/usr/bin/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_6.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 17:24:33,593 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 17:24:33,595 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 17:24:33,607 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 17:24:33,608 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 17:24:33,609 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 17:24:33,610 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 17:24:33,612 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 17:24:33,614 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 17:24:33,615 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 17:24:33,616 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 17:24:33,617 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 17:24:33,617 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 17:24:33,618 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 17:24:33,619 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 17:24:33,620 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 17:24:33,621 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 17:24:33,622 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 17:24:33,624 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 17:24:33,626 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 17:24:33,627 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 17:24:33,628 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 17:24:33,629 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 17:24:33,632 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 17:24:33,636 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 17:24:33,637 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 17:24:33,637 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 17:24:33,638 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 17:24:33,639 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 17:24:33,640 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 17:24:33,640 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 17:24:33,642 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 17:24:33,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 17:24:33,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 17:24:33,646 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 17:24:33,646 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 17:24:33,650 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 17:24:33,650 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 17:24:33,650 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 17:24:33,651 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 17:24:33,653 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 17:24:33,653 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-17 17:24:33,672 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 17:24:33,673 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 17:24:33,674 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 17:24:33,675 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 17:24:33,675 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 17:24:33,675 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 17:24:33,675 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 17:24:33,675 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 17:24:33,676 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 17:24:33,676 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 17:24:33,677 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 17:24:33,677 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 17:24:33,677 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 17:24:33,678 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 17:24:33,678 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 17:24:33,678 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-17 17:24:33,678 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 17:24:33,679 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 17:24:33,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 17:24:33,679 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 17:24:33,679 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-17 17:24:33,679 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 17:24:33,680 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-17 17:24:33,957 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 17:24:33,973 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 17:24:33,976 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 17:24:33,978 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 17:24:33,978 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 17:24:33,979 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_6.c [2020-07-17 17:24:34,055 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5105196d/0fee1a5e21e44b25843cc4bab5cea294/FLAGea6c880e7 [2020-07-17 17:24:34,547 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 17:24:34,548 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2020-07-17 17:24:34,557 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5105196d/0fee1a5e21e44b25843cc4bab5cea294/FLAGea6c880e7 [2020-07-17 17:24:34,918 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5105196d/0fee1a5e21e44b25843cc4bab5cea294 [2020-07-17 17:24:34,932 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 17:24:34,937 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 17:24:34,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 17:24:34,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 17:24:34,945 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 17:24:34,946 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 05:24:34" (1/1) ... [2020-07-17 17:24:34,949 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49c318e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:24:34, skipping insertion in model container [2020-07-17 17:24:34,950 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 05:24:34" (1/1) ... [2020-07-17 17:24:34,959 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 17:24:34,983 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 17:24:35,215 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 17:24:35,222 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 17:24:35,267 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 17:24:35,373 INFO L208 MainTranslator]: Completed translation [2020-07-17 17:24:35,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:24:35 WrapperNode [2020-07-17 17:24:35,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 17:24:35,375 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 17:24:35,375 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 17:24:35,375 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 17:24:35,390 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:24:35" (1/1) ... [2020-07-17 17:24:35,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:24:35" (1/1) ... [2020-07-17 17:24:35,399 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:24:35" (1/1) ... [2020-07-17 17:24:35,399 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:24:35" (1/1) ... [2020-07-17 17:24:35,408 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:24:35" (1/1) ... [2020-07-17 17:24:35,418 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:24:35" (1/1) ... [2020-07-17 17:24:35,424 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:24:35" (1/1) ... [2020-07-17 17:24:35,431 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 17:24:35,431 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 17:24:35,432 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 17:24:35,432 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 17:24:35,434 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:24:35" (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 [2020-07-17 17:24:35,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 17:24:35,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 17:24:35,509 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 17:24:35,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 17:24:35,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 17:24:35,509 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 17:24:35,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 17:24:35,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 17:24:35,795 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 17:24:35,795 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-17 17:24:35,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 05:24:35 BoogieIcfgContainer [2020-07-17 17:24:35,801 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 17:24:35,802 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 17:24:35,802 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 17:24:35,806 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 17:24:35,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 05:24:34" (1/3) ... [2020-07-17 17:24:35,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@239d95f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 05:24:35, skipping insertion in model container [2020-07-17 17:24:35,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:24:35" (2/3) ... [2020-07-17 17:24:35,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@239d95f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 05:24:35, skipping insertion in model container [2020-07-17 17:24:35,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 05:24:35" (3/3) ... [2020-07-17 17:24:35,810 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2020-07-17 17:24:35,832 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-17 17:24:35,849 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 17:24:35,883 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 17:24:35,935 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 17:24:35,935 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 17:24:35,936 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-17 17:24:35,936 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 17:24:35,936 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 17:24:35,936 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 17:24:35,936 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 17:24:35,937 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 17:24:35,958 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2020-07-17 17:24:35,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-17 17:24:35,971 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:24:35,972 INFO L422 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] [2020-07-17 17:24:35,973 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:24:35,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:24:35,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1400694048, now seen corresponding path program 1 times [2020-07-17 17:24:35,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:24:35,990 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1228811638] [2020-07-17 17:24:35,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:24:36,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:24:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:24:36,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 17:24:36,240 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1228811638] [2020-07-17 17:24:36,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 17:24:36,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 17:24:36,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445769515] [2020-07-17 17:24:36,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 17:24:36,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:24:36,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 17:24:36,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 17:24:36,269 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 3 states. [2020-07-17 17:24:36,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:24:36,374 INFO L93 Difference]: Finished difference Result 169 states and 229 transitions. [2020-07-17 17:24:36,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 17:24:36,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-07-17 17:24:36,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:24:36,398 INFO L225 Difference]: With dead ends: 169 [2020-07-17 17:24:36,399 INFO L226 Difference]: Without dead ends: 112 [2020-07-17 17:24:36,413 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 17:24:36,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-07-17 17:24:36,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2020-07-17 17:24:36,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-07-17 17:24:36,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 142 transitions. [2020-07-17 17:24:36,481 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 142 transitions. Word has length 49 [2020-07-17 17:24:36,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:24:36,482 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 142 transitions. [2020-07-17 17:24:36,482 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 17:24:36,482 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 142 transitions. [2020-07-17 17:24:36,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-17 17:24:36,484 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:24:36,485 INFO L422 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] [2020-07-17 17:24:36,485 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 17:24:36,485 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:24:36,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:24:36,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1290717684, now seen corresponding path program 1 times [2020-07-17 17:24:36,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:24:36,487 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [616677779] [2020-07-17 17:24:36,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:24:36,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:24:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:24:36,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 17:24:36,551 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [616677779] [2020-07-17 17:24:36,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 17:24:36,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 17:24:36,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068337705] [2020-07-17 17:24:36,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 17:24:36,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:24:36,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 17:24:36,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 17:24:36,556 INFO L87 Difference]: Start difference. First operand 110 states and 142 transitions. Second operand 3 states. [2020-07-17 17:24:36,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:24:36,592 INFO L93 Difference]: Finished difference Result 135 states and 175 transitions. [2020-07-17 17:24:36,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 17:24:36,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-17 17:24:36,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:24:36,596 INFO L225 Difference]: With dead ends: 135 [2020-07-17 17:24:36,596 INFO L226 Difference]: Without dead ends: 133 [2020-07-17 17:24:36,597 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 17:24:36,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-07-17 17:24:36,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 110. [2020-07-17 17:24:36,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-07-17 17:24:36,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 141 transitions. [2020-07-17 17:24:36,622 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 141 transitions. Word has length 50 [2020-07-17 17:24:36,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:24:36,623 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 141 transitions. [2020-07-17 17:24:36,623 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 17:24:36,623 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 141 transitions. [2020-07-17 17:24:36,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-17 17:24:36,625 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:24:36,625 INFO L422 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] [2020-07-17 17:24:36,626 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 17:24:36,626 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:24:36,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:24:36,626 INFO L82 PathProgramCache]: Analyzing trace with hash 472087846, now seen corresponding path program 1 times [2020-07-17 17:24:36,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:24:36,627 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [730319124] [2020-07-17 17:24:36,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:24:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:24:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:24:36,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 17:24:36,716 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [730319124] [2020-07-17 17:24:36,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 17:24:36,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 17:24:36,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161502501] [2020-07-17 17:24:36,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 17:24:36,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:24:36,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 17:24:36,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 17:24:36,719 INFO L87 Difference]: Start difference. First operand 110 states and 141 transitions. Second operand 3 states. [2020-07-17 17:24:36,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:24:36,772 INFO L93 Difference]: Finished difference Result 266 states and 357 transitions. [2020-07-17 17:24:36,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 17:24:36,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-17 17:24:36,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:24:36,776 INFO L225 Difference]: With dead ends: 266 [2020-07-17 17:24:36,776 INFO L226 Difference]: Without dead ends: 185 [2020-07-17 17:24:36,778 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 17:24:36,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-07-17 17:24:36,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2020-07-17 17:24:36,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-07-17 17:24:36,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 240 transitions. [2020-07-17 17:24:36,814 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 240 transitions. Word has length 50 [2020-07-17 17:24:36,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:24:36,815 INFO L479 AbstractCegarLoop]: Abstraction has 183 states and 240 transitions. [2020-07-17 17:24:36,815 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 17:24:36,815 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 240 transitions. [2020-07-17 17:24:36,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-17 17:24:36,817 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:24:36,818 INFO L422 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] [2020-07-17 17:24:36,818 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 17:24:36,818 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:24:36,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:24:36,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1750067028, now seen corresponding path program 1 times [2020-07-17 17:24:36,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:24:36,820 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [317759083] [2020-07-17 17:24:36,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:24:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:24:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:24:36,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 17:24:36,867 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [317759083] [2020-07-17 17:24:36,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 17:24:36,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 17:24:36,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938040056] [2020-07-17 17:24:36,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 17:24:36,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:24:36,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 17:24:36,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 17:24:36,869 INFO L87 Difference]: Start difference. First operand 183 states and 240 transitions. Second operand 3 states. [2020-07-17 17:24:36,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:24:36,936 INFO L93 Difference]: Finished difference Result 479 states and 646 transitions. [2020-07-17 17:24:36,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 17:24:36,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-07-17 17:24:36,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:24:36,944 INFO L225 Difference]: With dead ends: 479 [2020-07-17 17:24:36,944 INFO L226 Difference]: Without dead ends: 325 [2020-07-17 17:24:36,946 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 17:24:36,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-07-17 17:24:37,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 323. [2020-07-17 17:24:37,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-07-17 17:24:37,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 426 transitions. [2020-07-17 17:24:37,017 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 426 transitions. Word has length 51 [2020-07-17 17:24:37,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:24:37,017 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 426 transitions. [2020-07-17 17:24:37,017 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 17:24:37,018 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 426 transitions. [2020-07-17 17:24:37,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-17 17:24:37,020 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:24:37,020 INFO L422 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] [2020-07-17 17:24:37,021 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 17:24:37,021 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:24:37,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:24:37,022 INFO L82 PathProgramCache]: Analyzing trace with hash -17356107, now seen corresponding path program 1 times [2020-07-17 17:24:37,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:24:37,022 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2039092564] [2020-07-17 17:24:37,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:24:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:24:37,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:24:37,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 17:24:37,062 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2039092564] [2020-07-17 17:24:37,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 17:24:37,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 17:24:37,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021979889] [2020-07-17 17:24:37,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 17:24:37,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:24:37,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 17:24:37,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 17:24:37,064 INFO L87 Difference]: Start difference. First operand 323 states and 426 transitions. Second operand 3 states. [2020-07-17 17:24:37,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:24:37,140 INFO L93 Difference]: Finished difference Result 399 states and 528 transitions. [2020-07-17 17:24:37,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 17:24:37,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-07-17 17:24:37,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:24:37,148 INFO L225 Difference]: With dead ends: 399 [2020-07-17 17:24:37,148 INFO L226 Difference]: Without dead ends: 397 [2020-07-17 17:24:37,150 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 17:24:37,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2020-07-17 17:24:37,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 323. [2020-07-17 17:24:37,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-07-17 17:24:37,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 422 transitions. [2020-07-17 17:24:37,208 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 422 transitions. Word has length 51 [2020-07-17 17:24:37,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:24:37,209 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 422 transitions. [2020-07-17 17:24:37,209 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 17:24:37,209 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 422 transitions. [2020-07-17 17:24:37,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-17 17:24:37,212 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:24:37,212 INFO L422 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] [2020-07-17 17:24:37,212 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 17:24:37,212 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:24:37,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:24:37,213 INFO L82 PathProgramCache]: Analyzing trace with hash 802147488, now seen corresponding path program 1 times [2020-07-17 17:24:37,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:24:37,213 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1005211650] [2020-07-17 17:24:37,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:24:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:24:37,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:24:37,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 17:24:37,250 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1005211650] [2020-07-17 17:24:37,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 17:24:37,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 17:24:37,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372885173] [2020-07-17 17:24:37,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 17:24:37,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:24:37,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 17:24:37,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 17:24:37,252 INFO L87 Difference]: Start difference. First operand 323 states and 422 transitions. Second operand 3 states. [2020-07-17 17:24:37,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:24:37,291 INFO L93 Difference]: Finished difference Result 395 states and 516 transitions. [2020-07-17 17:24:37,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 17:24:37,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-07-17 17:24:37,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:24:37,296 INFO L225 Difference]: With dead ends: 395 [2020-07-17 17:24:37,296 INFO L226 Difference]: Without dead ends: 393 [2020-07-17 17:24:37,297 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 17:24:37,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2020-07-17 17:24:37,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 323. [2020-07-17 17:24:37,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-07-17 17:24:37,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 418 transitions. [2020-07-17 17:24:37,327 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 418 transitions. Word has length 52 [2020-07-17 17:24:37,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:24:37,328 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 418 transitions. [2020-07-17 17:24:37,328 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 17:24:37,328 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 418 transitions. [2020-07-17 17:24:37,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-17 17:24:37,331 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:24:37,331 INFO L422 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] [2020-07-17 17:24:37,331 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 17:24:37,331 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:24:37,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:24:37,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1582250918, now seen corresponding path program 1 times [2020-07-17 17:24:37,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:24:37,332 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1115060928] [2020-07-17 17:24:37,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:24:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:24:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:24:37,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 17:24:37,378 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1115060928] [2020-07-17 17:24:37,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 17:24:37,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 17:24:37,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947133600] [2020-07-17 17:24:37,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 17:24:37,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:24:37,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 17:24:37,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 17:24:37,380 INFO L87 Difference]: Start difference. First operand 323 states and 418 transitions. Second operand 3 states. [2020-07-17 17:24:37,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:24:37,452 INFO L93 Difference]: Finished difference Result 887 states and 1164 transitions. [2020-07-17 17:24:37,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 17:24:37,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-07-17 17:24:37,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:24:37,456 INFO L225 Difference]: With dead ends: 887 [2020-07-17 17:24:37,456 INFO L226 Difference]: Without dead ends: 593 [2020-07-17 17:24:37,458 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 17:24:37,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-07-17 17:24:37,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 591. [2020-07-17 17:24:37,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-07-17 17:24:37,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 758 transitions. [2020-07-17 17:24:37,509 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 758 transitions. Word has length 52 [2020-07-17 17:24:37,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:24:37,509 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 758 transitions. [2020-07-17 17:24:37,509 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 17:24:37,509 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 758 transitions. [2020-07-17 17:24:37,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-17 17:24:37,512 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:24:37,512 INFO L422 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] [2020-07-17 17:24:37,513 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-17 17:24:37,513 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:24:37,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:24:37,514 INFO L82 PathProgramCache]: Analyzing trace with hash 436955529, now seen corresponding path program 1 times [2020-07-17 17:24:37,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:24:37,515 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1704628026] [2020-07-17 17:24:37,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:24:37,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:24:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:24:37,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 17:24:37,595 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1704628026] [2020-07-17 17:24:37,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 17:24:37,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 17:24:37,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033747313] [2020-07-17 17:24:37,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 17:24:37,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:24:37,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 17:24:37,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 17:24:37,597 INFO L87 Difference]: Start difference. First operand 591 states and 758 transitions. Second operand 3 states. [2020-07-17 17:24:37,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:24:37,667 INFO L93 Difference]: Finished difference Result 715 states and 912 transitions. [2020-07-17 17:24:37,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 17:24:37,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-07-17 17:24:37,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:24:37,672 INFO L225 Difference]: With dead ends: 715 [2020-07-17 17:24:37,672 INFO L226 Difference]: Without dead ends: 713 [2020-07-17 17:24:37,673 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 17:24:37,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2020-07-17 17:24:37,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 591. [2020-07-17 17:24:37,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-07-17 17:24:37,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 750 transitions. [2020-07-17 17:24:37,733 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 750 transitions. Word has length 53 [2020-07-17 17:24:37,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:24:37,734 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 750 transitions. [2020-07-17 17:24:37,734 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 17:24:37,734 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 750 transitions. [2020-07-17 17:24:37,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-17 17:24:37,735 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:24:37,735 INFO L422 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] [2020-07-17 17:24:37,736 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-17 17:24:37,736 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:24:37,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:24:37,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1804891768, now seen corresponding path program 1 times [2020-07-17 17:24:37,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:24:37,737 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2116234023] [2020-07-17 17:24:37,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:24:37,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:24:37,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:24:37,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 17:24:37,764 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2116234023] [2020-07-17 17:24:37,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 17:24:37,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 17:24:37,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979580346] [2020-07-17 17:24:37,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 17:24:37,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:24:37,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 17:24:37,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 17:24:37,766 INFO L87 Difference]: Start difference. First operand 591 states and 750 transitions. Second operand 3 states. [2020-07-17 17:24:37,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:24:37,866 INFO L93 Difference]: Finished difference Result 1667 states and 2128 transitions. [2020-07-17 17:24:37,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 17:24:37,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-07-17 17:24:37,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:24:37,872 INFO L225 Difference]: With dead ends: 1667 [2020-07-17 17:24:37,873 INFO L226 Difference]: Without dead ends: 1105 [2020-07-17 17:24:37,874 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 17:24:37,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2020-07-17 17:24:37,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1103. [2020-07-17 17:24:37,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2020-07-17 17:24:37,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1374 transitions. [2020-07-17 17:24:37,963 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1374 transitions. Word has length 53 [2020-07-17 17:24:37,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:24:37,963 INFO L479 AbstractCegarLoop]: Abstraction has 1103 states and 1374 transitions. [2020-07-17 17:24:37,964 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 17:24:37,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1374 transitions. [2020-07-17 17:24:37,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-17 17:24:37,965 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:24:37,966 INFO L422 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] [2020-07-17 17:24:37,966 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-17 17:24:37,966 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:24:37,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:24:37,966 INFO L82 PathProgramCache]: Analyzing trace with hash 2000907060, now seen corresponding path program 1 times [2020-07-17 17:24:37,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:24:37,967 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1206142306] [2020-07-17 17:24:37,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:24:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:24:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:24:38,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 17:24:38,008 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1206142306] [2020-07-17 17:24:38,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 17:24:38,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 17:24:38,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959897322] [2020-07-17 17:24:38,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 17:24:38,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:24:38,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 17:24:38,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 17:24:38,010 INFO L87 Difference]: Start difference. First operand 1103 states and 1374 transitions. Second operand 3 states. [2020-07-17 17:24:38,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:24:38,108 INFO L93 Difference]: Finished difference Result 1315 states and 1616 transitions. [2020-07-17 17:24:38,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 17:24:38,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-07-17 17:24:38,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:24:38,116 INFO L225 Difference]: With dead ends: 1315 [2020-07-17 17:24:38,116 INFO L226 Difference]: Without dead ends: 1313 [2020-07-17 17:24:38,117 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 17:24:38,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2020-07-17 17:24:38,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1103. [2020-07-17 17:24:38,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2020-07-17 17:24:38,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1358 transitions. [2020-07-17 17:24:38,217 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1358 transitions. Word has length 54 [2020-07-17 17:24:38,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:24:38,218 INFO L479 AbstractCegarLoop]: Abstraction has 1103 states and 1358 transitions. [2020-07-17 17:24:38,218 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 17:24:38,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1358 transitions. [2020-07-17 17:24:38,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-17 17:24:38,220 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:24:38,220 INFO L422 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] [2020-07-17 17:24:38,220 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-17 17:24:38,220 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:24:38,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:24:38,221 INFO L82 PathProgramCache]: Analyzing trace with hash -116823154, now seen corresponding path program 1 times [2020-07-17 17:24:38,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:24:38,221 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1442167411] [2020-07-17 17:24:38,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:24:38,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:24:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:24:38,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 17:24:38,246 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1442167411] [2020-07-17 17:24:38,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 17:24:38,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 17:24:38,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183258292] [2020-07-17 17:24:38,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 17:24:38,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:24:38,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 17:24:38,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 17:24:38,248 INFO L87 Difference]: Start difference. First operand 1103 states and 1358 transitions. Second operand 3 states. [2020-07-17 17:24:38,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:24:38,452 INFO L93 Difference]: Finished difference Result 3153 states and 3887 transitions. [2020-07-17 17:24:38,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 17:24:38,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-07-17 17:24:38,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:24:38,459 INFO L225 Difference]: With dead ends: 3153 [2020-07-17 17:24:38,459 INFO L226 Difference]: Without dead ends: 1103 [2020-07-17 17:24:38,463 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 17:24:38,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2020-07-17 17:24:38,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1103. [2020-07-17 17:24:38,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2020-07-17 17:24:38,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1294 transitions. [2020-07-17 17:24:38,571 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1294 transitions. Word has length 54 [2020-07-17 17:24:38,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:24:38,571 INFO L479 AbstractCegarLoop]: Abstraction has 1103 states and 1294 transitions. [2020-07-17 17:24:38,572 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 17:24:38,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1294 transitions. [2020-07-17 17:24:38,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-17 17:24:38,573 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:24:38,573 INFO L422 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] [2020-07-17 17:24:38,573 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-17 17:24:38,574 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:24:38,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:24:38,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1056202659, now seen corresponding path program 1 times [2020-07-17 17:24:38,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:24:38,576 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [824563127] [2020-07-17 17:24:38,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:24:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:24:38,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:24:38,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 17:24:38,617 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [824563127] [2020-07-17 17:24:38,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 17:24:38,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 17:24:38,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272979374] [2020-07-17 17:24:38,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 17:24:38,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:24:38,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 17:24:38,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 17:24:38,619 INFO L87 Difference]: Start difference. First operand 1103 states and 1294 transitions. Second operand 3 states. [2020-07-17 17:24:38,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:24:38,689 INFO L93 Difference]: Finished difference Result 1103 states and 1294 transitions. [2020-07-17 17:24:38,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 17:24:38,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-07-17 17:24:38,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:24:38,690 INFO L225 Difference]: With dead ends: 1103 [2020-07-17 17:24:38,690 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 17:24:38,693 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 17:24:38,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 17:24:38,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 17:24:38,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 17:24:38,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 17:24:38,694 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2020-07-17 17:24:38,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:24:38,694 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 17:24:38,694 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 17:24:38,694 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 17:24:38,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 17:24:38,695 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-17 17:24:38,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 17:24:39,174 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-17 17:24:39,507 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 7 [2020-07-17 17:24:40,149 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-17 17:24:40,604 WARN L193 SmtUtils]: Spent 444.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-17 17:24:41,025 WARN L193 SmtUtils]: Spent 412.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-17 17:24:42,002 WARN L193 SmtUtils]: Spent 904.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-17 17:24:42,140 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-17 17:24:42,360 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-17 17:24:42,729 WARN L193 SmtUtils]: Spent 367.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-17 17:24:43,074 WARN L193 SmtUtils]: Spent 340.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-17 17:24:43,238 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-17 17:24:43,473 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-17 17:24:43,812 WARN L193 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-17 17:24:43,956 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 17:24:43,957 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-17 17:24:43,957 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-17 17:24:43,957 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 17:24:43,957 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 17:24:43,957 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-17 17:24:43,957 INFO L264 CegarLoopResult]: At program point L93(line 93) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk5~0))) (or (and (= 0 main_~p6~0) .cse0) (and (= 1 main_~lk6~0) .cse0))) [2020-07-17 17:24:43,957 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 4 107) the Hoare annotation is: true [2020-07-17 17:24:43,958 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-17 17:24:43,958 INFO L264 CegarLoopResult]: At program point L77-1(lines 27 102) the Hoare annotation is: (let ((.cse4 (= 0 main_~p3~0)) (.cse3 (= 1 main_~lk5~0)) (.cse1 (= 0 main_~p4~0)) (.cse6 (= 0 main_~p6~0)) (.cse0 (= 1 main_~lk6~0)) (.cse2 (= 1 main_~lk3~0)) (.cse7 (= 0 main_~p5~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse3 .cse5) (and .cse2 .cse6 .cse3 .cse5) (and .cse0 .cse4 .cse1 .cse3) (and .cse1 .cse2 .cse6 .cse3) (and .cse0 .cse2 .cse3 .cse5) (and .cse4 .cse1 .cse7 .cse6) (and .cse4 .cse1 .cse6 .cse3) (and .cse0 .cse1 .cse2 .cse7) (and .cse0 .cse4 .cse1 .cse7) (and .cse2 .cse7 .cse6 .cse5) (and .cse4 .cse7 .cse6 .cse5) (and .cse0 .cse4 .cse7 .cse5) (and .cse4 .cse6 .cse3 .cse5) (and .cse1 .cse2 .cse7 .cse6) (and .cse0 .cse2 .cse7 .cse5))) [2020-07-17 17:24:43,958 INFO L271 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: true [2020-07-17 17:24:43,958 INFO L264 CegarLoopResult]: At program point L94(line 94) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk5~0))) (or (and (= 0 main_~p6~0) .cse0) (and (= 1 main_~lk6~0) .cse0))) [2020-07-17 17:24:43,959 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-07-17 17:24:43,959 INFO L271 CegarLoopResult]: At program point L28-1(line 28) the Hoare annotation is: true [2020-07-17 17:24:43,959 INFO L271 CegarLoopResult]: At program point L28-2(line 28) the Hoare annotation is: true [2020-07-17 17:24:43,959 INFO L264 CegarLoopResult]: At program point L78(line 78) the Hoare annotation is: (let ((.cse1 (= 1 main_~lk3~0)) (.cse3 (= 0 main_~p6~0)) (.cse6 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk4~0)) (.cse5 (= 1 main_~lk6~0)) (.cse7 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse8 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p5~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse4) (and .cse7 .cse0 .cse8 .cse3 .cse6) (and .cse5 .cse7 .cse0 .cse8 .cse6) (and .cse5 .cse0 .cse8 .cse1 .cse2) (and .cse5 .cse7 .cse0 .cse6 .cse4) (and .cse7 .cse0 .cse2 .cse3 .cse4) (and .cse0 .cse8 .cse1 .cse3 .cse6) (and .cse5 .cse0 .cse1 .cse2 .cse4) (and .cse5 .cse7 .cse0 .cse2 .cse4) (and .cse5 .cse0 .cse8 .cse1 .cse6) (and .cse7 .cse0 .cse3 .cse6 .cse4) (and .cse0 .cse8 .cse1 .cse2 .cse3) (and .cse7 .cse0 .cse8 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse6 .cse4) (and .cse5 .cse7 .cse0 .cse8 .cse2))) [2020-07-17 17:24:43,959 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-07-17 17:24:43,960 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-07-17 17:24:43,960 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-07-17 17:24:43,960 INFO L271 CegarLoopResult]: At program point L103(lines 5 107) the Hoare annotation is: true [2020-07-17 17:24:43,960 INFO L271 CegarLoopResult]: At program point L29(lines 29 31) the Hoare annotation is: true [2020-07-17 17:24:43,961 INFO L264 CegarLoopResult]: At program point L62-1(lines 27 102) the Hoare annotation is: (let ((.cse1 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk5~0)) (.cse5 (= 0 main_~p3~0)) (.cse9 (= 0 main_~p1~0)) (.cse7 (= 0 main_~p2~0)) (.cse2 (= 1 main_~lk3~0)) (.cse6 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk1~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse4) (and .cse5 .cse7 .cse3 .cse4 .cse8) (and .cse7 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse5 .cse7 .cse9 .cse3 .cse8) (and .cse1 .cse7 .cse2 .cse6 .cse4) (and .cse7 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse9 .cse3) (and .cse0 .cse2 .cse6 .cse4 .cse8) (and .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse9 .cse3 .cse8) (and .cse5 .cse7 .cse6 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse5 .cse1 .cse7 .cse6 .cse4) (and .cse0 .cse2 .cse6 .cse9 .cse8) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse9 .cse3) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse6 .cse4 .cse8) (and .cse7 .cse2 .cse6 .cse9 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse8) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse1 .cse7 .cse9 .cse3) (and .cse5 .cse0 .cse6 .cse9 .cse8) (and .cse0 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse6 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse9) (and .cse5 .cse0 .cse3 .cse4 .cse8) (and .cse5 .cse7 .cse6 .cse9 .cse8) (and .cse7 .cse2 .cse6 .cse4 .cse8))) [2020-07-17 17:24:43,961 INFO L264 CegarLoopResult]: At program point L87-1(lines 27 102) the Hoare annotation is: (let ((.cse1 (= 1 main_~lk5~0)) (.cse2 (= 1 main_~lk6~0)) (.cse3 (= 0 main_~p5~0)) (.cse0 (= 0 main_~p6~0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse2 .cse3) (and .cse3 .cse0))) [2020-07-17 17:24:43,961 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-07-17 17:24:43,961 INFO L264 CegarLoopResult]: At program point L54-1(lines 27 102) the Hoare annotation is: (let ((.cse5 (= 0 main_~p1~0)) (.cse3 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse4 (= 0 main_~p2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse4 .cse1 .cse5) (and .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse5) (and .cse3 .cse0 .cse5) (and .cse3 .cse0 .cse2) (and .cse4 .cse1 .cse2))) [2020-07-17 17:24:43,961 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-07-17 17:24:43,962 INFO L271 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: true [2020-07-17 17:24:43,962 INFO L264 CegarLoopResult]: At program point L79(line 79) the Hoare annotation is: (let ((.cse1 (= 1 main_~lk3~0)) (.cse3 (= 0 main_~p6~0)) (.cse6 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk4~0)) (.cse5 (= 1 main_~lk6~0)) (.cse7 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse8 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p5~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse4) (and .cse7 .cse0 .cse8 .cse3 .cse6) (and .cse5 .cse7 .cse0 .cse8 .cse6) (and .cse5 .cse0 .cse8 .cse1 .cse2) (and .cse5 .cse7 .cse0 .cse6 .cse4) (and .cse7 .cse0 .cse2 .cse3 .cse4) (and .cse0 .cse8 .cse1 .cse3 .cse6) (and .cse5 .cse0 .cse1 .cse2 .cse4) (and .cse5 .cse7 .cse0 .cse2 .cse4) (and .cse5 .cse0 .cse8 .cse1 .cse6) (and .cse7 .cse0 .cse3 .cse6 .cse4) (and .cse0 .cse8 .cse1 .cse2 .cse3) (and .cse7 .cse0 .cse8 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse6 .cse4) (and .cse5 .cse7 .cse0 .cse8 .cse2))) [2020-07-17 17:24:43,962 INFO L271 CegarLoopResult]: At program point L46(lines 46 48) the Hoare annotation is: true [2020-07-17 17:24:43,962 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-07-17 17:24:43,962 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 4 107) the Hoare annotation is: true [2020-07-17 17:24:43,963 INFO L264 CegarLoopResult]: At program point L46-2(lines 27 102) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-17 17:24:43,963 INFO L271 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: true [2020-07-17 17:24:43,963 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) the Hoare annotation is: false [2020-07-17 17:24:43,963 INFO L264 CegarLoopResult]: At program point L63(line 63) the Hoare annotation is: (let ((.cse7 (= 0 main_~p2~0)) (.cse4 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p1~0)) (.cse3 (= 1 main_~lk4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse5 (= 0 main_~p4~0)) (.cse1 (= 1 main_~lk3~0)) (.cse6 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6) (and .cse7 .cse1 .cse6 .cse3) (and .cse5 .cse7 .cse1 .cse6) (and .cse4 .cse0 .cse6 .cse3) (and .cse7 .cse1 .cse2 .cse3) (and .cse4 .cse7 .cse6 .cse3) (and .cse4 .cse5 .cse7 .cse6) (and .cse5 .cse7 .cse1 .cse2) (and .cse4 .cse0 .cse5 .cse2) (and .cse4 .cse5 .cse7 .cse2) (and .cse4 .cse7 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2) (and .cse0 .cse1 .cse6 .cse3) (and .cse0 .cse5 .cse1 .cse6))) [2020-07-17 17:24:43,963 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 107) the Hoare annotation is: true [2020-07-17 17:24:43,964 INFO L264 CegarLoopResult]: At program point L88(line 88) the Hoare annotation is: (let ((.cse1 (= 0 main_~p6~0)) (.cse0 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk6~0)) (.cse3 (= 1 main_~lk5~0)) (.cse2 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse2) (and .cse4 .cse0 .cse2) (and .cse4 .cse3 .cse2))) [2020-07-17 17:24:43,964 INFO L264 CegarLoopResult]: At program point L55(line 55) the Hoare annotation is: (let ((.cse0 (= 0 main_~p2~0)) (.cse1 (= 0 main_~p1~0)) (.cse3 (= 1 main_~lk2~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse3 .cse1) (and .cse3 .cse2))) [2020-07-17 17:24:43,964 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-07-17 17:24:43,964 INFO L271 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: true [2020-07-17 17:24:43,965 INFO L264 CegarLoopResult]: At program point L72-1(lines 27 102) the Hoare annotation is: (let ((.cse3 (= 0 main_~p6~0)) (.cse9 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk4~0)) (.cse6 (= 0 main_~p2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse7 (= 1 main_~lk6~0)) (.cse8 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse5 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p5~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse1 .cse2 .cse3) (and .cse7 .cse8 .cse0 .cse5 .cse9) (and .cse7 .cse8 .cse6 .cse9 .cse4) (and .cse8 .cse5 .cse6 .cse2 .cse3) (and .cse8 .cse6 .cse3 .cse9 .cse4) (and .cse6 .cse1 .cse2 .cse3 .cse4) (and .cse7 .cse8 .cse0 .cse9 .cse4) (and .cse5 .cse6 .cse1 .cse3 .cse9) (and .cse7 .cse8 .cse6 .cse2 .cse4) (and .cse0 .cse5 .cse1 .cse3 .cse9) (and .cse7 .cse0 .cse1 .cse2 .cse4) (and .cse7 .cse0 .cse5 .cse1 .cse9) (and .cse8 .cse0 .cse3 .cse9 .cse4) (and .cse8 .cse0 .cse5 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2 .cse3) (and .cse7 .cse0 .cse1 .cse9 .cse4) (and .cse8 .cse0 .cse5 .cse3 .cse9) (and .cse6 .cse1 .cse3 .cse9 .cse4) (and .cse7 .cse0 .cse5 .cse1 .cse2) (and .cse7 .cse6 .cse1 .cse2 .cse4) (and .cse8 .cse0 .cse2 .cse3 .cse4) (and .cse7 .cse5 .cse6 .cse1 .cse9) (and .cse8 .cse5 .cse6 .cse3 .cse9) (and .cse8 .cse6 .cse2 .cse3 .cse4) (and .cse7 .cse8 .cse0 .cse2 .cse4) (and .cse7 .cse8 .cse5 .cse6 .cse9) (and .cse7 .cse6 .cse1 .cse9 .cse4) (and .cse0 .cse1 .cse3 .cse9 .cse4) (and .cse7 .cse8 .cse5 .cse6 .cse2) (and .cse7 .cse5 .cse6 .cse1 .cse2) (and .cse7 .cse8 .cse0 .cse5 .cse2))) [2020-07-17 17:24:43,965 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-17 17:24:43,965 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-07-17 17:24:43,965 INFO L271 CegarLoopResult]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2020-07-17 17:24:43,965 INFO L264 CegarLoopResult]: At program point L89(line 89) the Hoare annotation is: (let ((.cse1 (= 0 main_~p6~0)) (.cse0 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk6~0)) (.cse3 (= 1 main_~lk5~0)) (.cse2 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse2) (and .cse4 .cse0 .cse2) (and .cse4 .cse3 .cse2))) [2020-07-17 17:24:43,965 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-17 17:24:43,966 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-07-17 17:24:43,966 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-07-17 17:24:43,966 INFO L264 CegarLoopResult]: At program point L106(line 106) the Hoare annotation is: false [2020-07-17 17:24:43,966 INFO L264 CegarLoopResult]: At program point L73(line 73) the Hoare annotation is: (let ((.cse8 (= 0 main_~p5~0)) (.cse9 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p2~0)) (.cse7 (= 1 main_~lk3~0)) (.cse5 (= 1 main_~lk4~0)) (.cse0 (= 0 main_~p3~0)) (.cse10 (= 1 main_~lk2~0)) (.cse6 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p6~0)) (.cse3 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse1 .cse7 .cse8 .cse2 .cse4) (and .cse1 .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse0 .cse6 .cse1 .cse8 .cse4) (and .cse6 .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse9 .cse0 .cse10 .cse6 .cse3 .cse4) (and .cse9 .cse10 .cse7 .cse3 .cse4 .cse5) (and .cse9 .cse10 .cse7 .cse8 .cse4 .cse5) (and .cse9 .cse6 .cse1 .cse7 .cse3 .cse4) (and .cse9 .cse0 .cse10 .cse6 .cse8 .cse4) (and .cse0 .cse1 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse1 .cse7 .cse8 .cse4 .cse5) (and .cse1 .cse7 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse10 .cse6 .cse7 .cse8 .cse4) (and .cse10 .cse6 .cse7 .cse8 .cse2 .cse4) (and .cse10 .cse6 .cse7 .cse2 .cse3 .cse4) (and .cse0 .cse10 .cse6 .cse8 .cse2 .cse4) (and .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse10 .cse6 .cse7 .cse3 .cse4) (and .cse9 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse9 .cse6 .cse1 .cse7 .cse8 .cse4) (and .cse0 .cse10 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse0 .cse10 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse8 .cse2 .cse4) (and .cse9 .cse0 .cse1 .cse8 .cse4 .cse5) (and .cse10 .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse0 .cse10 .cse8 .cse4 .cse5) (and .cse10 .cse7 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse0 .cse6 .cse1 .cse3 .cse4) (and .cse0 .cse6 .cse1 .cse2 .cse3 .cse4) (and .cse9 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse10 .cse6 .cse2 .cse3 .cse4))) [2020-07-17 17:24:43,966 INFO L271 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: true [2020-07-17 17:24:43,967 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-07-17 17:24:43,967 INFO L264 CegarLoopResult]: At program point L98(line 98) the Hoare annotation is: (= 1 main_~lk6~0) [2020-07-17 17:24:43,967 INFO L264 CegarLoopResult]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2020-07-17 17:24:43,967 INFO L271 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: true [2020-07-17 17:24:43,967 INFO L264 CegarLoopResult]: At program point L82-1(lines 27 102) the Hoare annotation is: (let ((.cse4 (= 0 main_~p6~0)) (.cse2 (= 1 main_~lk5~0)) (.cse5 (= 1 main_~lk4~0)) (.cse0 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p4~0)) (.cse3 (= 0 main_~p5~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse4 .cse2 .cse5) (and .cse1 .cse4 .cse2) (and .cse0 .cse3 .cse5) (and .cse1 .cse3 .cse4) (and .cse0 .cse2 .cse5) (and .cse0 .cse1 .cse3))) [2020-07-17 17:24:43,967 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-17 17:24:43,968 INFO L264 CegarLoopResult]: At program point L74(line 74) the Hoare annotation is: (let ((.cse8 (= 0 main_~p5~0)) (.cse9 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p2~0)) (.cse7 (= 1 main_~lk3~0)) (.cse5 (= 1 main_~lk4~0)) (.cse0 (= 0 main_~p3~0)) (.cse10 (= 1 main_~lk2~0)) (.cse6 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p6~0)) (.cse3 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse1 .cse7 .cse8 .cse2 .cse4) (and .cse1 .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse0 .cse6 .cse1 .cse8 .cse4) (and .cse9 .cse0 .cse10 .cse6 .cse3 .cse4) (and .cse6 .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse9 .cse10 .cse7 .cse3 .cse4 .cse5) (and .cse9 .cse10 .cse7 .cse8 .cse4 .cse5) (and .cse9 .cse6 .cse1 .cse7 .cse3 .cse4) (and .cse9 .cse1 .cse7 .cse8 .cse4 .cse5) (and .cse0 .cse1 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse0 .cse10 .cse6 .cse8 .cse4) (and .cse1 .cse7 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse10 .cse6 .cse7 .cse8 .cse4) (and .cse10 .cse6 .cse7 .cse8 .cse2 .cse4) (and .cse10 .cse6 .cse7 .cse2 .cse3 .cse4) (and .cse0 .cse10 .cse6 .cse8 .cse2 .cse4) (and .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse10 .cse6 .cse7 .cse3 .cse4) (and .cse9 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse9 .cse6 .cse1 .cse7 .cse8 .cse4) (and .cse0 .cse10 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse0 .cse10 .cse3 .cse4 .cse5) (and .cse9 .cse0 .cse10 .cse8 .cse4 .cse5) (and .cse10 .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse8 .cse2 .cse4) (and .cse9 .cse0 .cse1 .cse8 .cse4 .cse5) (and .cse10 .cse7 .cse8 .cse2 .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse2 .cse3 .cse4) (and .cse9 .cse0 .cse6 .cse1 .cse3 .cse4) (and .cse9 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse10 .cse6 .cse2 .cse3 .cse4))) [2020-07-17 17:24:43,968 INFO L264 CegarLoopResult]: At program point L99(line 99) the Hoare annotation is: (= 1 main_~lk6~0) [2020-07-17 17:24:43,969 INFO L264 CegarLoopResult]: At program point L66-1(lines 27 102) the Hoare annotation is: (let ((.cse2 (= 0 main_~p5~0)) (.cse11 (= 1 main_~lk6~0)) (.cse6 (= 0 main_~p2~0)) (.cse10 (= 1 main_~lk3~0)) (.cse9 (= 0 main_~p4~0)) (.cse8 (= 1 main_~lk1~0)) (.cse0 (= 0 main_~p3~0)) (.cse1 (= 1 main_~lk2~0)) (.cse3 (= 0 main_~p6~0)) (.cse4 (= 0 main_~p1~0)) (.cse7 (= 1 main_~lk5~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse3 .cse7 .cse8 .cse5) (and .cse0 .cse9 .cse6 .cse3 .cse4 .cse7) (and .cse9 .cse6 .cse10 .cse2 .cse3 .cse8) (and .cse6 .cse10 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse4 .cse7 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse4 .cse7) (and .cse11 .cse0 .cse9 .cse6 .cse2 .cse4) (and .cse6 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse8 .cse5) (and .cse1 .cse10 .cse3 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse6 .cse2 .cse4 .cse5) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse4) (and .cse1 .cse9 .cse10 .cse2 .cse3 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse2 .cse3 .cse4) (and .cse11 .cse1 .cse10 .cse2 .cse4 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse7 .cse8) (and .cse11 .cse0 .cse6 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse6 .cse7 .cse8 .cse5) (and .cse1 .cse9 .cse10 .cse3 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse6 .cse10 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse7 .cse8 .cse5) (and .cse1 .cse10 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse6 .cse2 .cse8 .cse5) (and .cse6 .cse10 .cse3 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse6 .cse3 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse4) (and .cse11 .cse1 .cse9 .cse10 .cse2 .cse4) (and .cse11 .cse6 .cse10 .cse2 .cse4 .cse5) (and .cse9 .cse6 .cse10 .cse3 .cse4 .cse7) (and .cse11 .cse1 .cse10 .cse4 .cse7 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse11 .cse6 .cse10 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse2 .cse8) (and .cse9 .cse6 .cse10 .cse3 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse7 .cse8) (and .cse11 .cse1 .cse10 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse9 .cse4 .cse7) (and .cse11 .cse1 .cse10 .cse2 .cse8 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse4 .cse7) (and .cse11 .cse9 .cse6 .cse10 .cse4 .cse7) (and .cse11 .cse9 .cse6 .cse10 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse8) (and .cse11 .cse6 .cse10 .cse2 .cse8 .cse5) (and .cse6 .cse10 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse2 .cse8) (and .cse0 .cse6 .cse3 .cse4 .cse7 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse8) (and .cse0 .cse1 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse9 .cse6 .cse10 .cse2 .cse4) (and .cse11 .cse9 .cse6 .cse10 .cse2 .cse8) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse7) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse8) (and .cse11 .cse0 .cse1 .cse2 .cse8 .cse5) (and .cse1 .cse10 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse11 .cse6 .cse10 .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse9 .cse3 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse7 .cse5))) [2020-07-17 17:24:43,969 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-07-17 17:24:43,969 INFO L264 CegarLoopResult]: At program point L58-1(lines 27 102) the Hoare annotation is: (let ((.cse7 (= 0 main_~p2~0)) (.cse4 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p1~0)) (.cse5 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse6 (= 1 main_~lk1~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6) (and .cse7 .cse1 .cse6 .cse3) (and .cse4 .cse0 .cse6 .cse3) (and .cse5 .cse7 .cse1 .cse6) (and .cse4 .cse7 .cse6 .cse3) (and .cse7 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse7 .cse6) (and .cse5 .cse7 .cse1 .cse2) (and .cse4 .cse0 .cse5 .cse2) (and .cse4 .cse5 .cse7 .cse2) (and .cse4 .cse7 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2) (and .cse0 .cse5 .cse1 .cse6) (and .cse0 .cse1 .cse6 .cse3))) [2020-07-17 17:24:43,969 INFO L264 CegarLoopResult]: At program point L83(line 83) the Hoare annotation is: (let ((.cse2 (= 1 main_~lk5~0)) (.cse5 (= 0 main_~p4~0)) (.cse1 (= 0 main_~p6~0)) (.cse4 (= 1 main_~lk6~0)) (.cse0 (= 1 main_~lk3~0)) (.cse6 (= 0 main_~p5~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse1 .cse2) (and .cse4 .cse0 .cse2 .cse3) (and .cse4 .cse5 .cse0 .cse6) (and .cse0 .cse6 .cse1 .cse3) (and .cse5 .cse0 .cse6 .cse1) (and .cse4 .cse0 .cse6 .cse3))) [2020-07-17 17:24:43,970 INFO L264 CegarLoopResult]: At program point L50-1(lines 27 102) the Hoare annotation is: (let ((.cse0 (= 0 main_~p2~0)) (.cse1 (= 0 main_~p1~0)) (.cse3 (= 1 main_~lk2~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse3 .cse1) (and .cse3 .cse2))) [2020-07-17 17:24:43,970 INFO L271 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-07-17 17:24:43,970 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-07-17 17:24:43,970 INFO L271 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: true [2020-07-17 17:24:43,970 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-07-17 17:24:43,971 INFO L264 CegarLoopResult]: At program point L67(line 67) the Hoare annotation is: (let ((.cse1 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk5~0)) (.cse5 (= 0 main_~p3~0)) (.cse9 (= 0 main_~p1~0)) (.cse7 (= 0 main_~p2~0)) (.cse2 (= 1 main_~lk3~0)) (.cse6 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk1~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse4) (and .cse5 .cse7 .cse3 .cse4 .cse8) (and .cse7 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse1 .cse7 .cse2 .cse6 .cse4) (and .cse5 .cse7 .cse9 .cse3 .cse8) (and .cse7 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse9 .cse3) (and .cse0 .cse2 .cse6 .cse4 .cse8) (and .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse9 .cse3 .cse8) (and .cse5 .cse7 .cse6 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse5 .cse1 .cse7 .cse6 .cse4) (and .cse0 .cse2 .cse6 .cse9 .cse8) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse9 .cse3) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse6 .cse9) (and .cse7 .cse2 .cse6 .cse9 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse0 .cse6 .cse4 .cse8) (and .cse5 .cse1 .cse7 .cse9 .cse3) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse0 .cse2 .cse9 .cse3 .cse8) (and .cse5 .cse0 .cse6 .cse9 .cse8) (and .cse0 .cse1 .cse2 .cse6 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse9) (and .cse5 .cse0 .cse3 .cse4 .cse8) (and .cse5 .cse7 .cse6 .cse9 .cse8) (and .cse7 .cse2 .cse6 .cse4 .cse8))) [2020-07-17 17:24:43,971 INFO L271 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: true [2020-07-17 17:24:43,971 INFO L264 CegarLoopResult]: At program point L59(line 59) the Hoare annotation is: (let ((.cse5 (= 0 main_~p1~0)) (.cse3 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse4 (= 0 main_~p2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse4 .cse1 .cse5) (and .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse5) (and .cse3 .cse0 .cse5) (and .cse3 .cse0 .cse2) (and .cse4 .cse1 .cse2))) [2020-07-17 17:24:43,971 INFO L264 CegarLoopResult]: At program point L92-1(lines 27 102) the Hoare annotation is: (or (= 1 main_~lk6~0) (= 0 main_~p6~0)) [2020-07-17 17:24:43,971 INFO L264 CegarLoopResult]: At program point L84(line 84) the Hoare annotation is: (let ((.cse2 (= 1 main_~lk5~0)) (.cse5 (= 0 main_~p4~0)) (.cse1 (= 0 main_~p6~0)) (.cse4 (= 1 main_~lk6~0)) (.cse0 (= 1 main_~lk3~0)) (.cse6 (= 0 main_~p5~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse1 .cse2) (and .cse4 .cse0 .cse2 .cse3) (and .cse4 .cse5 .cse0 .cse6) (and .cse0 .cse6 .cse1 .cse3) (and .cse5 .cse0 .cse6 .cse1) (and .cse4 .cse0 .cse6 .cse3))) [2020-07-17 17:24:43,972 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-17 17:24:43,972 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-17 17:24:43,972 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-07-17 17:24:43,972 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-07-17 17:24:43,972 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-07-17 17:24:43,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 05:24:43 BoogieIcfgContainer [2020-07-17 17:24:43,986 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 17:24:43,988 INFO L168 Benchmark]: Toolchain (without parser) took 9052.80 ms. Allocated memory was 136.8 MB in the beginning and 382.2 MB in the end (delta: 245.4 MB). Free memory was 100.2 MB in the beginning and 175.8 MB in the end (delta: -75.6 MB). Peak memory consumption was 224.9 MB. Max. memory is 7.1 GB. [2020-07-17 17:24:43,988 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 136.8 MB. Free memory is still 118.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-17 17:24:43,989 INFO L168 Benchmark]: CACSL2BoogieTranslator took 434.76 ms. Allocated memory was 136.8 MB in the beginning and 201.9 MB in the end (delta: 65.0 MB). Free memory was 100.0 MB in the beginning and 181.2 MB in the end (delta: -81.2 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. [2020-07-17 17:24:43,990 INFO L168 Benchmark]: Boogie Preprocessor took 56.29 ms. Allocated memory is still 201.9 MB. Free memory was 181.2 MB in the beginning and 178.8 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2020-07-17 17:24:43,991 INFO L168 Benchmark]: RCFGBuilder took 369.60 ms. Allocated memory is still 201.9 MB. Free memory was 178.8 MB in the beginning and 159.9 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. [2020-07-17 17:24:43,992 INFO L168 Benchmark]: TraceAbstraction took 8183.61 ms. Allocated memory was 201.9 MB in the beginning and 382.2 MB in the end (delta: 180.4 MB). Free memory was 159.3 MB in the beginning and 175.8 MB in the end (delta: -16.6 MB). Peak memory consumption was 218.9 MB. Max. memory is 7.1 GB. [2020-07-17 17:24:43,995 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 136.8 MB. Free memory is still 118.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 434.76 ms. Allocated memory was 136.8 MB in the beginning and 201.9 MB in the end (delta: 65.0 MB). Free memory was 100.0 MB in the beginning and 181.2 MB in the end (delta: -81.2 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.29 ms. Allocated memory is still 201.9 MB. Free memory was 181.2 MB in the beginning and 178.8 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 369.60 ms. Allocated memory is still 201.9 MB. Free memory was 178.8 MB in the beginning and 159.9 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8183.61 ms. Allocated memory was 201.9 MB in the beginning and 382.2 MB in the end (delta: 180.4 MB). Free memory was 159.3 MB in the beginning and 175.8 MB in the end (delta: -16.6 MB). Peak memory consumption was 218.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 105]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 4]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.7s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1351 SDtfs, 477 SDslu, 950 SDs, 0 SdLazy, 59 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1103occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 509 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 78 LocationsWithAnnotation, 78 PreInvPairs, 2134 NumberOfFragments, 5844 HoareAnnotationTreeSize, 78 FomulaSimplifications, 32094 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 78 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 4.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 624 NumberOfCodeBlocks, 624 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 612 ConstructedInterpolants, 0 QuantifiedInterpolants, 39212 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...