/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_8.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-86f66a4 [2020-07-07 13:22:16,869 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-07 13:22:16,872 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-07 13:22:16,892 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-07 13:22:16,892 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-07 13:22:16,894 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-07 13:22:16,896 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-07 13:22:16,907 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-07 13:22:16,911 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-07 13:22:16,914 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-07 13:22:16,916 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-07 13:22:16,918 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-07 13:22:16,919 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-07 13:22:16,921 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-07 13:22:16,923 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-07 13:22:16,924 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-07 13:22:16,926 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-07 13:22:16,927 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-07 13:22:16,928 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-07 13:22:16,934 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-07 13:22:16,939 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-07 13:22:16,943 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-07 13:22:16,945 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-07 13:22:16,946 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-07 13:22:16,949 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-07 13:22:16,949 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-07 13:22:16,949 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-07 13:22:16,952 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-07 13:22:16,953 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-07 13:22:16,954 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-07 13:22:16,954 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-07 13:22:16,955 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-07 13:22:16,956 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-07 13:22:16,957 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-07 13:22:16,958 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-07 13:22:16,958 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-07 13:22:16,959 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-07 13:22:16,959 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-07 13:22:16,959 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-07 13:22:16,960 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-07 13:22:16,962 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-07 13:22:16,963 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-07 13:22:16,985 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-07 13:22:16,985 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-07 13:22:16,993 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-07 13:22:16,993 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-07 13:22:16,994 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-07 13:22:16,994 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-07 13:22:16,994 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-07 13:22:16,994 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-07 13:22:16,997 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-07 13:22:16,998 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-07 13:22:16,998 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-07 13:22:16,998 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-07 13:22:16,998 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-07 13:22:16,998 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-07 13:22:16,999 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-07 13:22:16,999 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-07 13:22:16,999 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-07 13:22:16,999 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-07 13:22:16,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 13:22:16,999 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-07 13:22:17,000 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-07 13:22:17,000 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-07 13:22:17,000 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-07 13:22:17,306 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-07 13:22:17,323 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-07 13:22:17,326 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-07 13:22:17,328 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-07 13:22:17,328 INFO L275 PluginConnector]: CDTParser initialized [2020-07-07 13:22:17,329 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_8.c [2020-07-07 13:22:17,399 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d014dca9/b2d93370375f41af9f0bec567882b0d5/FLAG62032accb [2020-07-07 13:22:17,904 INFO L306 CDTParser]: Found 1 translation units. [2020-07-07 13:22:17,905 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c [2020-07-07 13:22:17,912 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d014dca9/b2d93370375f41af9f0bec567882b0d5/FLAG62032accb [2020-07-07 13:22:18,297 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d014dca9/b2d93370375f41af9f0bec567882b0d5 [2020-07-07 13:22:18,313 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-07 13:22:18,315 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-07 13:22:18,318 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-07 13:22:18,318 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-07 13:22:18,323 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-07 13:22:18,324 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 01:22:18" (1/1) ... [2020-07-07 13:22:18,328 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@786be218 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:22:18, skipping insertion in model container [2020-07-07 13:22:18,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 01:22:18" (1/1) ... [2020-07-07 13:22:18,339 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-07 13:22:18,373 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-07 13:22:18,577 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 13:22:18,582 INFO L203 MainTranslator]: Completed pre-run [2020-07-07 13:22:18,609 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 13:22:18,625 INFO L208 MainTranslator]: Completed translation [2020-07-07 13:22:18,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:22:18 WrapperNode [2020-07-07 13:22:18,625 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-07 13:22:18,626 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-07 13:22:18,626 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-07 13:22:18,626 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-07 13:22:18,733 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:22:18" (1/1) ... [2020-07-07 13:22:18,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:22:18" (1/1) ... [2020-07-07 13:22:18,741 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:22:18" (1/1) ... [2020-07-07 13:22:18,741 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:22:18" (1/1) ... [2020-07-07 13:22:18,746 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:22:18" (1/1) ... [2020-07-07 13:22:18,754 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:22:18" (1/1) ... [2020-07-07 13:22:18,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:22:18" (1/1) ... [2020-07-07 13:22:18,758 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-07 13:22:18,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-07 13:22:18,759 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-07 13:22:18,759 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-07 13:22:18,760 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:22:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 13:22:18,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-07 13:22:18,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-07 13:22:18,820 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-07 13:22:18,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-07 13:22:18,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-07 13:22:18,820 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-07 13:22:18,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-07 13:22:18,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-07 13:22:19,179 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-07 13:22:19,180 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-07 13:22:19,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 01:22:19 BoogieIcfgContainer [2020-07-07 13:22:19,187 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-07 13:22:19,189 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-07 13:22:19,189 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-07 13:22:19,192 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-07 13:22:19,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.07 01:22:18" (1/3) ... [2020-07-07 13:22:19,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b643ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 01:22:19, skipping insertion in model container [2020-07-07 13:22:19,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:22:18" (2/3) ... [2020-07-07 13:22:19,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b643ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 01:22:19, skipping insertion in model container [2020-07-07 13:22:19,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 01:22:19" (3/3) ... [2020-07-07 13:22:19,196 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2020-07-07 13:22:19,210 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-07 13:22:19,218 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-07 13:22:19,234 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-07 13:22:19,259 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-07 13:22:19,260 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-07 13:22:19,260 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-07 13:22:19,260 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-07 13:22:19,261 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-07 13:22:19,261 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-07 13:22:19,261 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-07 13:22:19,261 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-07 13:22:19,283 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2020-07-07 13:22:19,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-07 13:22:19,297 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:19,299 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-07-07 13:22:19,299 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:19,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:19,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1717644884, now seen corresponding path program 1 times [2020-07-07 13:22:19,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:19,315 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [548976212] [2020-07-07 13:22:19,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:19,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:19,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:19,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:19,536 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:19,539 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [548976212] [2020-07-07 13:22:19,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:19,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:19,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236947024] [2020-07-07 13:22:19,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:19,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:19,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:19,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:19,570 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 3 states. [2020-07-07 13:22:19,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:19,693 INFO L93 Difference]: Finished difference Result 213 states and 291 transitions. [2020-07-07 13:22:19,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:19,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-07-07 13:22:19,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:19,711 INFO L225 Difference]: With dead ends: 213 [2020-07-07 13:22:19,712 INFO L226 Difference]: Without dead ends: 144 [2020-07-07 13:22:19,716 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:19,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-07-07 13:22:19,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2020-07-07 13:22:19,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-07-07 13:22:19,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 186 transitions. [2020-07-07 13:22:19,790 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 186 transitions. Word has length 61 [2020-07-07 13:22:19,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:19,791 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 186 transitions. [2020-07-07 13:22:19,791 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:19,792 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 186 transitions. [2020-07-07 13:22:19,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-07-07 13:22:19,795 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:19,795 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-07-07 13:22:19,796 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-07 13:22:19,796 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:19,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:19,797 INFO L82 PathProgramCache]: Analyzing trace with hash 16380224, now seen corresponding path program 1 times [2020-07-07 13:22:19,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:19,797 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [891826529] [2020-07-07 13:22:19,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:19,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:19,924 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:19,924 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [891826529] [2020-07-07 13:22:19,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:19,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:19,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428410225] [2020-07-07 13:22:19,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:19,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:19,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:19,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:19,927 INFO L87 Difference]: Start difference. First operand 142 states and 186 transitions. Second operand 3 states. [2020-07-07 13:22:19,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:19,970 INFO L93 Difference]: Finished difference Result 173 states and 229 transitions. [2020-07-07 13:22:19,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:19,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-07-07 13:22:19,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:19,974 INFO L225 Difference]: With dead ends: 173 [2020-07-07 13:22:19,974 INFO L226 Difference]: Without dead ends: 171 [2020-07-07 13:22:19,976 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:19,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-07-07 13:22:20,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 142. [2020-07-07 13:22:20,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-07-07 13:22:20,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 185 transitions. [2020-07-07 13:22:20,004 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 185 transitions. Word has length 62 [2020-07-07 13:22:20,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:20,004 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 185 transitions. [2020-07-07 13:22:20,005 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:20,005 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 185 transitions. [2020-07-07 13:22:20,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-07-07 13:22:20,007 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:20,007 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-07-07 13:22:20,008 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-07 13:22:20,008 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:20,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:20,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1707628474, now seen corresponding path program 1 times [2020-07-07 13:22:20,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:20,009 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1407294134] [2020-07-07 13:22:20,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:20,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:20,084 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:20,084 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1407294134] [2020-07-07 13:22:20,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:20,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:20,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399017907] [2020-07-07 13:22:20,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:20,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:20,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:20,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:20,087 INFO L87 Difference]: Start difference. First operand 142 states and 185 transitions. Second operand 3 states. [2020-07-07 13:22:20,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:20,151 INFO L93 Difference]: Finished difference Result 346 states and 473 transitions. [2020-07-07 13:22:20,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:20,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-07-07 13:22:20,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:20,156 INFO L225 Difference]: With dead ends: 346 [2020-07-07 13:22:20,156 INFO L226 Difference]: Without dead ends: 241 [2020-07-07 13:22:20,157 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:20,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2020-07-07 13:22:20,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 239. [2020-07-07 13:22:20,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2020-07-07 13:22:20,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 320 transitions. [2020-07-07 13:22:20,212 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 320 transitions. Word has length 62 [2020-07-07 13:22:20,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:20,213 INFO L479 AbstractCegarLoop]: Abstraction has 239 states and 320 transitions. [2020-07-07 13:22:20,213 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:20,213 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 320 transitions. [2020-07-07 13:22:20,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-07-07 13:22:20,215 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:20,216 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, 1] [2020-07-07 13:22:20,216 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-07 13:22:20,216 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:20,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:20,217 INFO L82 PathProgramCache]: Analyzing trace with hash -298745719, now seen corresponding path program 1 times [2020-07-07 13:22:20,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:20,218 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [408441104] [2020-07-07 13:22:20,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:20,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:20,271 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:20,272 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [408441104] [2020-07-07 13:22:20,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:20,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:20,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296250684] [2020-07-07 13:22:20,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:20,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:20,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:20,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:20,274 INFO L87 Difference]: Start difference. First operand 239 states and 320 transitions. Second operand 3 states. [2020-07-07 13:22:20,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:20,325 INFO L93 Difference]: Finished difference Result 293 states and 396 transitions. [2020-07-07 13:22:20,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:20,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-07-07 13:22:20,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:20,332 INFO L225 Difference]: With dead ends: 293 [2020-07-07 13:22:20,332 INFO L226 Difference]: Without dead ends: 291 [2020-07-07 13:22:20,333 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:20,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-07-07 13:22:20,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 239. [2020-07-07 13:22:20,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2020-07-07 13:22:20,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 318 transitions. [2020-07-07 13:22:20,382 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 318 transitions. Word has length 63 [2020-07-07 13:22:20,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:20,382 INFO L479 AbstractCegarLoop]: Abstraction has 239 states and 318 transitions. [2020-07-07 13:22:20,383 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:20,383 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 318 transitions. [2020-07-07 13:22:20,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-07-07 13:22:20,385 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:20,386 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, 1] [2020-07-07 13:22:20,386 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-07 13:22:20,386 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:20,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:20,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1397120136, now seen corresponding path program 1 times [2020-07-07 13:22:20,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:20,387 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2078197656] [2020-07-07 13:22:20,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:20,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:20,436 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:20,437 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2078197656] [2020-07-07 13:22:20,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:20,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:20,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92650500] [2020-07-07 13:22:20,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:20,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:20,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:20,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:20,439 INFO L87 Difference]: Start difference. First operand 239 states and 318 transitions. Second operand 3 states. [2020-07-07 13:22:20,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:20,487 INFO L93 Difference]: Finished difference Result 631 states and 864 transitions. [2020-07-07 13:22:20,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:20,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-07-07 13:22:20,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:20,491 INFO L225 Difference]: With dead ends: 631 [2020-07-07 13:22:20,492 INFO L226 Difference]: Without dead ends: 429 [2020-07-07 13:22:20,494 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:20,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2020-07-07 13:22:20,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 427. [2020-07-07 13:22:20,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2020-07-07 13:22:20,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 574 transitions. [2020-07-07 13:22:20,532 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 574 transitions. Word has length 63 [2020-07-07 13:22:20,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:20,532 INFO L479 AbstractCegarLoop]: Abstraction has 427 states and 574 transitions. [2020-07-07 13:22:20,533 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:20,533 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 574 transitions. [2020-07-07 13:22:20,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-07-07 13:22:20,536 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:20,536 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, 1, 1] [2020-07-07 13:22:20,537 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-07 13:22:20,537 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:20,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:20,537 INFO L82 PathProgramCache]: Analyzing trace with hash 361296622, now seen corresponding path program 1 times [2020-07-07 13:22:20,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:20,538 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1587887131] [2020-07-07 13:22:20,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:20,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:20,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:20,582 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:20,583 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1587887131] [2020-07-07 13:22:20,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:20,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:20,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182444030] [2020-07-07 13:22:20,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:20,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:20,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:20,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:20,585 INFO L87 Difference]: Start difference. First operand 427 states and 574 transitions. Second operand 3 states. [2020-07-07 13:22:20,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:20,665 INFO L93 Difference]: Finished difference Result 1183 states and 1616 transitions. [2020-07-07 13:22:20,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:20,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-07-07 13:22:20,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:20,671 INFO L225 Difference]: With dead ends: 1183 [2020-07-07 13:22:20,672 INFO L226 Difference]: Without dead ends: 793 [2020-07-07 13:22:20,674 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:20,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2020-07-07 13:22:20,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 791. [2020-07-07 13:22:20,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-07-07 13:22:20,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1062 transitions. [2020-07-07 13:22:20,748 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1062 transitions. Word has length 64 [2020-07-07 13:22:20,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:20,748 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 1062 transitions. [2020-07-07 13:22:20,748 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:20,749 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1062 transitions. [2020-07-07 13:22:20,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-07-07 13:22:20,756 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:20,759 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, 1, 1] [2020-07-07 13:22:20,760 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-07 13:22:20,760 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:20,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:20,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1477714988, now seen corresponding path program 1 times [2020-07-07 13:22:20,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:20,767 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [543332105] [2020-07-07 13:22:20,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:20,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:20,828 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:20,828 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [543332105] [2020-07-07 13:22:20,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:20,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:20,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434818327] [2020-07-07 13:22:20,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:20,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:20,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:20,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:20,831 INFO L87 Difference]: Start difference. First operand 791 states and 1062 transitions. Second operand 3 states. [2020-07-07 13:22:20,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:20,920 INFO L93 Difference]: Finished difference Result 971 states and 1312 transitions. [2020-07-07 13:22:20,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:20,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-07-07 13:22:20,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:20,926 INFO L225 Difference]: With dead ends: 971 [2020-07-07 13:22:20,926 INFO L226 Difference]: Without dead ends: 969 [2020-07-07 13:22:20,927 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:20,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2020-07-07 13:22:20,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 791. [2020-07-07 13:22:20,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-07-07 13:22:20,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1054 transitions. [2020-07-07 13:22:20,990 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1054 transitions. Word has length 64 [2020-07-07 13:22:20,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:20,990 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 1054 transitions. [2020-07-07 13:22:20,991 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:20,991 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1054 transitions. [2020-07-07 13:22:20,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-07 13:22:20,993 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:20,993 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, 1, 1, 1] [2020-07-07 13:22:20,993 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-07 13:22:20,993 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:20,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:20,994 INFO L82 PathProgramCache]: Analyzing trace with hash 628943709, now seen corresponding path program 1 times [2020-07-07 13:22:20,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:20,996 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1156023213] [2020-07-07 13:22:20,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:21,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:21,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:21,091 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:21,092 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1156023213] [2020-07-07 13:22:21,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:21,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:21,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767197756] [2020-07-07 13:22:21,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:21,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:21,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:21,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:21,096 INFO L87 Difference]: Start difference. First operand 791 states and 1054 transitions. Second operand 3 states. [2020-07-07 13:22:21,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:21,174 INFO L93 Difference]: Finished difference Result 963 states and 1288 transitions. [2020-07-07 13:22:21,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:21,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-07-07 13:22:21,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:21,181 INFO L225 Difference]: With dead ends: 963 [2020-07-07 13:22:21,181 INFO L226 Difference]: Without dead ends: 961 [2020-07-07 13:22:21,182 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:21,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2020-07-07 13:22:21,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 791. [2020-07-07 13:22:21,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-07-07 13:22:21,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1046 transitions. [2020-07-07 13:22:21,248 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1046 transitions. Word has length 65 [2020-07-07 13:22:21,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:21,249 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 1046 transitions. [2020-07-07 13:22:21,249 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:21,249 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1046 transitions. [2020-07-07 13:22:21,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-07 13:22:21,250 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:21,251 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, 1, 1, 1] [2020-07-07 13:22:21,251 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-07 13:22:21,251 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:21,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:21,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1684460868, now seen corresponding path program 1 times [2020-07-07 13:22:21,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:21,253 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1932656518] [2020-07-07 13:22:21,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:21,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:21,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:21,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:21,308 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:21,308 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1932656518] [2020-07-07 13:22:21,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:21,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:21,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889092153] [2020-07-07 13:22:21,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:21,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:21,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:21,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:21,311 INFO L87 Difference]: Start difference. First operand 791 states and 1046 transitions. Second operand 3 states. [2020-07-07 13:22:21,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:21,458 INFO L93 Difference]: Finished difference Result 2251 states and 3000 transitions. [2020-07-07 13:22:21,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:21,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-07-07 13:22:21,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:21,467 INFO L225 Difference]: With dead ends: 2251 [2020-07-07 13:22:21,467 INFO L226 Difference]: Without dead ends: 1497 [2020-07-07 13:22:21,470 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:21,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2020-07-07 13:22:21,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1495. [2020-07-07 13:22:21,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1495 states. [2020-07-07 13:22:21,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 1958 transitions. [2020-07-07 13:22:21,593 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 1958 transitions. Word has length 65 [2020-07-07 13:22:21,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:21,593 INFO L479 AbstractCegarLoop]: Abstraction has 1495 states and 1958 transitions. [2020-07-07 13:22:21,594 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:21,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1958 transitions. [2020-07-07 13:22:21,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-07 13:22:21,596 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:21,596 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, 1, 1, 1, 1] [2020-07-07 13:22:21,596 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-07 13:22:21,596 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:21,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:21,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1510854248, now seen corresponding path program 1 times [2020-07-07 13:22:21,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:21,598 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [992506955] [2020-07-07 13:22:21,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:21,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:21,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:21,653 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:21,653 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [992506955] [2020-07-07 13:22:21,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:21,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:21,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308994275] [2020-07-07 13:22:21,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:21,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:21,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:21,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:21,658 INFO L87 Difference]: Start difference. First operand 1495 states and 1958 transitions. Second operand 3 states. [2020-07-07 13:22:21,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:21,812 INFO L93 Difference]: Finished difference Result 1803 states and 2360 transitions. [2020-07-07 13:22:21,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:21,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-07 13:22:21,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:21,821 INFO L225 Difference]: With dead ends: 1803 [2020-07-07 13:22:21,822 INFO L226 Difference]: Without dead ends: 1801 [2020-07-07 13:22:21,824 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:21,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states. [2020-07-07 13:22:21,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1495. [2020-07-07 13:22:21,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1495 states. [2020-07-07 13:22:21,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 1942 transitions. [2020-07-07 13:22:21,938 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 1942 transitions. Word has length 66 [2020-07-07 13:22:21,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:21,938 INFO L479 AbstractCegarLoop]: Abstraction has 1495 states and 1942 transitions. [2020-07-07 13:22:21,939 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:21,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1942 transitions. [2020-07-07 13:22:21,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-07 13:22:21,946 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:21,946 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, 1, 1, 1, 1] [2020-07-07 13:22:21,947 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-07 13:22:21,947 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:21,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:21,947 INFO L82 PathProgramCache]: Analyzing trace with hash -678433246, now seen corresponding path program 1 times [2020-07-07 13:22:21,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:21,948 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [345566643] [2020-07-07 13:22:21,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:21,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:21,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:21,989 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:21,989 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [345566643] [2020-07-07 13:22:21,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:21,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:21,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630974248] [2020-07-07 13:22:21,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:21,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:21,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:21,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:21,993 INFO L87 Difference]: Start difference. First operand 1495 states and 1942 transitions. Second operand 3 states. [2020-07-07 13:22:22,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:22,241 INFO L93 Difference]: Finished difference Result 4315 states and 5624 transitions. [2020-07-07 13:22:22,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:22,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-07 13:22:22,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:22,257 INFO L225 Difference]: With dead ends: 4315 [2020-07-07 13:22:22,257 INFO L226 Difference]: Without dead ends: 2857 [2020-07-07 13:22:22,261 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:22,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2857 states. [2020-07-07 13:22:22,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2857 to 2855. [2020-07-07 13:22:22,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2855 states. [2020-07-07 13:22:22,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2855 states to 2855 states and 3654 transitions. [2020-07-07 13:22:22,450 INFO L78 Accepts]: Start accepts. Automaton has 2855 states and 3654 transitions. Word has length 66 [2020-07-07 13:22:22,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:22,450 INFO L479 AbstractCegarLoop]: Abstraction has 2855 states and 3654 transitions. [2020-07-07 13:22:22,450 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:22,451 INFO L276 IsEmpty]: Start isEmpty. Operand 2855 states and 3654 transitions. [2020-07-07 13:22:22,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-07 13:22:22,454 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:22,454 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, 1, 1, 1, 1, 1] [2020-07-07 13:22:22,454 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-07 13:22:22,455 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:22,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:22,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1214689743, now seen corresponding path program 1 times [2020-07-07 13:22:22,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:22,456 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [322701851] [2020-07-07 13:22:22,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:22,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:22,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:22,504 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:22,505 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [322701851] [2020-07-07 13:22:22,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:22,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:22,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666165630] [2020-07-07 13:22:22,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:22,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:22,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:22,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:22,507 INFO L87 Difference]: Start difference. First operand 2855 states and 3654 transitions. Second operand 3 states. [2020-07-07 13:22:22,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:22,719 INFO L93 Difference]: Finished difference Result 3403 states and 4328 transitions. [2020-07-07 13:22:22,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:22,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2020-07-07 13:22:22,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:22,737 INFO L225 Difference]: With dead ends: 3403 [2020-07-07 13:22:22,737 INFO L226 Difference]: Without dead ends: 3401 [2020-07-07 13:22:22,742 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:22,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3401 states. [2020-07-07 13:22:22,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3401 to 2855. [2020-07-07 13:22:22,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2855 states. [2020-07-07 13:22:22,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2855 states to 2855 states and 3622 transitions. [2020-07-07 13:22:22,939 INFO L78 Accepts]: Start accepts. Automaton has 2855 states and 3622 transitions. Word has length 67 [2020-07-07 13:22:22,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:22,939 INFO L479 AbstractCegarLoop]: Abstraction has 2855 states and 3622 transitions. [2020-07-07 13:22:22,939 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:22,940 INFO L276 IsEmpty]: Start isEmpty. Operand 2855 states and 3622 transitions. [2020-07-07 13:22:22,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-07 13:22:22,942 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:22,943 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, 1, 1, 1, 1, 1] [2020-07-07 13:22:22,943 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-07 13:22:22,943 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:22,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:22,943 INFO L82 PathProgramCache]: Analyzing trace with hash 443652336, now seen corresponding path program 1 times [2020-07-07 13:22:22,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:22,944 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1140277657] [2020-07-07 13:22:22,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:22,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:22,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:22,975 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:22,976 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1140277657] [2020-07-07 13:22:22,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:22,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:22,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021815115] [2020-07-07 13:22:22,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:22,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:22,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:22,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:22,979 INFO L87 Difference]: Start difference. First operand 2855 states and 3622 transitions. Second operand 3 states. [2020-07-07 13:22:23,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:23,412 INFO L93 Difference]: Finished difference Result 8299 states and 10536 transitions. [2020-07-07 13:22:23,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:23,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2020-07-07 13:22:23,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:23,441 INFO L225 Difference]: With dead ends: 8299 [2020-07-07 13:22:23,441 INFO L226 Difference]: Without dead ends: 5481 [2020-07-07 13:22:23,449 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:23,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5481 states. [2020-07-07 13:22:23,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5481 to 5479. [2020-07-07 13:22:23,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5479 states. [2020-07-07 13:22:23,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5479 states to 5479 states and 6822 transitions. [2020-07-07 13:22:23,833 INFO L78 Accepts]: Start accepts. Automaton has 5479 states and 6822 transitions. Word has length 67 [2020-07-07 13:22:23,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:23,833 INFO L479 AbstractCegarLoop]: Abstraction has 5479 states and 6822 transitions. [2020-07-07 13:22:23,833 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:23,834 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 6822 transitions. [2020-07-07 13:22:23,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-07-07 13:22:23,838 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:23,838 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, 1, 1, 1, 1, 1, 1] [2020-07-07 13:22:23,839 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-07 13:22:23,839 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:23,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:23,839 INFO L82 PathProgramCache]: Analyzing trace with hash 192792828, now seen corresponding path program 1 times [2020-07-07 13:22:23,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:23,844 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [651538245] [2020-07-07 13:22:23,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:23,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:23,875 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:23,875 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [651538245] [2020-07-07 13:22:23,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:23,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:23,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597860497] [2020-07-07 13:22:23,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:23,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:23,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:23,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:23,877 INFO L87 Difference]: Start difference. First operand 5479 states and 6822 transitions. Second operand 3 states. [2020-07-07 13:22:24,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:24,323 INFO L93 Difference]: Finished difference Result 6443 states and 7912 transitions. [2020-07-07 13:22:24,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:24,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2020-07-07 13:22:24,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:24,353 INFO L225 Difference]: With dead ends: 6443 [2020-07-07 13:22:24,353 INFO L226 Difference]: Without dead ends: 6441 [2020-07-07 13:22:24,356 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:24,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6441 states. [2020-07-07 13:22:24,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6441 to 5479. [2020-07-07 13:22:24,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5479 states. [2020-07-07 13:22:24,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5479 states to 5479 states and 6758 transitions. [2020-07-07 13:22:24,802 INFO L78 Accepts]: Start accepts. Automaton has 5479 states and 6758 transitions. Word has length 68 [2020-07-07 13:22:24,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:24,802 INFO L479 AbstractCegarLoop]: Abstraction has 5479 states and 6758 transitions. [2020-07-07 13:22:24,802 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:24,802 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 6758 transitions. [2020-07-07 13:22:24,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-07-07 13:22:24,807 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:24,807 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, 1, 1, 1, 1, 1, 1] [2020-07-07 13:22:24,807 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-07 13:22:24,807 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:24,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:24,808 INFO L82 PathProgramCache]: Analyzing trace with hash 868567382, now seen corresponding path program 1 times [2020-07-07 13:22:24,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:24,808 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1454410300] [2020-07-07 13:22:24,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:24,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:24,842 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:24,842 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1454410300] [2020-07-07 13:22:24,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:24,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:24,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703501276] [2020-07-07 13:22:24,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:24,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:24,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:24,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:24,844 INFO L87 Difference]: Start difference. First operand 5479 states and 6758 transitions. Second operand 3 states. [2020-07-07 13:22:25,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:25,496 INFO L93 Difference]: Finished difference Result 15977 states and 19687 transitions. [2020-07-07 13:22:25,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:25,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2020-07-07 13:22:25,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:25,520 INFO L225 Difference]: With dead ends: 15977 [2020-07-07 13:22:25,521 INFO L226 Difference]: Without dead ends: 5479 [2020-07-07 13:22:25,539 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:25,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2020-07-07 13:22:25,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 5479. [2020-07-07 13:22:25,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5479 states. [2020-07-07 13:22:25,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5479 states to 5479 states and 6502 transitions. [2020-07-07 13:22:25,840 INFO L78 Accepts]: Start accepts. Automaton has 5479 states and 6502 transitions. Word has length 68 [2020-07-07 13:22:25,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:25,840 INFO L479 AbstractCegarLoop]: Abstraction has 5479 states and 6502 transitions. [2020-07-07 13:22:25,840 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:25,841 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 6502 transitions. [2020-07-07 13:22:25,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-07-07 13:22:25,845 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:25,845 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, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:22:25,846 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-07 13:22:25,846 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:25,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:25,846 INFO L82 PathProgramCache]: Analyzing trace with hash 875079941, now seen corresponding path program 1 times [2020-07-07 13:22:25,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:25,847 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1252948463] [2020-07-07 13:22:25,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:25,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:25,871 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:25,871 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1252948463] [2020-07-07 13:22:25,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:25,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:25,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259505600] [2020-07-07 13:22:25,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:25,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:25,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:25,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:25,873 INFO L87 Difference]: Start difference. First operand 5479 states and 6502 transitions. Second operand 3 states. [2020-07-07 13:22:26,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:26,205 INFO L93 Difference]: Finished difference Result 5479 states and 6502 transitions. [2020-07-07 13:22:26,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:26,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2020-07-07 13:22:26,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:26,206 INFO L225 Difference]: With dead ends: 5479 [2020-07-07 13:22:26,206 INFO L226 Difference]: Without dead ends: 0 [2020-07-07 13:22:26,217 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:26,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-07 13:22:26,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-07 13:22:26,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-07 13:22:26,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-07 13:22:26,218 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2020-07-07 13:22:26,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:26,219 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-07 13:22:26,219 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:26,219 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-07 13:22:26,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-07 13:22:26,219 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-07 13:22:26,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-07 13:22:27,128 WARN L193 SmtUtils]: Spent 880.00 ms on a formula simplification. DAG size of input: 289 DAG size of output: 159 [2020-07-07 13:22:27,532 WARN L193 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2020-07-07 13:22:27,667 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 57 [2020-07-07 13:22:27,815 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 55 [2020-07-07 13:22:28,272 WARN L193 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 387 DAG size of output: 23 [2020-07-07 13:22:28,575 WARN L193 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 352 DAG size of output: 11 [2020-07-07 13:22:28,867 WARN L193 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2020-07-07 13:22:29,064 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 93 [2020-07-07 13:22:29,175 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 37 [2020-07-07 13:22:29,341 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 279 DAG size of output: 15 [2020-07-07 13:22:29,738 WARN L193 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 482 DAG size of output: 15 [2020-07-07 13:22:29,979 WARN L193 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 542 DAG size of output: 3 [2020-07-07 13:22:30,158 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 283 DAG size of output: 35 [2020-07-07 13:22:30,498 WARN L193 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 293 DAG size of output: 159 [2020-07-07 13:22:30,881 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 91 [2020-07-07 13:22:31,516 WARN L193 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 671 DAG size of output: 7 [2020-07-07 13:22:32,207 WARN L193 SmtUtils]: Spent 682.00 ms on a formula simplification that was a NOOP. DAG size: 291 [2020-07-07 13:22:32,361 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 298 DAG size of output: 91 [2020-07-07 13:22:32,857 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2020-07-07 13:22:33,095 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 321 DAG size of output: 55 [2020-07-07 13:22:33,280 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 352 DAG size of output: 11 [2020-07-07 13:22:33,659 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 340 DAG size of output: 35 [2020-07-07 13:22:33,880 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 542 DAG size of output: 3 [2020-07-07 13:22:36,798 WARN L193 SmtUtils]: Spent 2.91 s on a formula simplification that was a NOOP. DAG size: 159 [2020-07-07 13:22:39,759 WARN L193 SmtUtils]: Spent 2.89 s on a formula simplification that was a NOOP. DAG size: 161 [2020-07-07 13:22:40,159 WARN L193 SmtUtils]: Spent 398.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-07 13:22:40,502 WARN L193 SmtUtils]: Spent 340.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-07 13:22:43,143 WARN L193 SmtUtils]: Spent 2.57 s on a formula simplification that was a NOOP. DAG size: 159 [2020-07-07 13:22:44,290 WARN L193 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 93 [2020-07-07 13:22:44,449 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-07 13:22:44,635 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-07 13:22:47,199 WARN L193 SmtUtils]: Spent 2.56 s on a formula simplification that was a NOOP. DAG size: 159 [2020-07-07 13:22:47,608 WARN L193 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-07 13:22:48,578 WARN L193 SmtUtils]: Spent 898.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-07 13:22:56,898 WARN L193 SmtUtils]: Spent 8.28 s on a formula simplification that was a NOOP. DAG size: 291 [2020-07-07 13:22:57,817 WARN L193 SmtUtils]: Spent 915.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-07 13:22:57,949 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-07 13:22:58,117 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-07 13:22:59,048 WARN L193 SmtUtils]: Spent 898.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-07 13:23:01,936 WARN L193 SmtUtils]: Spent 2.88 s on a formula simplification that was a NOOP. DAG size: 161 [2020-07-07 13:23:02,277 WARN L193 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-07 13:23:03,453 WARN L193 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 93 [2020-07-07 13:23:03,790 WARN L193 SmtUtils]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-07 13:23:03,925 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-07 13:23:03,960 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-07 13:23:03,960 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-07 13:23:03,961 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-07 13:23:03,961 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-07 13:23:03,961 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-07 13:23:03,961 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-07 13:23:03,961 INFO L264 CegarLoopResult]: At program point L126(line 126) the Hoare annotation is: (= 1 main_~lk8~0) [2020-07-07 13:23:03,961 INFO L264 CegarLoopResult]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2020-07-07 13:23:03,962 INFO L271 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-07-07 13:23:03,962 INFO L264 CegarLoopResult]: At program point L60-1(lines 33 130) the Hoare annotation is: (let ((.cse0 (= 0 main_~p2~0)) (.cse1 (= 0 main_~p1~0)) (.cse3 (= 1 main_~lk2~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse3 .cse1) (and .cse3 .cse2))) [2020-07-07 13:23:03,962 INFO L271 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: true [2020-07-07 13:23:03,962 INFO L271 CegarLoopResult]: At program point L27-2(line 27) the Hoare annotation is: true [2020-07-07 13:23:03,962 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 4 135) the Hoare annotation is: true [2020-07-07 13:23:03,964 INFO L264 CegarLoopResult]: At program point L85(line 85) the Hoare annotation is: (let ((.cse1 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p2~0)) (.cse11 (= 1 main_~lk6~0)) (.cse12 (= 0 main_~p3~0)) (.cse0 (= main_~lk7~0 1)) (.cse5 (= 0 main_~p1~0)) (.cse6 (= 1 main_~lk5~0)) (.cse13 (= 0 main_~p7~0)) (.cse7 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk3~0)) (.cse8 (= 0 main_~p5~0)) (.cse4 (= 0 main_~p6~0)) (.cse9 (= 1 main_~lk1~0)) (.cse10 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse3 .cse8 .cse4 .cse9 .cse10) (and .cse11 .cse12 .cse7 .cse0 .cse1 .cse8 .cse5) (and .cse11 .cse7 .cse0 .cse1 .cse3 .cse8 .cse9) (and .cse13 .cse12 .cse1 .cse2 .cse4 .cse6 .cse9) (and .cse11 .cse0 .cse2 .cse3 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse9 .cse10) (and .cse12 .cse7 .cse0 .cse1 .cse8 .cse4 .cse5) (and .cse13 .cse12 .cse1 .cse2 .cse8 .cse4 .cse9) (and .cse13 .cse7 .cse1 .cse3 .cse8 .cse4 .cse5) (and .cse11 .cse7 .cse0 .cse3 .cse8 .cse5 .cse10) (and .cse11 .cse13 .cse12 .cse7 .cse1 .cse8 .cse9) (and .cse13 .cse12 .cse7 .cse1 .cse8 .cse4 .cse5) (and .cse13 .cse7 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse11 .cse13 .cse12 .cse2 .cse8 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse6 .cse9) (and .cse11 .cse12 .cse7 .cse0 .cse1 .cse8 .cse9) (and .cse11 .cse13 .cse12 .cse2 .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse7 .cse0 .cse8 .cse5 .cse10) (and .cse13 .cse12 .cse7 .cse8 .cse4 .cse5 .cse10) (and .cse11 .cse13 .cse12 .cse2 .cse6 .cse9 .cse10) (and .cse11 .cse13 .cse12 .cse2 .cse5 .cse6 .cse10) (and .cse11 .cse0 .cse2 .cse3 .cse5 .cse6 .cse10) (and .cse11 .cse12 .cse0 .cse2 .cse5 .cse6 .cse10) (and .cse13 .cse12 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse11 .cse13 .cse7 .cse1 .cse3 .cse5 .cse6) (and .cse13 .cse1 .cse2 .cse3 .cse8 .cse4 .cse5) (and .cse11 .cse0 .cse2 .cse3 .cse8 .cse5 .cse10) (and .cse11 .cse12 .cse0 .cse2 .cse8 .cse5 .cse10) (and .cse11 .cse13 .cse12 .cse7 .cse1 .cse8 .cse5) (and .cse11 .cse12 .cse0 .cse2 .cse6 .cse9 .cse10) (and .cse11 .cse13 .cse7 .cse3 .cse5 .cse6 .cse10) (and .cse7 .cse0 .cse3 .cse8 .cse4 .cse5 .cse10) (and .cse11 .cse7 .cse0 .cse1 .cse3 .cse6 .cse9) (and .cse12 .cse0 .cse1 .cse2 .cse4 .cse6 .cse9) (and .cse11 .cse13 .cse12 .cse7 .cse1 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse3 .cse8 .cse4 .cse9) (and .cse11 .cse12 .cse0 .cse1 .cse2 .cse8 .cse9) (and .cse7 .cse0 .cse1 .cse3 .cse8 .cse4 .cse5) (and .cse7 .cse0 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse13 .cse12 .cse1 .cse2 .cse8 .cse4 .cse5) (and .cse11 .cse13 .cse2 .cse3 .cse6 .cse9 .cse10) (and .cse11 .cse13 .cse7 .cse3 .cse8 .cse5 .cse10) (and .cse11 .cse7 .cse0 .cse3 .cse6 .cse9 .cse10) (and .cse11 .cse13 .cse12 .cse1 .cse2 .cse6 .cse9) (and .cse13 .cse1 .cse2 .cse3 .cse4 .cse6 .cse9) (and .cse11 .cse13 .cse7 .cse3 .cse8 .cse9 .cse10) (and .cse11 .cse7 .cse0 .cse1 .cse3 .cse8 .cse5) (and .cse12 .cse7 .cse0 .cse1 .cse8 .cse4 .cse9) (and .cse13 .cse12 .cse2 .cse8 .cse4 .cse5 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 .cse5) (and .cse11 .cse12 .cse0 .cse2 .cse8 .cse9 .cse10) (and .cse13 .cse12 .cse7 .cse4 .cse6 .cse9 .cse10) (and .cse13 .cse2 .cse3 .cse8 .cse4 .cse5 .cse10) (and .cse13 .cse12 .cse7 .cse1 .cse8 .cse4 .cse9) (and .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse12 .cse0 .cse2 .cse4 .cse6 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse12 .cse7 .cse0 .cse8 .cse4 .cse9 .cse10) (and .cse11 .cse13 .cse12 .cse1 .cse2 .cse8 .cse5) (and .cse13 .cse12 .cse7 .cse1 .cse4 .cse5 .cse6) (and .cse13 .cse7 .cse3 .cse4 .cse6 .cse9 .cse10) (and .cse13 .cse1 .cse2 .cse3 .cse8 .cse4 .cse9) (and .cse13 .cse12 .cse2 .cse4 .cse5 .cse6 .cse10) (and .cse12 .cse0 .cse2 .cse4 .cse5 .cse6 .cse10) (and .cse11 .cse12 .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse5 .cse10) (and .cse11 .cse12 .cse7 .cse0 .cse6 .cse9 .cse10) (and .cse11 .cse7 .cse0 .cse3 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse11 .cse13 .cse1 .cse2 .cse3 .cse8 .cse9) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse6 .cse9) (and .cse12 .cse7 .cse0 .cse4 .cse6 .cse9 .cse10) (and .cse13 .cse7 .cse1 .cse3 .cse8 .cse4 .cse9) (and .cse11 .cse12 .cse7 .cse0 .cse1 .cse6 .cse9) (and .cse13 .cse7 .cse1 .cse3 .cse4 .cse6 .cse9) (and .cse11 .cse12 .cse7 .cse0 .cse8 .cse9 .cse10) (and .cse13 .cse7 .cse3 .cse8 .cse4 .cse5 .cse10) (and .cse12 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse8 .cse9) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse13 .cse12 .cse7 .cse6 .cse9 .cse10) (and .cse11 .cse13 .cse12 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse13 .cse12 .cse1 .cse2 .cse5 .cse6) (and .cse11 .cse13 .cse2 .cse3 .cse5 .cse6 .cse10) (and .cse11 .cse13 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse12 .cse0 .cse2 .cse8 .cse4 .cse5 .cse10) (and .cse12 .cse7 .cse0 .cse1 .cse4 .cse5 .cse6) (and .cse11 .cse13 .cse2 .cse3 .cse8 .cse9 .cse10) (and .cse13 .cse2 .cse3 .cse4 .cse6 .cse9 .cse10) (and .cse11 .cse0 .cse2 .cse3 .cse6 .cse9 .cse10) (and .cse11 .cse12 .cse0 .cse1 .cse2 .cse8 .cse5) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9 .cse10) (and .cse11 .cse13 .cse12 .cse1 .cse2 .cse8 .cse9) (and .cse11 .cse7 .cse0 .cse1 .cse3 .cse5 .cse6) (and .cse7 .cse0 .cse3 .cse4 .cse6 .cse9 .cse10) (and .cse11 .cse13 .cse7 .cse3 .cse6 .cse9 .cse10) (and .cse12 .cse0 .cse2 .cse8 .cse4 .cse9 .cse10) (and .cse13 .cse12 .cse7 .cse4 .cse5 .cse6 .cse10) (and .cse11 .cse13 .cse12 .cse7 .cse1 .cse6 .cse9) (and .cse11 .cse13 .cse7 .cse1 .cse3 .cse6 .cse9) (and .cse13 .cse12 .cse7 .cse1 .cse4 .cse6 .cse9) (and .cse13 .cse7 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse11 .cse12 .cse0 .cse1 .cse2 .cse5 .cse6) (and .cse11 .cse13 .cse1 .cse2 .cse3 .cse6 .cse9) (and .cse13 .cse2 .cse3 .cse8 .cse4 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse9) (and .cse11 .cse13 .cse2 .cse3 .cse8 .cse5 .cse10) (and .cse11 .cse13 .cse12 .cse7 .cse8 .cse5 .cse10) (and .cse12 .cse7 .cse0 .cse4 .cse5 .cse6 .cse10) (and .cse13 .cse12 .cse2 .cse8 .cse4 .cse9 .cse10) (and .cse13 .cse12 .cse2 .cse4 .cse6 .cse9 .cse10) (and .cse11 .cse12 .cse7 .cse0 .cse1 .cse5 .cse6) (and .cse11 .cse13 .cse1 .cse2 .cse3 .cse8 .cse5) (and .cse12 .cse0 .cse1 .cse2 .cse8 .cse4 .cse9) (and .cse13 .cse12 .cse7 .cse8 .cse4 .cse9 .cse10) (and .cse12 .cse7 .cse0 .cse1 .cse4 .cse6 .cse9) (and .cse11 .cse13 .cse7 .cse1 .cse3 .cse8 .cse5) (and .cse11 .cse13 .cse7 .cse1 .cse3 .cse8 .cse9) (and .cse12 .cse7 .cse0 .cse8 .cse4 .cse5 .cse10) (and .cse11 .cse13 .cse12 .cse7 .cse5 .cse6 .cse10) (and .cse13 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse11 .cse7 .cse0 .cse3 .cse5 .cse6 .cse10) (and .cse12 .cse0 .cse1 .cse2 .cse8 .cse4 .cse5) (and .cse11 .cse12 .cse7 .cse0 .cse5 .cse6 .cse10) (and .cse13 .cse7 .cse3 .cse8 .cse4 .cse9 .cse10))) [2020-07-07 13:23:03,965 INFO L271 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: true [2020-07-07 13:23:03,965 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-07 13:23:03,966 INFO L264 CegarLoopResult]: At program point L77(line 77) the Hoare annotation is: (let ((.cse1 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk5~0)) (.cse5 (= 0 main_~p3~0)) (.cse9 (= 0 main_~p1~0)) (.cse7 (= 0 main_~p2~0)) (.cse2 (= 1 main_~lk3~0)) (.cse6 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk1~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse4) (and .cse5 .cse7 .cse3 .cse4 .cse8) (and .cse7 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse5 .cse7 .cse9 .cse3 .cse8) (and .cse1 .cse7 .cse2 .cse6 .cse4) (and .cse7 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse9 .cse3) (and .cse0 .cse2 .cse6 .cse4 .cse8) (and .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse9 .cse3 .cse8) (and .cse5 .cse7 .cse6 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse5 .cse1 .cse7 .cse6 .cse4) (and .cse0 .cse2 .cse6 .cse9 .cse8) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse9 .cse3) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse6 .cse4 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse8) (and .cse7 .cse2 .cse6 .cse9 .cse8) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse1 .cse7 .cse9 .cse3) (and .cse5 .cse0 .cse6 .cse9 .cse8) (and .cse0 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse6 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse9) (and .cse5 .cse0 .cse3 .cse4 .cse8) (and .cse5 .cse7 .cse6 .cse9 .cse8) (and .cse7 .cse2 .cse6 .cse4 .cse8))) [2020-07-07 13:23:03,966 INFO L264 CegarLoopResult]: At program point L110-1(lines 33 130) the Hoare annotation is: (let ((.cse1 (= 0 main_~p6~0)) (.cse0 (= 1 main_~lk7~0)) (.cse2 (= 0 main_~p8~0)) (.cse3 (= 1 main_~lk6~0)) (.cse4 (= 0 main_~p7~0)) (.cse5 (= 1 main_~lk8~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse4 .cse1 .cse2) (and .cse5 .cse0 .cse1) (and .cse3 .cse5 .cse0) (and .cse4 .cse5 .cse1) (and .cse3 .cse0 .cse2) (and .cse3 .cse4 .cse5))) [2020-07-07 13:23:03,966 INFO L271 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: true [2020-07-07 13:23:03,966 INFO L264 CegarLoopResult]: At program point L102(line 102) the Hoare annotation is: (let ((.cse9 (= 0 main_~p5~0)) (.cse6 (= 1 main_~lk6~0)) (.cse7 (= 0 main_~p7~0)) (.cse8 (= 0 main_~p4~0)) (.cse3 (= 0 main_~p8~0)) (.cse10 (= 1 main_~lk8~0)) (.cse0 (= 1 main_~lk7~0)) (.cse1 (= 1 main_~lk3~0)) (.cse2 (= 0 main_~p6~0)) (.cse4 (= 1 main_~lk5~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse1 .cse3 .cse4) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse7 .cse1 .cse9 .cse2 .cse3 .cse5) (and .cse6 .cse10 .cse0 .cse8 .cse1 .cse9) (and .cse6 .cse7 .cse10 .cse1 .cse4 .cse5) (and .cse6 .cse10 .cse0 .cse8 .cse1 .cse4) (and .cse0 .cse8 .cse1 .cse9 .cse2 .cse3) (and .cse6 .cse7 .cse8 .cse1 .cse9 .cse3) (and .cse6 .cse10 .cse0 .cse1 .cse4 .cse5) (and .cse6 .cse7 .cse10 .cse1 .cse9 .cse5) (and .cse6 .cse7 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5) (and .cse6 .cse7 .cse10 .cse8 .cse1 .cse9) (and .cse10 .cse0 .cse8 .cse1 .cse2 .cse4) (and .cse7 .cse10 .cse8 .cse1 .cse2 .cse4) (and .cse6 .cse10 .cse0 .cse1 .cse9 .cse5) (and .cse10 .cse0 .cse8 .cse1 .cse9 .cse2) (and .cse6 .cse7 .cse1 .cse9 .cse3 .cse5) (and .cse6 .cse0 .cse8 .cse1 .cse9 .cse3) (and .cse6 .cse0 .cse1 .cse9 .cse3 .cse5) (and .cse7 .cse10 .cse8 .cse1 .cse9 .cse2) (and .cse7 .cse10 .cse1 .cse9 .cse2 .cse5) (and .cse10 .cse0 .cse1 .cse9 .cse2 .cse5) (and .cse7 .cse8 .cse1 .cse9 .cse2 .cse3) (and .cse6 .cse7 .cse10 .cse8 .cse1 .cse4) (and .cse6 .cse0 .cse8 .cse1 .cse3 .cse4) (and .cse7 .cse10 .cse1 .cse2 .cse4 .cse5) (and .cse7 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse7 .cse8 .cse1 .cse2 .cse3 .cse4) (and .cse10 .cse0 .cse1 .cse2 .cse4 .cse5))) [2020-07-07 13:23:03,967 INFO L264 CegarLoopResult]: At program point L69(line 69) the Hoare annotation is: (let ((.cse5 (= 0 main_~p1~0)) (.cse3 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse4 (= 0 main_~p2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse4 .cse1 .cse5) (and .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse5) (and .cse3 .cse0 .cse5) (and .cse3 .cse0 .cse2) (and .cse4 .cse1 .cse2))) [2020-07-07 13:23:03,967 INFO L264 CegarLoopResult]: At program point L127(line 127) the Hoare annotation is: (= 1 main_~lk8~0) [2020-07-07 13:23:03,967 INFO L264 CegarLoopResult]: At program point L61(line 61) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-07 13:23:03,967 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-07-07 13:23:03,967 INFO L264 CegarLoopResult]: At program point L111(line 111) the Hoare annotation is: (let ((.cse5 (= 1 main_~lk8~0)) (.cse1 (= 0 main_~p6~0)) (.cse0 (= 0 main_~p7~0)) (.cse4 (= 1 main_~lk6~0)) (.cse6 (= 1 main_~lk7~0)) (.cse2 (= 0 main_~p8~0)) (.cse3 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse3) (and .cse4 .cse5 .cse6 .cse3) (and .cse5 .cse6 .cse1 .cse3) (and .cse6 .cse1 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse4 .cse6 .cse2 .cse3))) [2020-07-07 13:23:03,967 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-07-07 13:23:03,968 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-07-07 13:23:03,968 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-07-07 13:23:03,968 INFO L264 CegarLoopResult]: At program point L95-1(lines 33 130) the Hoare annotation is: (let ((.cse4 (= 0 main_~p8~0)) (.cse0 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p7~0)) (.cse8 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p4~0)) (.cse10 (= 0 main_~p5~0)) (.cse9 (= 1 main_~lk8~0)) (.cse6 (= 1 main_~lk7~0)) (.cse3 (= 1 main_~lk3~0)) (.cse7 (= 0 main_~p6~0)) (.cse5 (= 1 main_~lk5~0)) (.cse11 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse9 .cse6 .cse2 .cse5) (and .cse1 .cse3 .cse10 .cse7 .cse4 .cse11) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse10) (and .cse0 .cse1 .cse8 .cse2 .cse10 .cse4) (and .cse0 .cse1 .cse9 .cse3 .cse5 .cse11) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse5) (and .cse0 .cse8 .cse9 .cse6 .cse10 .cse11) (and .cse6 .cse2 .cse3 .cse10 .cse7 .cse4) (and .cse8 .cse9 .cse6 .cse2 .cse7 .cse5) (and .cse0 .cse8 .cse6 .cse4 .cse5 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse11) (and .cse0 .cse8 .cse9 .cse6 .cse2 .cse10) (and .cse0 .cse1 .cse8 .cse9 .cse5 .cse11) (and .cse9 .cse6 .cse2 .cse3 .cse7 .cse5) (and .cse1 .cse9 .cse2 .cse3 .cse7 .cse5) (and .cse0 .cse1 .cse8 .cse2 .cse4 .cse5) (and .cse0 .cse1 .cse8 .cse4 .cse5 .cse11) (and .cse1 .cse8 .cse7 .cse4 .cse5 .cse11) (and .cse0 .cse6 .cse3 .cse10 .cse4 .cse11) (and .cse1 .cse8 .cse9 .cse2 .cse10 .cse7) (and .cse1 .cse9 .cse2 .cse3 .cse10 .cse7) (and .cse9 .cse6 .cse3 .cse10 .cse7 .cse11) (and .cse1 .cse2 .cse3 .cse10 .cse7 .cse4) (and .cse1 .cse8 .cse9 .cse10 .cse7 .cse11) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5) (and .cse1 .cse8 .cse9 .cse7 .cse5 .cse11) (and .cse1 .cse9 .cse3 .cse7 .cse5 .cse11) (and .cse1 .cse3 .cse7 .cse4 .cse5 .cse11) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse6 .cse3 .cse7 .cse4 .cse5 .cse11) (and .cse0 .cse6 .cse3 .cse4 .cse5 .cse11) (and .cse8 .cse6 .cse7 .cse4 .cse5 .cse11) (and .cse0 .cse1 .cse8 .cse10 .cse4 .cse11) (and .cse8 .cse6 .cse2 .cse7 .cse4 .cse5) (and .cse1 .cse8 .cse2 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse6 .cse2 .cse10 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4) (and .cse8 .cse6 .cse2 .cse10 .cse7 .cse4) (and .cse0 .cse9 .cse6 .cse3 .cse5 .cse11) (and .cse0 .cse1 .cse9 .cse3 .cse10 .cse11) (and .cse6 .cse3 .cse10 .cse7 .cse4 .cse11) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse10) (and .cse0 .cse8 .cse6 .cse2 .cse4 .cse5) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse9 .cse6 .cse3 .cse10 .cse11) (and .cse9 .cse6 .cse2 .cse3 .cse10 .cse7) (and .cse8 .cse9 .cse6 .cse10 .cse7 .cse11) (and .cse0 .cse8 .cse6 .cse10 .cse4 .cse11) (and .cse8 .cse9 .cse6 .cse2 .cse10 .cse7) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse11) (and .cse0 .cse6 .cse2 .cse3 .cse10 .cse4) (and .cse8 .cse9 .cse6 .cse7 .cse5 .cse11) (and .cse1 .cse9 .cse3 .cse10 .cse7 .cse11) (and .cse0 .cse8 .cse9 .cse6 .cse5 .cse11) (and .cse0 .cse1 .cse8 .cse9 .cse2 .cse5) (and .cse1 .cse8 .cse10 .cse7 .cse4 .cse11) (and .cse8 .cse6 .cse10 .cse7 .cse4 .cse11) (and .cse1 .cse8 .cse2 .cse10 .cse7 .cse4) (and .cse1 .cse8 .cse9 .cse2 .cse7 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse8 .cse9 .cse2 .cse10) (and .cse9 .cse6 .cse3 .cse7 .cse5 .cse11))) [2020-07-07 13:23:03,969 INFO L264 CegarLoopResult]: At program point L120-1(lines 33 130) the Hoare annotation is: (or (= 1 main_~lk8~0) (= 0 main_~p8~0)) [2020-07-07 13:23:03,969 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-07-07 13:23:03,969 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-07-07 13:23:03,969 INFO L271 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: true [2020-07-07 13:23:03,969 INFO L264 CegarLoopResult]: At program point L112(line 112) the Hoare annotation is: (let ((.cse5 (= 1 main_~lk8~0)) (.cse1 (= 0 main_~p6~0)) (.cse0 (= 0 main_~p7~0)) (.cse4 (= 1 main_~lk6~0)) (.cse6 (= 1 main_~lk7~0)) (.cse2 (= 0 main_~p8~0)) (.cse3 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse3) (and .cse4 .cse5 .cse6 .cse3) (and .cse5 .cse6 .cse1 .cse3) (and .cse6 .cse1 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse4 .cse6 .cse2 .cse3))) [2020-07-07 13:23:03,969 INFO L271 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: true [2020-07-07 13:23:03,970 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-07-07 13:23:03,970 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 4 135) the Hoare annotation is: true [2020-07-07 13:23:03,970 INFO L271 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: true [2020-07-07 13:23:03,971 INFO L264 CegarLoopResult]: At program point L96(line 96) the Hoare annotation is: (let ((.cse9 (= 0 main_~p7~0)) (.cse6 (= 0 main_~p8~0)) (.cse7 (= 1 main_~lk6~0)) (.cse8 (= 0 main_~p3~0)) (.cse12 (= 1 main_~lk5~0)) (.cse11 (= 1 main_~lk4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse10 (= 1 main_~lk8~0)) (.cse1 (= 1 main_~lk7~0)) (.cse2 (= 0 main_~p4~0)) (.cse3 (= 1 main_~lk3~0)) (.cse4 (= 0 main_~p5~0)) (.cse5 (= 0 main_~p6~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse4 .cse6) (and .cse9 .cse0 .cse10 .cse3 .cse4 .cse5 .cse11) (and .cse9 .cse8 .cse0 .cse4 .cse5 .cse6 .cse11) (and .cse8 .cse0 .cse1 .cse5 .cse6 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse4 .cse6 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse9 .cse0 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse2 .cse4) (and .cse7 .cse9 .cse0 .cse10 .cse3 .cse4 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse6 .cse11) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse6 .cse12) (and .cse7 .cse0 .cse10 .cse1 .cse3 .cse4 .cse11) (and .cse7 .cse9 .cse0 .cse10 .cse2 .cse3 .cse4) (and .cse9 .cse0 .cse10 .cse2 .cse3 .cse5 .cse12) (and .cse7 .cse0 .cse10 .cse1 .cse2 .cse3 .cse12) (and .cse0 .cse10 .cse1 .cse3 .cse4 .cse5 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse2 .cse4) (and .cse7 .cse9 .cse8 .cse0 .cse2 .cse6 .cse12) (and .cse7 .cse9 .cse0 .cse3 .cse6 .cse12 .cse11) (and .cse7 .cse8 .cse0 .cse1 .cse6 .cse12 .cse11) (and .cse8 .cse0 .cse10 .cse1 .cse4 .cse5 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse12 .cse11) (and .cse9 .cse0 .cse3 .cse5 .cse6 .cse12 .cse11) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse5 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse9 .cse8 .cse0 .cse6 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse2 .cse4 .cse6) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse2 .cse12) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse4 .cse11) (and .cse7 .cse9 .cse0 .cse10 .cse2 .cse3 .cse12) (and .cse9 .cse8 .cse0 .cse2 .cse5 .cse6 .cse12) (and .cse7 .cse9 .cse0 .cse2 .cse3 .cse6 .cse12) (and .cse7 .cse0 .cse10 .cse1 .cse3 .cse12 .cse11) (and .cse7 .cse0 .cse10 .cse1 .cse2 .cse3 .cse4) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse12 .cse11) (and .cse9 .cse8 .cse0 .cse10 .cse5 .cse12 .cse11) (and .cse9 .cse0 .cse2 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse9 .cse0 .cse10 .cse3 .cse12 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse6 .cse12 .cse11) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse12 .cse11) (and .cse9 .cse8 .cse0 .cse10 .cse2 .cse5 .cse12) (and .cse8 .cse0 .cse1 .cse4 .cse5 .cse6 .cse11) (and .cse8 .cse0 .cse10 .cse1 .cse2 .cse4 .cse5) (and .cse7 .cse8 .cse0 .cse1 .cse4 .cse6 .cse11) (and .cse8 .cse0 .cse1 .cse2 .cse5 .cse6 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse6 .cse12) (and .cse9 .cse8 .cse0 .cse2 .cse4 .cse5 .cse6) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse9 .cse0 .cse3 .cse4 .cse6 .cse11) (and .cse9 .cse8 .cse0 .cse10 .cse2 .cse4 .cse5) (and .cse8 .cse0 .cse10 .cse1 .cse2 .cse5 .cse12) (and .cse9 .cse8 .cse0 .cse5 .cse6 .cse12 .cse11) (and .cse7 .cse9 .cse0 .cse2 .cse3 .cse4 .cse6) (and .cse9 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse8 .cse0 .cse10 .cse4 .cse5 .cse11) (and .cse9 .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse10 .cse1 .cse5 .cse12 .cse11) (and .cse9 .cse0 .cse10 .cse3 .cse5 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse4 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse2 .cse12) (and .cse0 .cse10 .cse1 .cse3 .cse5 .cse12 .cse11) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse4 .cse5))) [2020-07-07 13:23:03,971 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) the Hoare annotation is: false [2020-07-07 13:23:03,971 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 135) the Hoare annotation is: true [2020-07-07 13:23:03,971 INFO L264 CegarLoopResult]: At program point L121(line 121) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk7~0))) (or (and .cse0 (= 0 main_~p8~0)) (and (= 1 main_~lk8~0) .cse0))) [2020-07-07 13:23:03,971 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-07-07 13:23:03,973 INFO L264 CegarLoopResult]: At program point L80-1(lines 33 130) the Hoare annotation is: (let ((.cse1 (= 0 main_~p3~0)) (.cse5 (= 1 main_~lk5~0)) (.cse2 (= 0 main_~p4~0)) (.cse0 (= 0 main_~p7~0)) (.cse13 (= 1 main_~lk2~0)) (.cse4 (= 0 main_~p6~0)) (.cse6 (= 1 main_~lk1~0)) (.cse9 (= 1 main_~lk6~0)) (.cse7 (= 1 main_~lk7~0)) (.cse3 (= 0 main_~p2~0)) (.cse10 (= 1 main_~lk3~0)) (.cse8 (= 0 main_~p5~0)) (.cse12 (= 0 main_~p1~0)) (.cse11 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse7 .cse2 .cse3 .cse8 .cse4 .cse6) (and .cse9 .cse7 .cse3 .cse10 .cse5 .cse6 .cse11) (and .cse1 .cse7 .cse2 .cse3 .cse8 .cse4 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 .cse6) (and .cse7 .cse2 .cse3 .cse10 .cse8 .cse4 .cse12) (and .cse0 .cse13 .cse2 .cse10 .cse8 .cse4 .cse12) (and .cse9 .cse13 .cse7 .cse10 .cse8 .cse6 .cse11) (and .cse9 .cse1 .cse7 .cse3 .cse5 .cse6 .cse11) (and .cse9 .cse0 .cse1 .cse13 .cse2 .cse8 .cse6) (and .cse13 .cse7 .cse10 .cse4 .cse12 .cse5 .cse11) (and .cse0 .cse1 .cse13 .cse2 .cse8 .cse4 .cse12) (and .cse0 .cse13 .cse10 .cse4 .cse12 .cse5 .cse11) (and .cse1 .cse7 .cse2 .cse3 .cse4 .cse12 .cse5) (and .cse13 .cse7 .cse2 .cse10 .cse4 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse3 .cse8 .cse12 .cse11) (and .cse9 .cse0 .cse1 .cse3 .cse8 .cse6 .cse11) (and .cse0 .cse1 .cse13 .cse8 .cse4 .cse12 .cse11) (and .cse9 .cse0 .cse1 .cse3 .cse5 .cse6 .cse11) (and .cse9 .cse0 .cse1 .cse3 .cse12 .cse5 .cse11) (and .cse13 .cse7 .cse10 .cse8 .cse4 .cse6 .cse11) (and .cse9 .cse1 .cse13 .cse7 .cse2 .cse8 .cse6) (and .cse9 .cse7 .cse2 .cse3 .cse10 .cse12 .cse5) (and .cse1 .cse7 .cse3 .cse8 .cse4 .cse6 .cse11) (and .cse9 .cse0 .cse13 .cse2 .cse10 .cse12 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse5) (and .cse9 .cse1 .cse13 .cse7 .cse2 .cse12 .cse5) (and .cse9 .cse1 .cse13 .cse7 .cse12 .cse5 .cse11) (and .cse0 .cse2 .cse3 .cse10 .cse8 .cse4 .cse12) (and .cse1 .cse7 .cse3 .cse8 .cse4 .cse12 .cse11) (and .cse9 .cse0 .cse13 .cse10 .cse12 .cse5 .cse11) (and .cse9 .cse1 .cse7 .cse3 .cse8 .cse6 .cse11) (and .cse1 .cse13 .cse7 .cse2 .cse8 .cse4 .cse12) (and .cse9 .cse0 .cse1 .cse13 .cse2 .cse8 .cse12) (and .cse9 .cse0 .cse1 .cse13 .cse2 .cse12 .cse5) (and .cse1 .cse13 .cse7 .cse2 .cse4 .cse5 .cse6) (and .cse1 .cse13 .cse7 .cse2 .cse4 .cse12 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 .cse12) (and .cse9 .cse0 .cse3 .cse10 .cse5 .cse6 .cse11) (and .cse9 .cse0 .cse13 .cse10 .cse8 .cse12 .cse11) (and .cse1 .cse7 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse4 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse9 .cse0 .cse13 .cse10 .cse8 .cse6 .cse11) (and .cse9 .cse1 .cse13 .cse7 .cse2 .cse5 .cse6) (and .cse9 .cse13 .cse7 .cse10 .cse8 .cse12 .cse11) (and .cse9 .cse7 .cse2 .cse3 .cse10 .cse8 .cse12) (and .cse0 .cse1 .cse3 .cse8 .cse4 .cse12 .cse11) (and .cse0 .cse3 .cse10 .cse8 .cse4 .cse12 .cse11) (and .cse0 .cse1 .cse13 .cse4 .cse5 .cse6 .cse11) (and .cse9 .cse1 .cse7 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse13 .cse2 .cse8 .cse4 .cse6) (and .cse0 .cse3 .cse10 .cse4 .cse12 .cse5 .cse11) (and .cse9 .cse1 .cse7 .cse3 .cse12 .cse5 .cse11) (and .cse7 .cse2 .cse3 .cse10 .cse4 .cse5 .cse6) (and .cse9 .cse13 .cse7 .cse2 .cse10 .cse12 .cse5) (and .cse13 .cse7 .cse10 .cse8 .cse4 .cse12 .cse11) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse8 .cse12) (and .cse0 .cse1 .cse13 .cse2 .cse4 .cse12 .cse5) (and .cse0 .cse13 .cse10 .cse4 .cse5 .cse6 .cse11) (and .cse9 .cse1 .cse7 .cse2 .cse3 .cse12 .cse5) (and .cse9 .cse1 .cse7 .cse2 .cse3 .cse8 .cse12) (and .cse9 .cse1 .cse13 .cse7 .cse2 .cse8 .cse12) (and .cse0 .cse2 .cse3 .cse10 .cse8 .cse4 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse12 .cse5 .cse11) (and .cse9 .cse13 .cse7 .cse10 .cse12 .cse5 .cse11) (and .cse13 .cse7 .cse10 .cse4 .cse5 .cse6 .cse11) (and .cse9 .cse1 .cse13 .cse7 .cse5 .cse6 .cse11) (and .cse7 .cse3 .cse10 .cse8 .cse4 .cse12 .cse11) (and .cse9 .cse1 .cse7 .cse3 .cse8 .cse12 .cse11) (and .cse9 .cse7 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse9 .cse0 .cse2 .cse3 .cse10 .cse8 .cse6) (and .cse0 .cse13 .cse2 .cse10 .cse8 .cse4 .cse6) (and .cse1 .cse13 .cse7 .cse8 .cse4 .cse6 .cse11) (and .cse0 .cse13 .cse2 .cse10 .cse4 .cse5 .cse6) (and .cse0 .cse13 .cse10 .cse8 .cse4 .cse12 .cse11) (and .cse9 .cse0 .cse1 .cse13 .cse5 .cse6 .cse11) (and .cse9 .cse0 .cse1 .cse13 .cse8 .cse6 .cse11) (and .cse7 .cse3 .cse10 .cse4 .cse12 .cse5 .cse11) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse12 .cse5) (and .cse9 .cse1 .cse7 .cse2 .cse3 .cse8 .cse6) (and .cse9 .cse0 .cse3 .cse10 .cse12 .cse5 .cse11) (and .cse9 .cse1 .cse13 .cse7 .cse8 .cse12 .cse11) (and .cse9 .cse13 .cse7 .cse2 .cse10 .cse8 .cse6) (and .cse9 .cse0 .cse2 .cse3 .cse10 .cse12 .cse5) (and .cse7 .cse2 .cse3 .cse10 .cse4 .cse12 .cse5) (and .cse9 .cse0 .cse3 .cse10 .cse8 .cse6 .cse11) (and .cse0 .cse3 .cse10 .cse4 .cse5 .cse6 .cse11) (and .cse1 .cse13 .cse7 .cse8 .cse4 .cse12 .cse11) (and .cse13 .cse7 .cse2 .cse10 .cse8 .cse4 .cse6) (and .cse7 .cse2 .cse3 .cse10 .cse8 .cse4 .cse6) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse8 .cse6) (and .cse9 .cse7 .cse3 .cse10 .cse8 .cse6 .cse11) (and .cse9 .cse0 .cse13 .cse10 .cse5 .cse6 .cse11) (and .cse9 .cse7 .cse2 .cse3 .cse10 .cse8 .cse6) (and .cse0 .cse1 .cse13 .cse4 .cse12 .cse5 .cse11) (and .cse9 .cse0 .cse1 .cse13 .cse2 .cse5 .cse6) (and .cse9 .cse0 .cse13 .cse2 .cse10 .cse5 .cse6) (and .cse0 .cse1 .cse13 .cse2 .cse4 .cse5 .cse6) (and .cse0 .cse13 .cse2 .cse10 .cse4 .cse12 .cse5) (and .cse1 .cse7 .cse3 .cse4 .cse12 .cse5 .cse11) (and .cse0 .cse3 .cse10 .cse8 .cse4 .cse6 .cse11) (and .cse9 .cse0 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse7 .cse3 .cse10 .cse8 .cse4 .cse6 .cse11) (and .cse13 .cse7 .cse2 .cse10 .cse4 .cse12 .cse5) (and .cse9 .cse0 .cse3 .cse10 .cse8 .cse12 .cse11) (and .cse9 .cse7 .cse3 .cse10 .cse12 .cse5 .cse11) (and .cse9 .cse0 .cse1 .cse13 .cse8 .cse12 .cse11) (and .cse1 .cse13 .cse7 .cse4 .cse12 .cse5 .cse11) (and .cse1 .cse7 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse1 .cse13 .cse7 .cse2 .cse8 .cse4 .cse6) (and .cse0 .cse1 .cse3 .cse8 .cse4 .cse6 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse9 .cse13 .cse7 .cse2 .cse10 .cse8 .cse12) (and .cse9 .cse0 .cse2 .cse3 .cse10 .cse8 .cse12) (and .cse9 .cse13 .cse7 .cse10 .cse5 .cse6 .cse11) (and .cse7 .cse3 .cse10 .cse4 .cse5 .cse6 .cse11) (and .cse0 .cse1 .cse13 .cse8 .cse4 .cse6 .cse11) (and .cse9 .cse1 .cse13 .cse7 .cse8 .cse6 .cse11) (and .cse9 .cse0 .cse13 .cse2 .cse10 .cse8 .cse12) (and .cse1 .cse13 .cse7 .cse4 .cse5 .cse6 .cse11) (and .cse9 .cse0 .cse13 .cse2 .cse10 .cse8 .cse6) (and .cse9 .cse13 .cse7 .cse2 .cse10 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse4 .cse12 .cse5) (and .cse9 .cse0 .cse1 .cse13 .cse12 .cse5 .cse11) (and .cse13 .cse7 .cse2 .cse10 .cse8 .cse4 .cse12) (and .cse0 .cse13 .cse10 .cse8 .cse4 .cse6 .cse11) (and .cse9 .cse7 .cse3 .cse10 .cse8 .cse12 .cse11))) [2020-07-07 13:23:03,973 INFO L264 CegarLoopResult]: At program point L105-1(lines 33 130) the Hoare annotation is: (let ((.cse6 (= 0 main_~p5~0)) (.cse0 (= 0 main_~p7~0)) (.cse7 (= 1 main_~lk8~0)) (.cse1 (= 0 main_~p6~0)) (.cse4 (= 1 main_~lk6~0)) (.cse5 (= 1 main_~lk7~0)) (.cse2 (= 0 main_~p8~0)) (.cse3 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse2) (and .cse7 .cse5 .cse1 .cse3) (and .cse5 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse6 .cse2) (and .cse5 .cse6 .cse1 .cse2) (and .cse4 .cse0 .cse7 .cse6) (and .cse0 .cse6 .cse1 .cse2) (and .cse4 .cse7 .cse5 .cse6) (and .cse4 .cse0 .cse7 .cse3) (and .cse4 .cse7 .cse5 .cse3) (and .cse0 .cse7 .cse6 .cse1) (and .cse4 .cse0 .cse2 .cse3) (and .cse7 .cse5 .cse6 .cse1) (and .cse0 .cse7 .cse1 .cse3) (and .cse4 .cse5 .cse2 .cse3))) [2020-07-07 13:23:03,973 INFO L264 CegarLoopResult]: At program point L72-1(lines 33 130) the Hoare annotation is: (let ((.cse1 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk5~0)) (.cse5 (= 0 main_~p3~0)) (.cse9 (= 0 main_~p1~0)) (.cse7 (= 0 main_~p2~0)) (.cse2 (= 1 main_~lk3~0)) (.cse6 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk1~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse4) (and .cse5 .cse7 .cse3 .cse4 .cse8) (and .cse7 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse5 .cse7 .cse9 .cse3 .cse8) (and .cse1 .cse7 .cse2 .cse6 .cse4) (and .cse7 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse9 .cse3) (and .cse0 .cse2 .cse6 .cse4 .cse8) (and .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse9 .cse3 .cse8) (and .cse5 .cse7 .cse6 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse5 .cse1 .cse7 .cse6 .cse4) (and .cse0 .cse2 .cse6 .cse9 .cse8) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse9 .cse3) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse6 .cse4 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse8) (and .cse7 .cse2 .cse6 .cse9 .cse8) (and .cse5 .cse1 .cse7 .cse9 .cse3) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse6 .cse9 .cse8) (and .cse0 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse6 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse9) (and .cse5 .cse0 .cse3 .cse4 .cse8) (and .cse5 .cse7 .cse6 .cse9 .cse8) (and .cse7 .cse2 .cse6 .cse4 .cse8))) [2020-07-07 13:23:03,974 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-07 13:23:03,974 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-07-07 13:23:03,974 INFO L264 CegarLoopResult]: At program point L97(line 97) the Hoare annotation is: (let ((.cse9 (= 0 main_~p7~0)) (.cse6 (= 0 main_~p8~0)) (.cse7 (= 1 main_~lk6~0)) (.cse8 (= 0 main_~p3~0)) (.cse12 (= 1 main_~lk5~0)) (.cse11 (= 1 main_~lk4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse10 (= 1 main_~lk8~0)) (.cse1 (= 1 main_~lk7~0)) (.cse2 (= 0 main_~p4~0)) (.cse3 (= 1 main_~lk3~0)) (.cse4 (= 0 main_~p5~0)) (.cse5 (= 0 main_~p6~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse4 .cse6) (and .cse9 .cse0 .cse10 .cse3 .cse4 .cse5 .cse11) (and .cse9 .cse8 .cse0 .cse4 .cse5 .cse6 .cse11) (and .cse8 .cse0 .cse1 .cse5 .cse6 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse4 .cse6 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse9 .cse0 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse2 .cse4) (and .cse7 .cse9 .cse0 .cse10 .cse3 .cse4 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse6 .cse11) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse6 .cse12) (and .cse7 .cse0 .cse10 .cse1 .cse3 .cse4 .cse11) (and .cse7 .cse9 .cse0 .cse10 .cse2 .cse3 .cse4) (and .cse9 .cse0 .cse10 .cse2 .cse3 .cse5 .cse12) (and .cse7 .cse0 .cse10 .cse1 .cse2 .cse3 .cse12) (and .cse0 .cse10 .cse1 .cse3 .cse4 .cse5 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse2 .cse4) (and .cse7 .cse9 .cse8 .cse0 .cse2 .cse6 .cse12) (and .cse7 .cse9 .cse0 .cse3 .cse6 .cse12 .cse11) (and .cse7 .cse8 .cse0 .cse1 .cse6 .cse12 .cse11) (and .cse8 .cse0 .cse10 .cse1 .cse4 .cse5 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse12 .cse11) (and .cse9 .cse0 .cse3 .cse5 .cse6 .cse12 .cse11) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse5 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse9 .cse8 .cse0 .cse6 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse2 .cse4 .cse6) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse2 .cse12) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse4 .cse11) (and .cse7 .cse9 .cse0 .cse10 .cse2 .cse3 .cse12) (and .cse9 .cse8 .cse0 .cse2 .cse5 .cse6 .cse12) (and .cse7 .cse9 .cse0 .cse2 .cse3 .cse6 .cse12) (and .cse7 .cse0 .cse10 .cse1 .cse3 .cse12 .cse11) (and .cse7 .cse0 .cse10 .cse1 .cse2 .cse3 .cse4) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse12 .cse11) (and .cse9 .cse8 .cse0 .cse10 .cse5 .cse12 .cse11) (and .cse9 .cse0 .cse2 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse9 .cse0 .cse10 .cse3 .cse12 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse6 .cse12 .cse11) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse12 .cse11) (and .cse9 .cse8 .cse0 .cse10 .cse2 .cse5 .cse12) (and .cse8 .cse0 .cse1 .cse4 .cse5 .cse6 .cse11) (and .cse8 .cse0 .cse10 .cse1 .cse2 .cse4 .cse5) (and .cse7 .cse8 .cse0 .cse1 .cse4 .cse6 .cse11) (and .cse8 .cse0 .cse1 .cse2 .cse5 .cse6 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse6 .cse12) (and .cse9 .cse8 .cse0 .cse2 .cse4 .cse5 .cse6) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse9 .cse0 .cse3 .cse4 .cse6 .cse11) (and .cse9 .cse8 .cse0 .cse10 .cse2 .cse4 .cse5) (and .cse8 .cse0 .cse10 .cse1 .cse2 .cse5 .cse12) (and .cse9 .cse8 .cse0 .cse5 .cse6 .cse12 .cse11) (and .cse7 .cse9 .cse0 .cse2 .cse3 .cse4 .cse6) (and .cse9 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse8 .cse0 .cse10 .cse4 .cse5 .cse11) (and .cse9 .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse10 .cse1 .cse5 .cse12 .cse11) (and .cse9 .cse0 .cse10 .cse3 .cse5 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse4 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse2 .cse12) (and .cse0 .cse10 .cse1 .cse3 .cse5 .cse12 .cse11) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse4 .cse5))) [2020-07-07 13:23:03,974 INFO L271 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-07-07 13:23:03,975 INFO L264 CegarLoopResult]: At program point L64-1(lines 33 130) the Hoare annotation is: (let ((.cse5 (= 0 main_~p1~0)) (.cse3 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse4 (= 0 main_~p2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse4 .cse1 .cse5) (and .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse5) (and .cse3 .cse0 .cse5) (and .cse3 .cse0 .cse2) (and .cse4 .cse1 .cse2))) [2020-07-07 13:23:03,975 INFO L264 CegarLoopResult]: At program point L122(line 122) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk7~0))) (or (and .cse0 (= 0 main_~p8~0)) (and (= 1 main_~lk8~0) .cse0))) [2020-07-07 13:23:03,975 INFO L271 CegarLoopResult]: At program point L56(lines 56 58) the Hoare annotation is: true [2020-07-07 13:23:03,975 INFO L264 CegarLoopResult]: At program point L56-2(lines 33 130) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-07 13:23:03,976 INFO L264 CegarLoopResult]: At program point L81(line 81) the Hoare annotation is: (let ((.cse6 (= 0 main_~p2~0)) (.cse10 (= 1 main_~lk3~0)) (.cse11 (= 1 main_~lk6~0)) (.cse2 (= 0 main_~p5~0)) (.cse9 (= 0 main_~p4~0)) (.cse8 (= 1 main_~lk1~0)) (.cse0 (= 0 main_~p3~0)) (.cse1 (= 1 main_~lk2~0)) (.cse3 (= 0 main_~p6~0)) (.cse4 (= 0 main_~p1~0)) (.cse7 (= 1 main_~lk5~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse3 .cse7 .cse8 .cse5) (and .cse0 .cse9 .cse6 .cse3 .cse4 .cse7) (and .cse9 .cse6 .cse10 .cse2 .cse3 .cse8) (and .cse6 .cse10 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse4 .cse7 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse4 .cse7) (and .cse11 .cse0 .cse9 .cse6 .cse2 .cse4) (and .cse6 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse8 .cse5) (and .cse1 .cse10 .cse3 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse6 .cse2 .cse4 .cse5) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse4) (and .cse1 .cse9 .cse10 .cse2 .cse3 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse2 .cse3 .cse4) (and .cse11 .cse1 .cse9 .cse10 .cse7 .cse8) (and .cse11 .cse1 .cse10 .cse2 .cse4 .cse5) (and .cse11 .cse0 .cse6 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse6 .cse7 .cse8 .cse5) (and .cse1 .cse9 .cse10 .cse3 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse6 .cse10 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse7 .cse8 .cse5) (and .cse1 .cse10 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse6 .cse2 .cse8 .cse5) (and .cse6 .cse10 .cse3 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse6 .cse3 .cse7 .cse8) (and .cse11 .cse1 .cse9 .cse10 .cse2 .cse4) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse4) (and .cse11 .cse6 .cse10 .cse2 .cse4 .cse5) (and .cse9 .cse6 .cse10 .cse3 .cse4 .cse7) (and .cse11 .cse1 .cse10 .cse4 .cse7 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse11 .cse6 .cse10 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse2 .cse8) (and .cse9 .cse6 .cse10 .cse3 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse7 .cse8) (and .cse11 .cse1 .cse10 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse9 .cse4 .cse7) (and .cse11 .cse1 .cse10 .cse2 .cse8 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse4 .cse7) (and .cse11 .cse9 .cse6 .cse10 .cse4 .cse7) (and .cse11 .cse9 .cse6 .cse10 .cse7 .cse8) (and .cse11 .cse6 .cse10 .cse2 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse8) (and .cse6 .cse10 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse2 .cse8) (and .cse0 .cse6 .cse3 .cse4 .cse7 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse8) (and .cse0 .cse1 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse9 .cse6 .cse10 .cse2 .cse4) (and .cse11 .cse9 .cse6 .cse10 .cse2 .cse8) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse7) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4) (and .cse11 .cse0 .cse1 .cse2 .cse8 .cse5) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse8) (and .cse1 .cse10 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse6 .cse10 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse0 .cse1 .cse9 .cse3 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse7 .cse5))) [2020-07-07 13:23:03,976 INFO L271 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: true [2020-07-07 13:23:03,976 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-07 13:23:03,976 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-07-07 13:23:03,976 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-07-07 13:23:03,977 INFO L264 CegarLoopResult]: At program point L106(line 106) the Hoare annotation is: (let ((.cse2 (= 1 main_~lk7~0)) (.cse6 (= 0 main_~p6~0)) (.cse7 (= 0 main_~p8~0)) (.cse8 (= 1 main_~lk5~0)) (.cse0 (= 1 main_~lk6~0)) (.cse5 (= 0 main_~p7~0)) (.cse1 (= 1 main_~lk8~0)) (.cse3 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse3 .cse6 .cse7 .cse4) (and .cse0 .cse1 .cse2 .cse8 .cse4) (and .cse5 .cse1 .cse3 .cse6 .cse4) (and .cse1 .cse2 .cse6 .cse8 .cse4) (and .cse2 .cse3 .cse6 .cse7 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse4) (and .cse1 .cse2 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse7 .cse8 .cse4) (and .cse5 .cse1 .cse6 .cse8 .cse4) (and .cse0 .cse2 .cse3 .cse7 .cse4) (and .cse0 .cse5 .cse3 .cse7 .cse4) (and .cse2 .cse6 .cse7 .cse8 .cse4) (and .cse0 .cse5 .cse1 .cse8 .cse4) (and .cse0 .cse5 .cse7 .cse8 .cse4) (and .cse0 .cse5 .cse1 .cse3 .cse4))) [2020-07-07 13:23:03,977 INFO L264 CegarLoopResult]: At program point L73(line 73) the Hoare annotation is: (let ((.cse7 (= 0 main_~p2~0)) (.cse4 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p1~0)) (.cse5 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse6 (= 1 main_~lk1~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6) (and .cse7 .cse1 .cse6 .cse3) (and .cse5 .cse7 .cse1 .cse6) (and .cse4 .cse0 .cse6 .cse3) (and .cse4 .cse7 .cse6 .cse3) (and .cse7 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse7 .cse6) (and .cse5 .cse7 .cse1 .cse2) (and .cse4 .cse0 .cse5 .cse2) (and .cse4 .cse5 .cse7 .cse2) (and .cse4 .cse7 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2) (and .cse0 .cse5 .cse1 .cse6) (and .cse0 .cse1 .cse6 .cse3))) [2020-07-07 13:23:03,977 INFO L271 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: true [2020-07-07 13:23:03,977 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-07-07 13:23:03,977 INFO L271 CegarLoopResult]: At program point L131(lines 5 135) the Hoare annotation is: true [2020-07-07 13:23:03,978 INFO L264 CegarLoopResult]: At program point L65(line 65) the Hoare annotation is: (let ((.cse0 (= 0 main_~p2~0)) (.cse1 (= 0 main_~p1~0)) (.cse3 (= 1 main_~lk2~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse3 .cse1) (and .cse3 .cse2))) [2020-07-07 13:23:03,978 INFO L271 CegarLoopResult]: At program point L57(line 57) the Hoare annotation is: true [2020-07-07 13:23:03,979 INFO L264 CegarLoopResult]: At program point L90-1(lines 33 130) the Hoare annotation is: (let ((.cse7 (= 1 main_~lk6~0)) (.cse12 (= 1 main_~lk5~0)) (.cse9 (= 0 main_~p7~0)) (.cse0 (= 1 main_~lk2~0)) (.cse10 (= 1 main_~lk8~0)) (.cse2 (= 0 main_~p4~0)) (.cse3 (= 1 main_~lk3~0)) (.cse8 (= 0 main_~p3~0)) (.cse1 (= 1 main_~lk7~0)) (.cse13 (= 0 main_~p2~0)) (.cse4 (= 0 main_~p5~0)) (.cse5 (= 0 main_~p6~0)) (.cse6 (= 0 main_~p8~0)) (.cse11 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse4 .cse6) (and .cse9 .cse0 .cse10 .cse3 .cse4 .cse5 .cse11) (and .cse8 .cse0 .cse1 .cse5 .cse6 .cse12 .cse11) (and .cse8 .cse10 .cse1 .cse13 .cse4 .cse5 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse9 .cse8 .cse10 .cse13 .cse5 .cse12 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse6 .cse11) (and .cse7 .cse9 .cse0 .cse10 .cse3 .cse4 .cse11) (and .cse7 .cse0 .cse10 .cse1 .cse3 .cse4 .cse11) (and .cse0 .cse10 .cse1 .cse3 .cse4 .cse5 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse2 .cse4) (and .cse9 .cse8 .cse2 .cse13 .cse5 .cse6 .cse12) (and .cse7 .cse9 .cse8 .cse0 .cse2 .cse6 .cse12) (and .cse9 .cse10 .cse13 .cse3 .cse5 .cse12 .cse11) (and .cse7 .cse9 .cse0 .cse3 .cse6 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse10 .cse13 .cse4 .cse11) (and .cse8 .cse0 .cse10 .cse1 .cse4 .cse5 .cse11) (and .cse7 .cse8 .cse10 .cse1 .cse13 .cse4 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse12 .cse11) (and .cse9 .cse0 .cse3 .cse5 .cse6 .cse12 .cse11) (and .cse1 .cse13 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse5 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse9 .cse8 .cse0 .cse2 .cse4 .cse6) (and .cse8 .cse1 .cse13 .cse5 .cse6 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse6 .cse12 .cse11) (and .cse7 .cse8 .cse1 .cse2 .cse13 .cse6 .cse12) (and .cse7 .cse9 .cse10 .cse13 .cse3 .cse12 .cse11) (and .cse8 .cse1 .cse2 .cse13 .cse5 .cse6 .cse12) (and .cse7 .cse9 .cse0 .cse2 .cse3 .cse6 .cse12) (and .cse7 .cse0 .cse10 .cse1 .cse2 .cse3 .cse4) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse12 .cse11) (and .cse9 .cse8 .cse0 .cse10 .cse5 .cse12 .cse11) (and .cse9 .cse0 .cse2 .cse3 .cse5 .cse6 .cse12) (and .cse8 .cse1 .cse2 .cse13 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse3 .cse6 .cse12 .cse11) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse12 .cse11) (and .cse8 .cse0 .cse1 .cse4 .cse5 .cse6 .cse11) (and .cse8 .cse0 .cse10 .cse1 .cse2 .cse4 .cse5) (and .cse7 .cse8 .cse1 .cse13 .cse6 .cse12 .cse11) (and .cse7 .cse1 .cse2 .cse13 .cse3 .cse6 .cse12) (and .cse7 .cse9 .cse10 .cse2 .cse13 .cse3 .cse12) (and .cse7 .cse9 .cse8 .cse13 .cse4 .cse6 .cse11) (and .cse7 .cse8 .cse0 .cse1 .cse4 .cse6 .cse11) (and .cse9 .cse10 .cse2 .cse13 .cse3 .cse5 .cse12) (and .cse7 .cse9 .cse10 .cse13 .cse3 .cse4 .cse11) (and .cse7 .cse10 .cse1 .cse2 .cse13 .cse3 .cse4) (and .cse7 .cse1 .cse2 .cse13 .cse3 .cse4 .cse6) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse9 .cse0 .cse3 .cse4 .cse6 .cse11) (and .cse8 .cse0 .cse10 .cse1 .cse2 .cse5 .cse12) (and .cse7 .cse9 .cse10 .cse2 .cse13 .cse3 .cse4) (and .cse1 .cse13 .cse3 .cse5 .cse6 .cse12 .cse11) (and .cse9 .cse8 .cse0 .cse10 .cse4 .cse5 .cse11) (and .cse9 .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse10 .cse1 .cse5 .cse12 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse4 .cse11) (and .cse7 .cse9 .cse8 .cse13 .cse6 .cse12 .cse11) (and .cse0 .cse10 .cse1 .cse3 .cse5 .cse12 .cse11) (and .cse7 .cse8 .cse1 .cse13 .cse4 .cse6 .cse11) (and .cse7 .cse9 .cse2 .cse13 .cse3 .cse4 .cse6) (and .cse9 .cse8 .cse0 .cse4 .cse5 .cse6 .cse11) (and .cse9 .cse8 .cse13 .cse5 .cse6 .cse12 .cse11) (and .cse7 .cse8 .cse10 .cse1 .cse2 .cse13 .cse12) (and .cse7 .cse9 .cse8 .cse0 .cse4 .cse6 .cse11) (and .cse9 .cse13 .cse3 .cse5 .cse6 .cse12 .cse11) (and .cse9 .cse0 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse2 .cse4) (and .cse10 .cse1 .cse13 .cse3 .cse4 .cse5 .cse11) (and .cse1 .cse2 .cse13 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse6 .cse12) (and .cse7 .cse9 .cse13 .cse3 .cse6 .cse12 .cse11) (and .cse7 .cse9 .cse0 .cse10 .cse2 .cse3 .cse4) (and .cse9 .cse0 .cse10 .cse2 .cse3 .cse5 .cse12) (and .cse7 .cse8 .cse10 .cse1 .cse13 .cse12 .cse11) (and .cse10 .cse1 .cse2 .cse13 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse10 .cse1 .cse2 .cse3 .cse12) (and .cse7 .cse1 .cse13 .cse3 .cse4 .cse6 .cse11) (and .cse7 .cse8 .cse10 .cse1 .cse2 .cse13 .cse4) (and .cse7 .cse8 .cse1 .cse2 .cse13 .cse4 .cse6) (and .cse7 .cse8 .cse0 .cse1 .cse6 .cse12 .cse11) (and .cse8 .cse10 .cse1 .cse2 .cse13 .cse5 .cse12) (and .cse7 .cse10 .cse1 .cse13 .cse3 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse2 .cse12) (and .cse9 .cse8 .cse2 .cse13 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse4 .cse11) (and .cse7 .cse9 .cse0 .cse10 .cse2 .cse3 .cse12) (and .cse7 .cse9 .cse13 .cse3 .cse4 .cse6 .cse11) (and .cse9 .cse8 .cse0 .cse2 .cse5 .cse6 .cse12) (and .cse7 .cse0 .cse10 .cse1 .cse3 .cse12 .cse11) (and .cse9 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse9 .cse0 .cse10 .cse3 .cse12 .cse11) (and .cse9 .cse8 .cse0 .cse10 .cse2 .cse5 .cse12) (and .cse7 .cse9 .cse8 .cse2 .cse13 .cse4 .cse6) (and .cse10 .cse1 .cse2 .cse13 .cse3 .cse5 .cse12) (and .cse9 .cse8 .cse10 .cse13 .cse4 .cse5 .cse11) (and .cse9 .cse8 .cse10 .cse2 .cse13 .cse5 .cse12) (and .cse8 .cse10 .cse1 .cse2 .cse13 .cse4 .cse5) (and .cse7 .cse9 .cse8 .cse2 .cse13 .cse6 .cse12) (and .cse7 .cse9 .cse8 .cse10 .cse13 .cse12 .cse11) (and .cse7 .cse10 .cse1 .cse2 .cse13 .cse3 .cse12) (and .cse7 .cse10 .cse1 .cse13 .cse3 .cse4 .cse11) (and .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse9 .cse8 .cse10 .cse2 .cse13 .cse4) (and .cse8 .cse0 .cse1 .cse2 .cse5 .cse6 .cse12) (and .cse9 .cse13 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse6 .cse12) (and .cse10 .cse1 .cse13 .cse3 .cse5 .cse12 .cse11) (and .cse7 .cse1 .cse13 .cse3 .cse6 .cse12 .cse11) (and .cse9 .cse10 .cse2 .cse13 .cse3 .cse4 .cse5) (and .cse9 .cse8 .cse0 .cse2 .cse4 .cse5 .cse6) (and .cse9 .cse8 .cse13 .cse4 .cse5 .cse6 .cse11) (and .cse9 .cse10 .cse13 .cse3 .cse4 .cse5 .cse11) (and .cse9 .cse8 .cse0 .cse10 .cse2 .cse4 .cse5) (and .cse9 .cse8 .cse0 .cse5 .cse6 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse10 .cse2 .cse13 .cse12) (and .cse8 .cse10 .cse1 .cse13 .cse5 .cse12 .cse11) (and .cse7 .cse9 .cse0 .cse2 .cse3 .cse4 .cse6) (and .cse9 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse2 .cse13 .cse3 .cse5 .cse6 .cse12) (and .cse9 .cse0 .cse10 .cse3 .cse5 .cse12 .cse11) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse2 .cse12) (and .cse7 .cse9 .cse2 .cse13 .cse3 .cse6 .cse12) (and .cse9 .cse8 .cse10 .cse2 .cse13 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse8 .cse1 .cse13 .cse4 .cse5 .cse6 .cse11))) [2020-07-07 13:23:03,979 INFO L271 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-07-07 13:23:03,980 INFO L271 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: true [2020-07-07 13:23:03,980 INFO L271 CegarLoopResult]: At program point L24-2(line 24) the Hoare annotation is: true [2020-07-07 13:23:03,980 INFO L264 CegarLoopResult]: At program point L115-1(lines 33 130) the Hoare annotation is: (let ((.cse1 (= 0 main_~p8~0)) (.cse2 (= 1 main_~lk7~0)) (.cse0 (= 0 main_~p7~0)) (.cse3 (= 1 main_~lk8~0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse3 .cse2) (and .cse0 .cse3))) [2020-07-07 13:23:03,980 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-07 13:23:03,980 INFO L264 CegarLoopResult]: At program point L107(line 107) the Hoare annotation is: (let ((.cse2 (= 1 main_~lk7~0)) (.cse6 (= 0 main_~p6~0)) (.cse7 (= 0 main_~p8~0)) (.cse8 (= 1 main_~lk5~0)) (.cse0 (= 1 main_~lk6~0)) (.cse5 (= 0 main_~p7~0)) (.cse1 (= 1 main_~lk8~0)) (.cse3 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse3 .cse6 .cse7 .cse4) (and .cse0 .cse1 .cse2 .cse8 .cse4) (and .cse5 .cse1 .cse3 .cse6 .cse4) (and .cse1 .cse2 .cse6 .cse8 .cse4) (and .cse2 .cse3 .cse6 .cse7 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse4) (and .cse1 .cse2 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse7 .cse8 .cse4) (and .cse5 .cse1 .cse6 .cse8 .cse4) (and .cse0 .cse2 .cse3 .cse7 .cse4) (and .cse0 .cse5 .cse3 .cse7 .cse4) (and .cse2 .cse6 .cse7 .cse8 .cse4) (and .cse0 .cse5 .cse1 .cse8 .cse4) (and .cse0 .cse5 .cse7 .cse8 .cse4) (and .cse0 .cse5 .cse1 .cse3 .cse4))) [2020-07-07 13:23:03,982 INFO L264 CegarLoopResult]: At program point L91(line 91) the Hoare annotation is: (let ((.cse4 (= 1 main_~lk8~0)) (.cse0 (= 1 main_~lk6~0)) (.cse12 (= 0 main_~p7~0)) (.cse8 (= 0 main_~p4~0)) (.cse1 (= 0 main_~p3~0)) (.cse13 (= 1 main_~lk5~0)) (.cse2 (= 1 main_~lk2~0)) (.cse3 (= main_~lk7~0 1)) (.cse9 (= 0 main_~p2~0)) (.cse10 (= 1 main_~lk3~0)) (.cse5 (= 0 main_~p5~0)) (.cse11 (= 0 main_~p6~0)) (.cse14 (= 0 main_~p8~0)) (.cse6 (= 1 main_~lk1~0)) (.cse7 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 .cse4 .cse8 .cse9 .cse10 .cse5 .cse11 .cse6) (and .cse12 .cse2 .cse4 .cse10 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse4 .cse10 .cse5 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse10 .cse13 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse10 .cse5 .cse6 .cse7) (and .cse0 .cse12 .cse4 .cse9 .cse10 .cse5 .cse6 .cse7) (and .cse12 .cse4 .cse9 .cse10 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse8 .cse10 .cse13 .cse6) (and .cse3 .cse4 .cse9 .cse10 .cse5 .cse11 .cse6 .cse7) (and .cse12 .cse2 .cse4 .cse8 .cse10 .cse11 .cse13 .cse6) (and .cse0 .cse12 .cse1 .cse2 .cse4 .cse8 .cse13 .cse6) (and .cse0 .cse12 .cse2 .cse4 .cse10 .cse13 .cse6 .cse7) (and .cse0 .cse3 .cse4 .cse8 .cse9 .cse10 .cse13 .cse6) (and .cse12 .cse1 .cse8 .cse9 .cse5 .cse11 .cse14 .cse6) (and .cse0 .cse12 .cse4 .cse8 .cse9 .cse10 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse3 .cse4 .cse8 .cse9 .cse10 .cse5 .cse6) (and .cse12 .cse1 .cse2 .cse4 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse12 .cse4 .cse9 .cse10 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse13 .cse6) (and .cse0 .cse12 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7) (and .cse12 .cse1 .cse2 .cse8 .cse11 .cse14 .cse13 .cse6) (and .cse12 .cse8 .cse9 .cse10 .cse11 .cse14 .cse13 .cse6) (and .cse12 .cse1 .cse2 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse8 .cse5 .cse14 .cse6) (and .cse12 .cse1 .cse2 .cse4 .cse8 .cse11 .cse13 .cse6) (and .cse0 .cse3 .cse4 .cse9 .cse10 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse14 .cse6 .cse7) (and .cse1 .cse3 .cse4 .cse9 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse3 .cse8 .cse9 .cse10 .cse5 .cse14 .cse6) (and .cse0 .cse12 .cse1 .cse8 .cse9 .cse5 .cse14 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse5 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5 .cse14 .cse6) (and .cse0 .cse12 .cse1 .cse4 .cse9 .cse13 .cse6 .cse7) (and .cse12 .cse2 .cse10 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse8 .cse9 .cse10 .cse14 .cse13 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse10 .cse14 .cse13 .cse6) (and .cse0 .cse1 .cse3 .cse9 .cse5 .cse14 .cse6 .cse7) (and .cse12 .cse2 .cse8 .cse10 .cse11 .cse14 .cse13 .cse6) (and .cse1 .cse3 .cse4 .cse8 .cse9 .cse5 .cse11 .cse6) (and .cse12 .cse1 .cse2 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse3 .cse4 .cse8 .cse9 .cse10 .cse11 .cse13 .cse6) (and .cse1 .cse3 .cse4 .cse9 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse8 .cse9 .cse14 .cse13 .cse6) (and .cse1 .cse2 .cse3 .cse8 .cse11 .cse14 .cse13 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse8 .cse11 .cse13 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7) (and .cse3 .cse9 .cse10 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse4 .cse8 .cse9 .cse10 .cse13 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse14 .cse13 .cse6) (and .cse12 .cse1 .cse2 .cse8 .cse5 .cse11 .cse14 .cse6) (and .cse0 .cse1 .cse3 .cse8 .cse9 .cse14 .cse13 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse10 .cse5 .cse14 .cse6) (and .cse0 .cse1 .cse3 .cse8 .cse9 .cse5 .cse14 .cse6) (and .cse0 .cse3 .cse9 .cse10 .cse14 .cse13 .cse6 .cse7) (and .cse2 .cse3 .cse4 .cse10 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse9 .cse10 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse4 .cse8 .cse5 .cse6) (and .cse12 .cse1 .cse4 .cse9 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse10 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse4 .cse8 .cse10 .cse5 .cse6) (and .cse0 .cse12 .cse1 .cse2 .cse14 .cse13 .cse6 .cse7) (and .cse12 .cse9 .cse10 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse8 .cse5 .cse11 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse13 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse3 .cse8 .cse9 .cse10 .cse14 .cse13 .cse6) (and .cse1 .cse3 .cse4 .cse8 .cse9 .cse11 .cse13 .cse6) (and .cse2 .cse3 .cse4 .cse8 .cse10 .cse11 .cse13 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse10 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse4 .cse8 .cse9 .cse5 .cse6) (and .cse12 .cse1 .cse4 .cse9 .cse5 .cse11 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse8 .cse5 .cse11 .cse14 .cse6) (and .cse0 .cse12 .cse1 .cse9 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse4 .cse13 .cse6 .cse7) (and .cse12 .cse1 .cse8 .cse9 .cse11 .cse14 .cse13 .cse6) (and .cse12 .cse4 .cse8 .cse9 .cse10 .cse11 .cse13 .cse6) (and .cse1 .cse3 .cse9 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse12 .cse2 .cse4 .cse10 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse8 .cse14 .cse13 .cse6) (and .cse12 .cse1 .cse2 .cse4 .cse8 .cse5 .cse11 .cse6) (and .cse12 .cse4 .cse9 .cse10 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse8 .cse10 .cse14 .cse13 .cse6) (and .cse0 .cse3 .cse4 .cse9 .cse10 .cse5 .cse6 .cse7) (and .cse3 .cse8 .cse9 .cse10 .cse11 .cse14 .cse13 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse9 .cse5 .cse14 .cse6 .cse7) (and .cse1 .cse3 .cse8 .cse9 .cse5 .cse11 .cse14 .cse6) (and .cse3 .cse8 .cse9 .cse10 .cse5 .cse11 .cse14 .cse6) (and .cse2 .cse3 .cse10 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse8 .cse9 .cse13 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse8 .cse10 .cse5 .cse6) (and .cse12 .cse1 .cse9 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse2 .cse3 .cse8 .cse10 .cse5 .cse11 .cse14 .cse6) (and .cse12 .cse1 .cse4 .cse8 .cse9 .cse11 .cse13 .cse6) (and .cse12 .cse1 .cse2 .cse4 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse8 .cse9 .cse10 .cse5 .cse14 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse13 .cse6 .cse7) (and .cse12 .cse2 .cse10 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse12 .cse1 .cse9 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse3 .cse9 .cse10 .cse5 .cse14 .cse6 .cse7) (and .cse12 .cse2 .cse4 .cse8 .cse10 .cse5 .cse11 .cse6) (and .cse12 .cse8 .cse9 .cse10 .cse5 .cse11 .cse14 .cse6) (and .cse0 .cse12 .cse1 .cse4 .cse8 .cse9 .cse13 .cse6) (and .cse0 .cse12 .cse2 .cse8 .cse10 .cse5 .cse14 .cse6) (and .cse12 .cse4 .cse8 .cse9 .cse10 .cse5 .cse11 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse8 .cse9 .cse5 .cse6) (and .cse3 .cse4 .cse9 .cse10 .cse11 .cse13 .cse6 .cse7) (and .cse2 .cse3 .cse4 .cse8 .cse10 .cse5 .cse11 .cse6) (and .cse12 .cse9 .cse10 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse10 .cse14 .cse13 .cse6 .cse7) (and .cse12 .cse1 .cse4 .cse8 .cse9 .cse5 .cse11 .cse6) (and .cse0 .cse12 .cse1 .cse4 .cse9 .cse5 .cse6 .cse7) (and .cse1 .cse3 .cse9 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse4 .cse8 .cse10 .cse13 .cse6) (and .cse2 .cse3 .cse4 .cse10 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse12 .cse9 .cse10 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse9 .cse14 .cse13 .cse6 .cse7) (and .cse1 .cse3 .cse8 .cse9 .cse11 .cse14 .cse13 .cse6) (and .cse12 .cse2 .cse8 .cse10 .cse5 .cse11 .cse14 .cse6) (and .cse2 .cse3 .cse8 .cse10 .cse11 .cse14 .cse13 .cse6) (and .cse1 .cse2 .cse3 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse2 .cse3 .cse10 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse3 .cse9 .cse10 .cse5 .cse11 .cse14 .cse6 .cse7))) [2020-07-07 13:23:03,982 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-07-07 13:23:03,982 INFO L264 CegarLoopResult]: At program point L116(line 116) the Hoare annotation is: (let ((.cse4 (= 1 main_~lk7~0)) (.cse2 (= 0 main_~p8~0)) (.cse0 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p7~0)) (.cse3 (= 1 main_~lk8~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse0 .cse4 .cse2) (and .cse0 .cse1 .cse3))) [2020-07-07 13:23:03,982 INFO L271 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: true [2020-07-07 13:23:03,982 INFO L271 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-07-07 13:23:03,983 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-07-07 13:23:03,983 INFO L271 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: true [2020-07-07 13:23:03,983 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-07-07 13:23:03,983 INFO L264 CegarLoopResult]: At program point L100-1(lines 33 130) the Hoare annotation is: (let ((.cse2 (= 0 main_~p5~0)) (.cse1 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk7~0)) (.cse3 (= 0 main_~p6~0)) (.cse6 (= 1 main_~lk8~0)) (.cse5 (= 1 main_~lk6~0)) (.cse8 (= 0 main_~p7~0)) (.cse4 (= 0 main_~p8~0)) (.cse9 (= 1 main_~lk5~0)) (.cse7 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse0 .cse2 .cse7) (and .cse8 .cse2 .cse3 .cse4 .cse7) (and .cse5 .cse6 .cse0 .cse9 .cse7) (and .cse8 .cse6 .cse2 .cse3 .cse7) (and .cse5 .cse8 .cse6 .cse1 .cse2) (and .cse0 .cse2 .cse3 .cse4 .cse7) (and .cse5 .cse0 .cse1 .cse2 .cse4) (and .cse5 .cse8 .cse1 .cse2 .cse4) (and .cse8 .cse6 .cse1 .cse2 .cse3) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse5 .cse8 .cse1 .cse4 .cse9) (and .cse5 .cse6 .cse0 .cse1 .cse2) (and .cse8 .cse1 .cse2 .cse3 .cse4) (and .cse8 .cse6 .cse3 .cse9 .cse7) (and .cse5 .cse0 .cse2 .cse4 .cse7) (and .cse6 .cse0 .cse1 .cse3 .cse9) (and .cse5 .cse8 .cse6 .cse2 .cse7) (and .cse6 .cse0 .cse3 .cse9 .cse7) (and .cse8 .cse3 .cse4 .cse9 .cse7) (and .cse5 .cse0 .cse1 .cse4 .cse9) (and .cse5 .cse0 .cse4 .cse9 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse9) (and .cse8 .cse1 .cse3 .cse4 .cse9) (and .cse6 .cse0 .cse1 .cse2 .cse3) (and .cse5 .cse8 .cse6 .cse1 .cse9) (and .cse5 .cse6 .cse0 .cse1 .cse9) (and .cse5 .cse8 .cse2 .cse4 .cse7) (and .cse8 .cse6 .cse1 .cse3 .cse9) (and .cse0 .cse3 .cse4 .cse9 .cse7) (and .cse5 .cse8 .cse6 .cse9 .cse7) (and .cse5 .cse8 .cse4 .cse9 .cse7))) [2020-07-07 13:23:03,983 INFO L271 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: true [2020-07-07 13:23:03,983 INFO L271 CegarLoopResult]: At program point L34-1(line 34) the Hoare annotation is: true [2020-07-07 13:23:03,984 INFO L271 CegarLoopResult]: At program point L34-2(line 34) the Hoare annotation is: true [2020-07-07 13:23:03,985 INFO L264 CegarLoopResult]: At program point L92(line 92) the Hoare annotation is: (let ((.cse4 (= 1 main_~lk8~0)) (.cse0 (= 1 main_~lk6~0)) (.cse12 (= 0 main_~p7~0)) (.cse8 (= 0 main_~p4~0)) (.cse1 (= 0 main_~p3~0)) (.cse13 (= 1 main_~lk5~0)) (.cse2 (= 1 main_~lk2~0)) (.cse3 (= main_~lk7~0 1)) (.cse9 (= 0 main_~p2~0)) (.cse10 (= 1 main_~lk3~0)) (.cse5 (= 0 main_~p5~0)) (.cse11 (= 0 main_~p6~0)) (.cse14 (= 0 main_~p8~0)) (.cse6 (= 1 main_~lk1~0)) (.cse7 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 .cse4 .cse8 .cse9 .cse10 .cse5 .cse11 .cse6) (and .cse0 .cse12 .cse2 .cse4 .cse10 .cse5 .cse6 .cse7) (and .cse12 .cse2 .cse4 .cse10 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse10 .cse13 .cse6 .cse7) (and .cse12 .cse4 .cse9 .cse10 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse10 .cse5 .cse6 .cse7) (and .cse0 .cse12 .cse4 .cse9 .cse10 .cse5 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse8 .cse10 .cse13 .cse6) (and .cse3 .cse4 .cse9 .cse10 .cse5 .cse11 .cse6 .cse7) (and .cse12 .cse2 .cse4 .cse8 .cse10 .cse11 .cse13 .cse6) (and .cse0 .cse12 .cse1 .cse2 .cse4 .cse8 .cse13 .cse6) (and .cse0 .cse12 .cse2 .cse4 .cse10 .cse13 .cse6 .cse7) (and .cse0 .cse3 .cse4 .cse8 .cse9 .cse10 .cse13 .cse6) (and .cse12 .cse1 .cse8 .cse9 .cse5 .cse11 .cse14 .cse6) (and .cse0 .cse12 .cse4 .cse8 .cse9 .cse10 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse3 .cse4 .cse8 .cse9 .cse10 .cse5 .cse6) (and .cse12 .cse1 .cse2 .cse4 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse12 .cse4 .cse9 .cse10 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse13 .cse6) (and .cse0 .cse12 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7) (and .cse12 .cse1 .cse2 .cse8 .cse11 .cse14 .cse13 .cse6) (and .cse12 .cse8 .cse9 .cse10 .cse11 .cse14 .cse13 .cse6) (and .cse12 .cse1 .cse2 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse8 .cse5 .cse14 .cse6) (and .cse12 .cse1 .cse2 .cse4 .cse8 .cse11 .cse13 .cse6) (and .cse0 .cse3 .cse4 .cse9 .cse10 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse14 .cse6 .cse7) (and .cse1 .cse3 .cse4 .cse9 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse3 .cse8 .cse9 .cse10 .cse5 .cse14 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse5 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse8 .cse9 .cse5 .cse14 .cse6) (and .cse0 .cse12 .cse1 .cse2 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5 .cse14 .cse6) (and .cse0 .cse12 .cse1 .cse4 .cse9 .cse13 .cse6 .cse7) (and .cse12 .cse2 .cse10 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse8 .cse9 .cse10 .cse14 .cse13 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse10 .cse14 .cse13 .cse6) (and .cse0 .cse1 .cse3 .cse9 .cse5 .cse14 .cse6 .cse7) (and .cse12 .cse2 .cse8 .cse10 .cse11 .cse14 .cse13 .cse6) (and .cse12 .cse1 .cse2 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse1 .cse3 .cse4 .cse8 .cse9 .cse5 .cse11 .cse6) (and .cse3 .cse4 .cse8 .cse9 .cse10 .cse11 .cse13 .cse6) (and .cse1 .cse3 .cse4 .cse9 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse8 .cse9 .cse14 .cse13 .cse6) (and .cse1 .cse2 .cse3 .cse8 .cse11 .cse14 .cse13 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse8 .cse11 .cse13 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7) (and .cse3 .cse9 .cse10 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse4 .cse8 .cse9 .cse10 .cse13 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse14 .cse13 .cse6) (and .cse12 .cse1 .cse2 .cse8 .cse5 .cse11 .cse14 .cse6) (and .cse0 .cse1 .cse3 .cse8 .cse9 .cse14 .cse13 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse10 .cse5 .cse14 .cse6) (and .cse0 .cse1 .cse3 .cse8 .cse9 .cse5 .cse14 .cse6) (and .cse0 .cse3 .cse9 .cse10 .cse14 .cse13 .cse6 .cse7) (and .cse2 .cse3 .cse4 .cse10 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse9 .cse10 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse4 .cse8 .cse5 .cse6) (and .cse12 .cse1 .cse4 .cse9 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse10 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse4 .cse8 .cse10 .cse5 .cse6) (and .cse12 .cse9 .cse10 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse8 .cse5 .cse11 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse13 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse3 .cse8 .cse9 .cse10 .cse14 .cse13 .cse6) (and .cse1 .cse3 .cse4 .cse8 .cse9 .cse11 .cse13 .cse6) (and .cse2 .cse3 .cse4 .cse8 .cse10 .cse11 .cse13 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse10 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse4 .cse8 .cse9 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse8 .cse5 .cse11 .cse14 .cse6) (and .cse12 .cse1 .cse4 .cse9 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse9 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse4 .cse13 .cse6 .cse7) (and .cse12 .cse1 .cse8 .cse9 .cse11 .cse14 .cse13 .cse6) (and .cse12 .cse4 .cse8 .cse9 .cse10 .cse11 .cse13 .cse6) (and .cse1 .cse3 .cse9 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse12 .cse2 .cse4 .cse10 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse8 .cse14 .cse13 .cse6) (and .cse12 .cse1 .cse2 .cse4 .cse8 .cse5 .cse11 .cse6) (and .cse12 .cse4 .cse9 .cse10 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse8 .cse10 .cse14 .cse13 .cse6) (and .cse0 .cse3 .cse4 .cse9 .cse10 .cse5 .cse6 .cse7) (and .cse3 .cse8 .cse9 .cse10 .cse11 .cse14 .cse13 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse9 .cse5 .cse14 .cse6 .cse7) (and .cse1 .cse3 .cse8 .cse9 .cse5 .cse11 .cse14 .cse6) (and .cse3 .cse8 .cse9 .cse10 .cse5 .cse11 .cse14 .cse6) (and .cse2 .cse3 .cse10 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse8 .cse10 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse8 .cse9 .cse13 .cse6) (and .cse12 .cse1 .cse9 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse2 .cse3 .cse8 .cse10 .cse5 .cse11 .cse14 .cse6) (and .cse12 .cse1 .cse4 .cse8 .cse9 .cse11 .cse13 .cse6) (and .cse12 .cse1 .cse2 .cse4 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse8 .cse9 .cse10 .cse5 .cse14 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse13 .cse6 .cse7) (and .cse12 .cse2 .cse10 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse12 .cse1 .cse9 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse3 .cse9 .cse10 .cse5 .cse14 .cse6 .cse7) (and .cse12 .cse2 .cse4 .cse8 .cse10 .cse5 .cse11 .cse6) (and .cse12 .cse8 .cse9 .cse10 .cse5 .cse11 .cse14 .cse6) (and .cse0 .cse12 .cse1 .cse4 .cse8 .cse9 .cse13 .cse6) (and .cse0 .cse12 .cse2 .cse8 .cse10 .cse5 .cse14 .cse6) (and .cse12 .cse4 .cse8 .cse9 .cse10 .cse5 .cse11 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse8 .cse9 .cse5 .cse6) (and .cse3 .cse4 .cse9 .cse10 .cse11 .cse13 .cse6 .cse7) (and .cse2 .cse3 .cse4 .cse8 .cse10 .cse5 .cse11 .cse6) (and .cse12 .cse9 .cse10 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse10 .cse14 .cse13 .cse6 .cse7) (and .cse12 .cse1 .cse4 .cse8 .cse9 .cse5 .cse11 .cse6) (and .cse0 .cse12 .cse1 .cse4 .cse9 .cse5 .cse6 .cse7) (and .cse1 .cse3 .cse9 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse4 .cse8 .cse10 .cse13 .cse6) (and .cse2 .cse3 .cse4 .cse10 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse12 .cse9 .cse10 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse9 .cse14 .cse13 .cse6 .cse7) (and .cse1 .cse3 .cse8 .cse9 .cse11 .cse14 .cse13 .cse6) (and .cse12 .cse2 .cse8 .cse10 .cse5 .cse11 .cse14 .cse6) (and .cse2 .cse3 .cse8 .cse10 .cse11 .cse14 .cse13 .cse6) (and .cse1 .cse2 .cse3 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse2 .cse3 .cse10 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse3 .cse9 .cse10 .cse5 .cse11 .cse14 .cse6 .cse7))) [2020-07-07 13:23:03,985 INFO L271 CegarLoopResult]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2020-07-07 13:23:03,985 INFO L264 CegarLoopResult]: At program point L117(line 117) the Hoare annotation is: (let ((.cse4 (= 1 main_~lk7~0)) (.cse2 (= 0 main_~p8~0)) (.cse0 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p7~0)) (.cse3 (= 1 main_~lk8~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse0 .cse4 .cse2) (and .cse0 .cse1 .cse3))) [2020-07-07 13:23:03,987 INFO L264 CegarLoopResult]: At program point L84-1(lines 33 130) the Hoare annotation is: (let ((.cse4 (= 1 main_~lk8~0)) (.cse12 (= 0 main_~p1~0)) (.cse0 (= 1 main_~lk6~0)) (.cse7 (= 1 main_~lk4~0)) (.cse1 (= 0 main_~p3~0)) (.cse9 (= 0 main_~p2~0)) (.cse8 (= 0 main_~p7~0)) (.cse5 (= 0 main_~p5~0)) (.cse2 (= 1 main_~lk2~0)) (.cse3 (= main_~lk7~0 1)) (.cse13 (= 0 main_~p4~0)) (.cse15 (= 1 main_~lk3~0)) (.cse10 (= 0 main_~p6~0)) (.cse11 (= 0 main_~p8~0)) (.cse14 (= 1 main_~lk5~0)) (.cse6 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse1 .cse9 .cse5 .cse10 .cse11 .cse12 .cse7) (and .cse0 .cse8 .cse1 .cse13 .cse9 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse3 .cse9 .cse5 .cse11 .cse12 .cse7) (and .cse8 .cse13 .cse9 .cse15 .cse10 .cse11 .cse12 .cse14) (and .cse3 .cse4 .cse13 .cse9 .cse15 .cse5 .cse10 .cse6) (and .cse0 .cse3 .cse9 .cse15 .cse11 .cse12 .cse14 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse5 .cse12 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse13 .cse15 .cse14 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse12 .cse7) (and .cse8 .cse2 .cse4 .cse13 .cse15 .cse10 .cse14 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse13 .cse14 .cse6) (and .cse0 .cse2 .cse3 .cse15 .cse11 .cse12 .cse14 .cse7) (and .cse0 .cse3 .cse4 .cse13 .cse9 .cse15 .cse14 .cse6) (and .cse0 .cse8 .cse2 .cse4 .cse15 .cse12 .cse14 .cse7) (and .cse8 .cse4 .cse9 .cse15 .cse10 .cse12 .cse14 .cse7) (and .cse8 .cse1 .cse13 .cse9 .cse5 .cse10 .cse11 .cse6) (and .cse0 .cse8 .cse2 .cse13 .cse15 .cse5 .cse11 .cse12) (and .cse8 .cse13 .cse9 .cse15 .cse5 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse14 .cse6 .cse7) (and .cse3 .cse13 .cse9 .cse15 .cse5 .cse10 .cse11 .cse12) (and .cse8 .cse1 .cse2 .cse4 .cse5 .cse10 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse15 .cse5 .cse11 .cse12 .cse7) (and .cse0 .cse8 .cse4 .cse9 .cse15 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse2 .cse15 .cse5 .cse11 .cse12 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse14 .cse6) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse5 .cse10 .cse11 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse4 .cse13 .cse10 .cse14 .cse6) (and .cse1 .cse3 .cse4 .cse9 .cse10 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse4 .cse13 .cse9 .cse12 .cse14) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse5 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse13 .cse15 .cse11 .cse14 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse13 .cse10 .cse12 .cse14) (and .cse8 .cse2 .cse13 .cse15 .cse10 .cse11 .cse14 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse12 .cse14 .cse7) (and .cse3 .cse4 .cse13 .cse9 .cse15 .cse10 .cse14 .cse6) (and .cse2 .cse3 .cse4 .cse15 .cse10 .cse12 .cse14 .cse7) (and .cse0 .cse8 .cse1 .cse13 .cse9 .cse11 .cse14 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse13 .cse10 .cse14 .cse6) (and .cse3 .cse9 .cse15 .cse10 .cse11 .cse14 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse7) (and .cse0 .cse8 .cse4 .cse13 .cse9 .cse15 .cse14 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse11 .cse14 .cse6) (and .cse8 .cse1 .cse2 .cse13 .cse5 .cse10 .cse11 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse13 .cse15 .cse5 .cse12) (and .cse8 .cse2 .cse4 .cse15 .cse10 .cse12 .cse14 .cse7) (and .cse0 .cse1 .cse3 .cse13 .cse9 .cse11 .cse14 .cse6) (and .cse0 .cse2 .cse3 .cse13 .cse15 .cse5 .cse11 .cse6) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse13 .cse12 .cse14) (and .cse0 .cse3 .cse13 .cse9 .cse15 .cse11 .cse12 .cse14) (and .cse0 .cse8 .cse9 .cse15 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse11 .cse12 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse13 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse11 .cse12 .cse14) (and .cse0 .cse8 .cse2 .cse15 .cse11 .cse14 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse13 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse3 .cse4 .cse13 .cse9 .cse15 .cse12 .cse14) (and .cse0 .cse8 .cse1 .cse2 .cse11 .cse12 .cse14 .cse7) (and .cse0 .cse3 .cse13 .cse9 .cse15 .cse11 .cse14 .cse6) (and .cse1 .cse3 .cse4 .cse13 .cse9 .cse10 .cse14 .cse6) (and .cse0 .cse8 .cse2 .cse4 .cse13 .cse15 .cse5 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse5 .cse6) (and .cse8 .cse1 .cse4 .cse9 .cse5 .cse10 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse13 .cse5 .cse10 .cse11 .cse6) (and .cse2 .cse3 .cse4 .cse13 .cse15 .cse10 .cse12 .cse14) (and .cse1 .cse3 .cse4 .cse13 .cse9 .cse10 .cse12 .cse14) (and .cse8 .cse2 .cse4 .cse15 .cse5 .cse10 .cse12 .cse7) (and .cse0 .cse8 .cse1 .cse4 .cse9 .cse5 .cse12 .cse7) (and .cse1 .cse3 .cse9 .cse10 .cse11 .cse14 .cse6 .cse7) (and .cse8 .cse2 .cse4 .cse15 .cse10 .cse14 .cse6 .cse7) (and .cse8 .cse4 .cse9 .cse15 .cse5 .cse10 .cse12 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse13 .cse11 .cse14 .cse6) (and .cse8 .cse4 .cse9 .cse15 .cse10 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse2 .cse13 .cse15 .cse11 .cse14 .cse6) (and .cse8 .cse1 .cse2 .cse10 .cse11 .cse12 .cse14 .cse7) (and .cse1 .cse3 .cse4 .cse13 .cse9 .cse5 .cse10 .cse12) (and .cse2 .cse3 .cse15 .cse10 .cse11 .cse12 .cse14 .cse7) (and .cse3 .cse13 .cse9 .cse15 .cse10 .cse11 .cse14 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse4 .cse5 .cse10 .cse12 .cse7) (and .cse1 .cse3 .cse13 .cse9 .cse5 .cse10 .cse11 .cse6) (and .cse1 .cse2 .cse3 .cse13 .cse5 .cse10 .cse11 .cse12) (and .cse2 .cse3 .cse15 .cse10 .cse11 .cse14 .cse6 .cse7) (and .cse2 .cse3 .cse13 .cse15 .cse10 .cse11 .cse12 .cse14) (and .cse8 .cse1 .cse4 .cse13 .cse9 .cse10 .cse14 .cse6) (and .cse0 .cse1 .cse3 .cse13 .cse9 .cse11 .cse12 .cse14) (and .cse0 .cse2 .cse3 .cse13 .cse15 .cse11 .cse12 .cse14) (and .cse0 .cse8 .cse13 .cse9 .cse15 .cse5 .cse11 .cse6) (and .cse8 .cse2 .cse15 .cse10 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse3 .cse9 .cse15 .cse5 .cse11 .cse6 .cse7) (and .cse8 .cse1 .cse9 .cse10 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse13 .cse5 .cse11 .cse12) (and .cse8 .cse1 .cse2 .cse5 .cse10 .cse11 .cse12 .cse7) (and .cse1 .cse3 .cse13 .cse9 .cse5 .cse10 .cse11 .cse12) (and .cse0 .cse8 .cse9 .cse15 .cse11 .cse12 .cse14 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse15 .cse5 .cse12 .cse7) (and .cse0 .cse8 .cse2 .cse13 .cse15 .cse5 .cse11 .cse6) (and .cse8 .cse4 .cse13 .cse9 .cse15 .cse5 .cse10 .cse6) (and .cse8 .cse1 .cse13 .cse9 .cse5 .cse10 .cse11 .cse12) (and .cse0 .cse8 .cse1 .cse9 .cse5 .cse11 .cse12 .cse7) (and .cse3 .cse4 .cse9 .cse15 .cse10 .cse14 .cse6 .cse7) (and .cse2 .cse3 .cse4 .cse13 .cse15 .cse5 .cse10 .cse6) (and .cse8 .cse2 .cse13 .cse15 .cse10 .cse11 .cse12 .cse14) (and .cse8 .cse1 .cse2 .cse4 .cse13 .cse5 .cse10 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse13 .cse11 .cse12 .cse14) (and .cse0 .cse8 .cse4 .cse9 .cse15 .cse12 .cse14 .cse7) (and .cse8 .cse2 .cse4 .cse13 .cse15 .cse5 .cse10 .cse12) (and .cse3 .cse13 .cse9 .cse15 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse8 .cse1 .cse4 .cse9 .cse12 .cse14 .cse7) (and .cse8 .cse2 .cse15 .cse10 .cse11 .cse12 .cse14 .cse7) (and .cse0 .cse2 .cse3 .cse13 .cse15 .cse5 .cse11 .cse12) (and .cse0 .cse8 .cse2 .cse4 .cse13 .cse15 .cse14 .cse6) (and .cse3 .cse4 .cse13 .cse9 .cse15 .cse5 .cse10 .cse12) (and .cse8 .cse1 .cse2 .cse13 .cse10 .cse11 .cse12 .cse14) (and .cse1 .cse2 .cse3 .cse10 .cse11 .cse14 .cse6 .cse7) (and .cse2 .cse3 .cse15 .cse5 .cse10 .cse11 .cse6 .cse7) (and .cse3 .cse9 .cse15 .cse5 .cse10 .cse11 .cse6 .cse7) (and .cse8 .cse9 .cse15 .cse5 .cse10 .cse11 .cse12 .cse7) (and .cse0 .cse8 .cse4 .cse13 .cse9 .cse15 .cse5 .cse12) (and .cse0 .cse3 .cse9 .cse15 .cse5 .cse11 .cse12 .cse7) (and .cse8 .cse4 .cse13 .cse9 .cse15 .cse5 .cse10 .cse12) (and .cse8 .cse1 .cse9 .cse10 .cse11 .cse12 .cse14 .cse7) (and .cse1 .cse3 .cse9 .cse10 .cse11 .cse12 .cse14 .cse7) (and .cse1 .cse3 .cse9 .cse5 .cse10 .cse11 .cse12 .cse7) (and .cse0 .cse8 .cse2 .cse4 .cse15 .cse5 .cse6 .cse7) (and .cse8 .cse2 .cse4 .cse15 .cse5 .cse10 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse15 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse12 .cse14 .cse7) (and .cse0 .cse1 .cse3 .cse9 .cse11 .cse12 .cse14 .cse7) (and .cse0 .cse8 .cse9 .cse15 .cse5 .cse11 .cse12 .cse7) (and .cse8 .cse4 .cse9 .cse15 .cse5 .cse10 .cse6 .cse7) (and .cse0 .cse8 .cse4 .cse9 .cse15 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse5 .cse11 .cse12 .cse7) (and .cse3 .cse4 .cse9 .cse15 .cse5 .cse10 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse15 .cse12 .cse14 .cse7) (and .cse8 .cse2 .cse4 .cse13 .cse15 .cse10 .cse12 .cse14) (and .cse2 .cse3 .cse13 .cse15 .cse5 .cse10 .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse12 .cse14 .cse7) (and .cse0 .cse8 .cse2 .cse4 .cse15 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse4 .cse9 .cse15 .cse5 .cse12 .cse7) (and .cse0 .cse8 .cse2 .cse13 .cse15 .cse11 .cse12 .cse14) (and .cse0 .cse8 .cse1 .cse4 .cse13 .cse9 .cse5 .cse12) (and .cse0 .cse8 .cse4 .cse13 .cse9 .cse15 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse12 .cse14) (and .cse0 .cse1 .cse3 .cse4 .cse13 .cse9 .cse5 .cse12) (and .cse0 .cse3 .cse4 .cse13 .cse9 .cse15 .cse5 .cse6) (and .cse8 .cse1 .cse13 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse3 .cse13 .cse9 .cse15 .cse5 .cse11 .cse12) (and .cse8 .cse1 .cse2 .cse13 .cse10 .cse11 .cse14 .cse6) (and .cse8 .cse13 .cse9 .cse15 .cse10 .cse11 .cse14 .cse6) (and .cse0 .cse8 .cse1 .cse2 .cse13 .cse5 .cse11 .cse6) (and .cse0 .cse3 .cse4 .cse9 .cse15 .cse14 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse11 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse13 .cse5 .cse10 .cse12) (and .cse0 .cse3 .cse13 .cse9 .cse15 .cse5 .cse11 .cse6) (and .cse0 .cse8 .cse1 .cse13 .cse9 .cse5 .cse11 .cse6) (and .cse8 .cse2 .cse13 .cse15 .cse5 .cse10 .cse11 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse5 .cse11 .cse6) (and .cse0 .cse8 .cse1 .cse4 .cse9 .cse14 .cse6 .cse7) (and .cse8 .cse2 .cse15 .cse5 .cse10 .cse11 .cse6 .cse7) (and .cse0 .cse8 .cse13 .cse9 .cse15 .cse11 .cse14 .cse6) (and .cse0 .cse1 .cse3 .cse9 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse8 .cse2 .cse4 .cse13 .cse15 .cse12 .cse14) (and .cse3 .cse4 .cse9 .cse15 .cse5 .cse10 .cse12 .cse7) (and .cse3 .cse9 .cse15 .cse10 .cse11 .cse12 .cse14 .cse7) (and .cse1 .cse3 .cse4 .cse13 .cse9 .cse5 .cse10 .cse6) (and .cse8 .cse1 .cse2 .cse10 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse13 .cse9 .cse15 .cse5 .cse11 .cse12) (and .cse1 .cse3 .cse4 .cse9 .cse5 .cse10 .cse6 .cse7) (and .cse3 .cse4 .cse9 .cse15 .cse10 .cse12 .cse14 .cse7) (and .cse1 .cse2 .cse3 .cse13 .cse10 .cse11 .cse14 .cse6) (and .cse3 .cse9 .cse15 .cse5 .cse10 .cse11 .cse12 .cse7) (and .cse8 .cse1 .cse4 .cse9 .cse5 .cse10 .cse12 .cse7) (and .cse0 .cse3 .cse4 .cse9 .cse15 .cse12 .cse14 .cse7) (and .cse2 .cse3 .cse4 .cse13 .cse15 .cse5 .cse10 .cse12) (and .cse0 .cse1 .cse3 .cse13 .cse9 .cse5 .cse11 .cse6) (and .cse0 .cse3 .cse9 .cse15 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse5 .cse12) (and .cse2 .cse3 .cse4 .cse15 .cse10 .cse14 .cse6 .cse7) (and .cse8 .cse1 .cse4 .cse9 .cse10 .cse14 .cse6 .cse7) (and .cse8 .cse1 .cse4 .cse9 .cse10 .cse12 .cse14 .cse7) (and .cse1 .cse3 .cse4 .cse9 .cse10 .cse12 .cse14 .cse7) (and .cse8 .cse1 .cse2 .cse13 .cse5 .cse10 .cse11 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse2 .cse4 .cse13 .cse15 .cse5 .cse6) (and .cse8 .cse9 .cse15 .cse10 .cse11 .cse14 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse13 .cse5 .cse10 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse14 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse5 .cse10 .cse11 .cse6 .cse7) (and .cse2 .cse3 .cse4 .cse13 .cse15 .cse10 .cse14 .cse6) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse13 .cse5 .cse12) (and .cse2 .cse3 .cse4 .cse15 .cse5 .cse10 .cse12 .cse7) (and .cse0 .cse8 .cse2 .cse15 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse15 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse4 .cse13 .cse9 .cse5 .cse6) (and .cse0 .cse8 .cse1 .cse9 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse14 .cse6 .cse7) (and .cse8 .cse4 .cse13 .cse9 .cse15 .cse10 .cse12 .cse14) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse12 .cse14 .cse7) (and .cse1 .cse3 .cse4 .cse9 .cse5 .cse10 .cse12 .cse7) (and .cse8 .cse2 .cse15 .cse5 .cse10 .cse11 .cse12 .cse7) (and .cse8 .cse1 .cse13 .cse9 .cse10 .cse11 .cse14 .cse6) (and .cse8 .cse4 .cse13 .cse9 .cse15 .cse10 .cse14 .cse6) (and .cse1 .cse3 .cse13 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse14 .cse7) (and .cse0 .cse8 .cse4 .cse13 .cse9 .cse15 .cse12 .cse14) (and .cse8 .cse1 .cse4 .cse13 .cse9 .cse10 .cse12 .cse14) (and .cse8 .cse1 .cse2 .cse4 .cse13 .cse5 .cse10 .cse6) (and .cse1 .cse2 .cse3 .cse5 .cse10 .cse11 .cse12 .cse7) (and .cse0 .cse8 .cse2 .cse4 .cse15 .cse5 .cse12 .cse7) (and .cse0 .cse3 .cse4 .cse9 .cse15 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse5 .cse12 .cse7) (and .cse0 .cse8 .cse1 .cse9 .cse5 .cse11 .cse6 .cse7) (and .cse3 .cse13 .cse9 .cse15 .cse5 .cse10 .cse11 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse13 .cse15 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse13 .cse9 .cse14 .cse6) (and .cse8 .cse1 .cse9 .cse5 .cse10 .cse11 .cse6 .cse7) (and .cse2 .cse3 .cse13 .cse15 .cse5 .cse10 .cse11 .cse6) (and .cse0 .cse8 .cse1 .cse13 .cse9 .cse5 .cse11 .cse12) (and .cse8 .cse1 .cse2 .cse4 .cse10 .cse12 .cse14 .cse7) (and .cse3 .cse4 .cse13 .cse9 .cse15 .cse10 .cse12 .cse14) (and .cse8 .cse1 .cse2 .cse4 .cse10 .cse14 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse14 .cse6 .cse7) (and .cse8 .cse2 .cse4 .cse13 .cse15 .cse5 .cse10 .cse6) (and .cse0 .cse3 .cse4 .cse9 .cse15 .cse5 .cse12 .cse7) (and .cse8 .cse13 .cse9 .cse15 .cse5 .cse10 .cse11 .cse6) (and .cse0 .cse8 .cse1 .cse4 .cse13 .cse9 .cse14 .cse6) (and .cse8 .cse9 .cse15 .cse10 .cse11 .cse12 .cse14 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse13 .cse9 .cse12 .cse14) (and .cse8 .cse1 .cse4 .cse13 .cse9 .cse5 .cse10 .cse12) (and .cse0 .cse1 .cse3 .cse4 .cse13 .cse9 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse14 .cse7) (and .cse8 .cse9 .cse15 .cse5 .cse10 .cse11 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse9 .cse11 .cse12 .cse14 .cse7) (and .cse2 .cse3 .cse15 .cse5 .cse10 .cse11 .cse12 .cse7) (and .cse8 .cse1 .cse2 .cse4 .cse13 .cse10 .cse12 .cse14) (and .cse0 .cse2 .cse3 .cse15 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse13 .cse9 .cse5 .cse11 .cse12) (and .cse0 .cse3 .cse4 .cse13 .cse9 .cse15 .cse5 .cse12) (and .cse8 .cse1 .cse4 .cse13 .cse9 .cse5 .cse10 .cse6) (and .cse1 .cse3 .cse9 .cse5 .cse10 .cse11 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse4 .cse9 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse2 .cse15 .cse11 .cse12 .cse14 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse5 .cse11 .cse12) (and .cse2 .cse3 .cse4 .cse15 .cse5 .cse10 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse13 .cse15 .cse12 .cse14) (and .cse0 .cse8 .cse13 .cse9 .cse15 .cse11 .cse12 .cse14) (and .cse0 .cse8 .cse9 .cse15 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse9 .cse11 .cse14 .cse6 .cse7) (and .cse1 .cse3 .cse13 .cse9 .cse10 .cse11 .cse14 .cse6) (and .cse8 .cse2 .cse13 .cse15 .cse5 .cse10 .cse11 .cse6) (and .cse2 .cse3 .cse13 .cse15 .cse10 .cse11 .cse14 .cse6))) [2020-07-07 13:23:03,988 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-07 13:23:03,988 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-07-07 13:23:03,988 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-07-07 13:23:03,989 INFO L264 CegarLoopResult]: At program point L76-1(lines 33 130) the Hoare annotation is: (let ((.cse2 (= 0 main_~p5~0)) (.cse11 (= 1 main_~lk6~0)) (.cse6 (= 0 main_~p2~0)) (.cse10 (= 1 main_~lk3~0)) (.cse9 (= 0 main_~p4~0)) (.cse8 (= 1 main_~lk1~0)) (.cse0 (= 0 main_~p3~0)) (.cse1 (= 1 main_~lk2~0)) (.cse3 (= 0 main_~p6~0)) (.cse4 (= 0 main_~p1~0)) (.cse7 (= 1 main_~lk5~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse3 .cse7 .cse8 .cse5) (and .cse0 .cse9 .cse6 .cse3 .cse4 .cse7) (and .cse9 .cse6 .cse10 .cse2 .cse3 .cse8) (and .cse6 .cse10 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse4 .cse7 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse4 .cse7) (and .cse11 .cse0 .cse9 .cse6 .cse2 .cse4) (and .cse6 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse8 .cse5) (and .cse1 .cse10 .cse3 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse6 .cse2 .cse4 .cse5) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse4) (and .cse1 .cse9 .cse10 .cse2 .cse3 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse2 .cse3 .cse4) (and .cse11 .cse1 .cse10 .cse2 .cse4 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse7 .cse8) (and .cse11 .cse0 .cse6 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse6 .cse7 .cse8 .cse5) (and .cse1 .cse9 .cse10 .cse3 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse6 .cse10 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse7 .cse8 .cse5) (and .cse1 .cse10 .cse3 .cse7 .cse8 .cse5) (and .cse6 .cse10 .cse3 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse6 .cse2 .cse8 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse6 .cse3 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse4) (and .cse11 .cse1 .cse9 .cse10 .cse2 .cse4) (and .cse11 .cse6 .cse10 .cse2 .cse4 .cse5) (and .cse9 .cse6 .cse10 .cse3 .cse4 .cse7) (and .cse11 .cse1 .cse10 .cse4 .cse7 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse11 .cse6 .cse10 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse2 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse7 .cse8) (and .cse9 .cse6 .cse10 .cse3 .cse7 .cse8) (and .cse11 .cse1 .cse10 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse9 .cse4 .cse7) (and .cse11 .cse1 .cse10 .cse2 .cse8 .cse5) (and .cse11 .cse9 .cse6 .cse10 .cse4 .cse7) (and .cse11 .cse0 .cse9 .cse6 .cse4 .cse7) (and .cse11 .cse9 .cse6 .cse10 .cse7 .cse8) (and .cse11 .cse6 .cse10 .cse2 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse8) (and .cse6 .cse10 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse2 .cse8) (and .cse0 .cse6 .cse3 .cse4 .cse7 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse8) (and .cse0 .cse1 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse9 .cse6 .cse10 .cse2 .cse4) (and .cse11 .cse9 .cse6 .cse10 .cse2 .cse8) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse7) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse8) (and .cse11 .cse0 .cse1 .cse2 .cse8 .cse5) (and .cse1 .cse10 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse11 .cse6 .cse10 .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse9 .cse3 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse7 .cse5))) [2020-07-07 13:23:03,989 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-07-07 13:23:03,989 INFO L264 CegarLoopResult]: At program point L134(line 134) the Hoare annotation is: false [2020-07-07 13:23:03,989 INFO L264 CegarLoopResult]: At program point L101(line 101) the Hoare annotation is: (let ((.cse9 (= 0 main_~p5~0)) (.cse6 (= 1 main_~lk6~0)) (.cse7 (= 0 main_~p7~0)) (.cse8 (= 0 main_~p4~0)) (.cse3 (= 0 main_~p8~0)) (.cse10 (= 1 main_~lk8~0)) (.cse0 (= 1 main_~lk7~0)) (.cse1 (= 1 main_~lk3~0)) (.cse2 (= 0 main_~p6~0)) (.cse4 (= 1 main_~lk5~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse1 .cse3 .cse4) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse7 .cse1 .cse9 .cse2 .cse3 .cse5) (and .cse6 .cse10 .cse0 .cse8 .cse1 .cse9) (and .cse6 .cse7 .cse10 .cse1 .cse4 .cse5) (and .cse6 .cse10 .cse0 .cse8 .cse1 .cse4) (and .cse0 .cse8 .cse1 .cse9 .cse2 .cse3) (and .cse6 .cse7 .cse8 .cse1 .cse9 .cse3) (and .cse6 .cse10 .cse0 .cse1 .cse4 .cse5) (and .cse6 .cse7 .cse10 .cse1 .cse9 .cse5) (and .cse6 .cse7 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5) (and .cse6 .cse7 .cse10 .cse8 .cse1 .cse9) (and .cse10 .cse0 .cse8 .cse1 .cse2 .cse4) (and .cse7 .cse10 .cse8 .cse1 .cse2 .cse4) (and .cse6 .cse10 .cse0 .cse1 .cse9 .cse5) (and .cse10 .cse0 .cse8 .cse1 .cse9 .cse2) (and .cse6 .cse7 .cse1 .cse9 .cse3 .cse5) (and .cse6 .cse0 .cse8 .cse1 .cse9 .cse3) (and .cse6 .cse0 .cse1 .cse9 .cse3 .cse5) (and .cse7 .cse10 .cse8 .cse1 .cse9 .cse2) (and .cse7 .cse10 .cse1 .cse9 .cse2 .cse5) (and .cse10 .cse0 .cse1 .cse9 .cse2 .cse5) (and .cse7 .cse8 .cse1 .cse9 .cse2 .cse3) (and .cse6 .cse7 .cse10 .cse8 .cse1 .cse4) (and .cse6 .cse0 .cse8 .cse1 .cse3 .cse4) (and .cse7 .cse10 .cse1 .cse2 .cse4 .cse5) (and .cse7 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse7 .cse8 .cse1 .cse2 .cse3 .cse4) (and .cse10 .cse0 .cse1 .cse2 .cse4 .cse5))) [2020-07-07 13:23:03,989 INFO L271 CegarLoopResult]: At program point L35(lines 35 37) the Hoare annotation is: true [2020-07-07 13:23:03,990 INFO L264 CegarLoopResult]: At program point L68-1(lines 33 130) the Hoare annotation is: (let ((.cse7 (= 0 main_~p2~0)) (.cse4 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p1~0)) (.cse5 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse6 (= 1 main_~lk1~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6) (and .cse7 .cse1 .cse6 .cse3) (and .cse5 .cse7 .cse1 .cse6) (and .cse4 .cse0 .cse6 .cse3) (and .cse7 .cse1 .cse2 .cse3) (and .cse4 .cse7 .cse6 .cse3) (and .cse4 .cse5 .cse7 .cse6) (and .cse5 .cse7 .cse1 .cse2) (and .cse4 .cse0 .cse5 .cse2) (and .cse4 .cse5 .cse7 .cse2) (and .cse4 .cse7 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2) (and .cse0 .cse5 .cse1 .cse6) (and .cse0 .cse1 .cse6 .cse3))) [2020-07-07 13:23:04,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.07 01:23:04 BoogieIcfgContainer [2020-07-07 13:23:04,004 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-07 13:23:04,006 INFO L168 Benchmark]: Toolchain (without parser) took 45691.96 ms. Allocated memory was 146.8 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 103.8 MB in the beginning and 340.7 MB in the end (delta: -236.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2020-07-07 13:23:04,007 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 146.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-07 13:23:04,007 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.66 ms. Allocated memory is still 146.8 MB. Free memory was 103.6 MB in the beginning and 93.1 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2020-07-07 13:23:04,008 INFO L168 Benchmark]: Boogie Preprocessor took 131.96 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 93.1 MB in the beginning and 181.7 MB in the end (delta: -88.7 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-07 13:23:04,008 INFO L168 Benchmark]: RCFGBuilder took 428.80 ms. Allocated memory is still 204.5 MB. Free memory was 181.7 MB in the beginning and 160.3 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 7.1 GB. [2020-07-07 13:23:04,009 INFO L168 Benchmark]: TraceAbstraction took 44815.76 ms. Allocated memory was 204.5 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 160.3 MB in the beginning and 340.7 MB in the end (delta: -180.4 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2020-07-07 13:23:04,012 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.24 ms. Allocated memory is still 146.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 307.66 ms. Allocated memory is still 146.8 MB. Free memory was 103.6 MB in the beginning and 93.1 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 131.96 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 93.1 MB in the beginning and 181.7 MB in the end (delta: -88.7 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 428.80 ms. Allocated memory is still 204.5 MB. Free memory was 181.7 MB in the beginning and 160.3 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 44815.76 ms. Allocated memory was 204.5 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 160.3 MB in the beginning and 340.7 MB in the end (delta: -180.4 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: 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: 33]: 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, 98 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 6.9s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 37.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2345 SDtfs, 845 SDslu, 1664 SDs, 0 SdLazy, 79 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5479occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 2257 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 98 LocationsWithAnnotation, 98 PreInvPairs, 10602 NumberOfFragments, 32360 HoareAnnotationTreeSize, 98 FomulaSimplifications, 323126 FormulaSimplificationTreeSizeReduction, 7.6s HoareSimplificationTime, 98 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 30.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...