/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 -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_6.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-72570d3 [2020-08-22 19:00:35,521 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 19:00:35,524 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 19:00:35,556 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 19:00:35,557 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 19:00:35,565 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 19:00:35,568 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 19:00:35,572 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 19:00:35,574 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 19:00:35,578 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 19:00:35,579 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 19:00:35,581 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 19:00:35,582 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 19:00:35,584 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 19:00:35,587 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 19:00:35,588 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 19:00:35,590 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 19:00:35,591 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 19:00:35,593 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 19:00:35,603 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 19:00:35,605 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 19:00:35,606 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 19:00:35,606 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 19:00:35,607 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 19:00:35,612 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 19:00:35,612 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 19:00:35,612 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 19:00:35,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 19:00:35,613 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 19:00:35,614 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 19:00:35,614 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 19:00:35,615 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 19:00:35,616 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 19:00:35,617 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 19:00:35,617 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 19:00:35,618 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 19:00:35,618 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 19:00:35,619 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 19:00:35,619 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 19:00:35,620 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 19:00:35,620 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 19:00:35,621 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-08-22 19:00:35,631 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 19:00:35,632 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 19:00:35,633 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 19:00:35,633 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 19:00:35,633 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 19:00:35,633 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 19:00:35,634 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 19:00:35,634 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 19:00:35,634 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 19:00:35,634 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 19:00:35,634 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 19:00:35,635 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 19:00:35,635 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 19:00:35,635 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 19:00:35,635 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 19:00:35,636 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-08-22 19:00:35,636 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 19:00:35,636 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 19:00:35,636 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 19:00:35,636 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 19:00:35,636 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-08-22 19:00:35,637 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 19:00:35,637 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-08-22 19:00:35,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 19:00:35,944 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 19:00:35,952 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 19:00:35,954 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 19:00:35,955 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 19:00:35,955 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-08-22 19:00:36,036 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dad65da9b/b996d28225b54134828ec98b89aec2d4/FLAG76a5b1bcd [2020-08-22 19:00:36,563 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 19:00:36,564 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2020-08-22 19:00:36,572 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dad65da9b/b996d28225b54134828ec98b89aec2d4/FLAG76a5b1bcd [2020-08-22 19:00:36,935 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dad65da9b/b996d28225b54134828ec98b89aec2d4 [2020-08-22 19:00:36,946 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 19:00:36,948 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 19:00:36,949 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 19:00:36,950 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 19:00:36,954 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 19:00:36,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 07:00:36" (1/1) ... [2020-08-22 19:00:36,958 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c25a75a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:00:36, skipping insertion in model container [2020-08-22 19:00:36,959 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 07:00:36" (1/1) ... [2020-08-22 19:00:36,971 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 19:00:36,996 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 19:00:37,197 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 19:00:37,205 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 19:00:37,253 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 19:00:37,270 INFO L208 MainTranslator]: Completed translation [2020-08-22 19:00:37,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:00:37 WrapperNode [2020-08-22 19:00:37,271 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 19:00:37,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 19:00:37,273 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 19:00:37,273 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 19:00:37,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:00:37" (1/1) ... [2020-08-22 19:00:37,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:00:37" (1/1) ... [2020-08-22 19:00:37,377 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:00:37" (1/1) ... [2020-08-22 19:00:37,378 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:00:37" (1/1) ... [2020-08-22 19:00:37,382 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:00:37" (1/1) ... [2020-08-22 19:00:37,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:00:37" (1/1) ... [2020-08-22 19:00:37,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:00:37" (1/1) ... [2020-08-22 19:00:37,400 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 19:00:37,401 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 19:00:37,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 19:00:37,401 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 19:00:37,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:00:37" (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-08-22 19:00:37,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 19:00:37,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 19:00:37,474 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 19:00:37,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 19:00:37,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 19:00:37,475 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 19:00:37,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 19:00:37,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 19:00:37,778 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 19:00:37,778 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-08-22 19:00:37,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 07:00:37 BoogieIcfgContainer [2020-08-22 19:00:37,784 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 19:00:37,786 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 19:00:37,786 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 19:00:37,789 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 19:00:37,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 07:00:36" (1/3) ... [2020-08-22 19:00:37,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ccfa53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 07:00:37, skipping insertion in model container [2020-08-22 19:00:37,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:00:37" (2/3) ... [2020-08-22 19:00:37,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ccfa53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 07:00:37, skipping insertion in model container [2020-08-22 19:00:37,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 07:00:37" (3/3) ... [2020-08-22 19:00:37,792 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2020-08-22 19:00:37,804 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-22 19:00:37,812 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 19:00:37,826 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 19:00:37,851 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 19:00:37,852 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 19:00:37,852 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-08-22 19:00:37,852 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 19:00:37,852 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 19:00:37,852 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 19:00:37,853 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 19:00:37,853 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 19:00:37,872 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2020-08-22 19:00:37,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-08-22 19:00:37,886 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:00:37,887 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-08-22 19:00:37,888 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:00:37,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:00:37,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1400694048, now seen corresponding path program 1 times [2020-08-22 19:00:37,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:00:37,903 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [988309051] [2020-08-22 19:00:37,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:00:37,957 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:00:38,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:38,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:00:38,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:38,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 19:00:38,109 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [988309051] [2020-08-22 19:00:38,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:00:38,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 19:00:38,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617173869] [2020-08-22 19:00:38,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 19:00:38,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:00:38,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 19:00:38,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 19:00:38,144 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 3 states. [2020-08-22 19:00:38,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:00:38,228 INFO L93 Difference]: Finished difference Result 169 states and 229 transitions. [2020-08-22 19:00:38,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 19:00:38,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-08-22 19:00:38,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:00:38,245 INFO L225 Difference]: With dead ends: 169 [2020-08-22 19:00:38,245 INFO L226 Difference]: Without dead ends: 112 [2020-08-22 19:00:38,250 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-08-22 19:00:38,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-08-22 19:00:38,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2020-08-22 19:00:38,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-08-22 19:00:38,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 142 transitions. [2020-08-22 19:00:38,315 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 142 transitions. Word has length 49 [2020-08-22 19:00:38,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:00:38,316 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 142 transitions. [2020-08-22 19:00:38,316 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 19:00:38,317 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 142 transitions. [2020-08-22 19:00:38,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-08-22 19:00:38,319 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:00:38,319 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-08-22 19:00:38,320 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 19:00:38,320 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:00:38,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:00:38,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1290717684, now seen corresponding path program 1 times [2020-08-22 19:00:38,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:00:38,322 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1573326220] [2020-08-22 19:00:38,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:00:38,324 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:00:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:38,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:00:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:38,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 19:00:38,404 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1573326220] [2020-08-22 19:00:38,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:00:38,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 19:00:38,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521552271] [2020-08-22 19:00:38,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 19:00:38,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:00:38,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 19:00:38,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 19:00:38,408 INFO L87 Difference]: Start difference. First operand 110 states and 142 transitions. Second operand 3 states. [2020-08-22 19:00:38,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:00:38,452 INFO L93 Difference]: Finished difference Result 135 states and 175 transitions. [2020-08-22 19:00:38,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 19:00:38,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-08-22 19:00:38,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:00:38,456 INFO L225 Difference]: With dead ends: 135 [2020-08-22 19:00:38,456 INFO L226 Difference]: Without dead ends: 133 [2020-08-22 19:00:38,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-08-22 19:00:38,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-08-22 19:00:38,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 110. [2020-08-22 19:00:38,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-08-22 19:00:38,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 141 transitions. [2020-08-22 19:00:38,482 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 141 transitions. Word has length 50 [2020-08-22 19:00:38,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:00:38,483 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 141 transitions. [2020-08-22 19:00:38,483 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 19:00:38,483 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 141 transitions. [2020-08-22 19:00:38,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-08-22 19:00:38,485 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:00:38,486 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-08-22 19:00:38,486 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 19:00:38,486 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:00:38,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:00:38,487 INFO L82 PathProgramCache]: Analyzing trace with hash 472087846, now seen corresponding path program 1 times [2020-08-22 19:00:38,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:00:38,487 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2053641324] [2020-08-22 19:00:38,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:00:38,490 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:00:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:38,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:00:38,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:38,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 19:00:38,563 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2053641324] [2020-08-22 19:00:38,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:00:38,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 19:00:38,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936822264] [2020-08-22 19:00:38,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 19:00:38,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:00:38,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 19:00:38,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 19:00:38,565 INFO L87 Difference]: Start difference. First operand 110 states and 141 transitions. Second operand 3 states. [2020-08-22 19:00:38,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:00:38,645 INFO L93 Difference]: Finished difference Result 266 states and 357 transitions. [2020-08-22 19:00:38,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 19:00:38,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-08-22 19:00:38,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:00:38,649 INFO L225 Difference]: With dead ends: 266 [2020-08-22 19:00:38,649 INFO L226 Difference]: Without dead ends: 185 [2020-08-22 19:00:38,651 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-08-22 19:00:38,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-08-22 19:00:38,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2020-08-22 19:00:38,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-08-22 19:00:38,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 240 transitions. [2020-08-22 19:00:38,719 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 240 transitions. Word has length 50 [2020-08-22 19:00:38,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:00:38,723 INFO L479 AbstractCegarLoop]: Abstraction has 183 states and 240 transitions. [2020-08-22 19:00:38,723 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 19:00:38,723 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 240 transitions. [2020-08-22 19:00:38,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-08-22 19:00:38,726 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:00:38,726 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-08-22 19:00:38,726 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 19:00:38,726 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:00:38,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:00:38,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1750067028, now seen corresponding path program 1 times [2020-08-22 19:00:38,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:00:38,730 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [917177072] [2020-08-22 19:00:38,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:00:38,734 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:00:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:38,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:00:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:38,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 19:00:38,801 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [917177072] [2020-08-22 19:00:38,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:00:38,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 19:00:38,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339984876] [2020-08-22 19:00:38,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 19:00:38,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:00:38,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 19:00:38,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 19:00:38,803 INFO L87 Difference]: Start difference. First operand 183 states and 240 transitions. Second operand 3 states. [2020-08-22 19:00:38,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:00:38,871 INFO L93 Difference]: Finished difference Result 479 states and 646 transitions. [2020-08-22 19:00:38,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 19:00:38,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-08-22 19:00:38,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:00:38,875 INFO L225 Difference]: With dead ends: 479 [2020-08-22 19:00:38,876 INFO L226 Difference]: Without dead ends: 325 [2020-08-22 19:00:38,877 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-08-22 19:00:38,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-08-22 19:00:38,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 323. [2020-08-22 19:00:38,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-08-22 19:00:38,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 426 transitions. [2020-08-22 19:00:38,936 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 426 transitions. Word has length 51 [2020-08-22 19:00:38,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:00:38,937 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 426 transitions. [2020-08-22 19:00:38,937 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 19:00:38,937 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 426 transitions. [2020-08-22 19:00:38,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-08-22 19:00:38,939 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:00:38,940 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-08-22 19:00:38,940 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 19:00:38,940 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:00:38,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:00:38,941 INFO L82 PathProgramCache]: Analyzing trace with hash -17356107, now seen corresponding path program 1 times [2020-08-22 19:00:38,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:00:38,941 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1599012969] [2020-08-22 19:00:38,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:00:38,943 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:00:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:38,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:00:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:38,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 19:00:38,990 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1599012969] [2020-08-22 19:00:38,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:00:38,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 19:00:38,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116134230] [2020-08-22 19:00:38,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 19:00:38,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:00:38,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 19:00:38,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 19:00:38,992 INFO L87 Difference]: Start difference. First operand 323 states and 426 transitions. Second operand 3 states. [2020-08-22 19:00:39,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:00:39,032 INFO L93 Difference]: Finished difference Result 399 states and 528 transitions. [2020-08-22 19:00:39,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 19:00:39,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-08-22 19:00:39,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:00:39,036 INFO L225 Difference]: With dead ends: 399 [2020-08-22 19:00:39,037 INFO L226 Difference]: Without dead ends: 397 [2020-08-22 19:00:39,037 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-08-22 19:00:39,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2020-08-22 19:00:39,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 323. [2020-08-22 19:00:39,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-08-22 19:00:39,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 422 transitions. [2020-08-22 19:00:39,077 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 422 transitions. Word has length 51 [2020-08-22 19:00:39,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:00:39,078 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 422 transitions. [2020-08-22 19:00:39,078 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 19:00:39,078 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 422 transitions. [2020-08-22 19:00:39,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-08-22 19:00:39,080 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:00:39,080 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-08-22 19:00:39,081 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 19:00:39,081 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:00:39,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:00:39,081 INFO L82 PathProgramCache]: Analyzing trace with hash 802147488, now seen corresponding path program 1 times [2020-08-22 19:00:39,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:00:39,082 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1258574577] [2020-08-22 19:00:39,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:00:39,084 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:00:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:39,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:00:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:39,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 19:00:39,133 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1258574577] [2020-08-22 19:00:39,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:00:39,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 19:00:39,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736915921] [2020-08-22 19:00:39,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 19:00:39,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:00:39,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 19:00:39,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 19:00:39,137 INFO L87 Difference]: Start difference. First operand 323 states and 422 transitions. Second operand 3 states. [2020-08-22 19:00:39,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:00:39,180 INFO L93 Difference]: Finished difference Result 395 states and 516 transitions. [2020-08-22 19:00:39,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 19:00:39,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-08-22 19:00:39,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:00:39,185 INFO L225 Difference]: With dead ends: 395 [2020-08-22 19:00:39,185 INFO L226 Difference]: Without dead ends: 393 [2020-08-22 19:00:39,188 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-08-22 19:00:39,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2020-08-22 19:00:39,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 323. [2020-08-22 19:00:39,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-08-22 19:00:39,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 418 transitions. [2020-08-22 19:00:39,224 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 418 transitions. Word has length 52 [2020-08-22 19:00:39,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:00:39,228 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 418 transitions. [2020-08-22 19:00:39,229 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 19:00:39,229 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 418 transitions. [2020-08-22 19:00:39,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-08-22 19:00:39,240 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:00:39,240 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-08-22 19:00:39,241 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 19:00:39,243 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:00:39,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:00:39,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1582250918, now seen corresponding path program 1 times [2020-08-22 19:00:39,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:00:39,244 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [731040224] [2020-08-22 19:00:39,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:00:39,245 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:00:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:39,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:00:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:39,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 19:00:39,326 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [731040224] [2020-08-22 19:00:39,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:00:39,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 19:00:39,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775287588] [2020-08-22 19:00:39,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 19:00:39,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:00:39,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 19:00:39,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 19:00:39,328 INFO L87 Difference]: Start difference. First operand 323 states and 418 transitions. Second operand 3 states. [2020-08-22 19:00:39,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:00:39,405 INFO L93 Difference]: Finished difference Result 887 states and 1164 transitions. [2020-08-22 19:00:39,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 19:00:39,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-08-22 19:00:39,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:00:39,411 INFO L225 Difference]: With dead ends: 887 [2020-08-22 19:00:39,411 INFO L226 Difference]: Without dead ends: 593 [2020-08-22 19:00:39,416 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-08-22 19:00:39,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-08-22 19:00:39,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 591. [2020-08-22 19:00:39,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-08-22 19:00:39,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 758 transitions. [2020-08-22 19:00:39,468 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 758 transitions. Word has length 52 [2020-08-22 19:00:39,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:00:39,469 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 758 transitions. [2020-08-22 19:00:39,469 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 19:00:39,469 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 758 transitions. [2020-08-22 19:00:39,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-08-22 19:00:39,476 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:00:39,476 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-08-22 19:00:39,477 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-22 19:00:39,477 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:00:39,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:00:39,477 INFO L82 PathProgramCache]: Analyzing trace with hash 436955529, now seen corresponding path program 1 times [2020-08-22 19:00:39,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:00:39,478 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1833383122] [2020-08-22 19:00:39,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:00:39,481 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:00:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:39,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:00:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:39,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 19:00:39,565 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1833383122] [2020-08-22 19:00:39,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:00:39,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 19:00:39,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046498642] [2020-08-22 19:00:39,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 19:00:39,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:00:39,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 19:00:39,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 19:00:39,567 INFO L87 Difference]: Start difference. First operand 591 states and 758 transitions. Second operand 3 states. [2020-08-22 19:00:39,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:00:39,646 INFO L93 Difference]: Finished difference Result 715 states and 912 transitions. [2020-08-22 19:00:39,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 19:00:39,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-08-22 19:00:39,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:00:39,651 INFO L225 Difference]: With dead ends: 715 [2020-08-22 19:00:39,652 INFO L226 Difference]: Without dead ends: 713 [2020-08-22 19:00:39,652 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-08-22 19:00:39,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2020-08-22 19:00:39,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 591. [2020-08-22 19:00:39,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-08-22 19:00:39,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 750 transitions. [2020-08-22 19:00:39,715 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 750 transitions. Word has length 53 [2020-08-22 19:00:39,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:00:39,716 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 750 transitions. [2020-08-22 19:00:39,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 19:00:39,717 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 750 transitions. [2020-08-22 19:00:39,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-08-22 19:00:39,718 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:00:39,718 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-08-22 19:00:39,718 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-22 19:00:39,718 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:00:39,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:00:39,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1804891768, now seen corresponding path program 1 times [2020-08-22 19:00:39,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:00:39,720 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [908298079] [2020-08-22 19:00:39,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:00:39,723 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:00:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:39,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:00:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:39,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 19:00:39,773 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [908298079] [2020-08-22 19:00:39,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:00:39,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 19:00:39,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23658073] [2020-08-22 19:00:39,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 19:00:39,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:00:39,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 19:00:39,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 19:00:39,775 INFO L87 Difference]: Start difference. First operand 591 states and 750 transitions. Second operand 3 states. [2020-08-22 19:00:39,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:00:39,880 INFO L93 Difference]: Finished difference Result 1667 states and 2128 transitions. [2020-08-22 19:00:39,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 19:00:39,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-08-22 19:00:39,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:00:39,887 INFO L225 Difference]: With dead ends: 1667 [2020-08-22 19:00:39,887 INFO L226 Difference]: Without dead ends: 1105 [2020-08-22 19:00:39,889 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-08-22 19:00:39,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2020-08-22 19:00:39,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1103. [2020-08-22 19:00:39,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2020-08-22 19:00:39,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1374 transitions. [2020-08-22 19:00:39,973 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1374 transitions. Word has length 53 [2020-08-22 19:00:39,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:00:39,973 INFO L479 AbstractCegarLoop]: Abstraction has 1103 states and 1374 transitions. [2020-08-22 19:00:39,973 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 19:00:39,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1374 transitions. [2020-08-22 19:00:39,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-08-22 19:00:39,978 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:00:39,979 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-08-22 19:00:39,979 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-22 19:00:39,979 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:00:39,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:00:39,981 INFO L82 PathProgramCache]: Analyzing trace with hash 2000907060, now seen corresponding path program 1 times [2020-08-22 19:00:39,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:00:39,982 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1866033635] [2020-08-22 19:00:39,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:00:39,984 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:00:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:40,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:00:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:40,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 19:00:40,040 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1866033635] [2020-08-22 19:00:40,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:00:40,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 19:00:40,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82164143] [2020-08-22 19:00:40,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 19:00:40,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:00:40,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 19:00:40,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 19:00:40,041 INFO L87 Difference]: Start difference. First operand 1103 states and 1374 transitions. Second operand 3 states. [2020-08-22 19:00:40,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:00:40,142 INFO L93 Difference]: Finished difference Result 1315 states and 1616 transitions. [2020-08-22 19:00:40,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 19:00:40,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-08-22 19:00:40,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:00:40,149 INFO L225 Difference]: With dead ends: 1315 [2020-08-22 19:00:40,149 INFO L226 Difference]: Without dead ends: 1313 [2020-08-22 19:00:40,151 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-08-22 19:00:40,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2020-08-22 19:00:40,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1103. [2020-08-22 19:00:40,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2020-08-22 19:00:40,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1358 transitions. [2020-08-22 19:00:40,250 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1358 transitions. Word has length 54 [2020-08-22 19:00:40,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:00:40,251 INFO L479 AbstractCegarLoop]: Abstraction has 1103 states and 1358 transitions. [2020-08-22 19:00:40,251 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 19:00:40,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1358 transitions. [2020-08-22 19:00:40,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-08-22 19:00:40,252 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:00:40,252 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-08-22 19:00:40,253 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-22 19:00:40,253 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:00:40,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:00:40,253 INFO L82 PathProgramCache]: Analyzing trace with hash -116823154, now seen corresponding path program 1 times [2020-08-22 19:00:40,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:00:40,254 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1835230084] [2020-08-22 19:00:40,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:00:40,255 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:00:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:40,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:00:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:40,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 19:00:40,280 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1835230084] [2020-08-22 19:00:40,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:00:40,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 19:00:40,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542060666] [2020-08-22 19:00:40,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 19:00:40,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:00:40,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 19:00:40,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 19:00:40,282 INFO L87 Difference]: Start difference. First operand 1103 states and 1358 transitions. Second operand 3 states. [2020-08-22 19:00:40,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:00:40,431 INFO L93 Difference]: Finished difference Result 3153 states and 3887 transitions. [2020-08-22 19:00:40,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 19:00:40,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-08-22 19:00:40,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:00:40,438 INFO L225 Difference]: With dead ends: 3153 [2020-08-22 19:00:40,438 INFO L226 Difference]: Without dead ends: 1103 [2020-08-22 19:00:40,442 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-08-22 19:00:40,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2020-08-22 19:00:40,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1103. [2020-08-22 19:00:40,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2020-08-22 19:00:40,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1294 transitions. [2020-08-22 19:00:40,513 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1294 transitions. Word has length 54 [2020-08-22 19:00:40,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:00:40,513 INFO L479 AbstractCegarLoop]: Abstraction has 1103 states and 1294 transitions. [2020-08-22 19:00:40,514 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 19:00:40,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1294 transitions. [2020-08-22 19:00:40,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-08-22 19:00:40,515 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:00:40,515 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-08-22 19:00:40,516 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-22 19:00:40,516 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:00:40,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:00:40,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1056202659, now seen corresponding path program 1 times [2020-08-22 19:00:40,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:00:40,517 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [911767337] [2020-08-22 19:00:40,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:00:40,518 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:00:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:40,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:00:40,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:40,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 19:00:40,569 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [911767337] [2020-08-22 19:00:40,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:00:40,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 19:00:40,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222801093] [2020-08-22 19:00:40,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 19:00:40,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:00:40,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 19:00:40,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 19:00:40,571 INFO L87 Difference]: Start difference. First operand 1103 states and 1294 transitions. Second operand 3 states. [2020-08-22 19:00:40,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:00:40,637 INFO L93 Difference]: Finished difference Result 1103 states and 1294 transitions. [2020-08-22 19:00:40,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 19:00:40,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-08-22 19:00:40,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:00:40,638 INFO L225 Difference]: With dead ends: 1103 [2020-08-22 19:00:40,638 INFO L226 Difference]: Without dead ends: 0 [2020-08-22 19:00:40,640 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-08-22 19:00:40,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-08-22 19:00:40,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-08-22 19:00:40,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-08-22 19:00:40,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-08-22 19:00:40,641 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2020-08-22 19:00:40,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:00:40,642 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-08-22 19:00:40,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 19:00:40,642 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-08-22 19:00:40,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-08-22 19:00:40,642 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-22 19:00:40,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-08-22 19:00:41,067 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-08-22 19:00:41,312 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 7 [2020-08-22 19:00:41,993 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-08-22 19:00:42,413 WARN L193 SmtUtils]: Spent 404.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-08-22 19:00:42,858 WARN L193 SmtUtils]: Spent 436.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-08-22 19:00:43,887 WARN L193 SmtUtils]: Spent 955.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-08-22 19:00:44,031 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-08-22 19:00:44,273 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-08-22 19:00:44,658 WARN L193 SmtUtils]: Spent 383.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-08-22 19:00:44,993 WARN L193 SmtUtils]: Spent 329.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-08-22 19:00:45,147 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-08-22 19:00:45,419 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-08-22 19:00:45,793 WARN L193 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-08-22 19:00:45,923 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-08-22 19:00:45,923 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-08-22 19:00:45,923 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-08-22 19:00:45,923 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-08-22 19:00:45,924 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-08-22 19:00:45,924 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-08-22 19:00:45,924 INFO L264 CegarLoopResult]: At program point L93(line 93) the Hoare annotation is: (let ((.cse0 (= main_~lk5~0 1))) (or (and (= main_~lk6~0 1) .cse0) (and (= main_~p6~0 0) .cse0))) [2020-08-22 19:00:45,924 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 4 107) the Hoare annotation is: true [2020-08-22 19:00:45,924 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-08-22 19:00:45,924 INFO L264 CegarLoopResult]: At program point L77-1(lines 27 102) the Hoare annotation is: (let ((.cse5 (= main_~p5~0 0)) (.cse1 (= main_~p6~0 0)) (.cse4 (= main_~lk3~0 1)) (.cse7 (= main_~p4~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse2 (= main_~p3~0 0)) (.cse6 (= main_~lk6~0 1)) (.cse3 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse1 .cse5) (and .cse0 .cse2 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse7) (and .cse4 .cse1 .cse7 .cse3) (and .cse2 .cse5 .cse6 .cse7) (and .cse2 .cse6 .cse7 .cse3) (and .cse0 .cse1 .cse2 .cse5) (and .cse1 .cse2 .cse7 .cse3) (and .cse0 .cse4 .cse5 .cse6) (and .cse0 .cse4 .cse6 .cse3) (and .cse4 .cse1 .cse5 .cse7) (and .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse4 .cse1 .cse3) (and .cse4 .cse6 .cse7 .cse3) (and .cse0 .cse2 .cse6 .cse3))) [2020-08-22 19:00:45,925 INFO L271 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: true [2020-08-22 19:00:45,925 INFO L264 CegarLoopResult]: At program point L94(line 94) the Hoare annotation is: (let ((.cse0 (= main_~lk5~0 1))) (or (and (= main_~lk6~0 1) .cse0) (and (= main_~p6~0 0) .cse0))) [2020-08-22 19:00:45,925 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-08-22 19:00:45,925 INFO L271 CegarLoopResult]: At program point L28-1(line 28) the Hoare annotation is: true [2020-08-22 19:00:45,925 INFO L271 CegarLoopResult]: At program point L28-2(line 28) the Hoare annotation is: true [2020-08-22 19:00:45,926 INFO L264 CegarLoopResult]: At program point L78(line 78) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1)) (.cse5 (= main_~lk3~0 1)) (.cse2 (= main_~p5~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse7 (= main_~p6~0 0)) (.cse1 (= main_~p3~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse6 (= main_~p4~0 0)) (.cse8 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse1 .cse3 .cse8) (and .cse0 .cse7 .cse1 .cse2 .cse3) (and .cse1 .cse3 .cse4 .cse6 .cse8) (and .cse5 .cse7 .cse3 .cse6 .cse8) (and .cse5 .cse7 .cse2 .cse3 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse8) (and .cse0 .cse5 .cse3 .cse4 .cse8) (and .cse0 .cse5 .cse7 .cse3 .cse8) (and .cse5 .cse3 .cse4 .cse6 .cse8) (and .cse7 .cse1 .cse2 .cse3 .cse6) (and .cse0 .cse5 .cse7 .cse2 .cse3) (and .cse5 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse1 .cse3 .cse6 .cse8))) [2020-08-22 19:00:45,926 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-08-22 19:00:45,926 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-08-22 19:00:45,926 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-08-22 19:00:45,926 INFO L271 CegarLoopResult]: At program point L103(lines 5 107) the Hoare annotation is: true [2020-08-22 19:00:45,926 INFO L271 CegarLoopResult]: At program point L29(lines 29 31) the Hoare annotation is: true [2020-08-22 19:00:45,926 INFO L264 CegarLoopResult]: At program point L62-1(lines 27 102) the Hoare annotation is: (let ((.cse0 (= main_~lk3~0 1)) (.cse2 (= main_~p4~0 0)) (.cse4 (= main_~lk1~0 1)) (.cse3 (= main_~lk5~0 1)) (.cse6 (= main_~p2~0 0)) (.cse7 (= main_~lk4~0 1)) (.cse8 (= main_~p3~0 0)) (.cse5 (= main_~p5~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse9 (= main_~p1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse6 .cse4) (and .cse7 .cse0 .cse5 .cse6 .cse4) (and .cse8 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse5 .cse2 .cse6 .cse4) (and .cse7 .cse8 .cse5 .cse1 .cse4) (and .cse7 .cse0 .cse1 .cse3 .cse4) (and .cse7 .cse0 .cse5 .cse1 .cse4) (and .cse7 .cse8 .cse5 .cse6 .cse4) (and .cse7 .cse8 .cse1 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 .cse4) (and .cse7 .cse0 .cse9 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse0 .cse5 .cse2 .cse9 .cse6) (and .cse7 .cse8 .cse3 .cse6 .cse4) (and .cse8 .cse2 .cse9 .cse3 .cse6) (and .cse7 .cse0 .cse5 .cse1 .cse9) (and .cse0 .cse2 .cse9 .cse3 .cse6) (and .cse8 .cse1 .cse2 .cse9 .cse3) (and .cse8 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse8 .cse1 .cse9 .cse3) (and .cse7 .cse0 .cse5 .cse9 .cse6) (and .cse7 .cse0 .cse1 .cse9 .cse3) (and .cse7 .cse8 .cse5 .cse9 .cse6) (and .cse0 .cse5 .cse1 .cse2 .cse9) (and .cse7 .cse0 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse8 .cse5 .cse2 .cse9 .cse6) (and .cse8 .cse1 .cse2 .cse3 .cse4) (and .cse7 .cse8 .cse9 .cse3 .cse6) (and .cse7 .cse8 .cse5 .cse1 .cse9))) [2020-08-22 19:00:45,927 INFO L264 CegarLoopResult]: At program point L87-1(lines 27 102) the Hoare annotation is: (let ((.cse1 (= main_~lk6~0 1)) (.cse2 (= main_~lk5~0 1)) (.cse3 (= main_~p6~0 0)) (.cse0 (= main_~p5~0 0))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse3 .cse2) (and .cse3 .cse0))) [2020-08-22 19:00:45,927 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-08-22 19:00:45,927 INFO L264 CegarLoopResult]: At program point L54-1(lines 27 102) the Hoare annotation is: (let ((.cse2 (= main_~lk1~0 1)) (.cse4 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse5 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 .cse1 .cse2) (and .cse4 .cse5 .cse3) (and .cse0 .cse1 .cse5) (and .cse4 .cse3 .cse2) (and .cse4 .cse1 .cse5) (and .cse0 .cse5 .cse3))) [2020-08-22 19:00:45,927 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-08-22 19:00:45,927 INFO L271 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: true [2020-08-22 19:00:45,927 INFO L264 CegarLoopResult]: At program point L79(line 79) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1)) (.cse5 (= main_~lk3~0 1)) (.cse2 (= main_~p5~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse7 (= main_~p6~0 0)) (.cse1 (= main_~p3~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse6 (= main_~p4~0 0)) (.cse8 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse1 .cse3 .cse8) (and .cse0 .cse7 .cse1 .cse2 .cse3) (and .cse1 .cse3 .cse4 .cse6 .cse8) (and .cse5 .cse7 .cse3 .cse6 .cse8) (and .cse5 .cse7 .cse2 .cse3 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse8) (and .cse5 .cse3 .cse4 .cse6 .cse8) (and .cse0 .cse5 .cse3 .cse4 .cse8) (and .cse0 .cse5 .cse7 .cse3 .cse8) (and .cse7 .cse1 .cse2 .cse3 .cse6) (and .cse0 .cse5 .cse7 .cse2 .cse3) (and .cse5 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse1 .cse3 .cse6 .cse8))) [2020-08-22 19:00:45,927 INFO L271 CegarLoopResult]: At program point L46(lines 46 48) the Hoare annotation is: true [2020-08-22 19:00:45,927 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-08-22 19:00:45,927 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 4 107) the Hoare annotation is: true [2020-08-22 19:00:45,928 INFO L264 CegarLoopResult]: At program point L46-2(lines 27 102) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-08-22 19:00:45,928 INFO L271 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: true [2020-08-22 19:00:45,928 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) the Hoare annotation is: false [2020-08-22 19:00:45,928 INFO L264 CegarLoopResult]: At program point L63(line 63) the Hoare annotation is: (let ((.cse6 (= main_~p2~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~p3~0 0)) (.cse3 (= main_~p1~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse4 .cse5 .cse3 .cse6) (and .cse5 .cse2 .cse3 .cse6) (and .cse5 .cse1 .cse2 .cse7) (and .cse0 .cse2 .cse6 .cse7) (and .cse5 .cse2 .cse6 .cse7) (and .cse4 .cse0 .cse6 .cse7) (and .cse4 .cse0 .cse1 .cse3) (and .cse4 .cse0 .cse1 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse7))) [2020-08-22 19:00:45,928 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 107) the Hoare annotation is: true [2020-08-22 19:00:45,928 INFO L264 CegarLoopResult]: At program point L88(line 88) the Hoare annotation is: (let ((.cse4 (= main_~p5~0 0)) (.cse1 (= main_~lk6~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse3 (= main_~p6~0 0)) (.cse2 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse0 .cse4 .cse1) (and .cse0 .cse3 .cse2))) [2020-08-22 19:00:45,928 INFO L264 CegarLoopResult]: At program point L55(line 55) the Hoare annotation is: (let ((.cse0 (= main_~lk2~0 1)) (.cse2 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0)) (.cse1 (= main_~lk1~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse2) (and .cse3 .cse1))) [2020-08-22 19:00:45,929 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-08-22 19:00:45,929 INFO L271 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: true [2020-08-22 19:00:45,929 INFO L264 CegarLoopResult]: At program point L72-1(lines 27 102) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse2 (= main_~p5~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse9 (= main_~p2~0 0)) (.cse5 (= main_~p6~0 0)) (.cse6 (= main_~p3~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse8 (= main_~p4~0 0)) (.cse7 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse6 .cse3 .cse7) (and .cse1 .cse4 .cse8 .cse7 .cse9) (and .cse0 .cse1 .cse5 .cse2 .cse9) (and .cse6 .cse3 .cse4 .cse8 .cse7) (and .cse0 .cse5 .cse6 .cse7 .cse9) (and .cse0 .cse1 .cse4 .cse7 .cse9) (and .cse6 .cse2 .cse4 .cse8 .cse9) (and .cse0 .cse6 .cse4 .cse7 .cse9) (and .cse1 .cse3 .cse4 .cse8 .cse7) (and .cse0 .cse1 .cse5 .cse3 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse7) (and .cse0 .cse1 .cse5 .cse2 .cse3) (and .cse6 .cse4 .cse8 .cse7 .cse9) (and .cse5 .cse6 .cse8 .cse7 .cse9) (and .cse0 .cse5 .cse6 .cse2 .cse9) (and .cse0 .cse6 .cse2 .cse4 .cse9) (and .cse0 .cse6 .cse2 .cse3 .cse4) (and .cse6 .cse2 .cse3 .cse4 .cse8) (and .cse0 .cse5 .cse6 .cse2 .cse3) (and .cse1 .cse5 .cse3 .cse8 .cse7) (and .cse1 .cse5 .cse2 .cse3 .cse8) (and .cse0 .cse6 .cse3 .cse4 .cse7) (and .cse1 .cse5 .cse2 .cse8 .cse9) (and .cse5 .cse6 .cse2 .cse8 .cse9) (and .cse1 .cse2 .cse4 .cse8 .cse9) (and .cse0 .cse1 .cse5 .cse7 .cse9) (and .cse1 .cse5 .cse8 .cse7 .cse9) (and .cse5 .cse6 .cse2 .cse3 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse9) (and .cse5 .cse6 .cse3 .cse8 .cse7))) [2020-08-22 19:00:45,929 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-08-22 19:00:45,929 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-08-22 19:00:45,929 INFO L271 CegarLoopResult]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2020-08-22 19:00:45,930 INFO L264 CegarLoopResult]: At program point L89(line 89) the Hoare annotation is: (let ((.cse4 (= main_~p5~0 0)) (.cse1 (= main_~lk6~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse3 (= main_~p6~0 0)) (.cse2 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse0 .cse4 .cse1) (and .cse0 .cse3 .cse2))) [2020-08-22 19:00:45,930 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-08-22 19:00:45,930 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-08-22 19:00:45,930 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-08-22 19:00:45,930 INFO L264 CegarLoopResult]: At program point L106(line 106) the Hoare annotation is: false [2020-08-22 19:00:45,930 INFO L264 CegarLoopResult]: At program point L73(line 73) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1)) (.cse10 (= main_~lk2~0 1)) (.cse1 (= main_~p6~0 0)) (.cse2 (= main_~p3~0 0)) (.cse9 (= main_~p5~0 0)) (.cse8 (= main_~lk3~0 1)) (.cse6 (= main_~lk6~0 1)) (.cse7 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~p2~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse9 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse10 .cse5) (and .cse0 .cse8 .cse9 .cse6 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse10 .cse6 .cse3 .cse5) (and .cse8 .cse1 .cse9 .cse7 .cse4 .cse5) (and .cse0 .cse2 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse10 .cse5) (and .cse0 .cse8 .cse10 .cse6 .cse3 .cse5) (and .cse8 .cse10 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse4 .cse5) (and .cse1 .cse2 .cse10 .cse7 .cse3 .cse5) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse1 .cse9 .cse10 .cse7 .cse5) (and .cse8 .cse9 .cse10 .cse6 .cse7 .cse5) (and .cse0 .cse8 .cse1 .cse10 .cse3 .cse5) (and .cse2 .cse9 .cse10 .cse6 .cse7 .cse5) (and .cse0 .cse2 .cse9 .cse10 .cse6 .cse5) (and .cse2 .cse10 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse5) (and .cse0 .cse2 .cse9 .cse6 .cse4 .cse5) (and .cse8 .cse1 .cse10 .cse7 .cse3 .cse5) (and .cse2 .cse9 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse9 .cse10 .cse6 .cse5) (and .cse8 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse10 .cse7 .cse5) (and .cse1 .cse2 .cse9 .cse7 .cse4 .cse5) (and .cse8 .cse6 .cse7 .cse3 .cse4 .cse5))) [2020-08-22 19:00:45,930 INFO L271 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: true [2020-08-22 19:00:45,930 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-08-22 19:00:45,930 INFO L264 CegarLoopResult]: At program point L98(line 98) the Hoare annotation is: (= main_~lk6~0 1) [2020-08-22 19:00:45,930 INFO L264 CegarLoopResult]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2020-08-22 19:00:45,931 INFO L271 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: true [2020-08-22 19:00:45,931 INFO L264 CegarLoopResult]: At program point L82-1(lines 27 102) the Hoare annotation is: (let ((.cse4 (= main_~lk6~0 1)) (.cse5 (= main_~p5~0 0)) (.cse1 (= main_~p4~0 0)) (.cse3 (= main_~lk4~0 1)) (.cse0 (= main_~p6~0 0)) (.cse2 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse3 .cse0 .cse5) (and .cse5 .cse4 .cse1) (and .cse4 .cse1 .cse2) (and .cse3 .cse5 .cse4) (and .cse0 .cse5 .cse1) (and .cse3 .cse0 .cse2))) [2020-08-22 19:00:45,931 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-08-22 19:00:45,931 INFO L264 CegarLoopResult]: At program point L74(line 74) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1)) (.cse10 (= main_~lk2~0 1)) (.cse8 (= main_~lk3~0 1)) (.cse6 (= main_~lk6~0 1)) (.cse3 (= main_~lk5~0 1)) (.cse1 (= main_~p6~0 0)) (.cse2 (= main_~p3~0 0)) (.cse9 (= main_~p5~0 0)) (.cse7 (= main_~p4~0 0)) (.cse4 (= main_~p2~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse9 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse10 .cse5) (and .cse0 .cse8 .cse9 .cse6 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse3 .cse4 .cse5) (and .cse8 .cse1 .cse9 .cse7 .cse4 .cse5) (and .cse0 .cse2 .cse10 .cse6 .cse3 .cse5) (and .cse0 .cse2 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse10 .cse5) (and .cse0 .cse8 .cse10 .cse6 .cse3 .cse5) (and .cse8 .cse10 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse4 .cse5) (and .cse1 .cse2 .cse10 .cse7 .cse3 .cse5) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse1 .cse9 .cse10 .cse7 .cse5) (and .cse8 .cse9 .cse10 .cse6 .cse7 .cse5) (and .cse0 .cse8 .cse1 .cse10 .cse3 .cse5) (and .cse0 .cse2 .cse9 .cse10 .cse6 .cse5) (and .cse2 .cse9 .cse10 .cse6 .cse7 .cse5) (and .cse2 .cse10 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse5) (and .cse0 .cse2 .cse9 .cse6 .cse4 .cse5) (and .cse8 .cse1 .cse10 .cse7 .cse3 .cse5) (and .cse2 .cse9 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse9 .cse10 .cse6 .cse5) (and .cse8 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse10 .cse7 .cse5) (and .cse8 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse7 .cse4 .cse5))) [2020-08-22 19:00:45,931 INFO L264 CegarLoopResult]: At program point L99(line 99) the Hoare annotation is: (= main_~lk6~0 1) [2020-08-22 19:00:45,932 INFO L264 CegarLoopResult]: At program point L66-1(lines 27 102) the Hoare annotation is: (let ((.cse6 (= main_~lk6~0 1)) (.cse10 (= main_~p1~0 0)) (.cse8 (= main_~lk3~0 1)) (.cse3 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse4 (= main_~p2~0 0)) (.cse1 (= main_~p6~0 0)) (.cse2 (= main_~p3~0 0)) (.cse9 (= main_~p5~0 0)) (.cse11 (= main_~lk2~0 1)) (.cse7 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse9 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse10 .cse4) (and .cse8 .cse1 .cse11 .cse7 .cse10 .cse3) (and .cse0 .cse8 .cse9 .cse6 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse6 .cse10 .cse3 .cse4) (and .cse0 .cse2 .cse9 .cse6 .cse10 .cse4) (and .cse0 .cse8 .cse9 .cse6 .cse10 .cse4) (and .cse0 .cse8 .cse11 .cse6 .cse3 .cse5) (and .cse8 .cse9 .cse11 .cse6 .cse7 .cse10) (and .cse0 .cse2 .cse6 .cse10 .cse3 .cse4) (and .cse8 .cse1 .cse9 .cse11 .cse7 .cse5) (and .cse8 .cse9 .cse11 .cse6 .cse7 .cse5) (and .cse0 .cse8 .cse1 .cse11 .cse3 .cse5) (and .cse2 .cse9 .cse11 .cse6 .cse7 .cse10) (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse11 .cse10) (and .cse8 .cse1 .cse11 .cse7 .cse3 .cse5) (and .cse2 .cse9 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse9 .cse11 .cse6 .cse5) (and .cse0 .cse8 .cse11 .cse6 .cse10 .cse3) (and .cse2 .cse6 .cse7 .cse10 .cse3 .cse4) (and .cse8 .cse11 .cse6 .cse7 .cse10 .cse3) (and .cse0 .cse2 .cse11 .cse6 .cse10 .cse3) (and .cse8 .cse9 .cse6 .cse7 .cse10 .cse4) (and .cse8 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse7 .cse4 .cse5) (and .cse2 .cse9 .cse6 .cse7 .cse10 .cse4) (and .cse8 .cse1 .cse9 .cse7 .cse10 .cse4) (and .cse0 .cse8 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse11 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse10 .cse3) (and .cse8 .cse1 .cse9 .cse7 .cse4 .cse5) (and .cse0 .cse2 .cse11 .cse6 .cse3 .cse5) (and .cse8 .cse6 .cse7 .cse10 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse9 .cse11 .cse5) (and .cse0 .cse2 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse11 .cse10 .cse3) (and .cse8 .cse11 .cse6 .cse7 .cse3 .cse5) (and .cse1 .cse2 .cse11 .cse7 .cse10 .cse3) (and .cse0 .cse2 .cse9 .cse11 .cse6 .cse10) (and .cse0 .cse8 .cse1 .cse9 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse7 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse10 .cse4) (and .cse0 .cse8 .cse9 .cse11 .cse6 .cse10) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse1 .cse9 .cse11 .cse7 .cse10) (and .cse2 .cse9 .cse11 .cse6 .cse7 .cse5) (and .cse0 .cse2 .cse9 .cse11 .cse6 .cse5) (and .cse2 .cse11 .cse6 .cse7 .cse3 .cse5) (and .cse8 .cse1 .cse7 .cse10 .cse3 .cse4) (and .cse2 .cse11 .cse6 .cse7 .cse10 .cse3) (and .cse0 .cse8 .cse1 .cse10 .cse3 .cse4) (and .cse0 .cse2 .cse9 .cse6 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse11 .cse7 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse10 .cse4) (and .cse1 .cse2 .cse7 .cse10 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse4) (and .cse0 .cse8 .cse1 .cse9 .cse11 .cse10) (and .cse8 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse11 .cse7 .cse5))) [2020-08-22 19:00:45,932 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-08-22 19:00:45,932 INFO L264 CegarLoopResult]: At program point L58-1(lines 27 102) the Hoare annotation is: (let ((.cse6 (= main_~p2~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~p3~0 0)) (.cse3 (= main_~p1~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse4 .cse5 .cse3 .cse6) (and .cse5 .cse2 .cse3 .cse6) (and .cse5 .cse1 .cse2 .cse7) (and .cse0 .cse2 .cse6 .cse7) (and .cse5 .cse2 .cse6 .cse7) (and .cse4 .cse0 .cse6 .cse7) (and .cse4 .cse0 .cse1 .cse3) (and .cse4 .cse0 .cse1 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse7))) [2020-08-22 19:00:45,932 INFO L264 CegarLoopResult]: At program point L83(line 83) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1)) (.cse2 (= main_~p6~0 0)) (.cse3 (= main_~p5~0 0)) (.cse1 (= main_~lk3~0 1)) (.cse4 (= main_~lk6~0 1)) (.cse6 (= main_~p4~0 0)) (.cse5 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse4) (and .cse0 .cse1 .cse4 .cse5) (and .cse1 .cse2 .cse6 .cse5) (and .cse1 .cse2 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse5) (and .cse1 .cse3 .cse4 .cse6) (and .cse1 .cse4 .cse6 .cse5))) [2020-08-22 19:00:45,932 INFO L264 CegarLoopResult]: At program point L50-1(lines 27 102) the Hoare annotation is: (let ((.cse0 (= main_~lk2~0 1)) (.cse2 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0)) (.cse1 (= main_~lk1~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse2) (and .cse3 .cse1))) [2020-08-22 19:00:45,932 INFO L271 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-08-22 19:00:45,932 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-08-22 19:00:45,932 INFO L271 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: true [2020-08-22 19:00:45,933 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-08-22 19:00:45,933 INFO L264 CegarLoopResult]: At program point L67(line 67) the Hoare annotation is: (let ((.cse0 (= main_~lk3~0 1)) (.cse6 (= main_~p2~0 0)) (.cse2 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~lk1~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse7 (= main_~p3~0 0)) (.cse5 (= main_~p5~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse9 (= main_~p1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse0 .cse5 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse6 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse4) (and .cse8 .cse0 .cse1 .cse3 .cse4) (and .cse8 .cse0 .cse5 .cse1 .cse4) (and .cse8 .cse7 .cse5 .cse6 .cse4) (and .cse8 .cse0 .cse9 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse8 .cse7 .cse1 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 .cse4) (and .cse0 .cse5 .cse2 .cse9 .cse6) (and .cse7 .cse2 .cse9 .cse3 .cse6) (and .cse8 .cse7 .cse3 .cse6 .cse4) (and .cse8 .cse0 .cse5 .cse1 .cse9) (and .cse7 .cse5 .cse1 .cse2 .cse9) (and .cse7 .cse2 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse9 .cse3 .cse6) (and .cse7 .cse1 .cse2 .cse9 .cse3) (and .cse8 .cse7 .cse1 .cse9 .cse3) (and .cse8 .cse0 .cse5 .cse9 .cse6) (and .cse8 .cse0 .cse1 .cse9 .cse3) (and .cse8 .cse7 .cse5 .cse9 .cse6) (and .cse0 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse0 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse9 .cse6) (and .cse8 .cse7 .cse9 .cse3 .cse6) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse9))) [2020-08-22 19:00:45,933 INFO L271 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: true [2020-08-22 19:00:45,933 INFO L264 CegarLoopResult]: At program point L59(line 59) the Hoare annotation is: (let ((.cse2 (= main_~lk1~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse3 (= main_~p2~0 0)) (.cse4 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse5 (= main_~p1~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 .cse1 .cse2) (and .cse4 .cse5 .cse3) (and .cse0 .cse1 .cse5) (and .cse4 .cse3 .cse2) (and .cse0 .cse5 .cse3) (and .cse4 .cse1 .cse5))) [2020-08-22 19:00:45,933 INFO L264 CegarLoopResult]: At program point L92-1(lines 27 102) the Hoare annotation is: (or (= main_~p6~0 0) (= main_~lk6~0 1)) [2020-08-22 19:00:45,934 INFO L264 CegarLoopResult]: At program point L84(line 84) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1)) (.cse2 (= main_~p6~0 0)) (.cse3 (= main_~p5~0 0)) (.cse1 (= main_~lk3~0 1)) (.cse4 (= main_~lk6~0 1)) (.cse6 (= main_~p4~0 0)) (.cse5 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse5) (and .cse0 .cse1 .cse3 .cse4) (and .cse1 .cse2 .cse6 .cse5) (and .cse1 .cse2 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse5) (and .cse1 .cse3 .cse4 .cse6) (and .cse1 .cse4 .cse6 .cse5))) [2020-08-22 19:00:45,934 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-08-22 19:00:45,934 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-08-22 19:00:45,934 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-08-22 19:00:45,934 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-08-22 19:00:45,934 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-08-22 19:00:45,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 07:00:45 BoogieIcfgContainer [2020-08-22 19:00:45,948 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 19:00:45,950 INFO L168 Benchmark]: Toolchain (without parser) took 9002.08 ms. Allocated memory was 137.4 MB in the beginning and 385.9 MB in the end (delta: 248.5 MB). Free memory was 100.5 MB in the beginning and 232.3 MB in the end (delta: -131.8 MB). Peak memory consumption was 227.3 MB. Max. memory is 7.1 GB. [2020-08-22 19:00:45,950 INFO L168 Benchmark]: CDTParser took 0.85 ms. Allocated memory is still 137.4 MB. Free memory was 118.6 MB in the beginning and 118.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-22 19:00:45,951 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.35 ms. Allocated memory is still 137.4 MB. Free memory was 100.3 MB in the beginning and 89.9 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2020-08-22 19:00:45,952 INFO L168 Benchmark]: Boogie Preprocessor took 128.59 ms. Allocated memory was 137.4 MB in the beginning and 200.3 MB in the end (delta: 62.9 MB). Free memory was 89.9 MB in the beginning and 178.2 MB in the end (delta: -88.4 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2020-08-22 19:00:45,953 INFO L168 Benchmark]: RCFGBuilder took 383.07 ms. Allocated memory is still 200.3 MB. Free memory was 178.2 MB in the beginning and 159.4 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. [2020-08-22 19:00:45,954 INFO L168 Benchmark]: TraceAbstraction took 8162.22 ms. Allocated memory was 200.3 MB in the beginning and 385.9 MB in the end (delta: 185.6 MB). Free memory was 158.7 MB in the beginning and 232.3 MB in the end (delta: -73.6 MB). Peak memory consumption was 222.7 MB. Max. memory is 7.1 GB. [2020-08-22 19:00:45,957 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.85 ms. Allocated memory is still 137.4 MB. Free memory was 118.6 MB in the beginning and 118.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 322.35 ms. Allocated memory is still 137.4 MB. Free memory was 100.3 MB in the beginning and 89.9 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 128.59 ms. Allocated memory was 137.4 MB in the beginning and 200.3 MB in the end (delta: 62.9 MB). Free memory was 89.9 MB in the beginning and 178.2 MB in the end (delta: -88.4 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 383.07 ms. Allocated memory is still 200.3 MB. Free memory was 178.2 MB in the beginning and 159.4 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8162.22 ms. Allocated memory was 200.3 MB in the beginning and 385.9 MB in the end (delta: 185.6 MB). Free memory was 158.7 MB in the beginning and 232.3 MB in the end (delta: -73.6 MB). Peak memory consumption was 222.7 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.0s, 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.1s 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.1s HoareSimplificationTime, 78 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 4.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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...