/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_7.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 22:00:05,678 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 22:00:05,683 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 22:00:05,710 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 22:00:05,711 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 22:00:05,712 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 22:00:05,713 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 22:00:05,716 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 22:00:05,718 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 22:00:05,719 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 22:00:05,720 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 22:00:05,721 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 22:00:05,722 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 22:00:05,723 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 22:00:05,724 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 22:00:05,726 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 22:00:05,727 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 22:00:05,728 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 22:00:05,730 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 22:00:05,732 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 22:00:05,734 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 22:00:05,735 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 22:00:05,736 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 22:00:05,737 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 22:00:05,740 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 22:00:05,740 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 22:00:05,741 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 22:00:05,742 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 22:00:05,742 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 22:00:05,743 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 22:00:05,744 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 22:00:05,745 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 22:00:05,746 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 22:00:05,747 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 22:00:05,748 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 22:00:05,748 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 22:00:05,749 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 22:00:05,749 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 22:00:05,749 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 22:00:05,750 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 22:00:05,751 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 22:00:05,752 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 22:00:05,765 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 22:00:05,766 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 22:00:05,767 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 22:00:05,768 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 22:00:05,768 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 22:00:05,768 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 22:00:05,768 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 22:00:05,768 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 22:00:05,769 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 22:00:05,769 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 22:00:05,769 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 22:00:05,769 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 22:00:05,770 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 22:00:05,770 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 22:00:05,770 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 22:00:05,770 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 22:00:05,770 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 22:00:05,771 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 22:00:05,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 22:00:05,771 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 22:00:05,771 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 22:00:05,771 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 22:00:05,772 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-09-04 22:00:06,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 22:00:06,285 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 22:00:06,290 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 22:00:06,292 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 22:00:06,293 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 22:00:06,294 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_7.c [2020-09-04 22:00:06,408 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/4bb36c0a5/1614765fbca1432ca6426bac3893cb13/FLAGc62aa4b8f [2020-09-04 22:00:07,113 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 22:00:07,114 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/locks/test_locks_7.c [2020-09-04 22:00:07,124 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/4bb36c0a5/1614765fbca1432ca6426bac3893cb13/FLAGc62aa4b8f [2020-09-04 22:00:07,396 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/4bb36c0a5/1614765fbca1432ca6426bac3893cb13 [2020-09-04 22:00:07,413 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 22:00:07,416 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 22:00:07,418 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 22:00:07,418 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 22:00:07,423 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 22:00:07,425 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 10:00:07" (1/1) ... [2020-09-04 22:00:07,430 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31a94c33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:07, skipping insertion in model container [2020-09-04 22:00:07,431 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 10:00:07" (1/1) ... [2020-09-04 22:00:07,442 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 22:00:07,485 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 22:00:07,793 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 22:00:07,801 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 22:00:07,831 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 22:00:07,858 INFO L208 MainTranslator]: Completed translation [2020-09-04 22:00:07,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:07 WrapperNode [2020-09-04 22:00:07,860 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 22:00:07,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 22:00:07,863 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 22:00:07,863 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 22:00:07,977 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:07" (1/1) ... [2020-09-04 22:00:07,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:07" (1/1) ... [2020-09-04 22:00:07,987 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:07" (1/1) ... [2020-09-04 22:00:07,988 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:07" (1/1) ... [2020-09-04 22:00:08,002 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:07" (1/1) ... [2020-09-04 22:00:08,015 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:07" (1/1) ... [2020-09-04 22:00:08,017 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:07" (1/1) ... [2020-09-04 22:00:08,020 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 22:00:08,021 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 22:00:08,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 22:00:08,022 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 22:00:08,023 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:07" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-09-04 22:00:08,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 22:00:08,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 22:00:08,104 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 22:00:08,105 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 22:00:08,105 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 22:00:08,105 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 22:00:08,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 22:00:08,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 22:00:08,478 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 22:00:08,478 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-04 22:00:08,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 10:00:08 BoogieIcfgContainer [2020-09-04 22:00:08,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 22:00:08,488 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 22:00:08,488 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 22:00:08,492 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 22:00:08,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 10:00:07" (1/3) ... [2020-09-04 22:00:08,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61dce904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 10:00:08, skipping insertion in model container [2020-09-04 22:00:08,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:07" (2/3) ... [2020-09-04 22:00:08,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61dce904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 10:00:08, skipping insertion in model container [2020-09-04 22:00:08,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 10:00:08" (3/3) ... [2020-09-04 22:00:08,497 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2020-09-04 22:00:08,512 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 22:00:08,527 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 22:00:08,575 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 22:00:08,621 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 22:00:08,622 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 22:00:08,622 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 22:00:08,622 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 22:00:08,622 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 22:00:08,623 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 22:00:08,623 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 22:00:08,623 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 22:00:08,642 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2020-09-04 22:00:08,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-09-04 22:00:08,658 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:08,660 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-09-04 22:00:08,660 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:08,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:08,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1826051656, now seen corresponding path program 1 times [2020-09-04 22:00:08,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:08,682 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1567781139] [2020-09-04 22:00:08,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:08,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:08,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:08,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:08,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:08,937 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1567781139] [2020-09-04 22:00:08,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:08,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:08,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877783368] [2020-09-04 22:00:08,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:08,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:08,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:08,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:08,978 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 3 states. [2020-09-04 22:00:09,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:09,084 INFO L93 Difference]: Finished difference Result 191 states and 260 transitions. [2020-09-04 22:00:09,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:09,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-09-04 22:00:09,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:09,104 INFO L225 Difference]: With dead ends: 191 [2020-09-04 22:00:09,105 INFO L226 Difference]: Without dead ends: 128 [2020-09-04 22:00:09,111 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-09-04 22:00:09,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-09-04 22:00:09,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2020-09-04 22:00:09,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-09-04 22:00:09,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 164 transitions. [2020-09-04 22:00:09,193 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 164 transitions. Word has length 55 [2020-09-04 22:00:09,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:09,195 INFO L479 AbstractCegarLoop]: Abstraction has 126 states and 164 transitions. [2020-09-04 22:00:09,195 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:09,195 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 164 transitions. [2020-09-04 22:00:09,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-09-04 22:00:09,198 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:09,198 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, 1] [2020-09-04 22:00:09,199 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 22:00:09,199 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:09,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:09,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1965492109, now seen corresponding path program 1 times [2020-09-04 22:00:09,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:09,201 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1939369660] [2020-09-04 22:00:09,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:09,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:09,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:09,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:09,304 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1939369660] [2020-09-04 22:00:09,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:09,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:09,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615480481] [2020-09-04 22:00:09,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:09,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:09,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:09,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:09,309 INFO L87 Difference]: Start difference. First operand 126 states and 164 transitions. Second operand 3 states. [2020-09-04 22:00:09,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:09,366 INFO L93 Difference]: Finished difference Result 154 states and 202 transitions. [2020-09-04 22:00:09,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:09,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-09-04 22:00:09,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:09,371 INFO L225 Difference]: With dead ends: 154 [2020-09-04 22:00:09,371 INFO L226 Difference]: Without dead ends: 152 [2020-09-04 22:00:09,373 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-09-04 22:00:09,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-09-04 22:00:09,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 126. [2020-09-04 22:00:09,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-09-04 22:00:09,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 163 transitions. [2020-09-04 22:00:09,400 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 163 transitions. Word has length 56 [2020-09-04 22:00:09,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:09,400 INFO L479 AbstractCegarLoop]: Abstraction has 126 states and 163 transitions. [2020-09-04 22:00:09,401 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:09,401 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 163 transitions. [2020-09-04 22:00:09,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-09-04 22:00:09,403 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:09,403 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, 1] [2020-09-04 22:00:09,404 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 22:00:09,404 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:09,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:09,404 INFO L82 PathProgramCache]: Analyzing trace with hash 773271458, now seen corresponding path program 1 times [2020-09-04 22:00:09,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:09,405 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [160519725] [2020-09-04 22:00:09,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:09,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:09,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:09,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:09,529 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [160519725] [2020-09-04 22:00:09,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:09,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:09,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102353251] [2020-09-04 22:00:09,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:09,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:09,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:09,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:09,532 INFO L87 Difference]: Start difference. First operand 126 states and 163 transitions. Second operand 3 states. [2020-09-04 22:00:09,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:09,594 INFO L93 Difference]: Finished difference Result 306 states and 415 transitions. [2020-09-04 22:00:09,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:09,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-09-04 22:00:09,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:09,597 INFO L225 Difference]: With dead ends: 306 [2020-09-04 22:00:09,598 INFO L226 Difference]: Without dead ends: 213 [2020-09-04 22:00:09,599 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-09-04 22:00:09,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2020-09-04 22:00:09,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2020-09-04 22:00:09,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-09-04 22:00:09,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 280 transitions. [2020-09-04 22:00:09,636 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 280 transitions. Word has length 56 [2020-09-04 22:00:09,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:09,637 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 280 transitions. [2020-09-04 22:00:09,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:09,637 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 280 transitions. [2020-09-04 22:00:09,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-09-04 22:00:09,640 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:09,640 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, 1, 1] [2020-09-04 22:00:09,640 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 22:00:09,641 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:09,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:09,641 INFO L82 PathProgramCache]: Analyzing trace with hash -610540190, now seen corresponding path program 1 times [2020-09-04 22:00:09,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:09,642 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [518182119] [2020-09-04 22:00:09,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:09,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:09,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:09,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:09,715 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [518182119] [2020-09-04 22:00:09,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:09,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:09,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637442182] [2020-09-04 22:00:09,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:09,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:09,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:09,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:09,718 INFO L87 Difference]: Start difference. First operand 211 states and 280 transitions. Second operand 3 states. [2020-09-04 22:00:09,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:09,795 INFO L93 Difference]: Finished difference Result 259 states and 346 transitions. [2020-09-04 22:00:09,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:09,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2020-09-04 22:00:09,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:09,805 INFO L225 Difference]: With dead ends: 259 [2020-09-04 22:00:09,806 INFO L226 Difference]: Without dead ends: 257 [2020-09-04 22:00:09,807 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-09-04 22:00:09,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2020-09-04 22:00:09,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 211. [2020-09-04 22:00:09,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-09-04 22:00:09,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 278 transitions. [2020-09-04 22:00:09,880 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 278 transitions. Word has length 57 [2020-09-04 22:00:09,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:09,881 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 278 transitions. [2020-09-04 22:00:09,881 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:09,881 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 278 transitions. [2020-09-04 22:00:09,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-09-04 22:00:09,883 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:09,884 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, 1, 1] [2020-09-04 22:00:09,884 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 22:00:09,884 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:09,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:09,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1798143236, now seen corresponding path program 1 times [2020-09-04 22:00:09,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:09,892 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1909259531] [2020-09-04 22:00:09,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:09,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:09,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:09,982 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1909259531] [2020-09-04 22:00:09,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:09,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:09,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384939339] [2020-09-04 22:00:09,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:09,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:09,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:09,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:09,985 INFO L87 Difference]: Start difference. First operand 211 states and 278 transitions. Second operand 3 states. [2020-09-04 22:00:10,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:10,034 INFO L93 Difference]: Finished difference Result 555 states and 752 transitions. [2020-09-04 22:00:10,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:10,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2020-09-04 22:00:10,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:10,038 INFO L225 Difference]: With dead ends: 555 [2020-09-04 22:00:10,039 INFO L226 Difference]: Without dead ends: 377 [2020-09-04 22:00:10,041 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-09-04 22:00:10,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2020-09-04 22:00:10,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 375. [2020-09-04 22:00:10,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-09-04 22:00:10,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 498 transitions. [2020-09-04 22:00:10,099 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 498 transitions. Word has length 57 [2020-09-04 22:00:10,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:10,102 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 498 transitions. [2020-09-04 22:00:10,103 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:10,103 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 498 transitions. [2020-09-04 22:00:10,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-09-04 22:00:10,116 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:10,117 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, 1, 1, 1] [2020-09-04 22:00:10,117 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 22:00:10,117 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:10,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:10,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1136837537, now seen corresponding path program 1 times [2020-09-04 22:00:10,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:10,119 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2067604306] [2020-09-04 22:00:10,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:10,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:10,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:10,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:10,187 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2067604306] [2020-09-04 22:00:10,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:10,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:10,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198411109] [2020-09-04 22:00:10,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:10,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:10,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:10,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:10,190 INFO L87 Difference]: Start difference. First operand 375 states and 498 transitions. Second operand 3 states. [2020-09-04 22:00:10,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:10,240 INFO L93 Difference]: Finished difference Result 459 states and 612 transitions. [2020-09-04 22:00:10,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:10,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2020-09-04 22:00:10,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:10,244 INFO L225 Difference]: With dead ends: 459 [2020-09-04 22:00:10,244 INFO L226 Difference]: Without dead ends: 457 [2020-09-04 22:00:10,245 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-09-04 22:00:10,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2020-09-04 22:00:10,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 375. [2020-09-04 22:00:10,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-09-04 22:00:10,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 494 transitions. [2020-09-04 22:00:10,280 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 494 transitions. Word has length 58 [2020-09-04 22:00:10,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:10,280 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 494 transitions. [2020-09-04 22:00:10,280 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:10,280 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 494 transitions. [2020-09-04 22:00:10,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-09-04 22:00:10,282 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:10,282 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, 1, 1, 1] [2020-09-04 22:00:10,283 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 22:00:10,283 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:10,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:10,283 INFO L82 PathProgramCache]: Analyzing trace with hash 92380246, now seen corresponding path program 1 times [2020-09-04 22:00:10,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:10,284 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [130921799] [2020-09-04 22:00:10,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:10,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:10,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:10,335 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [130921799] [2020-09-04 22:00:10,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:10,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:10,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847440145] [2020-09-04 22:00:10,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:10,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:10,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:10,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:10,337 INFO L87 Difference]: Start difference. First operand 375 states and 494 transitions. Second operand 3 states. [2020-09-04 22:00:10,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:10,419 INFO L93 Difference]: Finished difference Result 1035 states and 1384 transitions. [2020-09-04 22:00:10,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:10,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2020-09-04 22:00:10,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:10,424 INFO L225 Difference]: With dead ends: 1035 [2020-09-04 22:00:10,425 INFO L226 Difference]: Without dead ends: 693 [2020-09-04 22:00:10,427 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-09-04 22:00:10,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2020-09-04 22:00:10,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 691. [2020-09-04 22:00:10,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2020-09-04 22:00:10,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 906 transitions. [2020-09-04 22:00:10,488 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 906 transitions. Word has length 58 [2020-09-04 22:00:10,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:10,488 INFO L479 AbstractCegarLoop]: Abstraction has 691 states and 906 transitions. [2020-09-04 22:00:10,489 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:10,489 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 906 transitions. [2020-09-04 22:00:10,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-09-04 22:00:10,491 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:10,492 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, 1, 1, 1, 1] [2020-09-04 22:00:10,492 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 22:00:10,492 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:10,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:10,493 INFO L82 PathProgramCache]: Analyzing trace with hash -529027402, now seen corresponding path program 1 times [2020-09-04 22:00:10,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:10,495 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2003964977] [2020-09-04 22:00:10,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:10,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:10,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:10,590 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2003964977] [2020-09-04 22:00:10,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:10,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:10,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720300469] [2020-09-04 22:00:10,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:10,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:10,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:10,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:10,593 INFO L87 Difference]: Start difference. First operand 691 states and 906 transitions. Second operand 3 states. [2020-09-04 22:00:10,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:10,681 INFO L93 Difference]: Finished difference Result 839 states and 1100 transitions. [2020-09-04 22:00:10,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:10,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-09-04 22:00:10,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:10,687 INFO L225 Difference]: With dead ends: 839 [2020-09-04 22:00:10,687 INFO L226 Difference]: Without dead ends: 837 [2020-09-04 22:00:10,688 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-09-04 22:00:10,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2020-09-04 22:00:10,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 691. [2020-09-04 22:00:10,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2020-09-04 22:00:10,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 898 transitions. [2020-09-04 22:00:10,746 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 898 transitions. Word has length 59 [2020-09-04 22:00:10,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:10,747 INFO L479 AbstractCegarLoop]: Abstraction has 691 states and 898 transitions. [2020-09-04 22:00:10,747 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:10,747 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 898 transitions. [2020-09-04 22:00:10,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-09-04 22:00:10,748 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:10,749 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, 1, 1, 1, 1] [2020-09-04 22:00:10,749 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 22:00:10,749 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:10,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:10,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1430933584, now seen corresponding path program 1 times [2020-09-04 22:00:10,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:10,750 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [199974996] [2020-09-04 22:00:10,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:10,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:10,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:10,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:10,787 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [199974996] [2020-09-04 22:00:10,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:10,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:10,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75956963] [2020-09-04 22:00:10,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:10,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:10,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:10,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:10,790 INFO L87 Difference]: Start difference. First operand 691 states and 898 transitions. Second operand 3 states. [2020-09-04 22:00:10,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:10,907 INFO L93 Difference]: Finished difference Result 1959 states and 2564 transitions. [2020-09-04 22:00:10,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:10,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-09-04 22:00:10,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:10,916 INFO L225 Difference]: With dead ends: 1959 [2020-09-04 22:00:10,916 INFO L226 Difference]: Without dead ends: 1301 [2020-09-04 22:00:10,919 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-09-04 22:00:10,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2020-09-04 22:00:11,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1299. [2020-09-04 22:00:11,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1299 states. [2020-09-04 22:00:11,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1666 transitions. [2020-09-04 22:00:11,026 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1666 transitions. Word has length 59 [2020-09-04 22:00:11,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:11,026 INFO L479 AbstractCegarLoop]: Abstraction has 1299 states and 1666 transitions. [2020-09-04 22:00:11,026 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:11,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1666 transitions. [2020-09-04 22:00:11,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-09-04 22:00:11,028 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:11,028 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, 1, 1, 1, 1, 1] [2020-09-04 22:00:11,029 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 22:00:11,029 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:11,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:11,029 INFO L82 PathProgramCache]: Analyzing trace with hash -631232587, now seen corresponding path program 1 times [2020-09-04 22:00:11,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:11,030 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [306590896] [2020-09-04 22:00:11,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:11,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:11,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:11,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:11,063 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [306590896] [2020-09-04 22:00:11,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:11,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:11,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296960396] [2020-09-04 22:00:11,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:11,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:11,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:11,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:11,066 INFO L87 Difference]: Start difference. First operand 1299 states and 1666 transitions. Second operand 3 states. [2020-09-04 22:00:11,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:11,209 INFO L93 Difference]: Finished difference Result 1559 states and 1988 transitions. [2020-09-04 22:00:11,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:11,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-09-04 22:00:11,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:11,219 INFO L225 Difference]: With dead ends: 1559 [2020-09-04 22:00:11,220 INFO L226 Difference]: Without dead ends: 1557 [2020-09-04 22:00:11,221 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-09-04 22:00:11,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2020-09-04 22:00:11,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1299. [2020-09-04 22:00:11,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1299 states. [2020-09-04 22:00:11,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1650 transitions. [2020-09-04 22:00:11,343 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1650 transitions. Word has length 60 [2020-09-04 22:00:11,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:11,344 INFO L479 AbstractCegarLoop]: Abstraction has 1299 states and 1650 transitions. [2020-09-04 22:00:11,344 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:11,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1650 transitions. [2020-09-04 22:00:11,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-09-04 22:00:11,347 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:11,347 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, 1, 1, 1, 1, 1] [2020-09-04 22:00:11,347 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 22:00:11,347 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:11,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:11,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1409021686, now seen corresponding path program 1 times [2020-09-04 22:00:11,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:11,349 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1955532789] [2020-09-04 22:00:11,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:11,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:11,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:11,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:11,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:11,382 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1955532789] [2020-09-04 22:00:11,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:11,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:11,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913417071] [2020-09-04 22:00:11,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:11,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:11,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:11,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:11,384 INFO L87 Difference]: Start difference. First operand 1299 states and 1650 transitions. Second operand 3 states. [2020-09-04 22:00:11,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:11,595 INFO L93 Difference]: Finished difference Result 3735 states and 4756 transitions. [2020-09-04 22:00:11,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:11,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-09-04 22:00:11,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:11,610 INFO L225 Difference]: With dead ends: 3735 [2020-09-04 22:00:11,611 INFO L226 Difference]: Without dead ends: 2469 [2020-09-04 22:00:11,616 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-09-04 22:00:11,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2469 states. [2020-09-04 22:00:11,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2469 to 2467. [2020-09-04 22:00:11,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2467 states. [2020-09-04 22:00:11,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 3074 transitions. [2020-09-04 22:00:11,843 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 3074 transitions. Word has length 60 [2020-09-04 22:00:11,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:11,844 INFO L479 AbstractCegarLoop]: Abstraction has 2467 states and 3074 transitions. [2020-09-04 22:00:11,844 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:11,844 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 3074 transitions. [2020-09-04 22:00:11,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-09-04 22:00:11,847 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:11,847 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, 1, 1, 1, 1, 1, 1] [2020-09-04 22:00:11,847 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 22:00:11,848 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:11,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:11,848 INFO L82 PathProgramCache]: Analyzing trace with hash -729752476, now seen corresponding path program 1 times [2020-09-04 22:00:11,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:11,849 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1201040216] [2020-09-04 22:00:11,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:11,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:11,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:11,895 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1201040216] [2020-09-04 22:00:11,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:11,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:11,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680651200] [2020-09-04 22:00:11,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:11,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:11,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:11,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:11,898 INFO L87 Difference]: Start difference. First operand 2467 states and 3074 transitions. Second operand 3 states. [2020-09-04 22:00:12,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:12,313 INFO L93 Difference]: Finished difference Result 7143 states and 8900 transitions. [2020-09-04 22:00:12,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:12,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-09-04 22:00:12,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:12,334 INFO L225 Difference]: With dead ends: 7143 [2020-09-04 22:00:12,335 INFO L226 Difference]: Without dead ends: 3637 [2020-09-04 22:00:12,343 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-09-04 22:00:12,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3637 states. [2020-09-04 22:00:12,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3637 to 3635. [2020-09-04 22:00:12,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3635 states. [2020-09-04 22:00:12,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3635 states to 3635 states and 4370 transitions. [2020-09-04 22:00:12,683 INFO L78 Accepts]: Start accepts. Automaton has 3635 states and 4370 transitions. Word has length 61 [2020-09-04 22:00:12,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:12,684 INFO L479 AbstractCegarLoop]: Abstraction has 3635 states and 4370 transitions. [2020-09-04 22:00:12,684 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:12,684 INFO L276 IsEmpty]: Start isEmpty. Operand 3635 states and 4370 transitions. [2020-09-04 22:00:12,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-09-04 22:00:12,689 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:12,689 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, 1, 1, 1, 1, 1, 1] [2020-09-04 22:00:12,690 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 22:00:12,690 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:12,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:12,691 INFO L82 PathProgramCache]: Analyzing trace with hash 495374346, now seen corresponding path program 1 times [2020-09-04 22:00:12,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:12,692 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [604879770] [2020-09-04 22:00:12,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:12,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:12,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:12,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:12,730 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [604879770] [2020-09-04 22:00:12,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:12,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:12,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112352420] [2020-09-04 22:00:12,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:12,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:12,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:12,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:12,732 INFO L87 Difference]: Start difference. First operand 3635 states and 4370 transitions. Second operand 3 states. [2020-09-04 22:00:13,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:13,074 INFO L93 Difference]: Finished difference Result 4087 states and 4852 transitions. [2020-09-04 22:00:13,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:13,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-09-04 22:00:13,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:13,090 INFO L225 Difference]: With dead ends: 4087 [2020-09-04 22:00:13,091 INFO L226 Difference]: Without dead ends: 2917 [2020-09-04 22:00:13,096 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-09-04 22:00:13,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2020-09-04 22:00:13,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 2467. [2020-09-04 22:00:13,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2467 states. [2020-09-04 22:00:13,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 2914 transitions. [2020-09-04 22:00:13,285 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 2914 transitions. Word has length 61 [2020-09-04 22:00:13,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:13,286 INFO L479 AbstractCegarLoop]: Abstraction has 2467 states and 2914 transitions. [2020-09-04 22:00:13,286 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:13,286 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 2914 transitions. [2020-09-04 22:00:13,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-09-04 22:00:13,289 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:13,290 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, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:00:13,290 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 22:00:13,290 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:13,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:13,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1060451273, now seen corresponding path program 1 times [2020-09-04 22:00:13,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:13,291 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1670354871] [2020-09-04 22:00:13,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:13,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:13,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:13,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:13,329 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1670354871] [2020-09-04 22:00:13,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:13,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:13,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262505801] [2020-09-04 22:00:13,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:13,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:13,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:13,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:13,332 INFO L87 Difference]: Start difference. First operand 2467 states and 2914 transitions. Second operand 3 states. [2020-09-04 22:00:13,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:13,475 INFO L93 Difference]: Finished difference Result 2467 states and 2914 transitions. [2020-09-04 22:00:13,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:13,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-09-04 22:00:13,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:13,476 INFO L225 Difference]: With dead ends: 2467 [2020-09-04 22:00:13,476 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 22:00:13,484 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-09-04 22:00:13,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 22:00:13,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 22:00:13,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 22:00:13,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 22:00:13,486 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2020-09-04 22:00:13,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:13,486 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 22:00:13,486 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:13,486 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 22:00:13,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 22:00:13,487 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 22:00:13,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 22:00:13,865 WARN L193 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-09-04 22:00:14,089 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 57 [2020-09-04 22:00:14,203 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 25 [2020-09-04 22:00:14,534 WARN L193 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 35 [2020-09-04 22:00:14,646 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 17 [2020-09-04 22:00:14,875 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 275 DAG size of output: 3 [2020-09-04 22:00:14,981 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 7 [2020-09-04 22:00:15,245 WARN L193 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 340 DAG size of output: 7 [2020-09-04 22:00:15,352 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 15 [2020-09-04 22:00:15,537 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 57 [2020-09-04 22:00:15,663 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 23 [2020-09-04 22:00:16,146 WARN L193 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 91 [2020-09-04 22:00:16,274 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 37 [2020-09-04 22:00:16,383 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 17 [2020-09-04 22:00:16,533 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 35 [2020-09-04 22:00:16,713 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 23 [2020-09-04 22:00:16,864 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 11 [2020-09-04 22:00:17,103 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 55 [2020-09-04 22:00:17,523 WARN L193 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 91 [2020-09-04 22:00:17,864 WARN L193 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-09-04 22:00:18,699 WARN L193 SmtUtils]: Spent 741.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2020-09-04 22:00:18,912 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 55 [2020-09-04 22:00:19,171 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 11 [2020-09-04 22:00:19,372 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 15 [2020-09-04 22:00:19,589 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 275 DAG size of output: 3 [2020-09-04 22:00:19,724 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 55 [2020-09-04 22:00:20,021 WARN L193 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-09-04 22:00:21,235 WARN L193 SmtUtils]: Spent 1.20 s on a formula simplification that was a NOOP. DAG size: 91 [2020-09-04 22:00:21,710 WARN L193 SmtUtils]: Spent 472.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-09-04 22:00:21,953 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-09-04 22:00:22,503 WARN L193 SmtUtils]: Spent 463.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-09-04 22:00:23,684 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification that was a NOOP. DAG size: 91 [2020-09-04 22:00:23,878 WARN L193 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-09-04 22:00:24,073 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-09-04 22:00:24,565 WARN L193 SmtUtils]: Spent 396.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-09-04 22:00:25,645 WARN L193 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 91 [2020-09-04 22:00:26,915 WARN L193 SmtUtils]: Spent 1.24 s on a formula simplification that was a NOOP. DAG size: 93 [2020-09-04 22:00:27,101 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-09-04 22:00:30,193 WARN L193 SmtUtils]: Spent 3.08 s on a formula simplification that was a NOOP. DAG size: 159 [2020-09-04 22:00:30,586 WARN L193 SmtUtils]: Spent 391.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-09-04 22:00:30,920 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-09-04 22:00:31,325 WARN L193 SmtUtils]: Spent 396.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-09-04 22:00:32,571 WARN L193 SmtUtils]: Spent 1.24 s on a formula simplification that was a NOOP. DAG size: 93 [2020-09-04 22:00:32,581 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 22:00:32,581 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 22:00:32,582 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 22:00:32,582 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 22:00:32,582 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 22:00:32,583 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 22:00:32,583 INFO L264 CegarLoopResult]: At program point L93(line 93) the Hoare annotation is: (let ((.cse5 (= main_~p7~0 0)) (.cse8 (= main_~lk6~0 1)) (.cse7 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse2 (= main_~p6~0 0)) (.cse6 (= main_~p5~0 0)) (.cse4 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse5 .cse3) (and .cse1 .cse2 .cse6 .cse7 .cse4) (and .cse1 .cse2 .cse7 .cse3 .cse4) (and .cse1 .cse8 .cse7 .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse7 .cse3) (and .cse0 .cse1 .cse6 .cse5 .cse8) (and .cse1 .cse2 .cse6 .cse5 .cse7) (and .cse0 .cse1 .cse5 .cse8 .cse3) (and .cse0 .cse1 .cse6 .cse8 .cse4) (and .cse0 .cse1 .cse2 .cse6 .cse5) (and .cse0 .cse1 .cse8 .cse3 .cse4) (and .cse1 .cse6 .cse8 .cse7 .cse4) (and .cse1 .cse6 .cse5 .cse8 .cse7) (and .cse1 .cse5 .cse8 .cse7 .cse3) (and .cse0 .cse1 .cse2 .cse6 .cse4))) [2020-09-04 22:00:32,584 INFO L264 CegarLoopResult]: At program point L60(line 60) 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-09-04 22:00:32,584 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 4 121) the Hoare annotation is: true [2020-09-04 22:00:32,584 INFO L271 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: true [2020-09-04 22:00:32,584 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-09-04 22:00:32,585 INFO L264 CegarLoopResult]: At program point L102(line 102) the Hoare annotation is: (let ((.cse0 (= main_~p6~0 0)) (.cse4 (= main_~lk7~0 1)) (.cse1 (= main_~p7~0 0)) (.cse3 (= main_~lk6~0 1)) (.cse2 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse2 .cse4) (and .cse0 .cse2 .cse4) (and .cse1 .cse3 .cse2))) [2020-09-04 22:00:32,585 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-09-04 22:00:32,586 INFO L264 CegarLoopResult]: At program point L86-1(lines 30 116) the Hoare annotation is: (let ((.cse7 (= main_~lk6~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse9 (= main_~p5~0 0)) (.cse4 (= main_~lk7~0 1)) (.cse2 (= main_~p6~0 0)) (.cse6 (= main_~p3~0 0)) (.cse5 (= main_~p7~0 0)) (.cse8 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse5 .cse3) (and .cse6 .cse5 .cse7 .cse8 .cse3) (and .cse2 .cse6 .cse9 .cse8 .cse4) (and .cse1 .cse2 .cse9 .cse5 .cse8) (and .cse6 .cse9 .cse5 .cse7 .cse8) (and .cse0 .cse1 .cse5 .cse7 .cse3) (and .cse0 .cse1 .cse9 .cse7 .cse4) (and .cse0 .cse2 .cse6 .cse9 .cse5) (and .cse0 .cse2 .cse6 .cse9 .cse4) (and .cse0 .cse6 .cse9 .cse7 .cse4) (and .cse0 .cse2 .cse6 .cse5 .cse3) (and .cse1 .cse9 .cse7 .cse8 .cse4) (and .cse0 .cse2 .cse6 .cse3 .cse4) (and .cse1 .cse2 .cse9 .cse8 .cse4) (and .cse6 .cse7 .cse8 .cse3 .cse4) (and .cse1 .cse2 .cse8 .cse3 .cse4) (and .cse1 .cse7 .cse8 .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse8 .cse3) (and .cse2 .cse6 .cse9 .cse5 .cse8) (and .cse0 .cse1 .cse9 .cse5 .cse7) (and .cse6 .cse9 .cse7 .cse8 .cse4) (and .cse0 .cse6 .cse5 .cse7 .cse3) (and .cse0 .cse6 .cse9 .cse5 .cse7) (and .cse2 .cse6 .cse8 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse9 .cse5) (and .cse0 .cse1 .cse7 .cse3 .cse4) (and .cse1 .cse9 .cse5 .cse7 .cse8) (and .cse0 .cse6 .cse7 .cse3 .cse4) (and .cse1 .cse5 .cse7 .cse8 .cse3) (and .cse0 .cse1 .cse2 .cse9 .cse4) (and .cse2 .cse6 .cse5 .cse8 .cse3))) [2020-09-04 22:00:32,586 INFO L271 CegarLoopResult]: At program point L111-1(lines 30 116) the Hoare annotation is: true [2020-09-04 22:00:32,586 INFO L271 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: true [2020-09-04 22:00:32,586 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-09-04 22:00:32,587 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-09-04 22:00:32,587 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-09-04 22:00:32,587 INFO L264 CegarLoopResult]: At program point L103(line 103) the Hoare annotation is: (let ((.cse0 (= main_~p6~0 0)) (.cse4 (= main_~lk7~0 1)) (.cse1 (= main_~p7~0 0)) (.cse3 (= main_~lk6~0 1)) (.cse2 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse2 .cse4) (and .cse0 .cse2 .cse4) (and .cse1 .cse3 .cse2))) [2020-09-04 22:00:32,587 INFO L271 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: true [2020-09-04 22:00:32,587 INFO L264 CegarLoopResult]: At program point L120(line 120) the Hoare annotation is: false [2020-09-04 22:00:32,588 INFO L264 CegarLoopResult]: At program point L87(line 87) the Hoare annotation is: (let ((.cse8 (= main_~lk4~0 1)) (.cse1 (= main_~p3~0 0)) (.cse0 (= main_~p6~0 0)) (.cse3 (= main_~p7~0 0)) (.cse5 (= main_~lk5~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse9 (= main_~p5~0 0)) (.cse2 (= main_~lk2~0 1)) (.cse7 (= main_~lk6~0 1)) (.cse4 (= main_~p4~0 0)) (.cse10 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse3 .cse7) (and .cse8 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse6 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse2 .cse5 .cse10) (and .cse8 .cse6 .cse2 .cse3 .cse7 .cse5) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse7 .cse10) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse1 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse8 .cse6 .cse0 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4) (and .cse8 .cse1 .cse9 .cse2 .cse3 .cse7) (and .cse6 .cse0 .cse9 .cse2 .cse4 .cse10) (and .cse8 .cse1 .cse9 .cse2 .cse7 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse3) (and .cse6 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse8 .cse6 .cse0 .cse2 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse10) (and .cse1 .cse9 .cse2 .cse7 .cse4 .cse10) (and .cse6 .cse0 .cse2 .cse4 .cse5 .cse10) (and .cse8 .cse1 .cse2 .cse7 .cse5 .cse10) (and .cse6 .cse0 .cse9 .cse2 .cse3 .cse4) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse3) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10) (and .cse8 .cse6 .cse2 .cse7 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse10) (and .cse1 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse6 .cse0 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse9 .cse2 .cse7 .cse4 .cse10))) [2020-09-04 22:00:32,588 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-09-04 22:00:32,588 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-09-04 22:00:32,588 INFO L271 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: true [2020-09-04 22:00:32,588 INFO L264 CegarLoopResult]: At program point L112(line 112) the Hoare annotation is: (= main_~lk7~0 1) [2020-09-04 22:00:32,588 INFO L264 CegarLoopResult]: At program point L112-1(lines 5 121) the Hoare annotation is: false [2020-09-04 22:00:32,589 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-09-04 22:00:32,589 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 4 121) the Hoare annotation is: true [2020-09-04 22:00:32,589 INFO L264 CegarLoopResult]: At program point L71-1(lines 30 116) the Hoare annotation is: (let ((.cse6 (= main_~lk6~0 1)) (.cse11 (= 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)) (.cse10 (= 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 .cse8 .cse1 .cse10 .cse7 .cse11 .cse3) (and .cse0 .cse8 .cse1 .cse9 .cse11 .cse4) (and .cse0 .cse8 .cse9 .cse6 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse6 .cse11 .cse3 .cse4) (and .cse0 .cse2 .cse9 .cse6 .cse11 .cse4) (and .cse0 .cse8 .cse9 .cse6 .cse11 .cse4) (and .cse0 .cse8 .cse10 .cse6 .cse3 .cse5) (and .cse8 .cse9 .cse10 .cse6 .cse7 .cse11) (and .cse0 .cse2 .cse6 .cse11 .cse3 .cse4) (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 .cse11) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse10 .cse11) (and .cse8 .cse1 .cse10 .cse7 .cse3 .cse5) (and .cse2 .cse9 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse9 .cse10 .cse6 .cse5) (and .cse0 .cse8 .cse10 .cse6 .cse11 .cse3) (and .cse2 .cse6 .cse7 .cse11 .cse3 .cse4) (and .cse8 .cse10 .cse6 .cse7 .cse11 .cse3) (and .cse0 .cse2 .cse10 .cse6 .cse11 .cse3) (and .cse8 .cse9 .cse6 .cse7 .cse11 .cse4) (and .cse8 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse7 .cse4 .cse5) (and .cse2 .cse9 .cse6 .cse7 .cse11 .cse4) (and .cse8 .cse1 .cse9 .cse7 .cse11 .cse4) (and .cse0 .cse8 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse10 .cse5) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse3) (and .cse0 .cse2 .cse10 .cse6 .cse3 .cse5) (and .cse8 .cse1 .cse9 .cse7 .cse4 .cse5) (and .cse8 .cse6 .cse7 .cse11 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse9 .cse10 .cse5) (and .cse0 .cse2 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse10 .cse11 .cse3) (and .cse8 .cse10 .cse6 .cse7 .cse3 .cse5) (and .cse1 .cse2 .cse10 .cse7 .cse11 .cse3) (and .cse0 .cse2 .cse9 .cse10 .cse6 .cse11) (and .cse1 .cse2 .cse10 .cse7 .cse3 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse11 .cse4) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse9 .cse10 .cse6 .cse11) (and .cse8 .cse1 .cse9 .cse10 .cse7 .cse11) (and .cse0 .cse2 .cse9 .cse10 .cse6 .cse5) (and .cse2 .cse9 .cse10 .cse6 .cse7 .cse5) (and .cse2 .cse10 .cse6 .cse7 .cse3 .cse5) (and .cse8 .cse1 .cse7 .cse11 .cse3 .cse4) (and .cse2 .cse10 .cse6 .cse7 .cse11 .cse3) (and .cse0 .cse8 .cse1 .cse11 .cse3 .cse4) (and .cse0 .cse2 .cse9 .cse6 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse10 .cse7 .cse11) (and .cse1 .cse2 .cse9 .cse7 .cse11 .cse4) (and .cse1 .cse2 .cse7 .cse11 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse4) (and .cse0 .cse8 .cse1 .cse9 .cse10 .cse11) (and .cse8 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse10 .cse7 .cse5))) [2020-09-04 22:00:32,589 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 119) the Hoare annotation is: false [2020-09-04 22:00:32,590 INFO L264 CegarLoopResult]: At program point L96-1(lines 30 116) the Hoare annotation is: (let ((.cse2 (= main_~lk5~0 1)) (.cse0 (= main_~p6~0 0)) (.cse5 (= main_~lk7~0 1)) (.cse3 (= main_~p5~0 0)) (.cse1 (= main_~p7~0 0)) (.cse4 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse0 .cse3 .cse1) (and .cse0 .cse2 .cse5) (and .cse4 .cse2 .cse5) (and .cse1 .cse4 .cse2) (and .cse0 .cse3 .cse5) (and .cse3 .cse1 .cse4))) [2020-09-04 22:00:32,590 INFO L264 CegarLoopResult]: At program point L63-1(lines 30 116) 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 .cse5 .cse2 .cse6 .cse7) (and .cse0 .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-09-04 22:00:32,590 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 121) the Hoare annotation is: true [2020-09-04 22:00:32,591 INFO L264 CegarLoopResult]: At program point L88(line 88) the Hoare annotation is: (let ((.cse8 (= main_~lk4~0 1)) (.cse1 (= main_~p3~0 0)) (.cse0 (= main_~p6~0 0)) (.cse3 (= main_~p7~0 0)) (.cse5 (= main_~lk5~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse9 (= main_~p5~0 0)) (.cse2 (= main_~lk2~0 1)) (.cse7 (= main_~lk6~0 1)) (.cse4 (= main_~p4~0 0)) (.cse10 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse3 .cse7) (and .cse8 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse6 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse2 .cse5 .cse10) (and .cse8 .cse6 .cse2 .cse3 .cse7 .cse5) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse5) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse7 .cse10) (and .cse1 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse8 .cse6 .cse0 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4) (and .cse8 .cse1 .cse9 .cse2 .cse3 .cse7) (and .cse6 .cse0 .cse9 .cse2 .cse4 .cse10) (and .cse8 .cse1 .cse9 .cse2 .cse7 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse3) (and .cse6 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse8 .cse6 .cse0 .cse2 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse10) (and .cse1 .cse9 .cse2 .cse7 .cse4 .cse10) (and .cse6 .cse0 .cse2 .cse4 .cse5 .cse10) (and .cse6 .cse0 .cse9 .cse2 .cse3 .cse4) (and .cse8 .cse1 .cse2 .cse7 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse3) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10) (and .cse8 .cse6 .cse2 .cse7 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse10) (and .cse1 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse6 .cse0 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse9 .cse2 .cse7 .cse4 .cse10))) [2020-09-04 22:00:32,591 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-09-04 22:00:32,591 INFO L264 CegarLoopResult]: At program point L55-1(lines 30 116) 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-09-04 22:00:32,591 INFO L264 CegarLoopResult]: At program point L113(line 113) the Hoare annotation is: (= main_~lk7~0 1) [2020-09-04 22:00:32,591 INFO L271 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: true [2020-09-04 22:00:32,592 INFO L264 CegarLoopResult]: At program point L72(line 72) 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 .cse2 .cse6 .cse4) (and .cse8 .cse5 .cse1 .cse2 .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 .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse7 .cse0 .cse9 .cse3 .cse6) (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 .cse8 .cse1 .cse2 .cse9 .cse3) (and .cse0 .cse2 .cse9 .cse3 .cse6) (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-09-04 22:00:32,592 INFO L271 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: true [2020-09-04 22:00:32,592 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-09-04 22:00:32,592 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-09-04 22:00:32,592 INFO L264 CegarLoopResult]: At program point L97(line 97) the Hoare annotation is: (let ((.cse2 (= main_~p5~0 0)) (.cse3 (= main_~p7~0 0)) (.cse1 (= main_~p6~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse4 (= main_~lk6~0 1)) (.cse6 (= main_~lk5~0 1)) (.cse5 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse5) (and .cse0 .cse2 .cse4 .cse5) (and .cse0 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse3 .cse6) (and .cse0 .cse1 .cse6 .cse5) (and .cse0 .cse4 .cse6 .cse5))) [2020-09-04 22:00:32,592 INFO L264 CegarLoopResult]: At program point L64(line 64) 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-09-04 22:00:32,593 INFO L271 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-09-04 22:00:32,593 INFO L271 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: true [2020-09-04 22:00:32,593 INFO L271 CegarLoopResult]: At program point L31-2(line 31) the Hoare annotation is: true [2020-09-04 22:00:32,593 INFO L264 CegarLoopResult]: At program point L56(line 56) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-09-04 22:00:32,593 INFO L264 CegarLoopResult]: At program point L81-1(lines 30 116) the Hoare annotation is: (let ((.cse5 (= main_~lk5~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse7 (= main_~p3~0 0)) (.cse6 (= main_~p6~0 0)) (.cse2 (= main_~p7~0 0)) (.cse11 (= main_~p2~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse9 (= main_~p5~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse3 (= main_~lk6~0 1)) (.cse4 (= main_~p4~0 0)) (.cse10 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse1 .cse2 .cse4 .cse5) (and .cse8 .cse0 .cse9 .cse1 .cse2 .cse3) (and .cse8 .cse7 .cse1 .cse2 .cse3 .cse5) (and .cse8 .cse0 .cse9 .cse1 .cse3 .cse10) (and .cse7 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse7 .cse9 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse4 .cse5 .cse11 .cse10) (and .cse7 .cse3 .cse4 .cse5 .cse11 .cse10) (and .cse8 .cse7 .cse9 .cse2 .cse3 .cse11) (and .cse8 .cse6 .cse7 .cse9 .cse1 .cse2) (and .cse8 .cse0 .cse6 .cse2 .cse5 .cse11) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4) (and .cse8 .cse0 .cse6 .cse1 .cse5 .cse10) (and .cse8 .cse0 .cse6 .cse9 .cse11 .cse10) (and .cse8 .cse6 .cse7 .cse9 .cse11 .cse10) (and .cse7 .cse2 .cse3 .cse4 .cse5 .cse11) (and .cse0 .cse6 .cse1 .cse4 .cse5 .cse10) (and .cse8 .cse0 .cse6 .cse5 .cse11 .cse10) (and .cse8 .cse6 .cse7 .cse2 .cse5 .cse11) (and .cse8 .cse0 .cse2 .cse3 .cse5 .cse11) (and .cse6 .cse7 .cse9 .cse1 .cse4 .cse10) (and .cse6 .cse7 .cse1 .cse4 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse3 .cse5 .cse10) (and .cse8 .cse6 .cse7 .cse9 .cse1 .cse10) (and .cse8 .cse0 .cse3 .cse5 .cse11 .cse10) (and .cse7 .cse9 .cse2 .cse3 .cse4 .cse11) (and .cse7 .cse1 .cse3 .cse4 .cse5 .cse10) (and .cse8 .cse6 .cse7 .cse5 .cse11 .cse10) (and .cse0 .cse6 .cse1 .cse2 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse4 .cse5 .cse11) (and .cse0 .cse9 .cse2 .cse3 .cse4 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse10) (and .cse8 .cse6 .cse7 .cse1 .cse5 .cse10) (and .cse0 .cse9 .cse3 .cse4 .cse11 .cse10) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse5) (and .cse8 .cse6 .cse7 .cse1 .cse2 .cse5) (and .cse6 .cse7 .cse2 .cse4 .cse5 .cse11) (and .cse8 .cse0 .cse9 .cse2 .cse3 .cse11) (and .cse8 .cse0 .cse6 .cse1 .cse2 .cse5) (and .cse8 .cse7 .cse2 .cse3 .cse5 .cse11) (and .cse6 .cse7 .cse9 .cse1 .cse2 .cse4) (and .cse8 .cse0 .cse9 .cse3 .cse11 .cse10) (and .cse0 .cse6 .cse9 .cse1 .cse4 .cse10) (and .cse8 .cse7 .cse9 .cse1 .cse2 .cse3) (and .cse8 .cse7 .cse9 .cse1 .cse3 .cse10) (and .cse8 .cse0 .cse6 .cse9 .cse2 .cse11) (and .cse6 .cse7 .cse9 .cse4 .cse11 .cse10) (and .cse0 .cse6 .cse4 .cse5 .cse11 .cse10) (and .cse8 .cse6 .cse7 .cse9 .cse2 .cse11) (and .cse8 .cse0 .cse6 .cse9 .cse1 .cse10) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse11) (and .cse0 .cse6 .cse9 .cse4 .cse11 .cse10) (and .cse7 .cse9 .cse1 .cse3 .cse4 .cse10) (and .cse7 .cse9 .cse3 .cse4 .cse11 .cse10) (and .cse0 .cse3 .cse4 .cse5 .cse11 .cse10) (and .cse8 .cse7 .cse1 .cse3 .cse5 .cse10) (and .cse0 .cse6 .cse9 .cse1 .cse2 .cse4) (and .cse8 .cse0 .cse6 .cse9 .cse1 .cse2) (and .cse8 .cse7 .cse3 .cse5 .cse11 .cse10) (and .cse8 .cse7 .cse9 .cse3 .cse11 .cse10) (and .cse6 .cse7 .cse9 .cse2 .cse4 .cse11) (and .cse0 .cse6 .cse9 .cse2 .cse4 .cse11) (and .cse0 .cse9 .cse1 .cse3 .cse4 .cse10))) [2020-09-04 22:00:32,594 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-09-04 22:00:32,594 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-09-04 22:00:32,594 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-09-04 22:00:32,594 INFO L264 CegarLoopResult]: At program point L106-1(lines 30 116) the Hoare annotation is: (or (= main_~p7~0 0) (= main_~lk7~0 1)) [2020-09-04 22:00:32,594 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-09-04 22:00:32,594 INFO L264 CegarLoopResult]: At program point L98(line 98) the Hoare annotation is: (let ((.cse2 (= main_~p5~0 0)) (.cse3 (= main_~p7~0 0)) (.cse1 (= main_~p6~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse5 (= main_~lk6~0 1)) (.cse6 (= main_~lk5~0 1)) (.cse4 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse4) (and .cse0 .cse2 .cse3 .cse5) (and .cse0 .cse2 .cse5 .cse4) (and .cse0 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse6) (and .cse0 .cse1 .cse6 .cse4) (and .cse0 .cse5 .cse6 .cse4))) [2020-09-04 22:00:32,594 INFO L271 CegarLoopResult]: At program point L32(lines 32 34) the Hoare annotation is: true [2020-09-04 22:00:32,594 INFO L271 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-09-04 22:00:32,595 INFO L271 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: true [2020-09-04 22:00:32,595 INFO L271 CegarLoopResult]: At program point L24-2(line 24) the Hoare annotation is: true [2020-09-04 22:00:32,595 INFO L264 CegarLoopResult]: At program point L82(line 82) the Hoare annotation is: (let ((.cse7 (= main_~lk4~0 1)) (.cse12 (= main_~p2~0 0)) (.cse1 (= main_~p6~0 0)) (.cse8 (= main_~p3~0 0)) (.cse2 (= main_~p5~0 0)) (.cse10 (= main_~p7~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse3 (= main_~lk2~0 1)) (.cse11 (= main_~lk6~0 1)) (.cse4 (= main_~p4~0 0)) (.cse9 (= main_~lk5~0 1)) (.cse5 (= main_~lk1~0 1)) (.cse6 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse3 .cse9 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse11 .cse4 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse10 .cse12 .cse5) (and .cse8 .cse2 .cse3 .cse11 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse5 .cse6) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse11 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse11 .cse4 .cse5 .cse6) (and .cse1 .cse8 .cse2 .cse4 .cse12 .cse5 .cse6) (and .cse8 .cse3 .cse10 .cse11 .cse4 .cse9 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse10 .cse9 .cse5) (and .cse1 .cse8 .cse2 .cse10 .cse4 .cse12 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse8 .cse10 .cse11 .cse4 .cse9 .cse12 .cse5) (and .cse7 .cse0 .cse2 .cse3 .cse11 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse12 .cse5 .cse6) (and .cse7 .cse8 .cse3 .cse10 .cse11 .cse9 .cse5) (and .cse7 .cse8 .cse3 .cse11 .cse9 .cse5 .cse6) (and .cse7 .cse0 .cse2 .cse10 .cse11 .cse12 .cse5) (and .cse7 .cse0 .cse1 .cse10 .cse9 .cse12 .cse5) (and .cse7 .cse1 .cse8 .cse10 .cse9 .cse12 .cse5) (and .cse8 .cse3 .cse11 .cse4 .cse9 .cse5 .cse6) (and .cse0 .cse10 .cse11 .cse4 .cse9 .cse12 .cse5) (and .cse7 .cse8 .cse2 .cse3 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse2 .cse11 .cse12 .cse5 .cse6) (and .cse7 .cse8 .cse2 .cse3 .cse10 .cse11 .cse5) (and .cse7 .cse0 .cse3 .cse11 .cse9 .cse5 .cse6) (and .cse0 .cse3 .cse10 .cse11 .cse4 .cse9 .cse5) (and .cse0 .cse1 .cse4 .cse9 .cse12 .cse5 .cse6) (and .cse1 .cse8 .cse4 .cse9 .cse12 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse0 .cse11 .cse9 .cse12 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse9 .cse12 .cse5 .cse6) (and .cse8 .cse2 .cse11 .cse4 .cse12 .cse5 .cse6) (and .cse7 .cse8 .cse2 .cse10 .cse11 .cse12 .cse5) (and .cse0 .cse1 .cse10 .cse4 .cse9 .cse12 .cse5) (and .cse7 .cse8 .cse10 .cse11 .cse9 .cse12 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse10 .cse12 .cse5) (and .cse8 .cse2 .cse3 .cse10 .cse11 .cse4 .cse5) (and .cse0 .cse11 .cse4 .cse9 .cse12 .cse5 .cse6) (and .cse8 .cse11 .cse4 .cse9 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse5 .cse6) (and .cse1 .cse8 .cse3 .cse10 .cse4 .cse9 .cse5) (and .cse0 .cse2 .cse11 .cse4 .cse12 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse9 .cse12 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse10 .cse5) (and .cse7 .cse0 .cse3 .cse10 .cse11 .cse9 .cse5) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse12 .cse5) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse9 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse9 .cse5 .cse6) (and .cse8 .cse2 .cse10 .cse11 .cse4 .cse12 .cse5) (and .cse7 .cse0 .cse2 .cse11 .cse12 .cse5 .cse6) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse10 .cse11 .cse9 .cse12 .cse5) (and .cse0 .cse2 .cse10 .cse11 .cse4 .cse12 .cse5) (and .cse7 .cse8 .cse11 .cse9 .cse12 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse3 .cse10 .cse9 .cse5) (and .cse1 .cse8 .cse10 .cse4 .cse9 .cse12 .cse5) (and .cse1 .cse8 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse0 .cse3 .cse11 .cse4 .cse9 .cse5 .cse6))) [2020-09-04 22:00:32,596 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-09-04 22:00:32,596 INFO L264 CegarLoopResult]: At program point L107(line 107) the Hoare annotation is: (let ((.cse0 (= main_~lk6~0 1))) (or (and .cse0 (= main_~lk7~0 1)) (and (= main_~p7~0 0) .cse0))) [2020-09-04 22:00:32,596 INFO L271 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: true [2020-09-04 22:00:32,596 INFO L264 CegarLoopResult]: At program point L91-1(lines 30 116) the Hoare annotation is: (let ((.cse0 (= main_~p5~0 0)) (.cse2 (= main_~p4~0 0)) (.cse1 (= main_~lk6~0 1)) (.cse7 (= main_~p7~0 0)) (.cse5 (= main_~lk4~0 1)) (.cse6 (= main_~p6~0 0)) (.cse4 (= main_~lk5~0 1)) (.cse3 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse4 .cse3) (and .cse5 .cse6 .cse0 .cse7) (and .cse5 .cse0 .cse1 .cse3) (and .cse5 .cse0 .cse7 .cse1) (and .cse5 .cse6 .cse0 .cse3) (and .cse5 .cse1 .cse4 .cse3) (and .cse7 .cse1 .cse2 .cse4) (and .cse6 .cse0 .cse2 .cse3) (and .cse6 .cse7 .cse2 .cse4) (and .cse6 .cse2 .cse4 .cse3) (and .cse6 .cse0 .cse7 .cse2) (and .cse0 .cse7 .cse1 .cse2) (and .cse5 .cse7 .cse1 .cse4) (and .cse5 .cse6 .cse7 .cse4) (and .cse5 .cse6 .cse4 .cse3))) [2020-09-04 22:00:32,597 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-09-04 22:00:32,597 INFO L264 CegarLoopResult]: At program point L83(line 83) the Hoare annotation is: (let ((.cse9 (= main_~lk4~0 1)) (.cse12 (= main_~p2~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse8 (= main_~lk6~0 1)) (.cse11 (= main_~lk5~0 1)) (.cse6 (= main_~lk7~0 1)) (.cse1 (= main_~p6~0 0)) (.cse10 (= main_~p3~0 0)) (.cse2 (= main_~p5~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse7 (= main_~p7~0 0)) (.cse4 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse7 .cse8 .cse4 .cse5) (and .cse9 .cse1 .cse10 .cse3 .cse11 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse2 .cse7 .cse12 .cse5) (and .cse10 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse1 .cse10 .cse3 .cse4 .cse11 .cse5 .cse6) (and .cse9 .cse0 .cse2 .cse3 .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse1 .cse10 .cse2 .cse4 .cse12 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse3 .cse7 .cse11 .cse5) (and .cse10 .cse3 .cse7 .cse8 .cse4 .cse11 .cse5) (and .cse1 .cse10 .cse2 .cse7 .cse4 .cse12 .cse5) (and .cse9 .cse1 .cse10 .cse2 .cse3 .cse5 .cse6) (and .cse10 .cse7 .cse8 .cse4 .cse11 .cse12 .cse5) (and .cse9 .cse0 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse9 .cse10 .cse3 .cse7 .cse8 .cse11 .cse5) (and .cse9 .cse1 .cse10 .cse2 .cse12 .cse5 .cse6) (and .cse9 .cse10 .cse3 .cse8 .cse11 .cse5 .cse6) (and .cse9 .cse0 .cse2 .cse7 .cse8 .cse12 .cse5) (and .cse9 .cse0 .cse1 .cse7 .cse11 .cse12 .cse5) (and .cse9 .cse1 .cse10 .cse7 .cse11 .cse12 .cse5) (and .cse10 .cse3 .cse8 .cse4 .cse11 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse4 .cse11 .cse12 .cse5) (and .cse9 .cse10 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse8 .cse12 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse3 .cse7 .cse8 .cse5) (and .cse9 .cse0 .cse3 .cse8 .cse11 .cse5 .cse6) (and .cse0 .cse3 .cse7 .cse8 .cse4 .cse11 .cse5) (and .cse0 .cse1 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse1 .cse10 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse2 .cse12 .cse5 .cse6) (and .cse9 .cse0 .cse8 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse9 .cse0 .cse1 .cse11 .cse12 .cse5 .cse6) (and .cse10 .cse2 .cse8 .cse4 .cse12 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse7 .cse8 .cse12 .cse5) (and .cse0 .cse1 .cse7 .cse4 .cse11 .cse12 .cse5) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse9 .cse0 .cse1 .cse2 .cse7 .cse12 .cse5) (and .cse9 .cse10 .cse7 .cse8 .cse11 .cse12 .cse5) (and .cse10 .cse2 .cse3 .cse7 .cse8 .cse4 .cse5) (and .cse10 .cse8 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse8 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse11 .cse5 .cse6) (and .cse1 .cse10 .cse3 .cse7 .cse4 .cse11 .cse5) (and .cse0 .cse2 .cse8 .cse4 .cse12 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse11 .cse12 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse2 .cse3 .cse7 .cse5) (and .cse9 .cse0 .cse3 .cse7 .cse8 .cse11 .cse5) (and .cse0 .cse1 .cse2 .cse7 .cse4 .cse12 .cse5) (and .cse0 .cse1 .cse3 .cse7 .cse4 .cse11 .cse5) (and .cse9 .cse0 .cse1 .cse3 .cse11 .cse5 .cse6) (and .cse10 .cse2 .cse7 .cse8 .cse4 .cse12 .cse5) (and .cse9 .cse0 .cse2 .cse8 .cse12 .cse5 .cse6) (and .cse1 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse0 .cse7 .cse8 .cse11 .cse12 .cse5) (and .cse0 .cse2 .cse7 .cse8 .cse4 .cse12 .cse5) (and .cse9 .cse10 .cse8 .cse11 .cse12 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse3 .cse7 .cse11 .cse5) (and .cse1 .cse10 .cse7 .cse4 .cse11 .cse12 .cse5) (and .cse0 .cse3 .cse8 .cse4 .cse11 .cse5 .cse6) (and .cse1 .cse10 .cse2 .cse3 .cse7 .cse4 .cse5))) [2020-09-04 22:00:32,598 INFO L264 CegarLoopResult]: At program point L108(line 108) the Hoare annotation is: (let ((.cse0 (= main_~lk6~0 1))) (or (and .cse0 (= main_~lk7~0 1)) (and (= main_~p7~0 0) .cse0))) [2020-09-04 22:00:32,600 INFO L264 CegarLoopResult]: At program point L75-1(lines 30 116) the Hoare annotation is: (let ((.cse13 (= main_~p1~0 0)) (.cse7 (= main_~lk4~0 1)) (.cse11 (= main_~p2~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse12 (= main_~lk6~0 1)) (.cse9 (= main_~lk5~0 1)) (.cse6 (= main_~lk7~0 1)) (.cse1 (= main_~p6~0 0)) (.cse8 (= main_~p3~0 0)) (.cse2 (= main_~p5~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse10 (= main_~p7~0 0)) (.cse4 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse3 .cse9 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse10 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse5 .cse6) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse12 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse13) (and .cse7 .cse1 .cse8 .cse10 .cse13 .cse9 .cse11) (and .cse8 .cse3 .cse10 .cse12 .cse4 .cse9 .cse5) (and .cse8 .cse2 .cse3 .cse10 .cse12 .cse4 .cse13) (and .cse7 .cse0 .cse2 .cse3 .cse12 .cse5 .cse6) (and .cse7 .cse0 .cse2 .cse10 .cse12 .cse13 .cse11) (and .cse7 .cse8 .cse3 .cse10 .cse12 .cse9 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse13 .cse6) (and .cse0 .cse3 .cse12 .cse4 .cse13 .cse9 .cse6) (and .cse7 .cse1 .cse8 .cse10 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse13 .cse9 .cse6) (and .cse8 .cse3 .cse12 .cse4 .cse9 .cse5 .cse6) (and .cse0 .cse10 .cse12 .cse4 .cse9 .cse11 .cse5) (and .cse0 .cse2 .cse12 .cse4 .cse13 .cse11 .cse6) (and .cse8 .cse12 .cse4 .cse13 .cse9 .cse11 .cse6) (and .cse7 .cse8 .cse2 .cse3 .cse10 .cse12 .cse5) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse13 .cse6) (and .cse7 .cse0 .cse3 .cse12 .cse9 .cse5 .cse6) (and .cse0 .cse3 .cse10 .cse12 .cse4 .cse9 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse10 .cse13 .cse11) (and .cse1 .cse8 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse11 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse0 .cse12 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse12 .cse4 .cse13 .cse6) (and .cse0 .cse12 .cse4 .cse13 .cse9 .cse11 .cse6) (and .cse0 .cse1 .cse4 .cse13 .cse9 .cse11 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse12 .cse4 .cse13) (and .cse7 .cse0 .cse1 .cse2 .cse13 .cse11 .cse6) (and .cse7 .cse8 .cse10 .cse12 .cse9 .cse11 .cse5) (and .cse0 .cse1 .cse10 .cse4 .cse13 .cse9 .cse11) (and .cse8 .cse12 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse12 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse13 .cse9 .cse11 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse5 .cse6) (and .cse8 .cse3 .cse12 .cse4 .cse13 .cse9 .cse6) (and .cse1 .cse8 .cse3 .cse10 .cse4 .cse9 .cse5) (and .cse7 .cse1 .cse8 .cse3 .cse10 .cse13 .cse9) (and .cse0 .cse2 .cse12 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse10 .cse5) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse9 .cse5 .cse6) (and .cse8 .cse2 .cse10 .cse12 .cse4 .cse13 .cse11) (and .cse7 .cse0 .cse3 .cse10 .cse12 .cse13 .cse9) (and .cse7 .cse0 .cse2 .cse12 .cse11 .cse5 .cse6) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse10 .cse12 .cse9 .cse11 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse13) (and .cse0 .cse2 .cse10 .cse12 .cse4 .cse11 .cse5) (and .cse7 .cse8 .cse10 .cse12 .cse13 .cse9 .cse11) (and .cse7 .cse1 .cse8 .cse3 .cse10 .cse9 .cse5) (and .cse8 .cse10 .cse12 .cse4 .cse13 .cse9 .cse11) (and .cse1 .cse8 .cse10 .cse4 .cse13 .cse9 .cse11) (and .cse7 .cse8 .cse2 .cse3 .cse10 .cse12 .cse13) (and .cse1 .cse8 .cse2 .cse3 .cse10 .cse4 .cse13) (and .cse7 .cse0 .cse2 .cse12 .cse13 .cse11 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse12 .cse4 .cse5) (and .cse7 .cse0 .cse3 .cse12 .cse13 .cse9 .cse6) (and .cse8 .cse2 .cse3 .cse12 .cse4 .cse13 .cse6) (and .cse8 .cse2 .cse3 .cse12 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse4 .cse13 .cse11 .cse6) (and .cse0 .cse2 .cse3 .cse12 .cse4 .cse5 .cse6) (and .cse8 .cse2 .cse12 .cse4 .cse13 .cse11 .cse6) (and .cse1 .cse8 .cse2 .cse4 .cse11 .cse5 .cse6) (and .cse0 .cse10 .cse12 .cse4 .cse13 .cse9 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse10 .cse9 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse10 .cse13 .cse9) (and .cse1 .cse8 .cse2 .cse10 .cse4 .cse11 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse13 .cse11 .cse6) (and .cse8 .cse10 .cse12 .cse4 .cse9 .cse11 .cse5) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse13 .cse9) (and .cse7 .cse1 .cse8 .cse2 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse3 .cse12 .cse9 .cse5 .cse6) (and .cse7 .cse0 .cse2 .cse10 .cse12 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse10 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse10 .cse13 .cse11) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse10 .cse13) (and .cse7 .cse8 .cse2 .cse3 .cse12 .cse5 .cse6) (and .cse7 .cse8 .cse2 .cse12 .cse13 .cse11 .cse6) (and .cse1 .cse8 .cse4 .cse13 .cse9 .cse11 .cse6) (and .cse7 .cse8 .cse2 .cse12 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse10 .cse13 .cse9 .cse11) (and .cse1 .cse8 .cse3 .cse10 .cse4 .cse13 .cse9) (and .cse7 .cse0 .cse10 .cse12 .cse13 .cse9 .cse11) (and .cse7 .cse8 .cse2 .cse3 .cse12 .cse13 .cse6) (and .cse0 .cse1 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse3 .cse13 .cse9 .cse6) (and .cse1 .cse8 .cse3 .cse4 .cse13 .cse9 .cse6) (and .cse7 .cse0 .cse2 .cse3 .cse12 .cse13 .cse6) (and .cse1 .cse8 .cse2 .cse4 .cse13 .cse11 .cse6) (and .cse8 .cse2 .cse12 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse2 .cse10 .cse12 .cse13 .cse11) (and .cse7 .cse8 .cse3 .cse12 .cse13 .cse9 .cse6) (and .cse7 .cse8 .cse2 .cse10 .cse12 .cse11 .cse5) (and .cse0 .cse3 .cse10 .cse12 .cse4 .cse13 .cse9) (and .cse0 .cse1 .cse10 .cse4 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse10 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse8 .cse2 .cse3 .cse10 .cse12 .cse4 .cse5) (and .cse8 .cse3 .cse10 .cse12 .cse4 .cse13 .cse9) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse13 .cse11) (and .cse7 .cse8 .cse3 .cse10 .cse12 .cse13 .cse9) (and .cse7 .cse1 .cse8 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse12 .cse13 .cse9 .cse11 .cse6) (and .cse7 .cse0 .cse3 .cse10 .cse12 .cse9 .cse5) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse12 .cse13) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse9 .cse5) (and .cse1 .cse8 .cse2 .cse10 .cse4 .cse13 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse13 .cse9 .cse6) (and .cse8 .cse2 .cse10 .cse12 .cse4 .cse11 .cse5) (and .cse7 .cse8 .cse12 .cse13 .cse9 .cse11 .cse6) (and .cse7 .cse0 .cse1 .cse13 .cse9 .cse11 .cse6) (and .cse0 .cse2 .cse10 .cse12 .cse4 .cse13 .cse11) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse13 .cse6) (and .cse7 .cse8 .cse12 .cse9 .cse11 .cse5 .cse6) (and .cse1 .cse8 .cse10 .cse4 .cse9 .cse11 .cse5) (and .cse0 .cse3 .cse12 .cse4 .cse9 .cse5 .cse6) (and .cse1 .cse8 .cse2 .cse3 .cse10 .cse4 .cse5))) [2020-09-04 22:00:32,600 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-09-04 22:00:32,600 INFO L271 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: true [2020-09-04 22:00:32,600 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-09-04 22:00:32,601 INFO L264 CegarLoopResult]: At program point L67-1(lines 30 116) 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 .cse2 .cse6 .cse4) (and .cse8 .cse5 .cse1 .cse2 .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 .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse7 .cse8 .cse1 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 .cse4) (and .cse7 .cse0 .cse9 .cse3 .cse6) (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 .cse8 .cse1 .cse2 .cse9 .cse3) (and .cse0 .cse2 .cse9 .cse3 .cse6) (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 .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse0 .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-09-04 22:00:32,601 INFO L264 CegarLoopResult]: At program point L92(line 92) the Hoare annotation is: (let ((.cse3 (= main_~p7~0 0)) (.cse8 (= main_~lk6~0 1)) (.cse7 (= main_~p4~0 0)) (.cse4 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse2 (= main_~p6~0 0)) (.cse6 (= main_~p5~0 0)) (.cse5 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse1 .cse2 .cse6 .cse7 .cse5) (and .cse1 .cse2 .cse7 .cse4 .cse5) (and .cse1 .cse2 .cse3 .cse7 .cse4) (and .cse1 .cse8 .cse7 .cse4 .cse5) (and .cse0 .cse1 .cse6 .cse3 .cse8) (and .cse1 .cse2 .cse6 .cse3 .cse7) (and .cse0 .cse1 .cse3 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse8 .cse5) (and .cse0 .cse1 .cse2 .cse6 .cse3) (and .cse0 .cse1 .cse8 .cse4 .cse5) (and .cse1 .cse6 .cse8 .cse7 .cse5) (and .cse1 .cse6 .cse3 .cse8 .cse7) (and .cse1 .cse3 .cse8 .cse7 .cse4) (and .cse0 .cse1 .cse2 .cse6 .cse5))) [2020-09-04 22:00:32,602 INFO L264 CegarLoopResult]: At program point L59-1(lines 30 116) 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 .cse0 .cse1 .cse5) (and .cse4 .cse5 .cse3) (and .cse4 .cse3 .cse2) (and .cse4 .cse1 .cse5) (and .cse0 .cse5 .cse3))) [2020-09-04 22:00:32,602 INFO L271 CegarLoopResult]: At program point L117(lines 5 121) the Hoare annotation is: true [2020-09-04 22:00:32,602 INFO L271 CegarLoopResult]: At program point L51(lines 51 53) the Hoare annotation is: true [2020-09-04 22:00:32,604 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-09-04 22:00:32,604 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-09-04 22:00:32,604 INFO L264 CegarLoopResult]: At program point L51-2(lines 30 116) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-09-04 22:00:32,604 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-09-04 22:00:32,605 INFO L264 CegarLoopResult]: At program point L76(line 76) 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 .cse2 .cse9 .cse11 .cse6 .cse7 .cse10) (and .cse0 .cse8 .cse1 .cse11 .cse3 .cse5) (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 .cse1 .cse2 .cse9 .cse7 .cse4 .cse5) (and .cse8 .cse6 .cse7 .cse3 .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 .cse2 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse11 .cse5) (and .cse0 .cse8 .cse1 .cse11 .cse10 .cse3) (and .cse8 .cse11 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse2 .cse9 .cse11 .cse6 .cse10) (and .cse1 .cse2 .cse11 .cse7 .cse10 .cse3) (and .cse1 .cse2 .cse11 .cse7 .cse3 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse10 .cse4) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse9 .cse11 .cse6 .cse10) (and .cse8 .cse1 .cse9 .cse11 .cse7 .cse10) (and .cse0 .cse2 .cse9 .cse11 .cse6 .cse5) (and .cse2 .cse9 .cse11 .cse6 .cse7 .cse5) (and .cse2 .cse11 .cse6 .cse7 .cse3 .cse5) (and .cse2 .cse11 .cse6 .cse7 .cse10 .cse3) (and .cse8 .cse1 .cse7 .cse10 .cse3 .cse4) (and .cse0 .cse8 .cse1 .cse10 .cse3 .cse4) (and .cse0 .cse2 .cse9 .cse6 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse11 .cse7 .cse10) (and .cse1 .cse2 .cse7 .cse10 .cse3 .cse4) (and .cse1 .cse2 .cse9 .cse7 .cse10 .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-09-04 22:00:32,605 INFO L271 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: true [2020-09-04 22:00:32,605 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-09-04 22:00:32,606 INFO L264 CegarLoopResult]: At program point L68(line 68) 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-09-04 22:00:32,606 INFO L264 CegarLoopResult]: At program point L101-1(lines 30 116) the Hoare annotation is: (let ((.cse0 (= main_~lk6~0 1)) (.cse2 (= main_~p7~0 0)) (.cse3 (= main_~p6~0 0)) (.cse1 (= main_~lk7~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and .cse3 .cse2) (and .cse3 .cse1))) [2020-09-04 22:00:32,606 INFO L271 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: true [2020-09-04 22:00:32,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 10:00:32 BoogieIcfgContainer [2020-09-04 22:00:32,624 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 22:00:32,627 INFO L168 Benchmark]: Toolchain (without parser) took 25211.29 ms. Allocated memory was 135.3 MB in the beginning and 680.5 MB in the end (delta: 545.3 MB). Free memory was 99.4 MB in the beginning and 68.6 MB in the end (delta: 30.8 MB). Peak memory consumption was 580.2 MB. Max. memory is 7.1 GB. [2020-09-04 22:00:32,628 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 135.3 MB. Free memory was 117.8 MB in the beginning and 117.4 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. [2020-09-04 22:00:32,629 INFO L168 Benchmark]: CACSL2BoogieTranslator took 444.15 ms. Allocated memory is still 135.3 MB. Free memory was 98.9 MB in the beginning and 88.7 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2020-09-04 22:00:32,629 INFO L168 Benchmark]: Boogie Preprocessor took 158.47 ms. Allocated memory was 135.3 MB in the beginning and 198.2 MB in the end (delta: 62.9 MB). Free memory was 88.7 MB in the beginning and 175.1 MB in the end (delta: -86.4 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2020-09-04 22:00:32,630 INFO L168 Benchmark]: RCFGBuilder took 464.84 ms. Allocated memory is still 198.2 MB. Free memory was 175.1 MB in the beginning and 154.7 MB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2020-09-04 22:00:32,631 INFO L168 Benchmark]: TraceAbstraction took 24136.43 ms. Allocated memory was 198.2 MB in the beginning and 680.5 MB in the end (delta: 482.3 MB). Free memory was 154.7 MB in the beginning and 68.6 MB in the end (delta: 86.2 MB). Peak memory consumption was 572.7 MB. Max. memory is 7.1 GB. [2020-09-04 22:00:32,635 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 135.3 MB. Free memory was 117.8 MB in the beginning and 117.4 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 444.15 ms. Allocated memory is still 135.3 MB. Free memory was 98.9 MB in the beginning and 88.7 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 158.47 ms. Allocated memory was 135.3 MB in the beginning and 198.2 MB in the end (delta: 62.9 MB). Free memory was 88.7 MB in the beginning and 175.1 MB in the end (delta: -86.4 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 464.84 ms. Allocated memory is still 198.2 MB. Free memory was 175.1 MB in the beginning and 154.7 MB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24136.43 ms. Allocated memory was 198.2 MB in the beginning and 680.5 MB in the end (delta: 482.3 MB). Free memory was 154.7 MB in the beginning and 68.6 MB in the end (delta: 86.2 MB). Peak memory consumption was 572.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 119]: 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: 30]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: 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, 88 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.8s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 19.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1813 SDtfs, 648 SDslu, 1281 SDs, 0 SdLazy, 69 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3635occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 1022 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 88 LocationsWithAnnotation, 88 PreInvPairs, 4768 NumberOfFragments, 13918 HoareAnnotationTreeSize, 88 FomulaSimplifications, 98944 FormulaSimplificationTreeSizeReduction, 6.5s HoareSimplificationTime, 88 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 12.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 819 NumberOfCodeBlocks, 819 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 805 ConstructedInterpolants, 0 QuantifiedInterpolants, 58429 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...