java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:37:15,842 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:37:15,845 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:37:15,862 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:37:15,862 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:37:15,864 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:37:15,866 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:37:15,875 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:37:15,879 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:37:15,882 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:37:15,884 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:37:15,886 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:37:15,886 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:37:15,888 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:37:15,890 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:37:15,891 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:37:15,893 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:37:15,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:37:15,896 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:37:15,899 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:37:15,903 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:37:15,905 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:37:15,908 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:37:15,909 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:37:15,910 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:37:15,911 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:37:15,911 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:37:15,911 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:37:15,912 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:37:15,913 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:37:15,913 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:37:15,914 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:37:15,914 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:37:15,915 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:37:15,916 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:37:15,916 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:37:15,917 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:37:15,917 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:37:15,917 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:37:15,918 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:37:15,918 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:37:15,919 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 12:37:15,932 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:37:15,933 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:37:15,934 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:37:15,934 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:37:15,934 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:37:15,934 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:37:15,935 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:37:15,935 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:37:15,935 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:37:15,935 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:37:15,935 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:37:15,936 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:37:15,936 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:37:15,936 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:37:15,936 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:37:15,936 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:37:15,936 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:37:15,937 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:37:15,937 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:37:15,937 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:37:15,937 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:37:15,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:37:15,938 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:37:15,938 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:37:15,938 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:37:15,938 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:37:15,938 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:37:15,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:37:15,939 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:37:15,985 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:37:15,997 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:37:16,002 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:37:16,003 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:37:16,005 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:37:16,006 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 12:37:16,068 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91fe2c166/ae420ddb6e014515a92b599681238d2a/FLAGf22396792 [2019-09-08 12:37:16,517 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:37:16,518 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 12:37:16,539 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91fe2c166/ae420ddb6e014515a92b599681238d2a/FLAGf22396792 [2019-09-08 12:37:16,824 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91fe2c166/ae420ddb6e014515a92b599681238d2a [2019-09-08 12:37:16,835 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:37:16,837 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:37:16,838 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:37:16,838 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:37:16,841 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:37:16,842 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:37:16" (1/1) ... [2019-09-08 12:37:16,845 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dfb2fd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:37:16, skipping insertion in model container [2019-09-08 12:37:16,845 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:37:16" (1/1) ... [2019-09-08 12:37:16,853 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:37:16,910 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:37:17,285 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:37:17,306 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:37:17,402 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:37:17,431 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:37:17,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:37:17 WrapperNode [2019-09-08 12:37:17,433 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:37:17,433 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:37:17,434 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:37:17,434 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:37:17,444 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:37:17" (1/1) ... [2019-09-08 12:37:17,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:37:17" (1/1) ... [2019-09-08 12:37:17,455 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:37:17" (1/1) ... [2019-09-08 12:37:17,456 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:37:17" (1/1) ... [2019-09-08 12:37:17,472 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:37:17" (1/1) ... [2019-09-08 12:37:17,486 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:37:17" (1/1) ... [2019-09-08 12:37:17,489 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:37:17" (1/1) ... [2019-09-08 12:37:17,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:37:17,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:37:17,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:37:17,495 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:37:17,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:37:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:37:17,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:37:17,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:37:17,549 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:37:17,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:37:17,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:37:17,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:37:17,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 12:37:17,550 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:37:17,550 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:37:17,550 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:37:17,550 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:37:17,550 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:37:17,550 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:37:17,551 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:37:17,551 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:37:17,551 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:37:17,551 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 12:37:17,551 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-08 12:37:17,552 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:37:17,552 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:37:17,552 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:37:17,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:37:17,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:37:18,331 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:37:18,331 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:37:18,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:37:18 BoogieIcfgContainer [2019-09-08 12:37:18,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:37:18,334 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:37:18,335 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:37:18,338 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:37:18,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:37:16" (1/3) ... [2019-09-08 12:37:18,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@314bf158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:37:18, skipping insertion in model container [2019-09-08 12:37:18,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:37:17" (2/3) ... [2019-09-08 12:37:18,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@314bf158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:37:18, skipping insertion in model container [2019-09-08 12:37:18,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:37:18" (3/3) ... [2019-09-08 12:37:18,347 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 12:37:18,357 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:37:18,377 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 12:37:18,391 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 12:37:18,418 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:37:18,419 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:37:18,419 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:37:18,419 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:37:18,420 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:37:18,420 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:37:18,420 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:37:18,420 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:37:18,420 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:37:18,441 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-09-08 12:37:18,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 12:37:18,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:18,452 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:18,454 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:18,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:18,459 INFO L82 PathProgramCache]: Analyzing trace with hash -134323180, now seen corresponding path program 1 times [2019-09-08 12:37:18,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:18,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:18,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:18,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:18,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:19,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:19,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:19,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:37:19,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:37:19,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:37:19,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:37:19,029 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 3 states. [2019-09-08 12:37:19,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:19,118 INFO L93 Difference]: Finished difference Result 307 states and 497 transitions. [2019-09-08 12:37:19,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:37:19,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-09-08 12:37:19,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:19,133 INFO L225 Difference]: With dead ends: 307 [2019-09-08 12:37:19,133 INFO L226 Difference]: Without dead ends: 213 [2019-09-08 12:37:19,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:37:19,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-08 12:37:19,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2019-09-08 12:37:19,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-09-08 12:37:19,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 302 transitions. [2019-09-08 12:37:19,205 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 302 transitions. Word has length 91 [2019-09-08 12:37:19,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:19,205 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 302 transitions. [2019-09-08 12:37:19,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:37:19,206 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 302 transitions. [2019-09-08 12:37:19,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 12:37:19,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:19,210 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:19,211 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:19,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:19,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1153087707, now seen corresponding path program 1 times [2019-09-08 12:37:19,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:19,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:19,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:19,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:19,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:19,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:19,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:19,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:37:19,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:37:19,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:37:19,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:37:19,425 INFO L87 Difference]: Start difference. First operand 211 states and 302 transitions. Second operand 3 states. [2019-09-08 12:37:19,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:19,491 INFO L93 Difference]: Finished difference Result 503 states and 766 transitions. [2019-09-08 12:37:19,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:37:19,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-09-08 12:37:19,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:19,496 INFO L225 Difference]: With dead ends: 503 [2019-09-08 12:37:19,496 INFO L226 Difference]: Without dead ends: 349 [2019-09-08 12:37:19,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:37:19,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-09-08 12:37:19,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 347. [2019-09-08 12:37:19,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-09-08 12:37:19,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 518 transitions. [2019-09-08 12:37:19,541 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 518 transitions. Word has length 92 [2019-09-08 12:37:19,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:19,542 INFO L475 AbstractCegarLoop]: Abstraction has 347 states and 518 transitions. [2019-09-08 12:37:19,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:37:19,542 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 518 transitions. [2019-09-08 12:37:19,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 12:37:19,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:19,549 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:19,549 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:19,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:19,550 INFO L82 PathProgramCache]: Analyzing trace with hash 453064733, now seen corresponding path program 1 times [2019-09-08 12:37:19,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:19,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:19,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:19,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:19,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:19,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:19,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:19,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:19,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:37:19,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:37:19,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:37:19,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:37:19,726 INFO L87 Difference]: Start difference. First operand 347 states and 518 transitions. Second operand 3 states. [2019-09-08 12:37:19,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:19,812 INFO L93 Difference]: Finished difference Result 895 states and 1388 transitions. [2019-09-08 12:37:19,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:37:19,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-09-08 12:37:19,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:19,822 INFO L225 Difference]: With dead ends: 895 [2019-09-08 12:37:19,822 INFO L226 Difference]: Without dead ends: 605 [2019-09-08 12:37:19,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:37:19,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-09-08 12:37:19,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 603. [2019-09-08 12:37:19,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-09-08 12:37:19,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 922 transitions. [2019-09-08 12:37:19,894 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 922 transitions. Word has length 93 [2019-09-08 12:37:19,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:19,894 INFO L475 AbstractCegarLoop]: Abstraction has 603 states and 922 transitions. [2019-09-08 12:37:19,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:37:19,895 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 922 transitions. [2019-09-08 12:37:19,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 12:37:19,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:19,897 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:19,898 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:19,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:19,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1052328474, now seen corresponding path program 1 times [2019-09-08 12:37:19,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:19,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:19,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:19,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:19,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:20,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:20,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:20,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:37:20,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:37:20,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:37:20,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:37:20,021 INFO L87 Difference]: Start difference. First operand 603 states and 922 transitions. Second operand 3 states. [2019-09-08 12:37:20,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:20,083 INFO L93 Difference]: Finished difference Result 1631 states and 2548 transitions. [2019-09-08 12:37:20,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:37:20,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-09-08 12:37:20,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:20,095 INFO L225 Difference]: With dead ends: 1631 [2019-09-08 12:37:20,096 INFO L226 Difference]: Without dead ends: 1085 [2019-09-08 12:37:20,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:37:20,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2019-09-08 12:37:20,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 1083. [2019-09-08 12:37:20,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1083 states. [2019-09-08 12:37:20,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1674 transitions. [2019-09-08 12:37:20,153 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1674 transitions. Word has length 94 [2019-09-08 12:37:20,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:20,155 INFO L475 AbstractCegarLoop]: Abstraction has 1083 states and 1674 transitions. [2019-09-08 12:37:20,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:37:20,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1674 transitions. [2019-09-08 12:37:20,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 12:37:20,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:20,165 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:20,165 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:20,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:20,165 INFO L82 PathProgramCache]: Analyzing trace with hash 178473406, now seen corresponding path program 1 times [2019-09-08 12:37:20,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:20,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:20,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:20,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:20,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:20,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:20,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:20,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:37:20,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:37:20,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:37:20,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:37:20,270 INFO L87 Difference]: Start difference. First operand 1083 states and 1674 transitions. Second operand 3 states. [2019-09-08 12:37:20,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:20,369 INFO L93 Difference]: Finished difference Result 3007 states and 4700 transitions. [2019-09-08 12:37:20,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:37:20,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-09-08 12:37:20,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:20,380 INFO L225 Difference]: With dead ends: 3007 [2019-09-08 12:37:20,381 INFO L226 Difference]: Without dead ends: 1981 [2019-09-08 12:37:20,384 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:37:20,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2019-09-08 12:37:20,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1979. [2019-09-08 12:37:20,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1979 states. [2019-09-08 12:37:20,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1979 states to 1979 states and 3066 transitions. [2019-09-08 12:37:20,478 INFO L78 Accepts]: Start accepts. Automaton has 1979 states and 3066 transitions. Word has length 95 [2019-09-08 12:37:20,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:20,478 INFO L475 AbstractCegarLoop]: Abstraction has 1979 states and 3066 transitions. [2019-09-08 12:37:20,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:37:20,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1979 states and 3066 transitions. [2019-09-08 12:37:20,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 12:37:20,480 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:20,481 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:20,481 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:20,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:20,481 INFO L82 PathProgramCache]: Analyzing trace with hash -502513908, now seen corresponding path program 1 times [2019-09-08 12:37:20,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:20,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:20,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:20,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:20,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:20,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:20,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:20,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:37:20,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:37:20,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:37:20,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:37:20,611 INFO L87 Difference]: Start difference. First operand 1979 states and 3066 transitions. Second operand 3 states. [2019-09-08 12:37:20,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:20,785 INFO L93 Difference]: Finished difference Result 5567 states and 8668 transitions. [2019-09-08 12:37:20,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:37:20,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-09-08 12:37:20,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:20,808 INFO L225 Difference]: With dead ends: 5567 [2019-09-08 12:37:20,808 INFO L226 Difference]: Without dead ends: 3645 [2019-09-08 12:37:20,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:37:20,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3645 states. [2019-09-08 12:37:20,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3645 to 3643. [2019-09-08 12:37:20,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2019-09-08 12:37:20,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 5626 transitions. [2019-09-08 12:37:20,992 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 5626 transitions. Word has length 96 [2019-09-08 12:37:20,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:20,993 INFO L475 AbstractCegarLoop]: Abstraction has 3643 states and 5626 transitions. [2019-09-08 12:37:20,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:37:20,993 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 5626 transitions. [2019-09-08 12:37:20,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:37:20,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:21,001 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:21,002 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:21,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:21,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1106092338, now seen corresponding path program 1 times [2019-09-08 12:37:21,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:21,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:21,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:21,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:21,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:21,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:21,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:21,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:37:21,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:37:21,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:37:21,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:37:21,175 INFO L87 Difference]: Start difference. First operand 3643 states and 5626 transitions. Second operand 5 states. [2019-09-08 12:37:21,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:21,614 INFO L93 Difference]: Finished difference Result 7229 states and 11195 transitions. [2019-09-08 12:37:21,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:37:21,615 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 12:37:21,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:21,638 INFO L225 Difference]: With dead ends: 7229 [2019-09-08 12:37:21,638 INFO L226 Difference]: Without dead ends: 3643 [2019-09-08 12:37:21,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:37:21,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3643 states. [2019-09-08 12:37:21,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3643 to 3643. [2019-09-08 12:37:21,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2019-09-08 12:37:21,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 5594 transitions. [2019-09-08 12:37:21,887 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 5594 transitions. Word has length 97 [2019-09-08 12:37:21,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:21,887 INFO L475 AbstractCegarLoop]: Abstraction has 3643 states and 5594 transitions. [2019-09-08 12:37:21,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:37:21,887 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 5594 transitions. [2019-09-08 12:37:21,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:37:21,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:21,889 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:21,889 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:21,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:21,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1467544083, now seen corresponding path program 1 times [2019-09-08 12:37:21,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:21,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:21,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:21,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:21,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:21,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:22,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:22,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:22,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:37:22,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:37:22,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:37:22,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:37:22,026 INFO L87 Difference]: Start difference. First operand 3643 states and 5594 transitions. Second operand 5 states. [2019-09-08 12:37:22,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:22,424 INFO L93 Difference]: Finished difference Result 7229 states and 11131 transitions. [2019-09-08 12:37:22,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:37:22,425 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 12:37:22,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:22,443 INFO L225 Difference]: With dead ends: 7229 [2019-09-08 12:37:22,443 INFO L226 Difference]: Without dead ends: 3643 [2019-09-08 12:37:22,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:37:22,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3643 states. [2019-09-08 12:37:22,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3643 to 3643. [2019-09-08 12:37:22,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2019-09-08 12:37:22,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 5562 transitions. [2019-09-08 12:37:22,696 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 5562 transitions. Word has length 97 [2019-09-08 12:37:22,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:22,697 INFO L475 AbstractCegarLoop]: Abstraction has 3643 states and 5562 transitions. [2019-09-08 12:37:22,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:37:22,697 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 5562 transitions. [2019-09-08 12:37:22,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:37:22,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:22,699 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:22,699 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:22,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:22,700 INFO L82 PathProgramCache]: Analyzing trace with hash -193676078, now seen corresponding path program 1 times [2019-09-08 12:37:22,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:22,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:22,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:22,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:22,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:22,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:22,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:22,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:22,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:37:22,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:37:22,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:37:22,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:37:22,804 INFO L87 Difference]: Start difference. First operand 3643 states and 5562 transitions. Second operand 5 states. [2019-09-08 12:37:23,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:23,171 INFO L93 Difference]: Finished difference Result 7229 states and 11067 transitions. [2019-09-08 12:37:23,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:37:23,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 12:37:23,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:23,189 INFO L225 Difference]: With dead ends: 7229 [2019-09-08 12:37:23,190 INFO L226 Difference]: Without dead ends: 3643 [2019-09-08 12:37:23,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:37:23,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3643 states. [2019-09-08 12:37:23,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3643 to 3643. [2019-09-08 12:37:23,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2019-09-08 12:37:23,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 5530 transitions. [2019-09-08 12:37:23,418 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 5530 transitions. Word has length 97 [2019-09-08 12:37:23,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:23,419 INFO L475 AbstractCegarLoop]: Abstraction has 3643 states and 5530 transitions. [2019-09-08 12:37:23,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:37:23,419 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 5530 transitions. [2019-09-08 12:37:23,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:37:23,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:23,420 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:23,420 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:23,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:23,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1657747635, now seen corresponding path program 1 times [2019-09-08 12:37:23,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:23,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:23,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:23,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:23,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:23,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:23,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:23,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:37:23,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:37:23,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:37:23,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:37:23,522 INFO L87 Difference]: Start difference. First operand 3643 states and 5530 transitions. Second operand 5 states. [2019-09-08 12:37:23,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:23,914 INFO L93 Difference]: Finished difference Result 7229 states and 11003 transitions. [2019-09-08 12:37:23,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:37:23,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 12:37:23,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:23,932 INFO L225 Difference]: With dead ends: 7229 [2019-09-08 12:37:23,933 INFO L226 Difference]: Without dead ends: 3643 [2019-09-08 12:37:23,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:37:23,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3643 states. [2019-09-08 12:37:24,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3643 to 3643. [2019-09-08 12:37:24,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2019-09-08 12:37:24,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 5498 transitions. [2019-09-08 12:37:24,173 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 5498 transitions. Word has length 97 [2019-09-08 12:37:24,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:24,174 INFO L475 AbstractCegarLoop]: Abstraction has 3643 states and 5498 transitions. [2019-09-08 12:37:24,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:37:24,174 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 5498 transitions. [2019-09-08 12:37:24,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:37:24,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:24,176 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:24,176 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:24,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:24,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1190190066, now seen corresponding path program 1 times [2019-09-08 12:37:24,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:24,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:24,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:24,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:24,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:24,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:24,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:24,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:24,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:37:24,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:37:24,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:37:24,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:37:24,302 INFO L87 Difference]: Start difference. First operand 3643 states and 5498 transitions. Second operand 5 states. [2019-09-08 12:37:24,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:24,652 INFO L93 Difference]: Finished difference Result 7229 states and 10939 transitions. [2019-09-08 12:37:24,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:37:24,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 12:37:24,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:24,678 INFO L225 Difference]: With dead ends: 7229 [2019-09-08 12:37:24,678 INFO L226 Difference]: Without dead ends: 3643 [2019-09-08 12:37:24,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:37:24,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3643 states. [2019-09-08 12:37:24,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3643 to 3643. [2019-09-08 12:37:24,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2019-09-08 12:37:24,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 5466 transitions. [2019-09-08 12:37:24,902 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 5466 transitions. Word has length 97 [2019-09-08 12:37:24,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:24,902 INFO L475 AbstractCegarLoop]: Abstraction has 3643 states and 5466 transitions. [2019-09-08 12:37:24,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:37:24,902 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 5466 transitions. [2019-09-08 12:37:24,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:37:24,903 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:24,903 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:24,904 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:24,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:24,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1777392041, now seen corresponding path program 1 times [2019-09-08 12:37:24,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:24,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:24,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:24,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:24,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:25,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:25,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:25,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:37:25,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:37:25,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:37:25,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:37:25,134 INFO L87 Difference]: Start difference. First operand 3643 states and 5466 transitions. Second operand 9 states. [2019-09-08 12:37:28,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:28,036 INFO L93 Difference]: Finished difference Result 50261 states and 75783 transitions. [2019-09-08 12:37:28,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:37:28,036 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-08 12:37:28,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:28,145 INFO L225 Difference]: With dead ends: 50261 [2019-09-08 12:37:28,145 INFO L226 Difference]: Without dead ends: 46675 [2019-09-08 12:37:28,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2019-09-08 12:37:28,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46675 states. [2019-09-08 12:37:29,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46675 to 10811. [2019-09-08 12:37:29,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10811 states. [2019-09-08 12:37:29,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10811 states to 10811 states and 16154 transitions. [2019-09-08 12:37:29,369 INFO L78 Accepts]: Start accepts. Automaton has 10811 states and 16154 transitions. Word has length 97 [2019-09-08 12:37:29,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:29,369 INFO L475 AbstractCegarLoop]: Abstraction has 10811 states and 16154 transitions. [2019-09-08 12:37:29,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:37:29,369 INFO L276 IsEmpty]: Start isEmpty. Operand 10811 states and 16154 transitions. [2019-09-08 12:37:29,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:37:29,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:29,370 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:29,371 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:29,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:29,371 INFO L82 PathProgramCache]: Analyzing trace with hash 430043314, now seen corresponding path program 1 times [2019-09-08 12:37:29,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:29,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:29,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:29,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:29,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:29,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:29,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:29,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:29,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:37:29,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:37:29,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:37:29,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:37:29,464 INFO L87 Difference]: Start difference. First operand 10811 states and 16154 transitions. Second operand 3 states. [2019-09-08 12:37:30,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:30,792 INFO L93 Difference]: Finished difference Result 28031 states and 41724 transitions. [2019-09-08 12:37:30,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:37:30,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-08 12:37:30,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:30,830 INFO L225 Difference]: With dead ends: 28031 [2019-09-08 12:37:30,830 INFO L226 Difference]: Without dead ends: 17277 [2019-09-08 12:37:30,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:37:30,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17277 states. [2019-09-08 12:37:32,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17277 to 17147. [2019-09-08 12:37:32,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17147 states. [2019-09-08 12:37:32,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17147 states to 17147 states and 25178 transitions. [2019-09-08 12:37:32,024 INFO L78 Accepts]: Start accepts. Automaton has 17147 states and 25178 transitions. Word has length 99 [2019-09-08 12:37:32,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:32,025 INFO L475 AbstractCegarLoop]: Abstraction has 17147 states and 25178 transitions. [2019-09-08 12:37:32,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:37:32,025 INFO L276 IsEmpty]: Start isEmpty. Operand 17147 states and 25178 transitions. [2019-09-08 12:37:32,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:37:32,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:32,026 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:32,026 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:32,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:32,027 INFO L82 PathProgramCache]: Analyzing trace with hash 450092657, now seen corresponding path program 1 times [2019-09-08 12:37:32,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:32,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:32,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:32,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:32,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:32,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:32,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:32,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:37:32,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:37:32,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:37:32,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:37:32,487 INFO L87 Difference]: Start difference. First operand 17147 states and 25178 transitions. Second operand 9 states. [2019-09-08 12:37:34,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:34,853 INFO L93 Difference]: Finished difference Result 47747 states and 70014 transitions. [2019-09-08 12:37:34,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:37:34,854 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:37:34,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:34,898 INFO L225 Difference]: With dead ends: 47747 [2019-09-08 12:37:34,898 INFO L226 Difference]: Without dead ends: 30657 [2019-09-08 12:37:34,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:37:34,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30657 states. [2019-09-08 12:37:37,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30657 to 30651. [2019-09-08 12:37:37,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30651 states. [2019-09-08 12:37:37,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30651 states to 30651 states and 44762 transitions. [2019-09-08 12:37:37,651 INFO L78 Accepts]: Start accepts. Automaton has 30651 states and 44762 transitions. Word has length 99 [2019-09-08 12:37:37,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:37,651 INFO L475 AbstractCegarLoop]: Abstraction has 30651 states and 44762 transitions. [2019-09-08 12:37:37,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:37:37,651 INFO L276 IsEmpty]: Start isEmpty. Operand 30651 states and 44762 transitions. [2019-09-08 12:37:37,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:37:37,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:37,652 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:37,652 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:37,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:37,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1066061208, now seen corresponding path program 1 times [2019-09-08 12:37:37,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:37,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:37,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:37,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:37,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:37,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:37,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:37,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:37:37,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:37:37,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:37:37,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:37:37,757 INFO L87 Difference]: Start difference. First operand 30651 states and 44762 transitions. Second operand 5 states. [2019-09-08 12:37:41,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:41,537 INFO L93 Difference]: Finished difference Result 56190 states and 81865 transitions. [2019-09-08 12:37:41,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 12:37:41,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-09-08 12:37:41,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:41,594 INFO L225 Difference]: With dead ends: 56190 [2019-09-08 12:37:41,594 INFO L226 Difference]: Without dead ends: 56188 [2019-09-08 12:37:41,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:37:41,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56188 states. [2019-09-08 12:37:44,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56188 to 31419. [2019-09-08 12:37:44,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31419 states. [2019-09-08 12:37:44,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31419 states to 31419 states and 45466 transitions. [2019-09-08 12:37:44,814 INFO L78 Accepts]: Start accepts. Automaton has 31419 states and 45466 transitions. Word has length 100 [2019-09-08 12:37:44,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:44,815 INFO L475 AbstractCegarLoop]: Abstraction has 31419 states and 45466 transitions. [2019-09-08 12:37:44,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:37:44,815 INFO L276 IsEmpty]: Start isEmpty. Operand 31419 states and 45466 transitions. [2019-09-08 12:37:44,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:37:44,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:44,816 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:44,816 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:44,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:44,817 INFO L82 PathProgramCache]: Analyzing trace with hash 2144763645, now seen corresponding path program 1 times [2019-09-08 12:37:44,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:44,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:44,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:44,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:44,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:44,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:44,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:44,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:37:44,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:37:44,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:37:44,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:37:44,904 INFO L87 Difference]: Start difference. First operand 31419 states and 45466 transitions. Second operand 3 states. [2019-09-08 12:37:48,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:48,230 INFO L93 Difference]: Finished difference Result 65346 states and 95072 transitions. [2019-09-08 12:37:48,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:37:48,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-08 12:37:48,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:48,436 INFO L225 Difference]: With dead ends: 65346 [2019-09-08 12:37:48,437 INFO L226 Difference]: Without dead ends: 46783 [2019-09-08 12:37:48,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:37:48,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46783 states. [2019-09-08 12:37:52,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46783 to 46781. [2019-09-08 12:37:52,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46781 states. [2019-09-08 12:37:52,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46781 states to 46781 states and 67388 transitions. [2019-09-08 12:37:52,698 INFO L78 Accepts]: Start accepts. Automaton has 46781 states and 67388 transitions. Word has length 100 [2019-09-08 12:37:52,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:52,699 INFO L475 AbstractCegarLoop]: Abstraction has 46781 states and 67388 transitions. [2019-09-08 12:37:52,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:37:52,699 INFO L276 IsEmpty]: Start isEmpty. Operand 46781 states and 67388 transitions. [2019-09-08 12:37:52,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:37:52,710 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:52,711 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:52,711 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:52,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:52,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1614271803, now seen corresponding path program 1 times [2019-09-08 12:37:52,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:52,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:52,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:52,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:52,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:52,834 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:37:52,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:37:52,834 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:37:52,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:53,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 12:37:53,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:37:53,267 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 12:37:53,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:37:53,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-09-08 12:37:53,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:37:53,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:37:53,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:37:53,277 INFO L87 Difference]: Start difference. First operand 46781 states and 67388 transitions. Second operand 12 states. [2019-09-08 12:38:21,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:21,102 INFO L93 Difference]: Finished difference Result 383921 states and 552758 transitions. [2019-09-08 12:38:21,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:38:21,103 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 135 [2019-09-08 12:38:21,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:21,837 INFO L225 Difference]: With dead ends: 383921 [2019-09-08 12:38:21,838 INFO L226 Difference]: Without dead ends: 357103 [2019-09-08 12:38:21,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=237, Invalid=633, Unknown=0, NotChecked=0, Total=870 [2019-09-08 12:38:22,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357103 states. [2019-09-08 12:38:34,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357103 to 87165. [2019-09-08 12:38:34,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87165 states. [2019-09-08 12:38:34,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87165 states to 87165 states and 125628 transitions. [2019-09-08 12:38:34,780 INFO L78 Accepts]: Start accepts. Automaton has 87165 states and 125628 transitions. Word has length 135 [2019-09-08 12:38:34,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:34,780 INFO L475 AbstractCegarLoop]: Abstraction has 87165 states and 125628 transitions. [2019-09-08 12:38:34,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:38:34,781 INFO L276 IsEmpty]: Start isEmpty. Operand 87165 states and 125628 transitions. [2019-09-08 12:38:34,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:38:34,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:34,797 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:38:34,798 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:34,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:34,798 INFO L82 PathProgramCache]: Analyzing trace with hash 2110676875, now seen corresponding path program 1 times [2019-09-08 12:38:34,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:34,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:34,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:34,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:34,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:35,357 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:38:35,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:38:35,358 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:38:35,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:35,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 12:38:35,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:38:35,806 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 12:38:35,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:38:35,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-09-08 12:38:35,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:38:35,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:38:35,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:38:35,821 INFO L87 Difference]: Start difference. First operand 87165 states and 125628 transitions. Second operand 12 states. [2019-09-08 12:39:05,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:05,289 INFO L93 Difference]: Finished difference Result 397477 states and 571440 transitions. [2019-09-08 12:39:05,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 12:39:05,289 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 135 [2019-09-08 12:39:05,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:05,891 INFO L225 Difference]: With dead ends: 397477 [2019-09-08 12:39:05,891 INFO L226 Difference]: Without dead ends: 310371 [2019-09-08 12:39:05,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=615, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:39:06,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310371 states. [2019-09-08 12:39:20,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310371 to 134141. [2019-09-08 12:39:20,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134141 states. [2019-09-08 12:39:21,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134141 states to 134141 states and 193788 transitions. [2019-09-08 12:39:21,012 INFO L78 Accepts]: Start accepts. Automaton has 134141 states and 193788 transitions. Word has length 135 [2019-09-08 12:39:21,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:21,013 INFO L475 AbstractCegarLoop]: Abstraction has 134141 states and 193788 transitions. [2019-09-08 12:39:21,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:39:21,013 INFO L276 IsEmpty]: Start isEmpty. Operand 134141 states and 193788 transitions. [2019-09-08 12:39:21,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:39:21,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:21,026 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:39:21,027 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:21,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:21,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1788947165, now seen corresponding path program 1 times [2019-09-08 12:39:21,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:21,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:21,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:21,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:21,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:21,136 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:39:21,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:39:21,137 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:39:21,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:21,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:21,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 12:39:21,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:39:21,816 WARN L188 SmtUtils]: Spent 479.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-09-08 12:39:21,955 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 12:39:21,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:39:21,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-09-08 12:39:21,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:39:21,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:39:21,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:39:21,960 INFO L87 Difference]: Start difference. First operand 134141 states and 193788 transitions. Second operand 12 states. [2019-09-08 12:39:59,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:59,770 INFO L93 Difference]: Finished difference Result 491429 states and 707760 transitions. [2019-09-08 12:39:59,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 12:39:59,770 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 135 [2019-09-08 12:39:59,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:00,180 INFO L225 Difference]: With dead ends: 491429 [2019-09-08 12:40:00,180 INFO L226 Difference]: Without dead ends: 357347 [2019-09-08 12:40:00,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=315, Invalid=615, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:40:00,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357347 states. [2019-09-08 12:40:19,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357347 to 174333. [2019-09-08 12:40:19,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174333 states. [2019-09-08 12:40:19,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174333 states to 174333 states and 251964 transitions. [2019-09-08 12:40:19,800 INFO L78 Accepts]: Start accepts. Automaton has 174333 states and 251964 transitions. Word has length 135 [2019-09-08 12:40:19,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:19,800 INFO L475 AbstractCegarLoop]: Abstraction has 174333 states and 251964 transitions. [2019-09-08 12:40:19,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:40:19,801 INFO L276 IsEmpty]: Start isEmpty. Operand 174333 states and 251964 transitions. [2019-09-08 12:40:19,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:40:19,813 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:19,813 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:40:19,813 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:19,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:19,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1812692387, now seen corresponding path program 1 times [2019-09-08 12:40:19,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:19,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:19,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:19,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:19,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:19,933 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:40:19,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:40:19,934 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 12:40:19,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:40:20,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:20,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 12:40:20,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:40:20,256 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 12:40:20,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:40:20,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-09-08 12:40:20,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:40:20,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:40:20,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:40:20,263 INFO L87 Difference]: Start difference. First operand 174333 states and 251964 transitions. Second operand 12 states. [2019-09-08 12:41:09,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:41:09,251 INFO L93 Difference]: Finished difference Result 594789 states and 857168 transitions. [2019-09-08 12:41:09,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 12:41:09,251 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 135 [2019-09-08 12:41:09,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:41:10,115 INFO L225 Difference]: With dead ends: 594789 [2019-09-08 12:41:10,115 INFO L226 Difference]: Without dead ends: 420515 [2019-09-08 12:41:10,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=292, Invalid=578, Unknown=0, NotChecked=0, Total=870 [2019-09-08 12:41:10,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420515 states. [2019-09-08 12:41:37,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420515 to 207741. [2019-09-08 12:41:37,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207741 states. [2019-09-08 12:41:37,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207741 states to 207741 states and 300284 transitions. [2019-09-08 12:41:37,755 INFO L78 Accepts]: Start accepts. Automaton has 207741 states and 300284 transitions. Word has length 135 [2019-09-08 12:41:37,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:41:37,755 INFO L475 AbstractCegarLoop]: Abstraction has 207741 states and 300284 transitions. [2019-09-08 12:41:37,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:41:37,755 INFO L276 IsEmpty]: Start isEmpty. Operand 207741 states and 300284 transitions. [2019-09-08 12:41:37,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:41:37,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:41:37,765 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:41:37,765 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:41:37,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:41:37,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1416421271, now seen corresponding path program 1 times [2019-09-08 12:41:37,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:41:37,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:41:37,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:37,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:37,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:41:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:37,898 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:41:37,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:41:37,898 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:41:37,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:41:38,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:41:38,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 12:41:38,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:41:38,257 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-08 12:41:38,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:41:38,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-09-08 12:41:38,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:41:38,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:41:38,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:41:38,276 INFO L87 Difference]: Start difference. First operand 207741 states and 300284 transitions. Second operand 12 states. [2019-09-08 12:42:37,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:42:37,901 INFO L93 Difference]: Finished difference Result 681445 states and 982416 transitions. [2019-09-08 12:42:37,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:42:37,901 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 135 [2019-09-08 12:42:37,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:42:38,487 INFO L225 Difference]: With dead ends: 681445 [2019-09-08 12:42:38,487 INFO L226 Difference]: Without dead ends: 473763 [2019-09-08 12:42:38,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=315, Invalid=615, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:42:38,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473763 states. [2019-09-08 12:43:10,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473763 to 241149. [2019-09-08 12:43:10,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241149 states. [2019-09-08 12:43:10,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241149 states to 241149 states and 348604 transitions. [2019-09-08 12:43:10,915 INFO L78 Accepts]: Start accepts. Automaton has 241149 states and 348604 transitions. Word has length 135 [2019-09-08 12:43:10,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:43:10,915 INFO L475 AbstractCegarLoop]: Abstraction has 241149 states and 348604 transitions. [2019-09-08 12:43:10,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:43:10,916 INFO L276 IsEmpty]: Start isEmpty. Operand 241149 states and 348604 transitions. [2019-09-08 12:43:10,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:43:10,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:43:10,926 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:43:10,926 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:43:10,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:43:10,927 INFO L82 PathProgramCache]: Analyzing trace with hash -495936559, now seen corresponding path program 1 times [2019-09-08 12:43:10,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:43:10,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:43:10,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:10,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:10,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:43:10,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:11,040 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:43:11,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:43:11,040 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:43:11,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:43:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:43:11,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 12:43:11,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:43:11,748 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 12:43:11,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:43:11,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-09-08 12:43:11,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:43:11,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:43:11,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:43:11,763 INFO L87 Difference]: Start difference. First operand 241149 states and 348604 transitions. Second operand 12 states. [2019-09-08 12:44:18,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:18,808 INFO L93 Difference]: Finished difference Result 758181 states and 1093360 transitions. [2019-09-08 12:44:18,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:44:18,811 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 135 [2019-09-08 12:44:18,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:19,470 INFO L225 Difference]: With dead ends: 758181 [2019-09-08 12:44:19,470 INFO L226 Difference]: Without dead ends: 517091 [2019-09-08 12:44:19,652 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=615, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:44:19,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517091 states. [2019-09-08 12:44:57,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517091 to 274557. [2019-09-08 12:44:57,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274557 states. [2019-09-08 12:44:57,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274557 states to 274557 states and 396924 transitions. [2019-09-08 12:44:57,719 INFO L78 Accepts]: Start accepts. Automaton has 274557 states and 396924 transitions. Word has length 135 [2019-09-08 12:44:57,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:57,719 INFO L475 AbstractCegarLoop]: Abstraction has 274557 states and 396924 transitions. [2019-09-08 12:44:57,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:44:57,719 INFO L276 IsEmpty]: Start isEmpty. Operand 274557 states and 396924 transitions. [2019-09-08 12:44:57,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 12:44:57,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:57,732 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:44:57,733 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:57,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:57,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1796801820, now seen corresponding path program 1 times [2019-09-08 12:44:57,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:57,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:57,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:57,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:57,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:57,956 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 12:44:57,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:57,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:57,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:57,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:57,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:57,958 INFO L87 Difference]: Start difference. First operand 274557 states and 396924 transitions. Second operand 9 states. [2019-09-08 12:46:06,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:06,695 INFO L93 Difference]: Finished difference Result 704461 states and 1018308 transitions. [2019-09-08 12:46:06,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:46:06,695 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 12:46:06,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:07,415 INFO L225 Difference]: With dead ends: 704461 [2019-09-08 12:46:07,415 INFO L226 Difference]: Without dead ends: 589131 [2019-09-08 12:46:07,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:46:07,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589131 states. [2019-09-08 12:46:49,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589131 to 298109. [2019-09-08 12:46:49,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298109 states. [2019-09-08 12:46:49,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298109 states to 298109 states and 430492 transitions. [2019-09-08 12:46:49,622 INFO L78 Accepts]: Start accepts. Automaton has 298109 states and 430492 transitions. Word has length 136 [2019-09-08 12:46:49,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:49,622 INFO L475 AbstractCegarLoop]: Abstraction has 298109 states and 430492 transitions. [2019-09-08 12:46:49,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:46:49,623 INFO L276 IsEmpty]: Start isEmpty. Operand 298109 states and 430492 transitions. [2019-09-08 12:46:49,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:46:49,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:49,637 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:46:49,637 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:49,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:49,638 INFO L82 PathProgramCache]: Analyzing trace with hash 658413086, now seen corresponding path program 1 times [2019-09-08 12:46:49,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:49,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:49,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:49,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:49,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:49,723 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:46:49,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:46:49,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:46:49,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:46:49,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:46:49,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:46:49,725 INFO L87 Difference]: Start difference. First operand 298109 states and 430492 transitions. Second operand 3 states. [2019-09-08 12:47:18,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:47:18,688 INFO L93 Difference]: Finished difference Result 542387 states and 784986 transitions. [2019-09-08 12:47:18,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:47:18,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-09-08 12:47:18,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:47:18,982 INFO L225 Difference]: With dead ends: 542387 [2019-09-08 12:47:18,982 INFO L226 Difference]: Without dead ends: 244337 [2019-09-08 12:47:19,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:47:19,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244337 states. [2019-09-08 12:47:42,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244337 to 244335. [2019-09-08 12:47:42,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244335 states. [2019-09-08 12:47:42,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244335 states to 244335 states and 352247 transitions. [2019-09-08 12:47:42,641 INFO L78 Accepts]: Start accepts. Automaton has 244335 states and 352247 transitions. Word has length 137 [2019-09-08 12:47:42,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:42,641 INFO L475 AbstractCegarLoop]: Abstraction has 244335 states and 352247 transitions. [2019-09-08 12:47:42,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:47:42,642 INFO L276 IsEmpty]: Start isEmpty. Operand 244335 states and 352247 transitions. [2019-09-08 12:47:42,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:47:42,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:42,652 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:47:42,652 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:42,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:42,653 INFO L82 PathProgramCache]: Analyzing trace with hash -99959780, now seen corresponding path program 1 times [2019-09-08 12:47:42,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:42,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:42,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:42,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:42,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:42,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:42,880 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:47:42,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:47:42,880 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:47:42,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:43,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 12:47:43,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:47:43,159 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Abandoning pump threads because process wont die! [2019-09-08 12:47:43,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 12:47:43,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4] total 12 [2019-09-08 12:47:43,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:47:43,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:47:43,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:47:43,691 INFO L87 Difference]: Start difference. First operand 244335 states and 352247 transitions. Second operand 12 states.