/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_8.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 00:59:46,592 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 00:59:46,596 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 00:59:46,640 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 00:59:46,641 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 00:59:46,643 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 00:59:46,645 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 00:59:46,647 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 00:59:46,650 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 00:59:46,651 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 00:59:46,652 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 00:59:46,654 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 00:59:46,655 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 00:59:46,656 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 00:59:46,657 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 00:59:46,659 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 00:59:46,660 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 00:59:46,661 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 00:59:46,674 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 00:59:46,676 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 00:59:46,678 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 00:59:46,680 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 00:59:46,681 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 00:59:46,682 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 00:59:46,686 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 00:59:46,686 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 00:59:46,687 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 00:59:46,688 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 00:59:46,688 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 00:59:46,693 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 00:59:46,693 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 00:59:46,694 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 00:59:46,695 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 00:59:46,696 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 00:59:46,701 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 00:59:46,701 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 00:59:46,703 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 00:59:46,704 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 00:59:46,705 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 00:59:46,706 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 00:59:46,708 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 00:59:46,710 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-24 00:59:46,738 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 00:59:46,739 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 00:59:46,740 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 00:59:46,741 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 00:59:46,741 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 00:59:46,741 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 00:59:46,742 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 00:59:46,742 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 00:59:46,742 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 00:59:46,742 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 00:59:46,743 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 00:59:46,743 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 00:59:46,743 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 00:59:46,744 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 00:59:46,744 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 00:59:46,744 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 00:59:46,744 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 00:59:46,745 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 00:59:46,745 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:59:46,745 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 00:59:46,746 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 00:59:46,746 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 00:59:46,746 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-10-24 00:59:47,130 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 00:59:47,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 00:59:47,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 00:59:47,185 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 00:59:47,185 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 00:59:47,186 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_8.c [2020-10-24 00:59:47,274 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ba87baf2/792de2b6e04a414bbc31226d0deb41f8/FLAG7d68e3fc6 [2020-10-24 00:59:47,915 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 00:59:47,916 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c [2020-10-24 00:59:47,925 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ba87baf2/792de2b6e04a414bbc31226d0deb41f8/FLAG7d68e3fc6 [2020-10-24 00:59:48,297 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ba87baf2/792de2b6e04a414bbc31226d0deb41f8 [2020-10-24 00:59:48,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 00:59:48,309 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 00:59:48,315 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 00:59:48,315 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 00:59:48,319 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 00:59:48,320 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:59:48" (1/1) ... [2020-10-24 00:59:48,324 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66a35e82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:59:48, skipping insertion in model container [2020-10-24 00:59:48,324 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:59:48" (1/1) ... [2020-10-24 00:59:48,334 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 00:59:48,364 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 00:59:48,533 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:59:48,548 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 00:59:48,605 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:59:48,633 INFO L208 MainTranslator]: Completed translation [2020-10-24 00:59:48,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:59:48 WrapperNode [2020-10-24 00:59:48,634 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 00:59:48,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 00:59:48,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 00:59:48,636 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 00:59:48,652 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:59:48" (1/1) ... [2020-10-24 00:59:48,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:59:48" (1/1) ... [2020-10-24 00:59:48,661 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:59:48" (1/1) ... [2020-10-24 00:59:48,662 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:59:48" (1/1) ... [2020-10-24 00:59:48,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:59:48" (1/1) ... [2020-10-24 00:59:48,677 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:59:48" (1/1) ... [2020-10-24 00:59:48,680 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:59:48" (1/1) ... [2020-10-24 00:59:48,683 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 00:59:48,684 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 00:59:48,684 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 00:59:48,684 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 00:59:48,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:59:48" (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-10-24 00:59:48,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 00:59:48,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 00:59:48,782 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 00:59:48,782 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 00:59:48,782 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 00:59:48,783 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 00:59:48,784 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 00:59:48,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 00:59:48,784 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-24 00:59:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 00:59:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 00:59:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 00:59:48,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 00:59:48,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 00:59:48,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 00:59:48,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 00:59:49,598 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 00:59:49,600 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-24 00:59:49,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:59:49 BoogieIcfgContainer [2020-10-24 00:59:49,604 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 00:59:49,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 00:59:49,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 00:59:49,614 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 00:59:49,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:59:48" (1/3) ... [2020-10-24 00:59:49,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f684a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:59:49, skipping insertion in model container [2020-10-24 00:59:49,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:59:48" (2/3) ... [2020-10-24 00:59:49,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f684a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:59:49, skipping insertion in model container [2020-10-24 00:59:49,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:59:49" (3/3) ... [2020-10-24 00:59:49,618 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2020-10-24 00:59:49,631 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 00:59:49,637 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 00:59:49,659 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 00:59:49,694 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 00:59:49,694 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 00:59:49,694 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 00:59:49,694 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 00:59:49,694 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 00:59:49,695 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 00:59:49,695 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 00:59:49,695 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 00:59:49,719 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2020-10-24 00:59:49,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-10-24 00:59:49,734 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:59:49,735 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:59:49,735 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:59:49,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:59:49,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1694589771, now seen corresponding path program 1 times [2020-10-24 00:59:49,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:59:49,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [551685483] [2020-10-24 00:59:49,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:59:49,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:50,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:59:50,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:50,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:59:50,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [551685483] [2020-10-24 00:59:50,131 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:59:50,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 00:59:50,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924290507] [2020-10-24 00:59:50,138 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 00:59:50,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:59:50,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 00:59:50,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 00:59:50,157 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 4 states. [2020-10-24 00:59:50,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:59:50,969 INFO L93 Difference]: Finished difference Result 225 states and 305 transitions. [2020-10-24 00:59:50,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 00:59:50,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2020-10-24 00:59:50,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:59:50,987 INFO L225 Difference]: With dead ends: 225 [2020-10-24 00:59:50,987 INFO L226 Difference]: Without dead ends: 152 [2020-10-24 00:59:50,992 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 00:59:51,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-10-24 00:59:51,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2020-10-24 00:59:51,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-10-24 00:59:51,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 195 transitions. [2020-10-24 00:59:51,139 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 195 transitions. Word has length 70 [2020-10-24 00:59:51,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:59:51,141 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 195 transitions. [2020-10-24 00:59:51,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 00:59:51,141 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 195 transitions. [2020-10-24 00:59:51,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-10-24 00:59:51,148 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:59:51,148 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, 1, 1] [2020-10-24 00:59:51,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 00:59:51,149 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:59:51,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:59:51,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1874187364, now seen corresponding path program 1 times [2020-10-24 00:59:51,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:59:51,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2104083633] [2020-10-24 00:59:51,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:59:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:51,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:59:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:51,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:59:51,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2104083633] [2020-10-24 00:59:51,339 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:59:51,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 00:59:51,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620248217] [2020-10-24 00:59:51,341 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 00:59:51,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:59:51,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 00:59:51,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 00:59:51,343 INFO L87 Difference]: Start difference. First operand 151 states and 195 transitions. Second operand 4 states. [2020-10-24 00:59:51,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:59:51,826 INFO L93 Difference]: Finished difference Result 182 states and 239 transitions. [2020-10-24 00:59:51,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 00:59:51,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2020-10-24 00:59:51,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:59:51,829 INFO L225 Difference]: With dead ends: 182 [2020-10-24 00:59:51,830 INFO L226 Difference]: Without dead ends: 179 [2020-10-24 00:59:51,831 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 00:59:51,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-10-24 00:59:51,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 151. [2020-10-24 00:59:51,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-10-24 00:59:51,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 194 transitions. [2020-10-24 00:59:51,866 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 194 transitions. Word has length 71 [2020-10-24 00:59:51,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:59:51,867 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 194 transitions. [2020-10-24 00:59:51,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 00:59:51,867 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 194 transitions. [2020-10-24 00:59:51,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-10-24 00:59:51,872 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:59:51,872 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, 1, 1] [2020-10-24 00:59:51,872 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 00:59:51,872 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:59:51,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:59:51,875 INFO L82 PathProgramCache]: Analyzing trace with hash -985099166, now seen corresponding path program 1 times [2020-10-24 00:59:51,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:59:51,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [254759390] [2020-10-24 00:59:51,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:59:51,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:52,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:59:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:52,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:59:52,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [254759390] [2020-10-24 00:59:52,051 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:59:52,051 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 00:59:52,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515778117] [2020-10-24 00:59:52,052 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 00:59:52,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:59:52,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 00:59:52,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 00:59:52,053 INFO L87 Difference]: Start difference. First operand 151 states and 194 transitions. Second operand 4 states. [2020-10-24 00:59:52,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:59:52,559 INFO L93 Difference]: Finished difference Result 355 states and 483 transitions. [2020-10-24 00:59:52,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 00:59:52,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2020-10-24 00:59:52,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:59:52,562 INFO L225 Difference]: With dead ends: 355 [2020-10-24 00:59:52,563 INFO L226 Difference]: Without dead ends: 249 [2020-10-24 00:59:52,564 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 00:59:52,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2020-10-24 00:59:52,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 248. [2020-10-24 00:59:52,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2020-10-24 00:59:52,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 329 transitions. [2020-10-24 00:59:52,613 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 329 transitions. Word has length 71 [2020-10-24 00:59:52,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:59:52,613 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 329 transitions. [2020-10-24 00:59:52,614 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 00:59:52,614 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 329 transitions. [2020-10-24 00:59:52,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-10-24 00:59:52,616 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:59:52,616 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, 1, 1, 1] [2020-10-24 00:59:52,616 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 00:59:52,616 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:59:52,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:59:52,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1497949312, now seen corresponding path program 1 times [2020-10-24 00:59:52,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:59:52,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1344004735] [2020-10-24 00:59:52,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:59:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:52,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:59:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:52,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:59:52,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1344004735] [2020-10-24 00:59:52,732 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:59:52,732 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 00:59:52,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292208895] [2020-10-24 00:59:52,733 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 00:59:52,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:59:52,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 00:59:52,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 00:59:52,734 INFO L87 Difference]: Start difference. First operand 248 states and 329 transitions. Second operand 4 states. [2020-10-24 00:59:53,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:59:53,197 INFO L93 Difference]: Finished difference Result 302 states and 406 transitions. [2020-10-24 00:59:53,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 00:59:53,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2020-10-24 00:59:53,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:59:53,200 INFO L225 Difference]: With dead ends: 302 [2020-10-24 00:59:53,201 INFO L226 Difference]: Without dead ends: 299 [2020-10-24 00:59:53,202 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 00:59:53,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-10-24 00:59:53,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 248. [2020-10-24 00:59:53,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2020-10-24 00:59:53,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 327 transitions. [2020-10-24 00:59:53,245 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 327 transitions. Word has length 72 [2020-10-24 00:59:53,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:59:53,246 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 327 transitions. [2020-10-24 00:59:53,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 00:59:53,246 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 327 transitions. [2020-10-24 00:59:53,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-10-24 00:59:53,248 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:59:53,248 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, 1, 1, 1] [2020-10-24 00:59:53,248 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 00:59:53,248 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:59:53,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:59:53,249 INFO L82 PathProgramCache]: Analyzing trace with hash -465715359, now seen corresponding path program 1 times [2020-10-24 00:59:53,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:59:53,250 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1418150631] [2020-10-24 00:59:53,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:59:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:53,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:59:53,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:53,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:59:53,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1418150631] [2020-10-24 00:59:53,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:59:53,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 00:59:53,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766821470] [2020-10-24 00:59:53,403 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 00:59:53,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:59:53,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 00:59:53,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 00:59:53,404 INFO L87 Difference]: Start difference. First operand 248 states and 327 transitions. Second operand 4 states. [2020-10-24 00:59:53,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:59:53,953 INFO L93 Difference]: Finished difference Result 640 states and 874 transitions. [2020-10-24 00:59:53,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 00:59:53,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2020-10-24 00:59:53,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:59:53,957 INFO L225 Difference]: With dead ends: 640 [2020-10-24 00:59:53,958 INFO L226 Difference]: Without dead ends: 437 [2020-10-24 00:59:53,960 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 00:59:53,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2020-10-24 00:59:54,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 436. [2020-10-24 00:59:54,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2020-10-24 00:59:54,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 583 transitions. [2020-10-24 00:59:54,032 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 583 transitions. Word has length 72 [2020-10-24 00:59:54,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:59:54,032 INFO L481 AbstractCegarLoop]: Abstraction has 436 states and 583 transitions. [2020-10-24 00:59:54,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 00:59:54,033 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 583 transitions. [2020-10-24 00:59:54,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-24 00:59:54,034 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:59:54,034 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, 1, 1, 1, 1] [2020-10-24 00:59:54,034 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 00:59:54,035 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:59:54,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:59:54,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1575507240, now seen corresponding path program 1 times [2020-10-24 00:59:54,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:59:54,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1755512295] [2020-10-24 00:59:54,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:59:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:54,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:59:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:54,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:59:54,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1755512295] [2020-10-24 00:59:54,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:59:54,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 00:59:54,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506483908] [2020-10-24 00:59:54,139 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 00:59:54,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:59:54,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 00:59:54,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 00:59:54,140 INFO L87 Difference]: Start difference. First operand 436 states and 583 transitions. Second operand 4 states. [2020-10-24 00:59:54,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:59:54,632 INFO L93 Difference]: Finished difference Result 532 states and 718 transitions. [2020-10-24 00:59:54,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 00:59:54,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2020-10-24 00:59:54,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:59:54,637 INFO L225 Difference]: With dead ends: 532 [2020-10-24 00:59:54,637 INFO L226 Difference]: Without dead ends: 529 [2020-10-24 00:59:54,638 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 00:59:54,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2020-10-24 00:59:54,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 436. [2020-10-24 00:59:54,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2020-10-24 00:59:54,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 579 transitions. [2020-10-24 00:59:54,713 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 579 transitions. Word has length 73 [2020-10-24 00:59:54,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:59:54,713 INFO L481 AbstractCegarLoop]: Abstraction has 436 states and 579 transitions. [2020-10-24 00:59:54,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 00:59:54,713 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 579 transitions. [2020-10-24 00:59:54,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-24 00:59:54,715 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:59:54,715 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, 1, 1, 1, 1] [2020-10-24 00:59:54,715 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 00:59:54,715 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:59:54,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:59:54,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1544674994, now seen corresponding path program 1 times [2020-10-24 00:59:54,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:59:54,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1788001907] [2020-10-24 00:59:54,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:59:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:54,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:59:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:54,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:59:54,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1788001907] [2020-10-24 00:59:54,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:59:54,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 00:59:54,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302579467] [2020-10-24 00:59:54,811 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 00:59:54,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:59:54,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 00:59:54,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 00:59:54,812 INFO L87 Difference]: Start difference. First operand 436 states and 579 transitions. Second operand 4 states. [2020-10-24 00:59:55,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:59:55,364 INFO L93 Difference]: Finished difference Result 1192 states and 1614 transitions. [2020-10-24 00:59:55,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 00:59:55,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2020-10-24 00:59:55,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:59:55,370 INFO L225 Difference]: With dead ends: 1192 [2020-10-24 00:59:55,370 INFO L226 Difference]: Without dead ends: 801 [2020-10-24 00:59:55,372 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 00:59:55,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2020-10-24 00:59:55,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 800. [2020-10-24 00:59:55,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-10-24 00:59:55,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1063 transitions. [2020-10-24 00:59:55,481 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1063 transitions. Word has length 73 [2020-10-24 00:59:55,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:59:55,482 INFO L481 AbstractCegarLoop]: Abstraction has 800 states and 1063 transitions. [2020-10-24 00:59:55,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 00:59:55,482 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1063 transitions. [2020-10-24 00:59:55,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-10-24 00:59:55,483 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:59:55,484 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, 1, 1, 1, 1, 1] [2020-10-24 00:59:55,484 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 00:59:55,484 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:59:55,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:59:55,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1931575924, now seen corresponding path program 1 times [2020-10-24 00:59:55,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:59:55,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [904152015] [2020-10-24 00:59:55,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:59:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:55,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:59:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:55,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:59:55,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [904152015] [2020-10-24 00:59:55,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:59:55,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 00:59:55,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18378555] [2020-10-24 00:59:55,613 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 00:59:55,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:59:55,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 00:59:55,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 00:59:55,615 INFO L87 Difference]: Start difference. First operand 800 states and 1063 transitions. Second operand 4 states. [2020-10-24 00:59:56,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:59:56,324 INFO L93 Difference]: Finished difference Result 972 states and 1298 transitions. [2020-10-24 00:59:56,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 00:59:56,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2020-10-24 00:59:56,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:59:56,331 INFO L225 Difference]: With dead ends: 972 [2020-10-24 00:59:56,331 INFO L226 Difference]: Without dead ends: 969 [2020-10-24 00:59:56,332 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 00:59:56,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2020-10-24 00:59:56,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 800. [2020-10-24 00:59:56,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-10-24 00:59:56,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1055 transitions. [2020-10-24 00:59:56,475 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1055 transitions. Word has length 74 [2020-10-24 00:59:56,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:59:56,475 INFO L481 AbstractCegarLoop]: Abstraction has 800 states and 1055 transitions. [2020-10-24 00:59:56,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 00:59:56,476 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1055 transitions. [2020-10-24 00:59:56,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-10-24 00:59:56,477 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:59:56,477 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, 1, 1, 1, 1, 1] [2020-10-24 00:59:56,477 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 00:59:56,478 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:59:56,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:59:56,478 INFO L82 PathProgramCache]: Analyzing trace with hash -632673779, now seen corresponding path program 1 times [2020-10-24 00:59:56,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:59:56,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1998595803] [2020-10-24 00:59:56,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:59:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:56,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:59:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:56,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:59:56,608 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1998595803] [2020-10-24 00:59:56,608 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:59:56,608 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 00:59:56,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957704392] [2020-10-24 00:59:56,610 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 00:59:56,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:59:56,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 00:59:56,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 00:59:56,622 INFO L87 Difference]: Start difference. First operand 800 states and 1055 transitions. Second operand 4 states. [2020-10-24 00:59:57,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:59:57,262 INFO L93 Difference]: Finished difference Result 2260 states and 3010 transitions. [2020-10-24 00:59:57,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 00:59:57,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2020-10-24 00:59:57,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:59:57,271 INFO L225 Difference]: With dead ends: 2260 [2020-10-24 00:59:57,272 INFO L226 Difference]: Without dead ends: 1505 [2020-10-24 00:59:57,275 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 00:59:57,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2020-10-24 00:59:57,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1504. [2020-10-24 00:59:57,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1504 states. [2020-10-24 00:59:57,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 1967 transitions. [2020-10-24 00:59:57,508 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 1967 transitions. Word has length 74 [2020-10-24 00:59:57,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:59:57,509 INFO L481 AbstractCegarLoop]: Abstraction has 1504 states and 1967 transitions. [2020-10-24 00:59:57,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 00:59:57,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1967 transitions. [2020-10-24 00:59:57,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-10-24 00:59:57,511 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:59:57,511 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, 1, 1, 1, 1, 1, 1] [2020-10-24 00:59:57,512 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 00:59:57,512 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:59:57,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:59:57,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1018007220, now seen corresponding path program 1 times [2020-10-24 00:59:57,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:59:57,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [997955743] [2020-10-24 00:59:57,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:59:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:57,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:59:57,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:57,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:59:57,598 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [997955743] [2020-10-24 00:59:57,598 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:59:57,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 00:59:57,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853893799] [2020-10-24 00:59:57,599 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 00:59:57,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:59:57,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 00:59:57,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 00:59:57,601 INFO L87 Difference]: Start difference. First operand 1504 states and 1967 transitions. Second operand 4 states. [2020-10-24 00:59:58,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:59:58,319 INFO L93 Difference]: Finished difference Result 1812 states and 2370 transitions. [2020-10-24 00:59:58,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 00:59:58,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2020-10-24 00:59:58,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:59:58,329 INFO L225 Difference]: With dead ends: 1812 [2020-10-24 00:59:58,329 INFO L226 Difference]: Without dead ends: 1809 [2020-10-24 00:59:58,330 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 00:59:58,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2020-10-24 00:59:58,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1504. [2020-10-24 00:59:58,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1504 states. [2020-10-24 00:59:58,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 1951 transitions. [2020-10-24 00:59:58,559 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 1951 transitions. Word has length 75 [2020-10-24 00:59:58,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:59:58,560 INFO L481 AbstractCegarLoop]: Abstraction has 1504 states and 1951 transitions. [2020-10-24 00:59:58,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 00:59:58,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1951 transitions. [2020-10-24 00:59:58,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-10-24 00:59:58,562 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:59:58,563 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, 1, 1, 1, 1, 1, 1] [2020-10-24 00:59:58,563 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-24 00:59:58,563 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:59:58,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:59:58,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1869571642, now seen corresponding path program 1 times [2020-10-24 00:59:58,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:59:58,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [633845613] [2020-10-24 00:59:58,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:59:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:58,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:59:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:59:58,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:59:58,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [633845613] [2020-10-24 00:59:58,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:59:58,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 00:59:58,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682710794] [2020-10-24 00:59:58,652 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 00:59:58,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:59:58,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 00:59:58,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 00:59:58,654 INFO L87 Difference]: Start difference. First operand 1504 states and 1951 transitions. Second operand 4 states. [2020-10-24 00:59:59,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:59:59,800 INFO L93 Difference]: Finished difference Result 4324 states and 5634 transitions. [2020-10-24 00:59:59,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 00:59:59,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2020-10-24 00:59:59,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:59:59,816 INFO L225 Difference]: With dead ends: 4324 [2020-10-24 00:59:59,817 INFO L226 Difference]: Without dead ends: 2865 [2020-10-24 00:59:59,822 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 00:59:59,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2865 states. [2020-10-24 01:00:00,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2865 to 2864. [2020-10-24 01:00:00,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2864 states. [2020-10-24 01:00:00,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2864 states to 2864 states and 3663 transitions. [2020-10-24 01:00:00,240 INFO L78 Accepts]: Start accepts. Automaton has 2864 states and 3663 transitions. Word has length 75 [2020-10-24 01:00:00,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:00:00,240 INFO L481 AbstractCegarLoop]: Abstraction has 2864 states and 3663 transitions. [2020-10-24 01:00:00,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 01:00:00,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2864 states and 3663 transitions. [2020-10-24 01:00:00,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-10-24 01:00:00,243 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:00:00,244 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, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:00:00,244 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-24 01:00:00,244 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:00:00,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:00:00,245 INFO L82 PathProgramCache]: Analyzing trace with hash 2129779897, now seen corresponding path program 1 times [2020-10-24 01:00:00,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:00:00,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [522590715] [2020-10-24 01:00:00,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:00:00,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:00:00,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:00:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:00:00,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 01:00:00,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [522590715] [2020-10-24 01:00:00,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 01:00:00,328 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 01:00:00,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274932572] [2020-10-24 01:00:00,329 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 01:00:00,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:00:00,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 01:00:00,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 01:00:00,330 INFO L87 Difference]: Start difference. First operand 2864 states and 3663 transitions. Second operand 4 states. [2020-10-24 01:00:01,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:00:01,516 INFO L93 Difference]: Finished difference Result 8308 states and 10642 transitions. [2020-10-24 01:00:01,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 01:00:01,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-10-24 01:00:01,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:00:01,544 INFO L225 Difference]: With dead ends: 8308 [2020-10-24 01:00:01,545 INFO L226 Difference]: Without dead ends: 5489 [2020-10-24 01:00:01,552 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 01:00:01,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5489 states. [2020-10-24 01:00:02,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5489 to 5488. [2020-10-24 01:00:02,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5488 states. [2020-10-24 01:00:02,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5488 states to 5488 states and 6895 transitions. [2020-10-24 01:00:02,353 INFO L78 Accepts]: Start accepts. Automaton has 5488 states and 6895 transitions. Word has length 76 [2020-10-24 01:00:02,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:00:02,353 INFO L481 AbstractCegarLoop]: Abstraction has 5488 states and 6895 transitions. [2020-10-24 01:00:02,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 01:00:02,353 INFO L276 IsEmpty]: Start isEmpty. Operand 5488 states and 6895 transitions. [2020-10-24 01:00:02,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-10-24 01:00:02,361 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:00:02,361 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, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:00:02,361 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-24 01:00:02,362 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:00:02,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:00:02,362 INFO L82 PathProgramCache]: Analyzing trace with hash -2034184296, now seen corresponding path program 1 times [2020-10-24 01:00:02,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:00:02,363 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1854522486] [2020-10-24 01:00:02,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:00:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:00:02,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:00:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:00:02,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 01:00:02,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1854522486] [2020-10-24 01:00:02,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 01:00:02,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 01:00:02,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812052057] [2020-10-24 01:00:02,444 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 01:00:02,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:00:02,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 01:00:02,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 01:00:02,445 INFO L87 Difference]: Start difference. First operand 5488 states and 6895 transitions. Second operand 4 states. [2020-10-24 01:00:03,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:00:03,525 INFO L93 Difference]: Finished difference Result 6516 states and 8114 transitions. [2020-10-24 01:00:03,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 01:00:03,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-10-24 01:00:03,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:00:03,553 INFO L225 Difference]: With dead ends: 6516 [2020-10-24 01:00:03,553 INFO L226 Difference]: Without dead ends: 6513 [2020-10-24 01:00:03,555 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 01:00:03,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6513 states. [2020-10-24 01:00:04,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6513 to 5488. [2020-10-24 01:00:04,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5488 states. [2020-10-24 01:00:04,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5488 states to 5488 states and 6831 transitions. [2020-10-24 01:00:04,583 INFO L78 Accepts]: Start accepts. Automaton has 5488 states and 6831 transitions. Word has length 76 [2020-10-24 01:00:04,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:00:04,583 INFO L481 AbstractCegarLoop]: Abstraction has 5488 states and 6831 transitions. [2020-10-24 01:00:04,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 01:00:04,583 INFO L276 IsEmpty]: Start isEmpty. Operand 5488 states and 6831 transitions. [2020-10-24 01:00:04,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-10-24 01:00:04,588 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:00:04,588 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:00:04,589 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-24 01:00:04,589 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:00:04,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:00:04,590 INFO L82 PathProgramCache]: Analyzing trace with hash 2132138048, now seen corresponding path program 1 times [2020-10-24 01:00:04,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:00:04,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [357794642] [2020-10-24 01:00:04,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:00:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:00:04,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:00:04,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:00:04,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 01:00:04,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [357794642] [2020-10-24 01:00:04,672 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 01:00:04,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 01:00:04,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670994] [2020-10-24 01:00:04,673 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 01:00:04,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:00:04,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 01:00:04,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 01:00:04,675 INFO L87 Difference]: Start difference. First operand 5488 states and 6831 transitions. Second operand 4 states. [2020-10-24 01:00:05,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:00:05,866 INFO L93 Difference]: Finished difference Result 6452 states and 7922 transitions. [2020-10-24 01:00:05,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 01:00:05,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2020-10-24 01:00:05,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:00:05,896 INFO L225 Difference]: With dead ends: 6452 [2020-10-24 01:00:05,897 INFO L226 Difference]: Without dead ends: 6449 [2020-10-24 01:00:05,900 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 01:00:05,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6449 states. [2020-10-24 01:00:06,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6449 to 5488. [2020-10-24 01:00:06,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5488 states. [2020-10-24 01:00:06,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5488 states to 5488 states and 6767 transitions. [2020-10-24 01:00:06,518 INFO L78 Accepts]: Start accepts. Automaton has 5488 states and 6767 transitions. Word has length 77 [2020-10-24 01:00:06,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:00:06,518 INFO L481 AbstractCegarLoop]: Abstraction has 5488 states and 6767 transitions. [2020-10-24 01:00:06,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 01:00:06,518 INFO L276 IsEmpty]: Start isEmpty. Operand 5488 states and 6767 transitions. [2020-10-24 01:00:06,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-10-24 01:00:06,523 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:00:06,523 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:00:06,523 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-24 01:00:06,524 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:00:06,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:00:06,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1606312742, now seen corresponding path program 1 times [2020-10-24 01:00:06,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:00:06,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1458410860] [2020-10-24 01:00:06,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:00:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:00:06,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:00:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:00:06,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 01:00:06,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1458410860] [2020-10-24 01:00:06,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 01:00:06,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 01:00:06,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449751239] [2020-10-24 01:00:06,600 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 01:00:06,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:00:06,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 01:00:06,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 01:00:06,602 INFO L87 Difference]: Start difference. First operand 5488 states and 6767 transitions. Second operand 4 states. [2020-10-24 01:00:08,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:00:08,249 INFO L93 Difference]: Finished difference Result 15987 states and 19697 transitions. [2020-10-24 01:00:08,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 01:00:08,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2020-10-24 01:00:08,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:00:08,269 INFO L225 Difference]: With dead ends: 15987 [2020-10-24 01:00:08,269 INFO L226 Difference]: Without dead ends: 5488 [2020-10-24 01:00:08,292 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 01:00:08,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5488 states. [2020-10-24 01:00:09,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5488 to 5488. [2020-10-24 01:00:09,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5488 states. [2020-10-24 01:00:09,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5488 states to 5488 states and 6511 transitions. [2020-10-24 01:00:09,017 INFO L78 Accepts]: Start accepts. Automaton has 5488 states and 6511 transitions. Word has length 77 [2020-10-24 01:00:09,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:00:09,017 INFO L481 AbstractCegarLoop]: Abstraction has 5488 states and 6511 transitions. [2020-10-24 01:00:09,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 01:00:09,017 INFO L276 IsEmpty]: Start isEmpty. Operand 5488 states and 6511 transitions. [2020-10-24 01:00:09,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-10-24 01:00:09,023 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:00:09,023 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:00:09,023 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-24 01:00:09,023 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:00:09,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:00:09,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1855843932, now seen corresponding path program 1 times [2020-10-24 01:00:09,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:00:09,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1736449105] [2020-10-24 01:00:09,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:00:09,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:00:09,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:00:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:00:09,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 01:00:09,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1736449105] [2020-10-24 01:00:09,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 01:00:09,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 01:00:09,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301654283] [2020-10-24 01:00:09,172 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 01:00:09,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:00:09,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 01:00:09,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 01:00:09,173 INFO L87 Difference]: Start difference. First operand 5488 states and 6511 transitions. Second operand 4 states. [2020-10-24 01:00:09,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:00:09,983 INFO L93 Difference]: Finished difference Result 5488 states and 6511 transitions. [2020-10-24 01:00:09,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 01:00:09,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2020-10-24 01:00:09,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:00:09,985 INFO L225 Difference]: With dead ends: 5488 [2020-10-24 01:00:09,985 INFO L226 Difference]: Without dead ends: 0 [2020-10-24 01:00:09,996 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 01:00:09,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-24 01:00:09,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-24 01:00:09,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-24 01:00:09,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-24 01:00:09,997 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2020-10-24 01:00:09,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:00:09,997 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-24 01:00:09,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 01:00:09,998 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-24 01:00:09,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-24 01:00:09,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-24 01:00:10,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-24 01:00:12,674 WARN L193 SmtUtils]: Spent 2.64 s on a formula simplification. DAG size of input: 796 DAG size of output: 31 [2020-10-24 01:00:13,020 WARN L193 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 307 DAG size of output: 39 [2020-10-24 01:00:14,586 WARN L193 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 796 DAG size of output: 31 [2020-10-24 01:00:16,241 WARN L193 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 796 DAG size of output: 31 [2020-10-24 01:00:16,400 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 304 DAG size of output: 31 [2020-10-24 01:00:16,676 WARN L193 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 342 DAG size of output: 85 [2020-10-24 01:00:17,096 WARN L193 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 380 DAG size of output: 41 [2020-10-24 01:00:17,250 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 311 DAG size of output: 53 [2020-10-24 01:00:18,326 WARN L193 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 783 DAG size of output: 31 [2020-10-24 01:00:18,513 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 123 [2020-10-24 01:00:18,720 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 315 DAG size of output: 85 [2020-10-24 01:00:19,035 WARN L193 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 499 DAG size of output: 31 [2020-10-24 01:00:19,315 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 366 DAG size of output: 65 [2020-10-24 01:00:19,468 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 284 DAG size of output: 47 [2020-10-24 01:00:19,867 WARN L193 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 668 DAG size of output: 34 [2020-10-24 01:00:20,378 WARN L193 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 319 DAG size of output: 189 [2020-10-24 01:00:20,722 WARN L193 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2020-10-24 01:00:20,873 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 87 [2020-10-24 01:00:21,817 WARN L193 SmtUtils]: Spent 933.00 ms on a formula simplification. DAG size of input: 769 DAG size of output: 31 [2020-10-24 01:00:22,157 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 414 DAG size of output: 53 [2020-10-24 01:00:22,467 WARN L193 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 380 DAG size of output: 41 [2020-10-24 01:00:22,622 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 304 DAG size of output: 31 [2020-10-24 01:00:22,903 WARN L193 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2020-10-24 01:00:23,087 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 123 [2020-10-24 01:00:23,212 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 67 [2020-10-24 01:00:23,320 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 309 DAG size of output: 45 [2020-10-24 01:00:24,589 WARN L193 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 796 DAG size of output: 31 [2020-10-24 01:00:25,366 WARN L193 SmtUtils]: Spent 774.00 ms on a formula simplification. DAG size of input: 606 DAG size of output: 45 [2020-10-24 01:00:25,761 WARN L193 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 668 DAG size of output: 34 [2020-10-24 01:00:25,924 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 313 DAG size of output: 65 [2020-10-24 01:00:27,171 WARN L193 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 796 DAG size of output: 31 [2020-10-24 01:00:28,026 WARN L193 SmtUtils]: Spent 852.00 ms on a formula simplification. DAG size of input: 743 DAG size of output: 31 [2020-10-24 01:00:28,587 WARN L193 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 324 DAG size of output: 189 [2020-10-24 01:00:28,732 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 87 [2020-10-24 01:00:29,149 WARN L193 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 317 DAG size of output: 121 [2020-10-24 01:00:30,602 WARN L193 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 798 DAG size of output: 39 [2020-10-24 01:00:31,796 WARN L193 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 791 DAG size of output: 31 [2020-10-24 01:00:32,744 WARN L193 SmtUtils]: Spent 945.00 ms on a formula simplification that was a NOOP. DAG size: 321 [2020-10-24 01:00:33,062 WARN L193 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 330 DAG size of output: 121 [2020-10-24 01:00:33,248 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 67 [2020-10-24 01:00:33,396 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 284 DAG size of output: 47 [2020-10-24 01:00:34,033 WARN L193 SmtUtils]: Spent 631.00 ms on a formula simplification. DAG size of input: 693 DAG size of output: 31 [2020-10-24 01:00:34,188 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 121 [2020-10-24 01:00:34,478 WARN L193 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2020-10-24 01:00:35,735 WARN L193 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 796 DAG size of output: 31 [2020-10-24 01:00:38,347 WARN L193 SmtUtils]: Spent 2.48 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-10-24 01:00:38,915 WARN L193 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2020-10-24 01:00:39,040 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 11 [2020-10-24 01:00:39,551 WARN L193 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-10-24 01:00:46,496 WARN L193 SmtUtils]: Spent 6.93 s on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2020-10-24 01:00:49,067 WARN L193 SmtUtils]: Spent 2.55 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-10-24 01:00:50,256 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-10-24 01:00:50,528 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2020-10-24 01:01:06,426 WARN L193 SmtUtils]: Spent 15.85 s on a formula simplification. DAG size of input: 179 DAG size of output: 159 [2020-10-24 01:01:06,915 WARN L193 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-10-24 01:01:24,238 WARN L193 SmtUtils]: Spent 17.32 s on a formula simplification. DAG size of input: 181 DAG size of output: 161 [2020-10-24 01:01:27,111 WARN L193 SmtUtils]: Spent 2.87 s on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2020-10-24 01:01:29,767 WARN L193 SmtUtils]: Spent 2.64 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-10-24 01:01:30,257 WARN L193 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-10-24 01:01:30,380 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 11 [2020-10-24 01:01:46,024 WARN L193 SmtUtils]: Spent 15.63 s on a formula simplification. DAG size of input: 179 DAG size of output: 159 [2020-10-24 01:01:52,945 WARN L193 SmtUtils]: Spent 6.91 s on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2020-10-24 01:01:54,225 WARN L193 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2020-10-24 01:01:54,466 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2020-10-24 01:01:54,705 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2020-10-24 01:01:55,933 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-10-24 01:02:12,029 WARN L193 SmtUtils]: Spent 16.08 s on a formula simplification. DAG size of input: 179 DAG size of output: 159 [2020-10-24 01:02:14,941 WARN L193 SmtUtils]: Spent 2.90 s on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2020-10-24 01:02:15,511 WARN L193 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2020-10-24 01:02:21,891 WARN L193 SmtUtils]: Spent 6.35 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2020-10-24 01:02:22,119 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2020-10-24 01:03:06,238 WARN L193 SmtUtils]: Spent 43.98 s on a formula simplification. DAG size of input: 311 DAG size of output: 291 [2020-10-24 01:03:12,538 WARN L193 SmtUtils]: Spent 6.30 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2020-10-24 01:03:13,651 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-10-24 01:03:14,909 WARN L193 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2020-10-24 01:03:15,175 WARN L193 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2020-10-24 01:03:21,405 WARN L193 SmtUtils]: Spent 6.21 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2020-10-24 01:03:38,762 WARN L193 SmtUtils]: Spent 17.35 s on a formula simplification. DAG size of input: 181 DAG size of output: 161 [2020-10-24 01:03:38,774 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-10-24 01:03:38,774 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-10-24 01:03:38,774 INFO L277 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-10-24 01:03:38,774 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-10-24 01:03:38,775 INFO L277 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-10-24 01:03:38,775 INFO L277 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-10-24 01:03:38,775 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 01:03:38,775 INFO L277 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-10-24 01:03:38,775 INFO L277 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-10-24 01:03:38,775 INFO L277 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2020-10-24 01:03:38,775 INFO L270 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-10-24 01:03:38,776 INFO L277 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-10-24 01:03:38,776 INFO L277 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-10-24 01:03:38,776 INFO L277 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-10-24 01:03:38,776 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-24 01:03:38,776 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 01:03:38,776 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-24 01:03:38,776 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-24 01:03:38,779 INFO L270 CegarLoopResult]: At program point L93(line 93) the Hoare annotation is: (let ((.cse8 (= main_~p6~0 0)) (.cse11 (= main_~p4~0 0)) (.cse13 (= main_~lk3~0 1)) (.cse14 (= main_~lk8~0 1)) (.cse12 (= main_~lk5~0 1)) (.cse5 (= main_~p2~0 0)) (.cse10 (= main_~p7~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~p3~0 0)) (.cse2 (= main_~p8~0 0)) (.cse3 (= main_~p5~0 0)) (.cse9 (= main_~lk2~0 1)) (.cse4 (= main_~lk6~0 1)) (.cse6 (= main_~lk1~0 1)) (.cse7 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse9 .cse10 .cse11 .cse12 .cse6) (and .cse0 .cse13 .cse9 .cse10 .cse4 .cse14 .cse12 .cse6) (and .cse13 .cse8 .cse2 .cse3 .cse9 .cse11 .cse6 .cse7) (and .cse0 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse1 .cse9 .cse10 .cse14 .cse11 .cse12 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5 .cse6) (and .cse0 .cse13 .cse8 .cse2 .cse9 .cse12 .cse6 .cse7) (and .cse0 .cse13 .cse2 .cse4 .cse12 .cse5 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse3 .cse11 .cse5 .cse6 .cse7) (and .cse13 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse3 .cse9 .cse10 .cse14 .cse6) (and .cse0 .cse1 .cse9 .cse4 .cse14 .cse12 .cse6 .cse7) (and .cse13 .cse9 .cse10 .cse4 .cse14 .cse11 .cse12 .cse6) (and .cse1 .cse2 .cse10 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse13 .cse3 .cse9 .cse4 .cse14 .cse6 .cse7) (and .cse0 .cse13 .cse2 .cse3 .cse9 .cse10 .cse4 .cse6) (and .cse0 .cse1 .cse4 .cse14 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse3 .cse10 .cse4 .cse14 .cse5 .cse6) (and .cse0 .cse8 .cse1 .cse2 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse2 .cse9 .cse4 .cse12 .cse6 .cse7) (and .cse13 .cse8 .cse2 .cse9 .cse10 .cse11 .cse12 .cse6) (and .cse13 .cse2 .cse3 .cse9 .cse10 .cse4 .cse11 .cse6) (and .cse13 .cse8 .cse9 .cse10 .cse14 .cse11 .cse12 .cse6) (and .cse8 .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse10 .cse4 .cse12 .cse6) (and .cse0 .cse13 .cse8 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse0 .cse13 .cse10 .cse4 .cse14 .cse12 .cse5 .cse6) (and .cse13 .cse8 .cse3 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse9 .cse10 .cse6) (and .cse0 .cse8 .cse1 .cse9 .cse10 .cse14 .cse12 .cse6) (and .cse0 .cse13 .cse2 .cse10 .cse4 .cse12 .cse5 .cse6) (and .cse13 .cse9 .cse4 .cse14 .cse11 .cse12 .cse6 .cse7) (and .cse13 .cse4 .cse14 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse3 .cse9 .cse14 .cse6 .cse7) (and .cse8 .cse1 .cse3 .cse10 .cse14 .cse11 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse10 .cse4 .cse11 .cse5 .cse6) (and .cse13 .cse8 .cse2 .cse10 .cse11 .cse12 .cse5 .cse6) (and .cse8 .cse1 .cse3 .cse9 .cse14 .cse11 .cse6 .cse7) (and .cse13 .cse8 .cse2 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse1 .cse9 .cse4 .cse14 .cse11 .cse12 .cse6 .cse7) (and .cse8 .cse1 .cse10 .cse14 .cse11 .cse12 .cse5 .cse6) (and .cse1 .cse10 .cse4 .cse14 .cse11 .cse12 .cse5 .cse6) (and .cse1 .cse2 .cse9 .cse4 .cse11 .cse12 .cse6 .cse7) (and .cse1 .cse3 .cse4 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7) (and .cse8 .cse1 .cse14 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse9 .cse4 .cse11 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse3 .cse10 .cse14 .cse5 .cse6) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse8 .cse1 .cse2 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse2 .cse3 .cse9 .cse10 .cse6) (and .cse13 .cse8 .cse10 .cse14 .cse11 .cse12 .cse5 .cse6) (and .cse13 .cse2 .cse4 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse13 .cse8 .cse3 .cse9 .cse10 .cse14 .cse11 .cse6) (and .cse1 .cse2 .cse4 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse13 .cse3 .cse9 .cse4 .cse14 .cse11 .cse6 .cse7) (and .cse1 .cse3 .cse10 .cse4 .cse14 .cse11 .cse5 .cse6) (and .cse13 .cse10 .cse4 .cse14 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse9 .cse10 .cse4 .cse14 .cse6) (and .cse8 .cse1 .cse2 .cse3 .cse9 .cse10 .cse11 .cse6) (and .cse13 .cse2 .cse3 .cse10 .cse4 .cse11 .cse5 .cse6) (and .cse0 .cse13 .cse4 .cse14 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse10 .cse4 .cse14 .cse12 .cse5 .cse6) (and .cse13 .cse8 .cse9 .cse14 .cse11 .cse12 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse9 .cse14 .cse12 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse2 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse9 .cse4 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse10 .cse12 .cse5 .cse6) (and .cse13 .cse8 .cse14 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse14 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse14 .cse12 .cse5 .cse6 .cse7) (and .cse13 .cse8 .cse2 .cse3 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse14 .cse5 .cse6) (and .cse1 .cse4 .cse14 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse13 .cse3 .cse4 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse2 .cse3 .cse5 .cse6 .cse7) (and .cse13 .cse2 .cse3 .cse9 .cse4 .cse11 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse3 .cse10 .cse14 .cse5 .cse6) (and .cse0 .cse8 .cse1 .cse3 .cse14 .cse5 .cse6 .cse7) (and .cse13 .cse2 .cse10 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse13 .cse2 .cse9 .cse4 .cse11 .cse12 .cse6 .cse7) (and .cse8 .cse1 .cse9 .cse14 .cse11 .cse12 .cse6 .cse7) (and .cse8 .cse1 .cse3 .cse9 .cse10 .cse14 .cse11 .cse6) (and .cse0 .cse13 .cse2 .cse3 .cse9 .cse4 .cse6 .cse7) (and .cse13 .cse3 .cse9 .cse10 .cse4 .cse14 .cse11 .cse6) (and .cse13 .cse8 .cse3 .cse9 .cse14 .cse11 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse9 .cse14 .cse12 .cse6 .cse7) (and .cse0 .cse13 .cse9 .cse4 .cse14 .cse12 .cse6 .cse7) (and .cse1 .cse2 .cse9 .cse10 .cse4 .cse11 .cse12 .cse6) (and .cse13 .cse3 .cse10 .cse4 .cse14 .cse11 .cse5 .cse6) (and .cse13 .cse8 .cse2 .cse9 .cse11 .cse12 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse10 .cse14 .cse12 .cse5 .cse6) (and .cse13 .cse8 .cse2 .cse3 .cse9 .cse10 .cse11 .cse6) (and .cse0 .cse13 .cse8 .cse3 .cse9 .cse14 .cse6 .cse7) (and .cse13 .cse8 .cse3 .cse10 .cse14 .cse11 .cse5 .cse6) (and .cse8 .cse1 .cse2 .cse10 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse13 .cse2 .cse9 .cse10 .cse4 .cse12 .cse6) (and .cse1 .cse3 .cse9 .cse4 .cse14 .cse11 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse12 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse5 .cse6 .cse7) (and .cse1 .cse3 .cse9 .cse10 .cse4 .cse14 .cse11 .cse6) (and .cse0 .cse13 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse9 .cse12 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse9 .cse11 .cse12 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse9 .cse10 .cse12 .cse6) (and .cse0 .cse13 .cse8 .cse2 .cse9 .cse10 .cse12 .cse6) (and .cse0 .cse13 .cse8 .cse2 .cse3 .cse9 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse9 .cse6 .cse7) (and .cse0 .cse1 .cse9 .cse10 .cse4 .cse14 .cse12 .cse6) (and .cse0 .cse13 .cse8 .cse3 .cse14 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse9 .cse10 .cse14 .cse12 .cse6) (and .cse0 .cse13 .cse8 .cse2 .cse10 .cse12 .cse5 .cse6) (and .cse0 .cse13 .cse2 .cse3 .cse10 .cse4 .cse5 .cse6) (and .cse8 .cse1 .cse3 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse9 .cse10 .cse4 .cse11 .cse6) (and .cse13 .cse8 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6) (and .cse8 .cse1 .cse2 .cse3 .cse9 .cse11 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse10 .cse14 .cse12 .cse5 .cse6) (and .cse1 .cse9 .cse10 .cse4 .cse14 .cse11 .cse12 .cse6) (and .cse0 .cse13 .cse8 .cse3 .cse9 .cse10 .cse14 .cse6) (and .cse13 .cse2 .cse9 .cse10 .cse4 .cse11 .cse12 .cse6) (and .cse0 .cse13 .cse3 .cse9 .cse10 .cse4 .cse14 .cse6) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse10 .cse4 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse4 .cse6 .cse7))) [2020-10-24 01:03:38,779 INFO L277 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-10-24 01:03:38,779 INFO L277 CegarLoopResult]: At program point mainEXIT(lines 6 137) the Hoare annotation is: true [2020-10-24 01:03:38,779 INFO L270 CegarLoopResult]: At program point L118(line 118) the Hoare annotation is: (let ((.cse1 (= main_~p7~0 0)) (.cse0 (= main_~p8~0 0)) (.cse2 (= main_~lk6~0 1)) (.cse3 (= main_~lk8~0 1)) (.cse4 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse4) (and .cse2 .cse3 .cse4))) [2020-10-24 01:03:38,779 INFO L277 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: true [2020-10-24 01:03:38,780 INFO L277 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: true [2020-10-24 01:03:38,780 INFO L277 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: true [2020-10-24 01:03:38,780 INFO L277 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: true [2020-10-24 01:03:38,780 INFO L277 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: true [2020-10-24 01:03:38,780 INFO L270 CegarLoopResult]: At program point L135(line 135) the Hoare annotation is: false [2020-10-24 01:03:38,781 INFO L270 CegarLoopResult]: At program point L102-1(lines 35 132) the Hoare annotation is: (let ((.cse9 (= main_~p7~0 0)) (.cse5 (= main_~lk4~0 1)) (.cse8 (= main_~lk5~0 1)) (.cse1 (= main_~p8~0 0)) (.cse6 (= main_~lk6~0 1)) (.cse0 (= main_~p6~0 0)) (.cse2 (= main_~p5~0 0)) (.cse7 (= main_~lk8~0 1)) (.cse3 (= main_~p4~0 0)) (.cse4 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse3 .cse8 .cse4) (and .cse0 .cse9 .cse7 .cse3 .cse8) (and .cse9 .cse6 .cse7 .cse3 .cse8) (and .cse5 .cse0 .cse2 .cse7 .cse4) (and .cse5 .cse9 .cse6 .cse7 .cse8) (and .cse1 .cse6 .cse3 .cse8 .cse4) (and .cse1 .cse9 .cse6 .cse3 .cse8) (and .cse5 .cse0 .cse9 .cse7 .cse8) (and .cse0 .cse7 .cse3 .cse8 .cse4) (and .cse5 .cse2 .cse9 .cse6 .cse7) (and .cse2 .cse6 .cse7 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse2 .cse9) (and .cse5 .cse0 .cse1 .cse9 .cse8) (and .cse5 .cse1 .cse2 .cse6 .cse4) (and .cse5 .cse0 .cse2 .cse9 .cse7) (and .cse5 .cse0 .cse1 .cse8 .cse4) (and .cse5 .cse0 .cse1 .cse2 .cse4) (and .cse0 .cse1 .cse9 .cse3 .cse8) (and .cse0 .cse2 .cse9 .cse7 .cse3) (and .cse1 .cse2 .cse9 .cse6 .cse3) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse5 .cse2 .cse6 .cse7 .cse4) (and .cse5 .cse1 .cse9 .cse6 .cse8) (and .cse5 .cse1 .cse6 .cse8 .cse4) (and .cse2 .cse9 .cse6 .cse7 .cse3) (and .cse5 .cse1 .cse2 .cse9 .cse6) (and .cse5 .cse0 .cse7 .cse8 .cse4) (and .cse6 .cse7 .cse3 .cse8 .cse4) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse0 .cse2 .cse7 .cse3 .cse4))) [2020-10-24 01:03:38,781 INFO L277 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: true [2020-10-24 01:03:38,781 INFO L277 CegarLoopResult]: At program point L36-1(line 36) the Hoare annotation is: true [2020-10-24 01:03:38,781 INFO L277 CegarLoopResult]: At program point L36-2(line 36) the Hoare annotation is: true [2020-10-24 01:03:38,782 INFO L270 CegarLoopResult]: At program point L94(line 94) the Hoare annotation is: (let ((.cse8 (= main_~p6~0 0)) (.cse11 (= main_~p4~0 0)) (.cse13 (= main_~lk3~0 1)) (.cse14 (= main_~lk8~0 1)) (.cse12 (= main_~lk5~0 1)) (.cse5 (= main_~p2~0 0)) (.cse10 (= main_~p7~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~p3~0 0)) (.cse2 (= main_~p8~0 0)) (.cse3 (= main_~p5~0 0)) (.cse9 (= main_~lk2~0 1)) (.cse4 (= main_~lk6~0 1)) (.cse6 (= main_~lk1~0 1)) (.cse7 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse9 .cse10 .cse11 .cse12 .cse6) (and .cse0 .cse13 .cse9 .cse10 .cse4 .cse14 .cse12 .cse6) (and .cse13 .cse8 .cse2 .cse3 .cse9 .cse11 .cse6 .cse7) (and .cse0 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse1 .cse9 .cse10 .cse14 .cse11 .cse12 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5 .cse6) (and .cse0 .cse13 .cse8 .cse2 .cse9 .cse12 .cse6 .cse7) (and .cse0 .cse13 .cse2 .cse4 .cse12 .cse5 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse3 .cse11 .cse5 .cse6 .cse7) (and .cse13 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse3 .cse9 .cse10 .cse14 .cse6) (and .cse0 .cse1 .cse9 .cse4 .cse14 .cse12 .cse6 .cse7) (and .cse13 .cse9 .cse10 .cse4 .cse14 .cse11 .cse12 .cse6) (and .cse1 .cse2 .cse10 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse13 .cse3 .cse9 .cse4 .cse14 .cse6 .cse7) (and .cse0 .cse13 .cse2 .cse3 .cse9 .cse10 .cse4 .cse6) (and .cse0 .cse1 .cse4 .cse14 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse3 .cse10 .cse4 .cse14 .cse5 .cse6) (and .cse0 .cse8 .cse1 .cse2 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse2 .cse9 .cse4 .cse12 .cse6 .cse7) (and .cse13 .cse8 .cse2 .cse9 .cse10 .cse11 .cse12 .cse6) (and .cse13 .cse2 .cse3 .cse9 .cse10 .cse4 .cse11 .cse6) (and .cse13 .cse8 .cse9 .cse10 .cse14 .cse11 .cse12 .cse6) (and .cse8 .cse1 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse10 .cse4 .cse12 .cse6) (and .cse0 .cse13 .cse8 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse0 .cse13 .cse10 .cse4 .cse14 .cse12 .cse5 .cse6) (and .cse13 .cse8 .cse3 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse9 .cse10 .cse6) (and .cse0 .cse8 .cse1 .cse9 .cse10 .cse14 .cse12 .cse6) (and .cse0 .cse13 .cse2 .cse10 .cse4 .cse12 .cse5 .cse6) (and .cse13 .cse9 .cse4 .cse14 .cse11 .cse12 .cse6 .cse7) (and .cse13 .cse4 .cse14 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse3 .cse9 .cse14 .cse6 .cse7) (and .cse8 .cse1 .cse3 .cse10 .cse14 .cse11 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse10 .cse4 .cse11 .cse5 .cse6) (and .cse13 .cse8 .cse2 .cse10 .cse11 .cse12 .cse5 .cse6) (and .cse8 .cse1 .cse3 .cse9 .cse14 .cse11 .cse6 .cse7) (and .cse13 .cse8 .cse2 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse1 .cse9 .cse4 .cse14 .cse11 .cse12 .cse6 .cse7) (and .cse8 .cse1 .cse10 .cse14 .cse11 .cse12 .cse5 .cse6) (and .cse1 .cse10 .cse4 .cse14 .cse11 .cse12 .cse5 .cse6) (and .cse1 .cse2 .cse9 .cse4 .cse11 .cse12 .cse6 .cse7) (and .cse1 .cse3 .cse4 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7) (and .cse8 .cse1 .cse14 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse9 .cse4 .cse11 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse3 .cse10 .cse14 .cse5 .cse6) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse8 .cse1 .cse2 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse2 .cse3 .cse9 .cse10 .cse6) (and .cse13 .cse8 .cse10 .cse14 .cse11 .cse12 .cse5 .cse6) (and .cse13 .cse2 .cse4 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse13 .cse8 .cse3 .cse9 .cse10 .cse14 .cse11 .cse6) (and .cse1 .cse2 .cse4 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse13 .cse3 .cse9 .cse4 .cse14 .cse11 .cse6 .cse7) (and .cse1 .cse3 .cse10 .cse4 .cse14 .cse11 .cse5 .cse6) (and .cse13 .cse10 .cse4 .cse14 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse9 .cse10 .cse4 .cse14 .cse6) (and .cse8 .cse1 .cse2 .cse3 .cse9 .cse10 .cse11 .cse6) (and .cse13 .cse2 .cse3 .cse10 .cse4 .cse11 .cse5 .cse6) (and .cse0 .cse13 .cse4 .cse14 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse10 .cse4 .cse14 .cse12 .cse5 .cse6) (and .cse13 .cse8 .cse9 .cse14 .cse11 .cse12 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse9 .cse14 .cse12 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse2 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse9 .cse4 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse10 .cse12 .cse5 .cse6) (and .cse13 .cse8 .cse14 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse14 .cse12 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse14 .cse12 .cse5 .cse6 .cse7) (and .cse13 .cse8 .cse2 .cse3 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse14 .cse5 .cse6) (and .cse1 .cse4 .cse14 .cse11 .cse12 .cse5 .cse6 .cse7) (and .cse13 .cse3 .cse4 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse2 .cse3 .cse5 .cse6 .cse7) (and .cse13 .cse2 .cse3 .cse9 .cse4 .cse11 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse3 .cse10 .cse14 .cse5 .cse6) (and .cse0 .cse8 .cse1 .cse3 .cse14 .cse5 .cse6 .cse7) (and .cse13 .cse2 .cse10 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse13 .cse2 .cse9 .cse4 .cse11 .cse12 .cse6 .cse7) (and .cse8 .cse1 .cse9 .cse14 .cse11 .cse12 .cse6 .cse7) (and .cse8 .cse1 .cse3 .cse9 .cse10 .cse14 .cse11 .cse6) (and .cse0 .cse13 .cse2 .cse3 .cse9 .cse4 .cse6 .cse7) (and .cse13 .cse3 .cse9 .cse10 .cse4 .cse14 .cse11 .cse6) (and .cse13 .cse8 .cse3 .cse9 .cse14 .cse11 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse9 .cse14 .cse12 .cse6 .cse7) (and .cse0 .cse13 .cse9 .cse4 .cse14 .cse12 .cse6 .cse7) (and .cse1 .cse2 .cse9 .cse10 .cse4 .cse11 .cse12 .cse6) (and .cse13 .cse3 .cse10 .cse4 .cse14 .cse11 .cse5 .cse6) (and .cse13 .cse8 .cse2 .cse9 .cse11 .cse12 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse10 .cse14 .cse12 .cse5 .cse6) (and .cse13 .cse8 .cse2 .cse3 .cse9 .cse10 .cse11 .cse6) (and .cse0 .cse13 .cse8 .cse3 .cse9 .cse14 .cse6 .cse7) (and .cse13 .cse8 .cse3 .cse10 .cse14 .cse11 .cse5 .cse6) (and .cse8 .cse1 .cse2 .cse10 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse13 .cse2 .cse9 .cse10 .cse4 .cse12 .cse6) (and .cse1 .cse3 .cse9 .cse4 .cse14 .cse11 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse12 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse5 .cse6 .cse7) (and .cse1 .cse3 .cse9 .cse10 .cse4 .cse14 .cse11 .cse6) (and .cse0 .cse13 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse9 .cse12 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse9 .cse11 .cse12 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse9 .cse10 .cse12 .cse6) (and .cse0 .cse13 .cse8 .cse2 .cse9 .cse10 .cse12 .cse6) (and .cse0 .cse13 .cse8 .cse2 .cse3 .cse9 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse9 .cse6 .cse7) (and .cse0 .cse1 .cse9 .cse10 .cse4 .cse14 .cse12 .cse6) (and .cse0 .cse13 .cse8 .cse3 .cse14 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse9 .cse10 .cse14 .cse12 .cse6) (and .cse0 .cse13 .cse8 .cse2 .cse10 .cse12 .cse5 .cse6) (and .cse0 .cse13 .cse2 .cse3 .cse10 .cse4 .cse5 .cse6) (and .cse8 .cse1 .cse3 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse9 .cse10 .cse4 .cse11 .cse6) (and .cse13 .cse8 .cse2 .cse3 .cse10 .cse11 .cse5 .cse6) (and .cse8 .cse1 .cse2 .cse3 .cse9 .cse11 .cse6 .cse7) (and .cse0 .cse13 .cse8 .cse10 .cse14 .cse12 .cse5 .cse6) (and .cse1 .cse9 .cse10 .cse4 .cse14 .cse11 .cse12 .cse6) (and .cse0 .cse13 .cse8 .cse3 .cse9 .cse10 .cse14 .cse6) (and .cse13 .cse2 .cse9 .cse10 .cse4 .cse11 .cse12 .cse6) (and .cse0 .cse13 .cse3 .cse9 .cse10 .cse4 .cse14 .cse6) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse10 .cse4 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse4 .cse6 .cse7))) [2020-10-24 01:03:38,783 INFO L277 CegarLoopResult]: At program point L127-1(lines 35 132) the Hoare annotation is: true [2020-10-24 01:03:38,783 INFO L270 CegarLoopResult]: At program point L119(line 119) the Hoare annotation is: (let ((.cse1 (= main_~p7~0 0)) (.cse0 (= main_~p8~0 0)) (.cse2 (= main_~lk6~0 1)) (.cse3 (= main_~lk8~0 1)) (.cse4 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse4) (and .cse2 .cse3 .cse4))) [2020-10-24 01:03:38,785 INFO L270 CegarLoopResult]: At program point L86-1(lines 35 132) the Hoare annotation is: (let ((.cse12 (= main_~lk1~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse8 (= main_~lk3~0 1)) (.cse14 (= main_~p6~0 0)) (.cse2 (= main_~p8~0 0)) (.cse9 (= main_~p5~0 0)) (.cse4 (= main_~p7~0 0)) (.cse11 (= main_~p2~0 0)) (.cse1 (= main_~p3~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse5 (= main_~lk6~0 1)) (.cse15 (= main_~lk8~0 1)) (.cse10 (= main_~p4~0 0)) (.cse6 (= main_~lk5~0 1)) (.cse7 (= main_~p1~0 0)) (.cse13 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse2 .cse9 .cse3 .cse4 .cse5 .cse10 .cse7) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse11 .cse12 .cse13) (and .cse14 .cse1 .cse2 .cse3 .cse4 .cse10 .cse6 .cse12) (and .cse0 .cse8 .cse14 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse1 .cse2 .cse5 .cse10 .cse6 .cse7 .cse11 .cse13) (and .cse14 .cse1 .cse2 .cse4 .cse10 .cse6 .cse7 .cse11) (and .cse0 .cse8 .cse3 .cse4 .cse5 .cse15 .cse6 .cse12) (and .cse0 .cse14 .cse1 .cse2 .cse9 .cse3 .cse4 .cse7) (and .cse0 .cse8 .cse9 .cse5 .cse15 .cse7 .cse11 .cse13) (and .cse8 .cse9 .cse5 .cse15 .cse10 .cse7 .cse11 .cse13) (and .cse8 .cse14 .cse2 .cse3 .cse10 .cse6 .cse7 .cse13) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse5 .cse11 .cse12) (and .cse0 .cse8 .cse14 .cse2 .cse3 .cse6 .cse7 .cse13) (and .cse0 .cse8 .cse2 .cse5 .cse6 .cse11 .cse12 .cse13) (and .cse14 .cse1 .cse2 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse8 .cse14 .cse2 .cse3 .cse6 .cse12 .cse13) (and .cse8 .cse14 .cse15 .cse10 .cse6 .cse7 .cse11 .cse13) (and .cse8 .cse14 .cse2 .cse9 .cse10 .cse7 .cse11 .cse13) (and .cse14 .cse1 .cse3 .cse15 .cse10 .cse6 .cse7 .cse13) (and .cse0 .cse1 .cse4 .cse5 .cse15 .cse6 .cse7 .cse11) (and .cse1 .cse2 .cse9 .cse5 .cse10 .cse11 .cse12 .cse13) (and .cse8 .cse14 .cse9 .cse4 .cse15 .cse10 .cse7 .cse11) (and .cse0 .cse8 .cse14 .cse9 .cse3 .cse15 .cse7 .cse13) (and .cse0 .cse14 .cse1 .cse2 .cse3 .cse6 .cse7 .cse13) (and .cse1 .cse4 .cse5 .cse15 .cse10 .cse6 .cse7 .cse11) (and .cse14 .cse1 .cse2 .cse10 .cse6 .cse7 .cse11 .cse13) (and .cse0 .cse8 .cse9 .cse3 .cse5 .cse15 .cse12 .cse13) (and .cse1 .cse9 .cse3 .cse5 .cse15 .cse10 .cse7 .cse13) (and .cse0 .cse8 .cse2 .cse3 .cse5 .cse6 .cse12 .cse13) (and .cse8 .cse14 .cse9 .cse3 .cse15 .cse10 .cse7 .cse13) (and .cse0 .cse14 .cse1 .cse2 .cse9 .cse3 .cse7 .cse13) (and .cse8 .cse14 .cse2 .cse3 .cse4 .cse10 .cse6 .cse12) (and .cse8 .cse5 .cse15 .cse10 .cse6 .cse7 .cse11 .cse13) (and .cse8 .cse2 .cse9 .cse3 .cse4 .cse5 .cse10 .cse12) (and .cse0 .cse1 .cse9 .cse4 .cse5 .cse15 .cse7 .cse11) (and .cse0 .cse14 .cse1 .cse2 .cse9 .cse7 .cse11 .cse13) (and .cse0 .cse14 .cse1 .cse9 .cse3 .cse4 .cse15 .cse7) (and .cse14 .cse1 .cse9 .cse3 .cse15 .cse10 .cse7 .cse13) (and .cse8 .cse2 .cse9 .cse4 .cse5 .cse10 .cse7 .cse11) (and .cse0 .cse14 .cse1 .cse3 .cse4 .cse15 .cse6 .cse7) (and .cse8 .cse14 .cse9 .cse15 .cse10 .cse7 .cse11 .cse13) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse5 .cse7 .cse13) (and .cse0 .cse8 .cse4 .cse5 .cse15 .cse6 .cse11 .cse12) (and .cse8 .cse14 .cse2 .cse10 .cse6 .cse7 .cse11 .cse13) (and .cse0 .cse14 .cse1 .cse2 .cse9 .cse3 .cse4 .cse12) (and .cse0 .cse14 .cse1 .cse3 .cse4 .cse15 .cse6 .cse12) (and .cse8 .cse3 .cse5 .cse15 .cse10 .cse6 .cse12 .cse13) (and .cse0 .cse14 .cse1 .cse9 .cse15 .cse7 .cse11 .cse13) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 .cse7) (and .cse8 .cse14 .cse2 .cse4 .cse10 .cse6 .cse11 .cse12) (and .cse8 .cse14 .cse2 .cse10 .cse6 .cse11 .cse12 .cse13) (and .cse14 .cse1 .cse9 .cse3 .cse15 .cse10 .cse12 .cse13) (and .cse1 .cse3 .cse5 .cse15 .cse10 .cse6 .cse12 .cse13) (and .cse14 .cse1 .cse4 .cse15 .cse10 .cse6 .cse11 .cse12) (and .cse1 .cse4 .cse5 .cse15 .cse10 .cse6 .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse5 .cse10 .cse6 .cse12 .cse13) (and .cse1 .cse9 .cse5 .cse15 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse9 .cse5 .cse15 .cse11 .cse12 .cse13) (and .cse0 .cse8 .cse14 .cse9 .cse4 .cse15 .cse11 .cse12) (and .cse0 .cse14 .cse1 .cse2 .cse9 .cse4 .cse11 .cse12) (and .cse0 .cse8 .cse14 .cse2 .cse9 .cse3 .cse4 .cse12) (and .cse8 .cse14 .cse4 .cse15 .cse10 .cse6 .cse11 .cse12) (and .cse8 .cse3 .cse5 .cse15 .cse10 .cse6 .cse7 .cse13) (and .cse1 .cse2 .cse4 .cse5 .cse10 .cse6 .cse7 .cse11) (and .cse8 .cse2 .cse5 .cse10 .cse6 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse3 .cse5 .cse10 .cse6 .cse7 .cse13) (and .cse8 .cse14 .cse9 .cse3 .cse4 .cse15 .cse10 .cse12) (and .cse1 .cse2 .cse5 .cse10 .cse6 .cse11 .cse12 .cse13) (and .cse8 .cse9 .cse3 .cse5 .cse15 .cse10 .cse12 .cse13) (and .cse8 .cse4 .cse5 .cse15 .cse10 .cse6 .cse11 .cse12) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse5 .cse15 .cse12) (and .cse8 .cse14 .cse2 .cse9 .cse3 .cse4 .cse10 .cse7) (and .cse0 .cse8 .cse14 .cse4 .cse15 .cse6 .cse7 .cse11) (and .cse8 .cse2 .cse9 .cse4 .cse5 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse4 .cse5 .cse15 .cse6 .cse11 .cse12) (and .cse0 .cse14 .cse1 .cse3 .cse15 .cse6 .cse12 .cse13) (and .cse0 .cse8 .cse2 .cse4 .cse5 .cse6 .cse7 .cse11) (and .cse0 .cse1 .cse9 .cse3 .cse5 .cse15 .cse12 .cse13) (and .cse0 .cse14 .cse1 .cse2 .cse4 .cse6 .cse11 .cse12) (and .cse0 .cse8 .cse14 .cse15 .cse6 .cse11 .cse12 .cse13) (and .cse8 .cse14 .cse9 .cse3 .cse4 .cse15 .cse10 .cse7) (and .cse0 .cse8 .cse2 .cse3 .cse5 .cse6 .cse7 .cse13) (and .cse8 .cse9 .cse5 .cse15 .cse10 .cse11 .cse12 .cse13) (and .cse8 .cse2 .cse9 .cse3 .cse5 .cse10 .cse12 .cse13) (and .cse8 .cse2 .cse3 .cse5 .cse10 .cse6 .cse12 .cse13) (and .cse14 .cse1 .cse3 .cse15 .cse10 .cse6 .cse12 .cse13) (and .cse14 .cse1 .cse9 .cse3 .cse4 .cse15 .cse10 .cse12) (and .cse0 .cse8 .cse2 .cse9 .cse3 .cse5 .cse12 .cse13) (and .cse1 .cse2 .cse9 .cse5 .cse10 .cse7 .cse11 .cse13) (and .cse0 .cse8 .cse14 .cse9 .cse15 .cse7 .cse11 .cse13) (and .cse0 .cse8 .cse2 .cse5 .cse6 .cse7 .cse11 .cse13) (and .cse8 .cse14 .cse9 .cse3 .cse15 .cse10 .cse12 .cse13) (and .cse0 .cse14 .cse1 .cse4 .cse15 .cse6 .cse7 .cse11) (and .cse0 .cse8 .cse14 .cse3 .cse15 .cse6 .cse12 .cse13) (and .cse1 .cse5 .cse15 .cse10 .cse6 .cse7 .cse11 .cse13) (and .cse0 .cse8 .cse3 .cse5 .cse15 .cse6 .cse12 .cse13) (and .cse1 .cse9 .cse4 .cse5 .cse15 .cse10 .cse7 .cse11) (and .cse8 .cse3 .cse4 .cse5 .cse15 .cse10 .cse6 .cse7) (and .cse0 .cse8 .cse14 .cse2 .cse9 .cse3 .cse7 .cse13) (and .cse8 .cse14 .cse2 .cse3 .cse10 .cse6 .cse12 .cse13) (and .cse0 .cse8 .cse14 .cse9 .cse4 .cse15 .cse7 .cse11) (and .cse8 .cse14 .cse9 .cse4 .cse15 .cse10 .cse11 .cse12) (and .cse14 .cse1 .cse2 .cse4 .cse10 .cse6 .cse11 .cse12) (and .cse0 .cse8 .cse9 .cse3 .cse5 .cse15 .cse7 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse12 .cse13) (and .cse0 .cse14 .cse1 .cse2 .cse3 .cse6 .cse12 .cse13) (and .cse0 .cse8 .cse9 .cse3 .cse4 .cse5 .cse15 .cse7) (and .cse0 .cse14 .cse1 .cse2 .cse3 .cse4 .cse6 .cse12) (and .cse14 .cse1 .cse2 .cse9 .cse4 .cse10 .cse7 .cse11) (and .cse0 .cse8 .cse2 .cse9 .cse3 .cse4 .cse5 .cse7) (and .cse0 .cse8 .cse14 .cse2 .cse4 .cse6 .cse11 .cse12) (and .cse0 .cse8 .cse14 .cse9 .cse15 .cse11 .cse12 .cse13) (and .cse8 .cse9 .cse3 .cse4 .cse5 .cse15 .cse10 .cse7) (and .cse1 .cse9 .cse5 .cse15 .cse10 .cse7 .cse11 .cse13) (and .cse14 .cse1 .cse2 .cse9 .cse10 .cse7 .cse11 .cse13) (and .cse0 .cse8 .cse2 .cse9 .cse4 .cse5 .cse11 .cse12) (and .cse14 .cse1 .cse2 .cse3 .cse4 .cse10 .cse6 .cse7) (and .cse0 .cse14 .cse1 .cse9 .cse3 .cse15 .cse7 .cse13) (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse7) (and .cse8 .cse14 .cse2 .cse9 .cse4 .cse10 .cse11 .cse12) (and .cse14 .cse1 .cse2 .cse9 .cse3 .cse10 .cse12 .cse13) (and .cse0 .cse8 .cse14 .cse4 .cse15 .cse6 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse5 .cse15 .cse6 .cse7 .cse13) (and .cse0 .cse8 .cse14 .cse2 .cse9 .cse7 .cse11 .cse13) (and .cse14 .cse1 .cse15 .cse10 .cse6 .cse7 .cse11 .cse13) (and .cse1 .cse3 .cse4 .cse5 .cse15 .cse10 .cse6 .cse12) (and .cse0 .cse8 .cse14 .cse9 .cse3 .cse4 .cse15 .cse12) (and .cse8 .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse12) (and .cse0 .cse8 .cse9 .cse3 .cse4 .cse5 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 .cse12) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse5 .cse12 .cse13) (and .cse0 .cse8 .cse14 .cse9 .cse3 .cse4 .cse15 .cse7) (and .cse0 .cse1 .cse9 .cse3 .cse5 .cse15 .cse7 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse11) (and .cse8 .cse14 .cse2 .cse9 .cse3 .cse10 .cse12 .cse13) (and .cse0 .cse8 .cse2 .cse9 .cse5 .cse11 .cse12 .cse13) (and .cse14 .cse1 .cse3 .cse4 .cse15 .cse10 .cse6 .cse12) (and .cse8 .cse2 .cse9 .cse3 .cse5 .cse10 .cse7 .cse13) (and .cse0 .cse14 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse8 .cse2 .cse9 .cse5 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse8 .cse2 .cse9 .cse3 .cse5 .cse7 .cse13) (and .cse0 .cse8 .cse14 .cse15 .cse6 .cse7 .cse11 .cse13) (and .cse0 .cse14 .cse1 .cse9 .cse3 .cse4 .cse15 .cse12) (and .cse0 .cse1 .cse3 .cse5 .cse15 .cse6 .cse12 .cse13) (and .cse1 .cse2 .cse9 .cse3 .cse5 .cse10 .cse7 .cse13) (and .cse8 .cse3 .cse4 .cse5 .cse15 .cse10 .cse6 .cse12) (and .cse1 .cse2 .cse4 .cse5 .cse10 .cse6 .cse11 .cse12) (and .cse8 .cse14 .cse3 .cse4 .cse15 .cse10 .cse6 .cse7) (and .cse14 .cse1 .cse2 .cse9 .cse3 .cse4 .cse10 .cse7) (and .cse14 .cse1 .cse3 .cse4 .cse15 .cse10 .cse6 .cse7) (and .cse0 .cse8 .cse2 .cse9 .cse3 .cse4 .cse5 .cse12) (and .cse0 .cse1 .cse5 .cse15 .cse6 .cse11 .cse12 .cse13) (and .cse0 .cse8 .cse9 .cse4 .cse5 .cse15 .cse11 .cse12) (and .cse8 .cse4 .cse5 .cse15 .cse10 .cse6 .cse7 .cse11) (and .cse8 .cse9 .cse3 .cse5 .cse15 .cse10 .cse7 .cse13) (and .cse0 .cse8 .cse3 .cse5 .cse15 .cse6 .cse7 .cse13) (and .cse0 .cse14 .cse1 .cse3 .cse15 .cse6 .cse7 .cse13) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse15 .cse6 .cse7) (and .cse0 .cse14 .cse1 .cse2 .cse6 .cse11 .cse12 .cse13) (and .cse0 .cse14 .cse1 .cse2 .cse4 .cse6 .cse7 .cse11) (and .cse8 .cse14 .cse3 .cse4 .cse15 .cse10 .cse6 .cse12) (and .cse14 .cse1 .cse2 .cse9 .cse4 .cse10 .cse11 .cse12) (and .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 .cse10 .cse7) (and .cse14 .cse1 .cse9 .cse4 .cse15 .cse10 .cse7 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse8 .cse14 .cse2 .cse9 .cse4 .cse11 .cse12) (and .cse8 .cse14 .cse9 .cse15 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse1 .cse2 .cse9 .cse3 .cse10 .cse7 .cse13) (and .cse0 .cse8 .cse9 .cse4 .cse5 .cse15 .cse7 .cse11) (and .cse0 .cse8 .cse2 .cse4 .cse5 .cse6 .cse11 .cse12) (and .cse8 .cse5 .cse15 .cse10 .cse6 .cse11 .cse12 .cse13) (and .cse0 .cse14 .cse1 .cse9 .cse3 .cse15 .cse12 .cse13) (and .cse14 .cse1 .cse9 .cse4 .cse15 .cse10 .cse11 .cse12) (and .cse0 .cse8 .cse2 .cse9 .cse4 .cse5 .cse7 .cse11) (and .cse1 .cse2 .cse9 .cse4 .cse5 .cse10 .cse11 .cse12) (and .cse0 .cse8 .cse3 .cse4 .cse5 .cse15 .cse6 .cse7) (and .cse0 .cse8 .cse14 .cse2 .cse9 .cse3 .cse4 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse7) (and .cse14 .cse1 .cse15 .cse10 .cse6 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse9 .cse3 .cse5 .cse10 .cse12 .cse13) (and .cse14 .cse1 .cse2 .cse10 .cse6 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse5 .cse7 .cse11) (and .cse0 .cse1 .cse5 .cse15 .cse6 .cse7 .cse11 .cse13) (and .cse1 .cse9 .cse4 .cse5 .cse15 .cse10 .cse11 .cse12) (and .cse8 .cse14 .cse2 .cse9 .cse3 .cse10 .cse7 .cse13) (and .cse14 .cse1 .cse2 .cse9 .cse3 .cse4 .cse10 .cse12) (and .cse14 .cse1 .cse4 .cse15 .cse10 .cse6 .cse7 .cse11) (and .cse0 .cse8 .cse5 .cse15 .cse6 .cse11 .cse12 .cse13) (and .cse8 .cse14 .cse3 .cse15 .cse10 .cse6 .cse12 .cse13) (and .cse0 .cse8 .cse14 .cse2 .cse4 .cse6 .cse7 .cse11) (and .cse0 .cse8 .cse14 .cse2 .cse6 .cse11 .cse12 .cse13) (and .cse8 .cse14 .cse15 .cse10 .cse6 .cse11 .cse12 .cse13) (and .cse0 .cse14 .cse1 .cse15 .cse6 .cse11 .cse12 .cse13) (and .cse8 .cse9 .cse4 .cse5 .cse15 .cse10 .cse7 .cse11) (and .cse8 .cse14 .cse2 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse9 .cse4 .cse5 .cse15 .cse11 .cse12) (and .cse8 .cse14 .cse4 .cse15 .cse10 .cse6 .cse7 .cse11) (and .cse1 .cse5 .cse15 .cse10 .cse6 .cse11 .cse12 .cse13) (and .cse0 .cse8 .cse14 .cse2 .cse9 .cse11 .cse12 .cse13) (and .cse8 .cse14 .cse2 .cse3 .cse4 .cse10 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse11 .cse13) (and .cse8 .cse14 .cse2 .cse9 .cse4 .cse10 .cse7 .cse11) (and .cse0 .cse14 .cse1 .cse9 .cse4 .cse15 .cse11 .cse12) (and .cse0 .cse14 .cse1 .cse9 .cse15 .cse11 .cse12 .cse13) (and .cse8 .cse2 .cse4 .cse5 .cse10 .cse6 .cse11 .cse12) (and .cse8 .cse9 .cse3 .cse4 .cse5 .cse15 .cse10 .cse12) (and .cse14 .cse1 .cse9 .cse3 .cse4 .cse15 .cse10 .cse7) (and .cse0 .cse8 .cse14 .cse3 .cse4 .cse15 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse12) (and .cse0 .cse8 .cse5 .cse15 .cse6 .cse7 .cse11 .cse13) (and .cse8 .cse9 .cse4 .cse5 .cse15 .cse10 .cse11 .cse12) (and .cse0 .cse8 .cse2 .cse9 .cse5 .cse7 .cse11 .cse13) (and .cse0 .cse14 .cse1 .cse4 .cse15 .cse6 .cse11 .cse12) (and .cse8 .cse14 .cse2 .cse9 .cse3 .cse4 .cse10 .cse12) (and .cse0 .cse8 .cse14 .cse9 .cse3 .cse15 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse13) (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse1 .cse9 .cse3 .cse5 .cse15 .cse10 .cse12 .cse13) (and .cse0 .cse14 .cse1 .cse2 .cse6 .cse7 .cse11 .cse13) (and .cse14 .cse1 .cse2 .cse3 .cse10 .cse6 .cse7 .cse13) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse11 .cse12 .cse13) (and .cse1 .cse9 .cse3 .cse4 .cse5 .cse15 .cse10 .cse12) (and .cse0 .cse1 .cse9 .cse5 .cse15 .cse7 .cse11 .cse13) (and .cse0 .cse8 .cse9 .cse5 .cse15 .cse11 .cse12 .cse13) (and .cse14 .cse1 .cse2 .cse3 .cse10 .cse6 .cse12 .cse13) (and .cse8 .cse14 .cse2 .cse4 .cse10 .cse6 .cse7 .cse11) (and .cse0 .cse14 .cse1 .cse2 .cse9 .cse11 .cse12 .cse13) (and .cse0 .cse14 .cse1 .cse15 .cse6 .cse7 .cse11 .cse13) (and .cse1 .cse3 .cse4 .cse5 .cse15 .cse10 .cse6 .cse7) (and .cse0 .cse8 .cse14 .cse2 .cse3 .cse4 .cse6 .cse12) (and .cse0 .cse14 .cse1 .cse2 .cse9 .cse4 .cse7 .cse11) (and .cse0 .cse8 .cse14 .cse2 .cse9 .cse3 .cse12 .cse13) (and .cse0 .cse14 .cse1 .cse2 .cse9 .cse3 .cse12 .cse13) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse15 .cse6 .cse12) (and .cse0 .cse8 .cse14 .cse3 .cse4 .cse15 .cse6 .cse12) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse5 .cse15 .cse7) (and .cse1 .cse9 .cse3 .cse4 .cse5 .cse15 .cse10 .cse7) (and .cse8 .cse2 .cse3 .cse5 .cse10 .cse6 .cse7 .cse13) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse7 .cse11 .cse13) (and .cse8 .cse2 .cse9 .cse5 .cse10 .cse7 .cse11 .cse13) (and .cse0 .cse14 .cse1 .cse9 .cse4 .cse15 .cse7 .cse11) (and .cse14 .cse1 .cse9 .cse15 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse9 .cse4 .cse5 .cse10 .cse7 .cse11) (and .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 .cse10 .cse12) (and .cse14 .cse1 .cse9 .cse15 .cse10 .cse7 .cse11 .cse13) (and .cse0 .cse8 .cse14 .cse2 .cse6 .cse7 .cse11 .cse13) (and .cse8 .cse2 .cse5 .cse10 .cse6 .cse7 .cse11 .cse13) (and .cse0 .cse8 .cse4 .cse5 .cse15 .cse6 .cse7 .cse11) (and .cse8 .cse2 .cse4 .cse5 .cse10 .cse6 .cse7 .cse11) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse11 .cse12) (and .cse8 .cse14 .cse3 .cse15 .cse10 .cse6 .cse7 .cse13) (and .cse0 .cse8 .cse14 .cse3 .cse15 .cse6 .cse7 .cse13) (and .cse0 .cse8 .cse14 .cse2 .cse9 .cse4 .cse7 .cse11) (and .cse1 .cse3 .cse5 .cse15 .cse10 .cse6 .cse7 .cse13))) [2020-10-24 01:03:38,785 INFO L277 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-10-24 01:03:38,786 INFO L277 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: true [2020-10-24 01:03:38,786 INFO L277 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: true [2020-10-24 01:03:38,786 INFO L270 CegarLoopResult]: At program point L78-1(lines 35 132) the Hoare annotation is: (let ((.cse6 (= main_~lk6~0 1)) (.cse9 (= main_~p1~0 0)) (.cse10 (= main_~lk3~0 1)) (.cse3 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse4 (= main_~p2~0 0)) (.cse1 (= main_~p6~0 0)) (.cse2 (= main_~p3~0 0)) (.cse11 (= main_~p5~0 0)) (.cse8 (= main_~lk2~0 1)) (.cse7 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse8 .cse6 .cse3 .cse9) (and .cse10 .cse11 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse11 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse6 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse11 .cse6 .cse9 .cse4) (and .cse0 .cse2 .cse6 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse6 .cse9 .cse4) (and .cse0 .cse10 .cse8 .cse6 .cse3 .cse5) (and .cse0 .cse10 .cse1 .cse3 .cse9 .cse4) (and .cse10 .cse11 .cse8 .cse6 .cse7 .cse9) (and .cse10 .cse1 .cse11 .cse8 .cse7 .cse5) (and .cse10 .cse11 .cse8 .cse6 .cse7 .cse5) (and .cse0 .cse10 .cse1 .cse8 .cse3 .cse5) (and .cse2 .cse11 .cse8 .cse6 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse8 .cse9) (and .cse10 .cse1 .cse8 .cse7 .cse3 .cse5) (and .cse2 .cse11 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse10 .cse11 .cse8 .cse6 .cse5) (and .cse10 .cse11 .cse6 .cse7 .cse9 .cse4) (and .cse1 .cse2 .cse11 .cse7 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse9) (and .cse10 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse2 .cse11 .cse6 .cse7 .cse9 .cse4) (and .cse10 .cse1 .cse11 .cse7 .cse9 .cse4) (and .cse0 .cse10 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse10 .cse8 .cse6 .cse3 .cse9) (and .cse0 .cse10 .cse1 .cse11 .cse8 .cse5) (and .cse0 .cse10 .cse6 .cse3 .cse9 .cse4) (and .cse10 .cse8 .cse6 .cse7 .cse3 .cse9) (and .cse10 .cse1 .cse7 .cse3 .cse9 .cse4) (and .cse1 .cse2 .cse8 .cse7 .cse3 .cse9) (and .cse1 .cse2 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse2 .cse8 .cse6 .cse3 .cse5) (and .cse10 .cse1 .cse11 .cse7 .cse4 .cse5) (and .cse0 .cse2 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse8 .cse5) (and .cse10 .cse8 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse2 .cse11 .cse8 .cse6 .cse9) (and .cse10 .cse6 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse1 .cse11 .cse4 .cse5) (and .cse1 .cse2 .cse8 .cse7 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse9 .cse4) (and .cse10 .cse1 .cse8 .cse7 .cse3 .cse9) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse8 .cse6 .cse9) (and .cse10 .cse1 .cse11 .cse8 .cse7 .cse9) (and .cse2 .cse8 .cse6 .cse7 .cse3 .cse9) (and .cse0 .cse2 .cse11 .cse8 .cse6 .cse5) (and .cse2 .cse11 .cse8 .cse6 .cse7 .cse5) (and .cse2 .cse8 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse10 .cse1 .cse8 .cse3 .cse9) (and .cse0 .cse2 .cse11 .cse6 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse8 .cse7 .cse9) (and .cse1 .cse2 .cse11 .cse7 .cse9 .cse4) (and .cse0 .cse10 .cse1 .cse11 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse4) (and .cse10 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse8 .cse7 .cse5))) [2020-10-24 01:03:38,787 INFO L277 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-10-24 01:03:38,787 INFO L270 CegarLoopResult]: At program point L136(line 136) the Hoare annotation is: false [2020-10-24 01:03:38,787 INFO L270 CegarLoopResult]: At program point L103(line 103) the Hoare annotation is: (let ((.cse10 (= main_~p7~0 0)) (.cse9 (= main_~p5~0 0)) (.cse3 (= main_~p4~0 0)) (.cse2 (= main_~lk6~0 1)) (.cse7 (= main_~lk8~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse6 (= main_~p6~0 0)) (.cse1 (= main_~p8~0 0)) (.cse4 (= main_~lk5~0 1)) (.cse5 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse9 .cse10 .cse2 .cse7) (and .cse0 .cse6 .cse9 .cse10 .cse7 .cse3) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse5) (and .cse8 .cse0 .cse6 .cse10 .cse7 .cse4) (and .cse0 .cse10 .cse2 .cse7 .cse3 .cse4) (and .cse0 .cse6 .cse1 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse10 .cse3 .cse4) (and .cse0 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse9 .cse2 .cse7 .cse5) (and .cse0 .cse6 .cse9 .cse7 .cse3 .cse5) (and .cse0 .cse6 .cse10 .cse7 .cse3 .cse4) (and .cse0 .cse9 .cse10 .cse2 .cse7 .cse3) (and .cse0 .cse9 .cse2 .cse7 .cse3 .cse5) (and .cse8 .cse0 .cse6 .cse1 .cse10 .cse4) (and .cse8 .cse0 .cse6 .cse9 .cse10 .cse7) (and .cse8 .cse0 .cse1 .cse10 .cse2 .cse4) (and .cse8 .cse0 .cse10 .cse2 .cse7 .cse4) (and .cse8 .cse0 .cse6 .cse9 .cse7 .cse5) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse8 .cse0 .cse1 .cse9 .cse10 .cse2) (and .cse0 .cse6 .cse1 .cse9 .cse3 .cse5) (and .cse8 .cse0 .cse6 .cse1 .cse9 .cse10) (and .cse0 .cse6 .cse1 .cse9 .cse10 .cse3) (and .cse0 .cse1 .cse10 .cse2 .cse3 .cse4) (and .cse8 .cse0 .cse6 .cse1 .cse9 .cse5) (and .cse0 .cse1 .cse9 .cse10 .cse2 .cse3) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5) (and .cse8 .cse0 .cse2 .cse7 .cse4 .cse5) (and .cse8 .cse0 .cse6 .cse1 .cse4 .cse5))) [2020-10-24 01:03:38,787 INFO L277 CegarLoopResult]: At program point L37(lines 37 39) the Hoare annotation is: true [2020-10-24 01:03:38,787 INFO L270 CegarLoopResult]: At program point L70-1(lines 35 132) the Hoare annotation is: (let ((.cse6 (= main_~p2~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~p3~0 0)) (.cse3 (= main_~p1~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse4 .cse5 .cse3 .cse6) (and .cse5 .cse2 .cse3 .cse6) (and .cse5 .cse1 .cse2 .cse7) (and .cse0 .cse2 .cse6 .cse7) (and .cse5 .cse2 .cse6 .cse7) (and .cse4 .cse0 .cse6 .cse7) (and .cse4 .cse0 .cse1 .cse3) (and .cse4 .cse0 .cse1 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse7))) [2020-10-24 01:03:38,788 INFO L270 CegarLoopResult]: At program point L128(line 128) the Hoare annotation is: (= main_~lk8~0 1) [2020-10-24 01:03:38,788 INFO L270 CegarLoopResult]: At program point L128-1(lines 7 137) the Hoare annotation is: false [2020-10-24 01:03:38,788 INFO L277 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: true [2020-10-24 01:03:38,788 INFO L270 CegarLoopResult]: At program point L62-1(lines 35 132) the Hoare annotation is: (let ((.cse0 (= main_~lk2~0 1)) (.cse2 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0)) (.cse1 (= main_~lk1~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse2) (and .cse3 .cse1))) [2020-10-24 01:03:38,788 INFO L277 CegarLoopResult]: At program point L29-1(line 29) the Hoare annotation is: true [2020-10-24 01:03:38,788 INFO L277 CegarLoopResult]: At program point L29-2(line 29) the Hoare annotation is: true [2020-10-24 01:03:38,790 INFO L270 CegarLoopResult]: At program point L87(line 87) the Hoare annotation is: (let ((.cse1 (= main_~p6~0 0)) (.cse8 (= main_~p3~0 0)) (.cse2 (= main_~p5~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse10 (= main_~p7~0 0)) (.cse4 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1)) (.cse7 (= main_~lk4~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse13 (= main_~lk6~0 1)) (.cse9 (= main_~lk5~0 1)) (.cse12 (= main_~p1~0 0)) (.cse11 (= main_~p2~0 0)) (.cse6 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse3 .cse9 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse10 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse5 .cse6) (and .cse1 .cse8 .cse3 .cse10 .cse4 .cse9 .cse12) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse13 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse12) (and .cse8 .cse3 .cse10 .cse13 .cse4 .cse9 .cse5) (and .cse8 .cse2 .cse3 .cse10 .cse13 .cse4 .cse12) (and .cse7 .cse8 .cse10 .cse13 .cse9 .cse12 .cse11) (and .cse7 .cse0 .cse2 .cse3 .cse13 .cse5 .cse6) (and .cse7 .cse8 .cse3 .cse10 .cse13 .cse9 .cse5) (and .cse7 .cse0 .cse2 .cse10 .cse13 .cse12 .cse11) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse12 .cse6) (and .cse7 .cse1 .cse8 .cse10 .cse9 .cse11 .cse5) (and .cse8 .cse3 .cse10 .cse13 .cse4 .cse9 .cse12) (and .cse8 .cse3 .cse13 .cse4 .cse9 .cse5 .cse6) (and .cse0 .cse10 .cse13 .cse4 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse3 .cse10 .cse13 .cse9 .cse12) (and .cse0 .cse2 .cse13 .cse4 .cse12 .cse11 .cse6) (and .cse0 .cse3 .cse10 .cse13 .cse4 .cse9 .cse12) (and .cse7 .cse1 .cse8 .cse3 .cse9 .cse12 .cse6) (and .cse7 .cse8 .cse2 .cse3 .cse10 .cse13 .cse5) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse12 .cse6) (and .cse7 .cse0 .cse3 .cse13 .cse9 .cse5 .cse6) (and .cse8 .cse10 .cse13 .cse4 .cse9 .cse12 .cse11) (and .cse0 .cse3 .cse10 .cse13 .cse4 .cse9 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse10 .cse12 .cse11) (and .cse1 .cse8 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse13 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse3 .cse13 .cse4 .cse9 .cse12 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse12 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse13 .cse4 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse12 .cse11 .cse6) (and .cse7 .cse8 .cse10 .cse13 .cse9 .cse11 .cse5) (and .cse8 .cse13 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse13 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse5 .cse6) (and .cse1 .cse8 .cse3 .cse10 .cse4 .cse9 .cse5) (and .cse0 .cse1 .cse10 .cse4 .cse9 .cse12 .cse11) (and .cse0 .cse2 .cse13 .cse4 .cse11 .cse5 .cse6) (and .cse1 .cse8 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse10 .cse5) (and .cse0 .cse13 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse11 .cse5) (and .cse1 .cse8 .cse10 .cse4 .cse9 .cse12 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse9 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse3 .cse10 .cse9 .cse12) (and .cse8 .cse2 .cse10 .cse13 .cse4 .cse12 .cse11) (and .cse7 .cse0 .cse2 .cse13 .cse11 .cse5 .cse6) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse10 .cse13 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse12) (and .cse0 .cse2 .cse10 .cse13 .cse4 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse9 .cse12 .cse6) (and .cse7 .cse8 .cse3 .cse13 .cse9 .cse12 .cse6) (and .cse7 .cse1 .cse8 .cse3 .cse10 .cse9 .cse5) (and .cse7 .cse8 .cse2 .cse3 .cse10 .cse13 .cse12) (and .cse1 .cse8 .cse2 .cse3 .cse10 .cse4 .cse12) (and .cse7 .cse0 .cse2 .cse13 .cse12 .cse11 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse13 .cse4 .cse5) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse12 .cse6) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse11 .cse6) (and .cse8 .cse13 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse12 .cse6) (and .cse0 .cse10 .cse13 .cse4 .cse9 .cse12 .cse11) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6) (and .cse8 .cse2 .cse13 .cse4 .cse12 .cse11 .cse6) (and .cse1 .cse8 .cse2 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse13 .cse9 .cse12 .cse11 .cse6) (and .cse7 .cse0 .cse1 .cse10 .cse9 .cse12 .cse11) (and .cse7 .cse1 .cse8 .cse10 .cse9 .cse12 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse10 .cse9 .cse5) (and .cse1 .cse8 .cse2 .cse10 .cse4 .cse11 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse7 .cse0 .cse3 .cse13 .cse9 .cse12 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse6) (and .cse8 .cse10 .cse13 .cse4 .cse9 .cse11 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse3 .cse13 .cse9 .cse5 .cse6) (and .cse7 .cse0 .cse2 .cse10 .cse13 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse10 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse10 .cse12 .cse11) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse10 .cse12) (and .cse8 .cse3 .cse13 .cse4 .cse9 .cse12 .cse6) (and .cse7 .cse8 .cse2 .cse3 .cse13 .cse5 .cse6) (and .cse7 .cse8 .cse2 .cse13 .cse12 .cse11 .cse6) (and .cse7 .cse8 .cse2 .cse13 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse3 .cse10 .cse9 .cse12) (and .cse7 .cse8 .cse2 .cse3 .cse13 .cse12 .cse6) (and .cse0 .cse1 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse9 .cse12 .cse11 .cse6) (and .cse7 .cse0 .cse2 .cse3 .cse13 .cse12 .cse6) (and .cse1 .cse8 .cse2 .cse4 .cse12 .cse11 .cse6) (and .cse8 .cse2 .cse13 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse2 .cse10 .cse13 .cse12 .cse11) (and .cse7 .cse8 .cse2 .cse10 .cse13 .cse11 .cse5) (and .cse0 .cse1 .cse10 .cse4 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse10 .cse11 .cse5) (and .cse8 .cse2 .cse3 .cse10 .cse13 .cse4 .cse5) (and .cse0 .cse1 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse12 .cse11) (and .cse7 .cse1 .cse8 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse3 .cse10 .cse13 .cse9 .cse5) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse13 .cse12) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse9 .cse5) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse12 .cse6) (and .cse1 .cse8 .cse2 .cse10 .cse4 .cse12 .cse11) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse9 .cse12) (and .cse8 .cse2 .cse10 .cse13 .cse4 .cse11 .cse5) (and .cse7 .cse0 .cse10 .cse13 .cse9 .cse12 .cse11) (and .cse0 .cse2 .cse10 .cse13 .cse4 .cse12 .cse11) (and .cse7 .cse8 .cse3 .cse10 .cse13 .cse9 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse12 .cse6) (and .cse7 .cse8 .cse13 .cse9 .cse11 .cse5 .cse6) (and .cse1 .cse8 .cse10 .cse4 .cse9 .cse11 .cse5) (and .cse0 .cse3 .cse13 .cse4 .cse9 .cse5 .cse6) (and .cse1 .cse8 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse0 .cse13 .cse9 .cse12 .cse11 .cse6))) [2020-10-24 01:03:38,790 INFO L277 CegarLoopResult]: At program point L54(line 54) the Hoare annotation is: true [2020-10-24 01:03:38,790 INFO L277 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-10-24 01:03:38,790 INFO L270 CegarLoopResult]: At program point L79(line 79) the Hoare annotation is: (let ((.cse0 (= main_~lk3~0 1)) (.cse6 (= main_~p2~0 0)) (.cse2 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~lk1~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse7 (= main_~p3~0 0)) (.cse5 (= main_~p5~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse9 (= main_~p1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse6 .cse4) (and .cse8 .cse0 .cse5 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse4) (and .cse8 .cse0 .cse1 .cse3 .cse4) (and .cse8 .cse0 .cse5 .cse1 .cse4) (and .cse7 .cse1 .cse2 .cse3 .cse9) (and .cse8 .cse7 .cse5 .cse6 .cse4) (and .cse0 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse7 .cse1 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse9 .cse6) (and .cse8 .cse7 .cse3 .cse6 .cse4) (and .cse8 .cse7 .cse3 .cse9 .cse6) (and .cse7 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse0 .cse5 .cse1 .cse9) (and .cse7 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse0 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse5 .cse9 .cse6) (and .cse8 .cse7 .cse5 .cse9 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse9) (and .cse0 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse7 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse3 .cse9 .cse6) (and .cse0 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse0 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse9 .cse6) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse9))) [2020-10-24 01:03:38,790 INFO L270 CegarLoopResult]: At program point L112-1(lines 35 132) the Hoare annotation is: (let ((.cse1 (= main_~p8~0 0)) (.cse0 (= main_~p6~0 0)) (.cse3 (= main_~p7~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse5 (= main_~lk8~0 1)) (.cse2 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse4) (and .cse0 .cse1 .cse3) (and .cse3 .cse4 .cse5) (and .cse0 .cse5 .cse2) (and .cse1 .cse4 .cse2) (and .cse0 .cse3 .cse5) (and .cse4 .cse5 .cse2))) [2020-10-24 01:03:38,791 INFO L277 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: true [2020-10-24 01:03:38,791 INFO L277 CegarLoopResult]: At program point mainFINAL(lines 6 137) the Hoare annotation is: true [2020-10-24 01:03:38,791 INFO L270 CegarLoopResult]: At program point L104(line 104) the Hoare annotation is: (let ((.cse10 (= main_~p7~0 0)) (.cse9 (= main_~p5~0 0)) (.cse3 (= main_~p4~0 0)) (.cse2 (= main_~lk6~0 1)) (.cse7 (= main_~lk8~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse6 (= main_~p6~0 0)) (.cse1 (= main_~p8~0 0)) (.cse4 (= main_~lk5~0 1)) (.cse5 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse9 .cse10 .cse2 .cse7) (and .cse0 .cse6 .cse9 .cse10 .cse7 .cse3) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse5) (and .cse8 .cse0 .cse6 .cse10 .cse7 .cse4) (and .cse0 .cse10 .cse2 .cse7 .cse3 .cse4) (and .cse0 .cse6 .cse1 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse10 .cse3 .cse4) (and .cse0 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse9 .cse2 .cse7 .cse5) (and .cse0 .cse6 .cse9 .cse7 .cse3 .cse5) (and .cse0 .cse6 .cse10 .cse7 .cse3 .cse4) (and .cse0 .cse9 .cse10 .cse2 .cse7 .cse3) (and .cse0 .cse9 .cse2 .cse7 .cse3 .cse5) (and .cse8 .cse0 .cse6 .cse1 .cse10 .cse4) (and .cse8 .cse0 .cse6 .cse9 .cse10 .cse7) (and .cse8 .cse0 .cse1 .cse10 .cse2 .cse4) (and .cse8 .cse0 .cse10 .cse2 .cse7 .cse4) (and .cse8 .cse0 .cse6 .cse9 .cse7 .cse5) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse8 .cse0 .cse1 .cse9 .cse10 .cse2) (and .cse0 .cse6 .cse1 .cse9 .cse3 .cse5) (and .cse8 .cse0 .cse6 .cse1 .cse9 .cse10) (and .cse0 .cse6 .cse1 .cse9 .cse10 .cse3) (and .cse0 .cse1 .cse10 .cse2 .cse3 .cse4) (and .cse8 .cse0 .cse6 .cse1 .cse9 .cse5) (and .cse0 .cse1 .cse9 .cse10 .cse2 .cse3) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5) (and .cse8 .cse0 .cse2 .cse7 .cse4 .cse5) (and .cse8 .cse0 .cse6 .cse1 .cse4 .cse5))) [2020-10-24 01:03:38,791 INFO L270 CegarLoopResult]: At program point L71(line 71) the Hoare annotation is: (let ((.cse2 (= main_~lk1~0 1)) (.cse4 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse5 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 .cse1 .cse2) (and .cse0 .cse1 .cse5) (and .cse4 .cse5 .cse3) (and .cse4 .cse3 .cse2) (and .cse4 .cse1 .cse5) (and .cse0 .cse5 .cse3))) [2020-10-24 01:03:38,792 INFO L270 CegarLoopResult]: At program point L129(line 129) the Hoare annotation is: (= main_~lk8~0 1) [2020-10-24 01:03:38,792 INFO L270 CegarLoopResult]: At program point L63(line 63) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-10-24 01:03:38,792 INFO L277 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: true [2020-10-24 01:03:38,792 INFO L277 CegarLoopResult]: At program point mainENTRY(lines 6 137) the Hoare annotation is: true [2020-10-24 01:03:38,792 INFO L270 CegarLoopResult]: At program point L113(line 113) the Hoare annotation is: (let ((.cse3 (= main_~lk7~0 1)) (.cse1 (= main_~lk8~0 1)) (.cse0 (= main_~lk6~0 1)) (.cse4 (= main_~p6~0 0)) (.cse5 (= main_~p8~0 0)) (.cse6 (= main_~p7~0 0)) (.cse2 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse3) (and .cse5 .cse0 .cse2 .cse3) (and .cse4 .cse6 .cse1 .cse2) (and .cse4 .cse5 .cse2 .cse3) (and .cse6 .cse0 .cse1 .cse2) (and .cse5 .cse6 .cse0 .cse2) (and .cse4 .cse5 .cse6 .cse2))) [2020-10-24 01:03:38,792 INFO L277 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-10-24 01:03:38,792 INFO L277 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: true [2020-10-24 01:03:38,792 INFO L277 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: true [2020-10-24 01:03:38,793 INFO L270 CegarLoopResult]: At program point L97-1(lines 35 132) the Hoare annotation is: (let ((.cse8 (= main_~p7~0 0)) (.cse2 (= main_~lk6~0 1)) (.cse9 (= main_~lk8~0 1)) (.cse3 (= main_~p4~0 0)) (.cse7 (= main_~p3~0 0)) (.cse11 (= main_~p5~0 0)) (.cse6 (= main_~lk4~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse10 (= main_~p6~0 0)) (.cse1 (= main_~p8~0 0)) (.cse4 (= main_~lk5~0 1)) (.cse5 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse2 .cse9 .cse4) (and .cse6 .cse10 .cse7 .cse9 .cse4 .cse5) (and .cse6 .cse0 .cse1 .cse11 .cse2 .cse5) (and .cse10 .cse7 .cse11 .cse8 .cse9 .cse3) (and .cse7 .cse11 .cse8 .cse2 .cse9 .cse3) (and .cse10 .cse7 .cse11 .cse9 .cse3 .cse5) (and .cse6 .cse7 .cse1 .cse2 .cse4 .cse5) (and .cse10 .cse7 .cse1 .cse11 .cse8 .cse3) (and .cse6 .cse10 .cse7 .cse11 .cse8 .cse9) (and .cse7 .cse1 .cse11 .cse8 .cse2 .cse3) (and .cse6 .cse10 .cse7 .cse1 .cse11 .cse8) (and .cse0 .cse11 .cse2 .cse9 .cse3 .cse5) (and .cse6 .cse0 .cse10 .cse11 .cse8 .cse9) (and .cse6 .cse0 .cse1 .cse8 .cse2 .cse4) (and .cse6 .cse0 .cse8 .cse2 .cse9 .cse4) (and .cse6 .cse7 .cse1 .cse8 .cse2 .cse4) (and .cse6 .cse0 .cse1 .cse11 .cse8 .cse2) (and .cse10 .cse7 .cse8 .cse9 .cse3 .cse4) (and .cse6 .cse10 .cse7 .cse11 .cse9 .cse5) (and .cse0 .cse10 .cse1 .cse11 .cse3 .cse5) (and .cse6 .cse0 .cse10 .cse1 .cse11 .cse5) (and .cse0 .cse1 .cse11 .cse8 .cse2 .cse3) (and .cse7 .cse1 .cse11 .cse2 .cse3 .cse5) (and .cse6 .cse7 .cse1 .cse11 .cse2 .cse5) (and .cse6 .cse10 .cse7 .cse8 .cse9 .cse4) (and .cse7 .cse2 .cse9 .cse3 .cse4 .cse5) (and .cse7 .cse8 .cse2 .cse9 .cse3 .cse4) (and .cse0 .cse10 .cse9 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse11 .cse8 .cse2 .cse9) (and .cse10 .cse7 .cse1 .cse3 .cse4 .cse5) (and .cse10 .cse7 .cse9 .cse3 .cse4 .cse5) (and .cse0 .cse10 .cse11 .cse8 .cse9 .cse3) (and .cse6 .cse0 .cse10 .cse8 .cse9 .cse4) (and .cse0 .cse8 .cse2 .cse9 .cse3 .cse4) (and .cse6 .cse7 .cse1 .cse11 .cse8 .cse2) (and .cse10 .cse7 .cse1 .cse11 .cse3 .cse5) (and .cse0 .cse10 .cse1 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse2 .cse9 .cse4 .cse5) (and .cse6 .cse0 .cse10 .cse9 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse8 .cse3 .cse4) (and .cse0 .cse2 .cse9 .cse3 .cse4 .cse5) (and .cse6 .cse10 .cse7 .cse1 .cse4 .cse5) (and .cse6 .cse0 .cse11 .cse2 .cse9 .cse5) (and .cse10 .cse7 .cse1 .cse8 .cse3 .cse4) (and .cse6 .cse7 .cse11 .cse8 .cse2 .cse9) (and .cse0 .cse10 .cse11 .cse9 .cse3 .cse5) (and .cse0 .cse10 .cse8 .cse9 .cse3 .cse4) (and .cse0 .cse11 .cse8 .cse2 .cse9 .cse3) (and .cse6 .cse0 .cse10 .cse1 .cse8 .cse4) (and .cse6 .cse0 .cse10 .cse11 .cse9 .cse5) (and .cse6 .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse6 .cse0 .cse10 .cse1 .cse11 .cse8) (and .cse6 .cse10 .cse7 .cse1 .cse8 .cse4) (and .cse0 .cse10 .cse1 .cse11 .cse8 .cse3) (and .cse6 .cse7 .cse11 .cse2 .cse9 .cse5) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse4) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse11 .cse2 .cse3 .cse5) (and .cse7 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse2 .cse9 .cse4 .cse5) (and .cse7 .cse11 .cse2 .cse9 .cse3 .cse5) (and .cse6 .cse10 .cse7 .cse1 .cse11 .cse5) (and .cse6 .cse0 .cse10 .cse1 .cse4 .cse5))) [2020-10-24 01:03:38,793 INFO L270 CegarLoopResult]: At program point L122-1(lines 35 132) the Hoare annotation is: (or (= main_~p8~0 0) (= main_~lk8~0 1)) [2020-10-24 01:03:38,793 INFO L277 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: true [2020-10-24 01:03:38,794 INFO L277 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: true [2020-10-24 01:03:38,794 INFO L277 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: true [2020-10-24 01:03:38,794 INFO L270 CegarLoopResult]: At program point L114(line 114) the Hoare annotation is: (let ((.cse3 (= main_~lk7~0 1)) (.cse1 (= main_~lk8~0 1)) (.cse0 (= main_~lk6~0 1)) (.cse4 (= main_~p6~0 0)) (.cse5 (= main_~p8~0 0)) (.cse6 (= main_~p7~0 0)) (.cse2 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse3) (and .cse5 .cse0 .cse2 .cse3) (and .cse4 .cse6 .cse1 .cse2) (and .cse4 .cse5 .cse2 .cse3) (and .cse6 .cse0 .cse1 .cse2) (and .cse5 .cse6 .cse0 .cse2) (and .cse4 .cse5 .cse6 .cse2))) [2020-10-24 01:03:38,794 INFO L277 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: true [2020-10-24 01:03:38,794 INFO L277 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-10-24 01:03:38,794 INFO L277 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: true [2020-10-24 01:03:38,795 INFO L270 CegarLoopResult]: At program point L98(line 98) the Hoare annotation is: (let ((.cse7 (= main_~p5~0 0)) (.cse4 (= main_~lk8~0 1)) (.cse5 (= main_~p4~0 0)) (.cse10 (= main_~lk3~0 1)) (.cse8 (= main_~p6~0 0)) (.cse12 (= main_~lk7~0 1)) (.cse11 (= main_~lk4~0 1)) (.cse0 (= main_~p3~0 0)) (.cse9 (= main_~p8~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p7~0 0)) (.cse3 (= main_~lk6~0 1)) (.cse6 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse9 .cse1 .cse2 .cse5 .cse6) (and .cse10 .cse8 .cse7 .cse1 .cse2 .cse4 .cse5) (and .cse11 .cse0 .cse7 .cse1 .cse3 .cse4 .cse12) (and .cse11 .cse8 .cse0 .cse9 .cse7 .cse1 .cse2) (and .cse10 .cse9 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse10 .cse8 .cse1 .cse4 .cse5 .cse6 .cse12) (and .cse8 .cse0 .cse9 .cse1 .cse5 .cse6 .cse12) (and .cse11 .cse10 .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse11 .cse0 .cse9 .cse7 .cse1 .cse3 .cse12) (and .cse0 .cse9 .cse7 .cse1 .cse3 .cse5 .cse12) (and .cse11 .cse8 .cse0 .cse1 .cse2 .cse4 .cse6) (and .cse11 .cse10 .cse9 .cse7 .cse1 .cse3 .cse12) (and .cse11 .cse10 .cse8 .cse7 .cse1 .cse4 .cse12) (and .cse8 .cse0 .cse9 .cse7 .cse1 .cse5 .cse12) (and .cse11 .cse10 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse11 .cse10 .cse8 .cse7 .cse1 .cse2 .cse4) (and .cse10 .cse8 .cse9 .cse1 .cse2 .cse5 .cse6) (and .cse8 .cse0 .cse1 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse9 .cse1 .cse3 .cse5 .cse6 .cse12) (and .cse10 .cse8 .cse9 .cse1 .cse5 .cse6 .cse12) (and .cse10 .cse1 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse11 .cse10 .cse9 .cse1 .cse2 .cse3 .cse6) (and .cse11 .cse0 .cse9 .cse7 .cse1 .cse2 .cse3) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse11 .cse10 .cse9 .cse7 .cse1 .cse2 .cse3) (and .cse10 .cse9 .cse1 .cse3 .cse5 .cse6 .cse12) (and .cse8 .cse0 .cse9 .cse7 .cse1 .cse2 .cse5) (and .cse8 .cse0 .cse7 .cse1 .cse2 .cse4 .cse5) (and .cse11 .cse10 .cse8 .cse1 .cse2 .cse4 .cse6) (and .cse10 .cse8 .cse9 .cse7 .cse1 .cse2 .cse5) (and .cse10 .cse8 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse11 .cse8 .cse0 .cse7 .cse1 .cse2 .cse4) (and .cse10 .cse9 .cse7 .cse1 .cse3 .cse5 .cse12) (and .cse10 .cse8 .cse9 .cse7 .cse1 .cse5 .cse12) (and .cse11 .cse0 .cse9 .cse1 .cse3 .cse6 .cse12) (and .cse11 .cse10 .cse8 .cse9 .cse7 .cse1 .cse12) (and .cse11 .cse10 .cse8 .cse1 .cse4 .cse6 .cse12) (and .cse10 .cse9 .cse7 .cse1 .cse2 .cse3 .cse5) (and .cse0 .cse7 .cse1 .cse3 .cse4 .cse5 .cse12) (and .cse11 .cse10 .cse8 .cse9 .cse7 .cse1 .cse2) (and .cse11 .cse8 .cse0 .cse7 .cse1 .cse4 .cse12) (and .cse11 .cse10 .cse1 .cse3 .cse4 .cse6 .cse12) (and .cse10 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse10 .cse7 .cse1 .cse3 .cse4 .cse5 .cse12) (and .cse0 .cse9 .cse7 .cse1 .cse2 .cse3 .cse5) (and .cse11 .cse8 .cse0 .cse9 .cse1 .cse6 .cse12) (and .cse11 .cse8 .cse0 .cse9 .cse7 .cse1 .cse12) (and .cse10 .cse8 .cse7 .cse1 .cse4 .cse5 .cse12) (and .cse11 .cse0 .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse11 .cse10 .cse9 .cse1 .cse3 .cse6 .cse12) (and .cse11 .cse10 .cse8 .cse9 .cse1 .cse2 .cse6) (and .cse11 .cse8 .cse0 .cse9 .cse1 .cse2 .cse6) (and .cse11 .cse0 .cse1 .cse3 .cse4 .cse6 .cse12) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse11 .cse8 .cse0 .cse1 .cse4 .cse6 .cse12) (and .cse8 .cse0 .cse7 .cse1 .cse4 .cse5 .cse12) (and .cse11 .cse10 .cse7 .cse1 .cse3 .cse4 .cse12) (and .cse10 .cse7 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse11 .cse10 .cse8 .cse9 .cse1 .cse6 .cse12) (and .cse11 .cse0 .cse9 .cse1 .cse2 .cse3 .cse6))) [2020-10-24 01:03:38,795 INFO L270 CegarLoopResult]: At program point L123(line 123) the Hoare annotation is: (let ((.cse0 (= main_~lk7~0 1))) (or (and (= main_~p8~0 0) .cse0) (and (= main_~lk8~0 1) .cse0))) [2020-10-24 01:03:38,795 INFO L277 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-10-24 01:03:38,797 INFO L270 CegarLoopResult]: At program point L82-1(lines 35 132) the Hoare annotation is: (let ((.cse1 (= main_~p6~0 0)) (.cse8 (= main_~p3~0 0)) (.cse2 (= main_~p5~0 0)) (.cse10 (= main_~p7~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse4 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1)) (.cse7 (= main_~lk4~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse13 (= main_~lk6~0 1)) (.cse9 (= main_~lk5~0 1)) (.cse12 (= main_~p1~0 0)) (.cse11 (= main_~p2~0 0)) (.cse6 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse3 .cse9 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse10 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse1 .cse8 .cse3 .cse10 .cse4 .cse9 .cse12) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse5 .cse6) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse13 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse12) (and .cse8 .cse3 .cse10 .cse13 .cse4 .cse9 .cse5) (and .cse8 .cse2 .cse3 .cse10 .cse13 .cse4 .cse12) (and .cse7 .cse8 .cse10 .cse13 .cse9 .cse12 .cse11) (and .cse7 .cse0 .cse2 .cse3 .cse13 .cse5 .cse6) (and .cse7 .cse0 .cse2 .cse10 .cse13 .cse12 .cse11) (and .cse7 .cse8 .cse3 .cse10 .cse13 .cse9 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse12 .cse6) (and .cse7 .cse1 .cse8 .cse10 .cse9 .cse11 .cse5) (and .cse8 .cse3 .cse10 .cse13 .cse4 .cse9 .cse12) (and .cse8 .cse3 .cse13 .cse4 .cse9 .cse5 .cse6) (and .cse7 .cse0 .cse3 .cse10 .cse13 .cse9 .cse12) (and .cse0 .cse10 .cse13 .cse4 .cse9 .cse11 .cse5) (and .cse0 .cse2 .cse13 .cse4 .cse12 .cse11 .cse6) (and .cse0 .cse3 .cse10 .cse13 .cse4 .cse9 .cse12) (and .cse7 .cse1 .cse8 .cse3 .cse9 .cse12 .cse6) (and .cse7 .cse8 .cse2 .cse3 .cse10 .cse13 .cse5) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse12 .cse6) (and .cse7 .cse0 .cse3 .cse13 .cse9 .cse5 .cse6) (and .cse8 .cse10 .cse13 .cse4 .cse9 .cse12 .cse11) (and .cse0 .cse3 .cse10 .cse13 .cse4 .cse9 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse10 .cse12 .cse11) (and .cse1 .cse8 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse11 .cse5 .cse6) (and .cse0 .cse3 .cse13 .cse4 .cse9 .cse12 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse0 .cse13 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse12 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse13 .cse4 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse12 .cse11 .cse6) (and .cse7 .cse8 .cse10 .cse13 .cse9 .cse11 .cse5) (and .cse8 .cse13 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse13 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse5 .cse6) (and .cse1 .cse8 .cse3 .cse10 .cse4 .cse9 .cse5) (and .cse0 .cse1 .cse10 .cse4 .cse9 .cse12 .cse11) (and .cse0 .cse2 .cse13 .cse4 .cse11 .cse5 .cse6) (and .cse1 .cse8 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse10 .cse5) (and .cse0 .cse13 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse11 .cse5) (and .cse1 .cse8 .cse10 .cse4 .cse9 .cse12 .cse11) (and .cse7 .cse1 .cse8 .cse3 .cse10 .cse9 .cse12) (and .cse7 .cse0 .cse1 .cse3 .cse9 .cse5 .cse6) (and .cse7 .cse0 .cse2 .cse13 .cse11 .cse5 .cse6) (and .cse8 .cse2 .cse10 .cse13 .cse4 .cse12 .cse11) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse10 .cse13 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse12) (and .cse0 .cse2 .cse10 .cse13 .cse4 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse9 .cse12 .cse6) (and .cse7 .cse8 .cse3 .cse13 .cse9 .cse12 .cse6) (and .cse7 .cse1 .cse8 .cse3 .cse10 .cse9 .cse5) (and .cse7 .cse8 .cse2 .cse3 .cse10 .cse13 .cse12) (and .cse1 .cse8 .cse2 .cse3 .cse10 .cse4 .cse12) (and .cse0 .cse2 .cse3 .cse10 .cse13 .cse4 .cse5) (and .cse7 .cse0 .cse2 .cse13 .cse12 .cse11 .cse6) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse12 .cse6) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse11 .cse6) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6) (and .cse8 .cse13 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse12 .cse6) (and .cse0 .cse10 .cse13 .cse4 .cse9 .cse12 .cse11) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6) (and .cse8 .cse2 .cse13 .cse4 .cse12 .cse11 .cse6) (and .cse1 .cse8 .cse2 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse13 .cse9 .cse12 .cse11 .cse6) (and .cse7 .cse0 .cse1 .cse10 .cse9 .cse12 .cse11) (and .cse7 .cse1 .cse8 .cse10 .cse9 .cse12 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse10 .cse9 .cse5) (and .cse1 .cse8 .cse2 .cse10 .cse4 .cse11 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse12 .cse11 .cse6) (and .cse7 .cse0 .cse3 .cse13 .cse9 .cse12 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse6) (and .cse8 .cse10 .cse13 .cse4 .cse9 .cse11 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse3 .cse13 .cse9 .cse5 .cse6) (and .cse7 .cse0 .cse2 .cse10 .cse13 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse10 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse10 .cse12 .cse11) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse10 .cse12) (and .cse8 .cse3 .cse13 .cse4 .cse9 .cse12 .cse6) (and .cse7 .cse8 .cse2 .cse3 .cse13 .cse5 .cse6) (and .cse7 .cse8 .cse2 .cse13 .cse12 .cse11 .cse6) (and .cse7 .cse8 .cse2 .cse13 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse3 .cse10 .cse9 .cse12) (and .cse7 .cse8 .cse2 .cse3 .cse13 .cse12 .cse6) (and .cse0 .cse1 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse9 .cse12 .cse11 .cse6) (and .cse7 .cse0 .cse2 .cse3 .cse13 .cse12 .cse6) (and .cse1 .cse8 .cse2 .cse4 .cse12 .cse11 .cse6) (and .cse8 .cse2 .cse13 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse2 .cse10 .cse13 .cse12 .cse11) (and .cse7 .cse8 .cse2 .cse10 .cse13 .cse11 .cse5) (and .cse0 .cse1 .cse10 .cse4 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse10 .cse11 .cse5) (and .cse8 .cse2 .cse3 .cse10 .cse13 .cse4 .cse5) (and .cse0 .cse1 .cse4 .cse9 .cse12 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse12 .cse11) (and .cse7 .cse1 .cse8 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse13 .cse12) (and .cse7 .cse0 .cse3 .cse10 .cse13 .cse9 .cse5) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse12 .cse6) (and .cse1 .cse8 .cse2 .cse10 .cse4 .cse12 .cse11) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse9 .cse5) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse9 .cse12) (and .cse8 .cse2 .cse10 .cse13 .cse4 .cse11 .cse5) (and .cse7 .cse0 .cse10 .cse13 .cse9 .cse12 .cse11) (and .cse7 .cse8 .cse3 .cse10 .cse13 .cse9 .cse12) (and .cse0 .cse2 .cse10 .cse13 .cse4 .cse12 .cse11) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse12 .cse6) (and .cse7 .cse8 .cse13 .cse9 .cse11 .cse5 .cse6) (and .cse1 .cse8 .cse10 .cse4 .cse9 .cse11 .cse5) (and .cse1 .cse8 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse0 .cse3 .cse13 .cse4 .cse9 .cse5 .cse6) (and .cse7 .cse0 .cse13 .cse9 .cse12 .cse11 .cse6))) [2020-10-24 01:03:38,797 INFO L270 CegarLoopResult]: At program point L107-1(lines 35 132) the Hoare annotation is: (let ((.cse1 (= main_~p5~0 0)) (.cse6 (= main_~lk7~0 1)) (.cse4 (= main_~lk6~0 1)) (.cse3 (= main_~lk8~0 1)) (.cse0 (= main_~p6~0 0)) (.cse7 (= main_~p8~0 0)) (.cse2 (= main_~p7~0 0)) (.cse5 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse3 .cse5 .cse6) (and .cse7 .cse1 .cse4 .cse6) (and .cse1 .cse2 .cse4 .cse3) (and .cse0 .cse3 .cse5 .cse6) (and .cse7 .cse1 .cse2 .cse4) (and .cse1 .cse4 .cse3 .cse6) (and .cse0 .cse7 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse6) (and .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse5) (and .cse0 .cse7 .cse1 .cse2) (and .cse0 .cse7 .cse1 .cse6) (and .cse7 .cse2 .cse4 .cse5) (and .cse2 .cse4 .cse3 .cse5) (and .cse0 .cse7 .cse2 .cse5))) [2020-10-24 01:03:38,797 INFO L270 CegarLoopResult]: At program point L74-1(lines 35 132) the Hoare annotation is: (let ((.cse0 (= main_~lk3~0 1)) (.cse6 (= main_~p2~0 0)) (.cse2 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~lk1~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse7 (= main_~p3~0 0)) (.cse5 (= main_~p5~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse9 (= main_~p1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse6 .cse4) (and .cse8 .cse0 .cse5 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse4) (and .cse8 .cse0 .cse1 .cse3 .cse4) (and .cse8 .cse0 .cse5 .cse1 .cse4) (and .cse7 .cse1 .cse2 .cse3 .cse9) (and .cse8 .cse7 .cse5 .cse6 .cse4) (and .cse0 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse7 .cse1 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse9 .cse6) (and .cse8 .cse7 .cse3 .cse6 .cse4) (and .cse8 .cse7 .cse3 .cse9 .cse6) (and .cse7 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse0 .cse5 .cse1 .cse9) (and .cse7 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse0 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse5 .cse9 .cse6) (and .cse8 .cse7 .cse5 .cse9 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse9) (and .cse0 .cse2 .cse3 .cse9 .cse6) (and .cse8 .cse7 .cse1 .cse3 .cse9) (and .cse8 .cse0 .cse3 .cse9 .cse6) (and .cse0 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse0 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse9 .cse6) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse9))) [2020-10-24 01:03:38,797 INFO L277 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: true [2020-10-24 01:03:38,798 INFO L277 CegarLoopResult]: At program point L8-1(line 8) the Hoare annotation is: true [2020-10-24 01:03:38,798 INFO L270 CegarLoopResult]: At program point L99(line 99) the Hoare annotation is: (let ((.cse7 (= main_~p5~0 0)) (.cse4 (= main_~lk8~0 1)) (.cse5 (= main_~p4~0 0)) (.cse10 (= main_~lk3~0 1)) (.cse8 (= main_~p6~0 0)) (.cse12 (= main_~lk7~0 1)) (.cse11 (= main_~lk4~0 1)) (.cse0 (= main_~p3~0 0)) (.cse9 (= main_~p8~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p7~0 0)) (.cse3 (= main_~lk6~0 1)) (.cse6 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse9 .cse1 .cse2 .cse5 .cse6) (and .cse10 .cse8 .cse7 .cse1 .cse2 .cse4 .cse5) (and .cse11 .cse0 .cse7 .cse1 .cse3 .cse4 .cse12) (and .cse11 .cse8 .cse0 .cse9 .cse7 .cse1 .cse2) (and .cse10 .cse9 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse10 .cse8 .cse1 .cse4 .cse5 .cse6 .cse12) (and .cse8 .cse0 .cse9 .cse1 .cse5 .cse6 .cse12) (and .cse11 .cse10 .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse11 .cse0 .cse9 .cse7 .cse1 .cse3 .cse12) (and .cse0 .cse9 .cse7 .cse1 .cse3 .cse5 .cse12) (and .cse11 .cse8 .cse0 .cse1 .cse2 .cse4 .cse6) (and .cse11 .cse10 .cse9 .cse7 .cse1 .cse3 .cse12) (and .cse11 .cse10 .cse8 .cse7 .cse1 .cse4 .cse12) (and .cse8 .cse0 .cse9 .cse7 .cse1 .cse5 .cse12) (and .cse11 .cse10 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse11 .cse10 .cse8 .cse7 .cse1 .cse2 .cse4) (and .cse10 .cse8 .cse9 .cse1 .cse2 .cse5 .cse6) (and .cse8 .cse0 .cse1 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse9 .cse1 .cse3 .cse5 .cse6 .cse12) (and .cse10 .cse8 .cse9 .cse1 .cse5 .cse6 .cse12) (and .cse10 .cse1 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse11 .cse10 .cse9 .cse1 .cse2 .cse3 .cse6) (and .cse11 .cse0 .cse9 .cse7 .cse1 .cse2 .cse3) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse11 .cse10 .cse9 .cse7 .cse1 .cse2 .cse3) (and .cse10 .cse9 .cse1 .cse3 .cse5 .cse6 .cse12) (and .cse8 .cse0 .cse9 .cse7 .cse1 .cse2 .cse5) (and .cse8 .cse0 .cse7 .cse1 .cse2 .cse4 .cse5) (and .cse11 .cse10 .cse8 .cse1 .cse2 .cse4 .cse6) (and .cse10 .cse8 .cse9 .cse7 .cse1 .cse2 .cse5) (and .cse10 .cse8 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse11 .cse8 .cse0 .cse7 .cse1 .cse2 .cse4) (and .cse10 .cse9 .cse7 .cse1 .cse3 .cse5 .cse12) (and .cse10 .cse8 .cse9 .cse7 .cse1 .cse5 .cse12) (and .cse11 .cse0 .cse9 .cse1 .cse3 .cse6 .cse12) (and .cse11 .cse10 .cse8 .cse9 .cse7 .cse1 .cse12) (and .cse11 .cse10 .cse8 .cse1 .cse4 .cse6 .cse12) (and .cse10 .cse9 .cse7 .cse1 .cse2 .cse3 .cse5) (and .cse0 .cse7 .cse1 .cse3 .cse4 .cse5 .cse12) (and .cse11 .cse10 .cse8 .cse9 .cse7 .cse1 .cse2) (and .cse11 .cse8 .cse0 .cse7 .cse1 .cse4 .cse12) (and .cse11 .cse10 .cse1 .cse3 .cse4 .cse6 .cse12) (and .cse10 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse10 .cse7 .cse1 .cse3 .cse4 .cse5 .cse12) (and .cse0 .cse9 .cse7 .cse1 .cse2 .cse3 .cse5) (and .cse11 .cse8 .cse0 .cse9 .cse1 .cse6 .cse12) (and .cse11 .cse8 .cse0 .cse9 .cse7 .cse1 .cse12) (and .cse10 .cse8 .cse7 .cse1 .cse4 .cse5 .cse12) (and .cse11 .cse0 .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse11 .cse10 .cse9 .cse1 .cse3 .cse6 .cse12) (and .cse11 .cse10 .cse8 .cse9 .cse1 .cse2 .cse6) (and .cse11 .cse8 .cse0 .cse9 .cse1 .cse2 .cse6) (and .cse11 .cse0 .cse1 .cse3 .cse4 .cse6 .cse12) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse11 .cse8 .cse0 .cse1 .cse4 .cse6 .cse12) (and .cse8 .cse0 .cse7 .cse1 .cse4 .cse5 .cse12) (and .cse11 .cse10 .cse7 .cse1 .cse3 .cse4 .cse12) (and .cse10 .cse7 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse11 .cse10 .cse8 .cse9 .cse1 .cse6 .cse12) (and .cse11 .cse0 .cse9 .cse1 .cse2 .cse3 .cse6))) [2020-10-24 01:03:38,798 INFO L277 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-10-24 01:03:38,799 INFO L270 CegarLoopResult]: At program point L66-1(lines 35 132) the Hoare annotation is: (let ((.cse2 (= main_~lk1~0 1)) (.cse4 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse5 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 .cse1 .cse2) (and .cse0 .cse1 .cse5) (and .cse4 .cse5 .cse3) (and .cse4 .cse3 .cse2) (and .cse4 .cse1 .cse5) (and .cse0 .cse5 .cse3))) [2020-10-24 01:03:38,799 INFO L270 CegarLoopResult]: At program point L124(line 124) the Hoare annotation is: (let ((.cse0 (= main_~lk7~0 1))) (or (and (= main_~p8~0 0) .cse0) (and (= main_~lk8~0 1) .cse0))) [2020-10-24 01:03:38,799 INFO L277 CegarLoopResult]: At program point L58(lines 58 60) the Hoare annotation is: true [2020-10-24 01:03:38,799 INFO L270 CegarLoopResult]: At program point L58-2(lines 35 132) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-10-24 01:03:38,800 INFO L270 CegarLoopResult]: At program point L83(line 83) the Hoare annotation is: (let ((.cse6 (= main_~lk6~0 1)) (.cse9 (= main_~p1~0 0)) (.cse10 (= main_~lk3~0 1)) (.cse3 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse4 (= main_~p2~0 0)) (.cse1 (= main_~p6~0 0)) (.cse2 (= main_~p3~0 0)) (.cse11 (= main_~p5~0 0)) (.cse8 (= main_~lk2~0 1)) (.cse7 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse8 .cse6 .cse3 .cse9) (and .cse10 .cse11 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse11 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse6 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse11 .cse6 .cse9 .cse4) (and .cse0 .cse2 .cse6 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse6 .cse9 .cse4) (and .cse0 .cse10 .cse8 .cse6 .cse3 .cse5) (and .cse0 .cse10 .cse1 .cse3 .cse9 .cse4) (and .cse10 .cse11 .cse8 .cse6 .cse7 .cse9) (and .cse10 .cse1 .cse11 .cse8 .cse7 .cse5) (and .cse10 .cse11 .cse8 .cse6 .cse7 .cse5) (and .cse0 .cse10 .cse1 .cse8 .cse3 .cse5) (and .cse2 .cse11 .cse8 .cse6 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse8 .cse9) (and .cse10 .cse1 .cse8 .cse7 .cse3 .cse5) (and .cse2 .cse11 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse10 .cse11 .cse8 .cse6 .cse5) (and .cse10 .cse11 .cse6 .cse7 .cse9 .cse4) (and .cse1 .cse2 .cse11 .cse7 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse9) (and .cse10 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse2 .cse11 .cse6 .cse7 .cse9 .cse4) (and .cse10 .cse1 .cse11 .cse7 .cse9 .cse4) (and .cse0 .cse10 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse10 .cse8 .cse6 .cse3 .cse9) (and .cse0 .cse10 .cse1 .cse11 .cse8 .cse5) (and .cse0 .cse10 .cse6 .cse3 .cse9 .cse4) (and .cse10 .cse8 .cse6 .cse7 .cse3 .cse9) (and .cse10 .cse1 .cse7 .cse3 .cse9 .cse4) (and .cse1 .cse2 .cse8 .cse7 .cse3 .cse9) (and .cse1 .cse2 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse2 .cse8 .cse6 .cse3 .cse5) (and .cse10 .cse1 .cse11 .cse7 .cse4 .cse5) (and .cse0 .cse2 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse8 .cse5) (and .cse10 .cse8 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse2 .cse11 .cse8 .cse6 .cse9) (and .cse10 .cse6 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse1 .cse11 .cse4 .cse5) (and .cse1 .cse2 .cse8 .cse7 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse9 .cse4) (and .cse10 .cse1 .cse8 .cse7 .cse3 .cse9) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse8 .cse6 .cse9) (and .cse10 .cse1 .cse11 .cse8 .cse7 .cse9) (and .cse2 .cse8 .cse6 .cse7 .cse3 .cse9) (and .cse0 .cse2 .cse11 .cse8 .cse6 .cse5) (and .cse2 .cse11 .cse8 .cse6 .cse7 .cse5) (and .cse2 .cse8 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse10 .cse1 .cse8 .cse3 .cse9) (and .cse0 .cse2 .cse11 .cse6 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse8 .cse7 .cse9) (and .cse1 .cse2 .cse11 .cse7 .cse9 .cse4) (and .cse0 .cse10 .cse1 .cse11 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse4) (and .cse10 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse8 .cse7 .cse5))) [2020-10-24 01:03:38,800 INFO L277 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: true [2020-10-24 01:03:38,800 INFO L277 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-10-24 01:03:38,800 INFO L277 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-10-24 01:03:38,800 INFO L277 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: true [2020-10-24 01:03:38,800 INFO L270 CegarLoopResult]: At program point L108(line 108) the Hoare annotation is: (let ((.cse4 (= main_~lk8~0 1)) (.cse1 (= main_~p6~0 0)) (.cse3 (= main_~p7~0 0)) (.cse6 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse5 (= main_~p8~0 0)) (.cse2 (= main_~p5~0 0)) (.cse8 (= main_~lk6~0 1)) (.cse7 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse4 .cse6 .cse7) (and .cse0 .cse1 .cse5 .cse2 .cse7) (and .cse0 .cse2 .cse8 .cse4 .cse7) (and .cse0 .cse5 .cse3 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse4 .cse7) (and .cse0 .cse3 .cse8 .cse4 .cse6) (and .cse0 .cse5 .cse8 .cse6 .cse7) (and .cse0 .cse5 .cse2 .cse3 .cse8) (and .cse0 .cse1 .cse4 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse4) (and .cse0 .cse1 .cse5 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse3 .cse6) (and .cse0 .cse5 .cse2 .cse8 .cse7))) [2020-10-24 01:03:38,801 INFO L270 CegarLoopResult]: At program point L75(line 75) the Hoare annotation is: (let ((.cse6 (= main_~p2~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~p3~0 0)) (.cse3 (= main_~p1~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse4 .cse5 .cse3 .cse6) (and .cse5 .cse2 .cse3 .cse6) (and .cse5 .cse1 .cse2 .cse7) (and .cse0 .cse2 .cse6 .cse7) (and .cse5 .cse2 .cse6 .cse7) (and .cse4 .cse0 .cse6 .cse7) (and .cse4 .cse0 .cse1 .cse3) (and .cse4 .cse0 .cse1 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse7))) [2020-10-24 01:03:38,801 INFO L277 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-10-24 01:03:38,801 INFO L277 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-10-24 01:03:38,801 INFO L277 CegarLoopResult]: At program point L133(lines 7 137) the Hoare annotation is: true [2020-10-24 01:03:38,801 INFO L270 CegarLoopResult]: At program point L67(line 67) the Hoare annotation is: (let ((.cse0 (= main_~lk2~0 1)) (.cse2 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0)) (.cse1 (= main_~lk1~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse2) (and .cse3 .cse1))) [2020-10-24 01:03:38,801 INFO L277 CegarLoopResult]: At program point L59(line 59) the Hoare annotation is: true [2020-10-24 01:03:38,802 INFO L270 CegarLoopResult]: At program point L92-1(lines 35 132) the Hoare annotation is: (let ((.cse11 (= main_~p5~0 0)) (.cse8 (= main_~p6~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~p3~0 0)) (.cse9 (= main_~p8~0 0)) (.cse13 (= main_~lk2~0 1)) (.cse12 (= main_~p7~0 0)) (.cse7 (= main_~lk3~0 1)) (.cse2 (= main_~lk6~0 1)) (.cse3 (= main_~lk8~0 1)) (.cse10 (= main_~p4~0 0)) (.cse4 (= main_~lk5~0 1)) (.cse5 (= main_~p2~0 0)) (.cse6 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse10 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse11 .cse2 .cse3 .cse5 .cse6) (and .cse7 .cse12 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse0 .cse1 .cse9 .cse11 .cse12 .cse2 .cse5) (and .cse0 .cse1 .cse11 .cse13 .cse2 .cse3 .cse6) (and .cse7 .cse9 .cse13 .cse12 .cse2 .cse10 .cse4) (and .cse8 .cse1 .cse9 .cse13 .cse10 .cse4 .cse6) (and .cse0 .cse8 .cse1 .cse9 .cse11 .cse12 .cse5) (and .cse0 .cse1 .cse9 .cse11 .cse13 .cse2 .cse6) (and .cse1 .cse9 .cse11 .cse13 .cse2 .cse10 .cse6) (and .cse0 .cse8 .cse1 .cse13 .cse12 .cse3 .cse4) (and .cse0 .cse7 .cse8 .cse11 .cse13 .cse3 .cse6) (and .cse0 .cse1 .cse11 .cse2 .cse3 .cse5 .cse6) (and .cse8 .cse1 .cse9 .cse11 .cse13 .cse10 .cse6) (and .cse0 .cse8 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse4 .cse5) (and .cse7 .cse8 .cse9 .cse13 .cse12 .cse10 .cse4) (and .cse0 .cse7 .cse8 .cse9 .cse11 .cse5 .cse6) (and .cse8 .cse1 .cse13 .cse3 .cse10 .cse4 .cse6) (and .cse7 .cse8 .cse9 .cse13 .cse10 .cse4 .cse6) (and .cse7 .cse9 .cse12 .cse2 .cse10 .cse4 .cse5) (and .cse0 .cse1 .cse9 .cse11 .cse13 .cse12 .cse2) (and .cse1 .cse9 .cse13 .cse12 .cse2 .cse10 .cse4) (and .cse0 .cse7 .cse9 .cse12 .cse2 .cse4 .cse5) (and .cse7 .cse8 .cse9 .cse12 .cse10 .cse4 .cse5) (and .cse0 .cse7 .cse8 .cse9 .cse11 .cse12 .cse5) (and .cse1 .cse13 .cse2 .cse3 .cse10 .cse4 .cse6) (and .cse7 .cse11 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse8 .cse1 .cse9 .cse12 .cse10 .cse4 .cse5) (and .cse0 .cse7 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse9 .cse11 .cse13 .cse12 .cse2) (and .cse7 .cse9 .cse13 .cse2 .cse10 .cse4 .cse6) (and .cse1 .cse11 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse8 .cse1 .cse11 .cse13 .cse12 .cse3 .cse10) (and .cse0 .cse7 .cse9 .cse11 .cse2 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse11 .cse13 .cse12 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse13 .cse10 .cse6) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse12 .cse3 .cse10 .cse5) (and .cse0 .cse7 .cse8 .cse9 .cse11 .cse13 .cse12) (and .cse0 .cse8 .cse1 .cse11 .cse13 .cse3 .cse6) (and .cse7 .cse11 .cse13 .cse2 .cse3 .cse10 .cse6) (and .cse1 .cse9 .cse11 .cse13 .cse12 .cse2 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse10 .cse5 .cse6) (and .cse0 .cse8 .cse1 .cse9 .cse12 .cse4 .cse5) (and .cse0 .cse7 .cse12 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse7 .cse8 .cse9 .cse13 .cse12 .cse4) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse8 .cse11 .cse3 .cse5 .cse6) (and .cse7 .cse11 .cse12 .cse2 .cse3 .cse10 .cse5) (and .cse0 .cse7 .cse11 .cse13 .cse2 .cse3 .cse6) (and .cse0 .cse7 .cse11 .cse12 .cse2 .cse3 .cse5) (and .cse7 .cse11 .cse13 .cse12 .cse2 .cse3 .cse10) (and .cse1 .cse13 .cse12 .cse2 .cse3 .cse10 .cse4) (and .cse7 .cse8 .cse11 .cse3 .cse10 .cse5 .cse6) (and .cse1 .cse11 .cse13 .cse12 .cse2 .cse3 .cse10) (and .cse1 .cse12 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse8 .cse11 .cse13 .cse12 .cse3 .cse10) (and .cse8 .cse1 .cse9 .cse13 .cse12 .cse10 .cse4) (and .cse7 .cse9 .cse11 .cse12 .cse2 .cse10 .cse5) (and .cse7 .cse8 .cse13 .cse3 .cse10 .cse4 .cse6) (and .cse0 .cse8 .cse1 .cse9 .cse11 .cse13 .cse12) (and .cse0 .cse7 .cse11 .cse13 .cse12 .cse2 .cse3) (and .cse0 .cse7 .cse9 .cse11 .cse13 .cse2 .cse6) (and .cse8 .cse1 .cse11 .cse12 .cse3 .cse10 .cse5) (and .cse0 .cse7 .cse13 .cse12 .cse2 .cse3 .cse4) (and .cse0 .cse7 .cse8 .cse9 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse11 .cse13 .cse12 .cse3) (and .cse0 .cse7 .cse8 .cse9 .cse12 .cse4 .cse5) (and .cse7 .cse9 .cse11 .cse2 .cse10 .cse5 .cse6) (and .cse0 .cse8 .cse1 .cse11 .cse3 .cse5 .cse6) (and .cse1 .cse9 .cse13 .cse2 .cse10 .cse4 .cse6) (and .cse7 .cse8 .cse9 .cse11 .cse12 .cse10 .cse5) (and .cse7 .cse13 .cse2 .cse3 .cse10 .cse4 .cse6) (and .cse0 .cse8 .cse1 .cse12 .cse3 .cse4 .cse5) (and .cse0 .cse7 .cse8 .cse11 .cse12 .cse3 .cse5) (and .cse0 .cse7 .cse8 .cse12 .cse3 .cse4 .cse5) (and .cse0 .cse7 .cse9 .cse13 .cse12 .cse2 .cse4) (and .cse1 .cse11 .cse12 .cse2 .cse3 .cse10 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse4 .cse5 .cse6) (and .cse7 .cse9 .cse2 .cse10 .cse4 .cse5 .cse6) (and .cse0 .cse8 .cse1 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse8 .cse1 .cse11 .cse12 .cse3 .cse5) (and .cse8 .cse1 .cse9 .cse11 .cse13 .cse12 .cse10) (and .cse8 .cse1 .cse11 .cse3 .cse10 .cse5 .cse6) (and .cse8 .cse1 .cse9 .cse11 .cse10 .cse5 .cse6) (and .cse0 .cse1 .cse11 .cse12 .cse2 .cse3 .cse5) (and .cse7 .cse8 .cse12 .cse3 .cse10 .cse4 .cse5) (and .cse0 .cse7 .cse8 .cse13 .cse12 .cse3 .cse4) (and .cse1 .cse9 .cse11 .cse12 .cse2 .cse10 .cse5) (and .cse0 .cse7 .cse9 .cse11 .cse12 .cse2 .cse5) (and .cse0 .cse7 .cse9 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse13 .cse12 .cse3 .cse10 .cse4) (and .cse0 .cse8 .cse1 .cse11 .cse13 .cse12 .cse3) (and .cse1 .cse2 .cse3 .cse10 .cse4 .cse5 .cse6) (and .cse8 .cse1 .cse9 .cse11 .cse12 .cse10 .cse5) (and .cse7 .cse9 .cse11 .cse13 .cse2 .cse10 .cse6) (and .cse0 .cse1 .cse9 .cse13 .cse2 .cse4 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse11 .cse13 .cse6) (and .cse0 .cse7 .cse8 .cse13 .cse3 .cse4 .cse6) (and .cse7 .cse9 .cse11 .cse13 .cse12 .cse2 .cse10) (and .cse1 .cse11 .cse13 .cse2 .cse3 .cse10 .cse6) (and .cse7 .cse13 .cse12 .cse2 .cse3 .cse10 .cse4) (and .cse0 .cse7 .cse13 .cse2 .cse3 .cse4 .cse6) (and .cse8 .cse1 .cse12 .cse3 .cse10 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse13 .cse4 .cse6) (and .cse0 .cse8 .cse1 .cse9 .cse11 .cse13 .cse6) (and .cse7 .cse8 .cse11 .cse13 .cse3 .cse10 .cse6) (and .cse0 .cse1 .cse11 .cse13 .cse12 .cse2 .cse3) (and .cse0 .cse7 .cse9 .cse13 .cse2 .cse4 .cse6) (and .cse0 .cse1 .cse9 .cse11 .cse2 .cse5 .cse6) (and .cse1 .cse9 .cse2 .cse10 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse9 .cse12 .cse2 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse13 .cse12 .cse4) (and .cse0 .cse1 .cse13 .cse12 .cse2 .cse3 .cse4) (and .cse8 .cse1 .cse13 .cse12 .cse3 .cse10 .cse4) (and .cse0 .cse8 .cse1 .cse13 .cse3 .cse4 .cse6) (and .cse1 .cse9 .cse11 .cse2 .cse10 .cse5 .cse6) (and .cse8 .cse1 .cse11 .cse13 .cse3 .cse10 .cse6) (and .cse1 .cse9 .cse12 .cse2 .cse10 .cse4 .cse5) (and .cse7 .cse8 .cse3 .cse10 .cse4 .cse5 .cse6) (and .cse8 .cse1 .cse9 .cse10 .cse4 .cse5 .cse6) (and .cse8 .cse1 .cse3 .cse10 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse13 .cse4 .cse6) (and .cse0 .cse1 .cse9 .cse13 .cse12 .cse2 .cse4) (and .cse7 .cse2 .cse3 .cse10 .cse4 .cse5 .cse6))) [2020-10-24 01:03:38,803 INFO L277 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: true [2020-10-24 01:03:38,803 INFO L277 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: true [2020-10-24 01:03:38,803 INFO L277 CegarLoopResult]: At program point L26-2(line 26) the Hoare annotation is: true [2020-10-24 01:03:38,803 INFO L270 CegarLoopResult]: At program point L117-1(lines 35 132) the Hoare annotation is: (let ((.cse1 (= main_~p7~0 0)) (.cse0 (= main_~p8~0 0)) (.cse2 (= main_~lk8~0 1)) (.cse3 (= main_~lk7~0 1))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse0 .cse3) (and .cse2 .cse3))) [2020-10-24 01:03:38,803 INFO L277 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-10-24 01:03:38,803 INFO L270 CegarLoopResult]: At program point L109(line 109) the Hoare annotation is: (let ((.cse4 (= main_~lk8~0 1)) (.cse1 (= main_~p6~0 0)) (.cse3 (= main_~p7~0 0)) (.cse6 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse5 (= main_~p8~0 0)) (.cse2 (= main_~p5~0 0)) (.cse8 (= main_~lk6~0 1)) (.cse7 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse4 .cse6 .cse7) (and .cse0 .cse1 .cse5 .cse2 .cse7) (and .cse0 .cse2 .cse8 .cse4 .cse7) (and .cse0 .cse5 .cse3 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse4 .cse7) (and .cse0 .cse3 .cse8 .cse4 .cse6) (and .cse0 .cse5 .cse8 .cse6 .cse7) (and .cse0 .cse5 .cse2 .cse3 .cse8) (and .cse0 .cse1 .cse4 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse4) (and .cse0 .cse1 .cse5 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse3 .cse6) (and .cse0 .cse5 .cse2 .cse8 .cse7))) [2020-10-24 01:03:38,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 01:03:38 BoogieIcfgContainer [2020-10-24 01:03:38,817 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 01:03:38,818 INFO L168 Benchmark]: Toolchain (without parser) took 230515.39 ms. Allocated memory was 151.0 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 127.2 MB in the beginning and 1.1 GB in the end (delta: -986.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 8.0 GB. [2020-10-24 01:03:38,818 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 151.0 MB. Free memory is still 125.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 01:03:38,819 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.88 ms. Allocated memory is still 151.0 MB. Free memory was 126.6 MB in the beginning and 116.3 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2020-10-24 01:03:38,819 INFO L168 Benchmark]: Boogie Preprocessor took 47.20 ms. Allocated memory is still 151.0 MB. Free memory was 116.3 MB in the beginning and 114.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-10-24 01:03:38,820 INFO L168 Benchmark]: RCFGBuilder took 921.28 ms. Allocated memory is still 151.0 MB. Free memory was 114.6 MB in the beginning and 125.9 MB in the end (delta: -11.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 8.0 GB. [2020-10-24 01:03:38,820 INFO L168 Benchmark]: TraceAbstraction took 229208.99 ms. Allocated memory was 151.0 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 125.4 MB in the beginning and 1.1 GB in the end (delta: -988.5 MB). Peak memory consumption was 1.4 GB. Max. memory is 8.0 GB. [2020-10-24 01:03:38,822 INFO L339 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 151.0 MB. Free memory is still 125.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 319.88 ms. Allocated memory is still 151.0 MB. Free memory was 126.6 MB in the beginning and 116.3 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 47.20 ms. Allocated memory is still 151.0 MB. Free memory was 116.3 MB in the beginning and 114.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 921.28 ms. Allocated memory is still 151.0 MB. Free memory was 114.6 MB in the beginning and 125.9 MB in the end (delta: -11.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 229208.99 ms. Allocated memory was 151.0 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 125.4 MB in the beginning and 1.1 GB in the end (delta: -988.5 MB). Peak memory consumption was 1.4 GB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: 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: 35]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 3]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 20.3s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 13.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 208.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2488 SDtfs, 2889 SDslu, 271 SDs, 0 SdLazy, 1790 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5488occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 2639 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 110 LocationsWithAnnotation, 170 PreInvPairs, 10674 NumberOfFragments, 32402 HoareAnnotationTreeSize, 170 FomulaSimplifications, 4159407 FormulaSimplificationTreeSizeReduction, 25.7s HoareSimplificationTime, 110 FomulaSimplificationsInter, 47378 FormulaSimplificationTreeSizeReductionInter, 182.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1184 NumberOfCodeBlocks, 1184 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1168 ConstructedInterpolants, 0 QuantifiedInterpolants, 140256 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...