/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 -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_7.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 00:46:56,617 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 00:46:56,621 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 00:46:56,678 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 00:46:56,679 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 00:46:56,683 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 00:46:56,688 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 00:46:56,697 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 00:46:56,709 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 00:46:56,715 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 00:46:56,716 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 00:46:56,718 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 00:46:56,719 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 00:46:56,722 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 00:46:56,724 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 00:46:56,726 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 00:46:56,728 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 00:46:56,731 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 00:46:56,738 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 00:46:56,743 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 00:46:56,746 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 00:46:56,749 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 00:46:56,752 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 00:46:56,753 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 00:46:56,761 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 00:46:56,762 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 00:46:56,762 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 00:46:56,764 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 00:46:56,765 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 00:46:56,766 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 00:46:56,766 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 00:46:56,767 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 00:46:56,769 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 00:46:56,770 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 00:46:56,771 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 00:46:56,772 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 00:46:56,773 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 00:46:56,773 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 00:46:56,773 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 00:46:56,774 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 00:46:56,775 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 00:46:56,776 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 00:46:56,801 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 00:46:56,801 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 00:46:56,805 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 00:46:56,806 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 00:46:56,806 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 00:46:56,806 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 00:46:56,807 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 00:46:56,807 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 00:46:56,807 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 00:46:56,807 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 00:46:56,809 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 00:46:56,809 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 00:46:56,809 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 00:46:56,810 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 00:46:56,810 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 00:46:56,810 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 00:46:56,811 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 00:46:56,811 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 00:46:56,811 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:46:56,811 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 00:46:56,812 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 00:46:56,812 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 00:46:56,812 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 [2020-11-07 00:46:57,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 00:46:57,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 00:46:57,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 00:46:57,295 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 00:46:57,299 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 00:46:57,300 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_7.c [2020-11-07 00:46:57,374 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5ba5c859/08e5baabb5c1463aa2b5f61f8999217a/FLAGa161d4fa5 [2020-11-07 00:46:57,983 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 00:46:57,984 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2020-11-07 00:46:57,996 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5ba5c859/08e5baabb5c1463aa2b5f61f8999217a/FLAGa161d4fa5 [2020-11-07 00:46:58,359 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5ba5c859/08e5baabb5c1463aa2b5f61f8999217a [2020-11-07 00:46:58,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 00:46:58,374 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 00:46:58,380 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 00:46:58,380 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 00:46:58,384 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 00:46:58,385 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:46:58" (1/1) ... [2020-11-07 00:46:58,389 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15dc1b9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:58, skipping insertion in model container [2020-11-07 00:46:58,390 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:46:58" (1/1) ... [2020-11-07 00:46:58,399 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 00:46:58,427 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 00:46:58,600 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:46:58,618 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 00:46:58,674 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:46:58,698 INFO L208 MainTranslator]: Completed translation [2020-11-07 00:46:58,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:58 WrapperNode [2020-11-07 00:46:58,699 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 00:46:58,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 00:46:58,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 00:46:58,700 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 00:46:58,714 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:58" (1/1) ... [2020-11-07 00:46:58,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:58" (1/1) ... [2020-11-07 00:46:58,723 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:58" (1/1) ... [2020-11-07 00:46:58,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:58" (1/1) ... [2020-11-07 00:46:58,729 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:58" (1/1) ... [2020-11-07 00:46:58,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:58" (1/1) ... [2020-11-07 00:46:58,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:58" (1/1) ... [2020-11-07 00:46:58,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 00:46:58,741 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 00:46:58,741 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 00:46:58,742 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 00:46:58,743 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:58" (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-11-07 00:46:58,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 00:46:58,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 00:46:58,818 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 00:46:58,818 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 00:46:58,818 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 00:46:58,819 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 00:46:58,819 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 00:46:58,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 00:46:58,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 00:46:58,820 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 00:46:58,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 00:46:58,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 00:46:58,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 00:46:58,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 00:46:58,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 00:46:58,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 00:46:59,286 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 00:46:59,286 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-11-07 00:46:59,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:46:59 BoogieIcfgContainer [2020-11-07 00:46:59,289 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 00:46:59,290 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 00:46:59,291 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 00:46:59,298 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 00:46:59,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:46:58" (1/3) ... [2020-11-07 00:46:59,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd8d026 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:46:59, skipping insertion in model container [2020-11-07 00:46:59,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:46:58" (2/3) ... [2020-11-07 00:46:59,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd8d026 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:46:59, skipping insertion in model container [2020-11-07 00:46:59,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:46:59" (3/3) ... [2020-11-07 00:46:59,305 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2020-11-07 00:46:59,321 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 00:46:59,324 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 00:46:59,335 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 00:46:59,361 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 00:46:59,362 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 00:46:59,362 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-11-07 00:46:59,362 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 00:46:59,362 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 00:46:59,363 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 00:46:59,363 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 00:46:59,363 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 00:46:59,382 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states. [2020-11-07 00:46:59,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-07 00:46:59,395 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:46:59,396 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:46:59,397 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:46:59,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:46:59,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1602311135, now seen corresponding path program 1 times [2020-11-07 00:46:59,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:46:59,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [826821782] [2020-11-07 00:46:59,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:46:59,499 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:46:59,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:59,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:46:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:46:59,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:46:59,775 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [826821782] [2020-11-07 00:46:59,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:46:59,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:46:59,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622414990] [2020-11-07 00:46:59,784 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:46:59,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:46:59,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:46:59,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:46:59,805 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 4 states. [2020-11-07 00:47:00,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:47:00,276 INFO L93 Difference]: Finished difference Result 203 states and 274 transitions. [2020-11-07 00:47:00,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:47:00,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2020-11-07 00:47:00,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:47:00,294 INFO L225 Difference]: With dead ends: 203 [2020-11-07 00:47:00,294 INFO L226 Difference]: Without dead ends: 136 [2020-11-07 00:47:00,300 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-11-07 00:47:00,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-11-07 00:47:00,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2020-11-07 00:47:00,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-11-07 00:47:00,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 173 transitions. [2020-11-07 00:47:00,392 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 173 transitions. Word has length 64 [2020-11-07 00:47:00,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:47:00,393 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 173 transitions. [2020-11-07 00:47:00,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:47:00,393 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 173 transitions. [2020-11-07 00:47:00,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-07 00:47:00,396 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:47:00,396 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:47:00,396 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 00:47:00,397 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:47:00,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:47:00,398 INFO L82 PathProgramCache]: Analyzing trace with hash 179683855, now seen corresponding path program 1 times [2020-11-07 00:47:00,398 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:47:00,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [122214449] [2020-11-07 00:47:00,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:47:00,402 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:47:00,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:00,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:47:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:00,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:47:00,541 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [122214449] [2020-11-07 00:47:00,541 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:47:00,542 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:47:00,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743494673] [2020-11-07 00:47:00,543 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:47:00,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:47:00,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:47:00,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:47:00,545 INFO L87 Difference]: Start difference. First operand 135 states and 173 transitions. Second operand 4 states. [2020-11-07 00:47:00,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:47:00,834 INFO L93 Difference]: Finished difference Result 163 states and 212 transitions. [2020-11-07 00:47:00,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:47:00,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2020-11-07 00:47:00,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:47:00,838 INFO L225 Difference]: With dead ends: 163 [2020-11-07 00:47:00,838 INFO L226 Difference]: Without dead ends: 160 [2020-11-07 00:47:00,840 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-11-07 00:47:00,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-11-07 00:47:00,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 135. [2020-11-07 00:47:00,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-11-07 00:47:00,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 172 transitions. [2020-11-07 00:47:00,890 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 172 transitions. Word has length 65 [2020-11-07 00:47:00,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:47:00,891 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 172 transitions. [2020-11-07 00:47:00,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:47:00,894 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 172 transitions. [2020-11-07 00:47:00,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-07 00:47:00,896 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:47:00,896 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:47:00,897 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 00:47:00,897 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:47:00,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:47:00,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1875549338, now seen corresponding path program 1 times [2020-11-07 00:47:00,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:47:00,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [496864227] [2020-11-07 00:47:00,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:47:00,908 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:47:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:01,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:47:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:01,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:47:01,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [496864227] [2020-11-07 00:47:01,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:47:01,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:47:01,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008357368] [2020-11-07 00:47:01,025 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:47:01,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:47:01,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:47:01,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:47:01,026 INFO L87 Difference]: Start difference. First operand 135 states and 172 transitions. Second operand 4 states. [2020-11-07 00:47:01,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:47:01,336 INFO L93 Difference]: Finished difference Result 315 states and 425 transitions. [2020-11-07 00:47:01,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:47:01,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2020-11-07 00:47:01,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:47:01,340 INFO L225 Difference]: With dead ends: 315 [2020-11-07 00:47:01,340 INFO L226 Difference]: Without dead ends: 221 [2020-11-07 00:47:01,341 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-11-07 00:47:01,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2020-11-07 00:47:01,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2020-11-07 00:47:01,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-11-07 00:47:01,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 289 transitions. [2020-11-07 00:47:01,388 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 289 transitions. Word has length 65 [2020-11-07 00:47:01,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:47:01,389 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 289 transitions. [2020-11-07 00:47:01,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:47:01,389 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 289 transitions. [2020-11-07 00:47:01,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-11-07 00:47:01,391 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:47:01,391 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:47:01,391 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 00:47:01,391 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:47:01,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:47:01,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1979914163, now seen corresponding path program 1 times [2020-11-07 00:47:01,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:47:01,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1332826866] [2020-11-07 00:47:01,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:47:01,395 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:47:01,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:01,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:47:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:01,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:47:01,494 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1332826866] [2020-11-07 00:47:01,494 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:47:01,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:47:01,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337558090] [2020-11-07 00:47:01,496 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:47:01,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:47:01,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:47:01,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:47:01,497 INFO L87 Difference]: Start difference. First operand 220 states and 289 transitions. Second operand 4 states. [2020-11-07 00:47:01,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:47:01,814 INFO L93 Difference]: Finished difference Result 564 states and 768 transitions. [2020-11-07 00:47:01,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:47:01,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2020-11-07 00:47:01,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:47:01,818 INFO L225 Difference]: With dead ends: 564 [2020-11-07 00:47:01,818 INFO L226 Difference]: Without dead ends: 385 [2020-11-07 00:47:01,820 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-11-07 00:47:01,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2020-11-07 00:47:01,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 384. [2020-11-07 00:47:01,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-11-07 00:47:01,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 511 transitions. [2020-11-07 00:47:01,916 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 511 transitions. Word has length 66 [2020-11-07 00:47:01,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:47:01,917 INFO L481 AbstractCegarLoop]: Abstraction has 384 states and 511 transitions. [2020-11-07 00:47:01,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:47:01,917 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 511 transitions. [2020-11-07 00:47:01,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-11-07 00:47:01,919 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:47:01,919 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:47:01,920 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 00:47:01,920 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:47:01,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:47:01,920 INFO L82 PathProgramCache]: Analyzing trace with hash 476041895, now seen corresponding path program 1 times [2020-11-07 00:47:01,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:47:01,921 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [573130529] [2020-11-07 00:47:01,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:47:01,924 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:47:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:01,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:47:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:01,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:47:01,999 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [573130529] [2020-11-07 00:47:02,000 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:47:02,000 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:47:02,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352724168] [2020-11-07 00:47:02,001 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:47:02,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:47:02,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:47:02,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:47:02,002 INFO L87 Difference]: Start difference. First operand 384 states and 511 transitions. Second operand 4 states. [2020-11-07 00:47:02,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:47:02,328 INFO L93 Difference]: Finished difference Result 472 states and 634 transitions. [2020-11-07 00:47:02,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:47:02,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2020-11-07 00:47:02,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:47:02,332 INFO L225 Difference]: With dead ends: 472 [2020-11-07 00:47:02,333 INFO L226 Difference]: Without dead ends: 469 [2020-11-07 00:47:02,333 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-11-07 00:47:02,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2020-11-07 00:47:02,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 384. [2020-11-07 00:47:02,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-11-07 00:47:02,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 507 transitions. [2020-11-07 00:47:02,415 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 507 transitions. Word has length 66 [2020-11-07 00:47:02,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:47:02,416 INFO L481 AbstractCegarLoop]: Abstraction has 384 states and 507 transitions. [2020-11-07 00:47:02,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:47:02,416 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 507 transitions. [2020-11-07 00:47:02,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-11-07 00:47:02,418 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:47:02,418 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:47:02,418 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 00:47:02,419 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:47:02,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:47:02,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1073218075, now seen corresponding path program 1 times [2020-11-07 00:47:02,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:47:02,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1469404001] [2020-11-07 00:47:02,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:47:02,422 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:47:02,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:02,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:47:02,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:02,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:47:02,512 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1469404001] [2020-11-07 00:47:02,512 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:47:02,512 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:47:02,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224878084] [2020-11-07 00:47:02,513 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:47:02,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:47:02,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:47:02,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:47:02,514 INFO L87 Difference]: Start difference. First operand 384 states and 507 transitions. Second operand 4 states. [2020-11-07 00:47:02,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:47:02,812 INFO L93 Difference]: Finished difference Result 468 states and 622 transitions. [2020-11-07 00:47:02,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:47:02,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2020-11-07 00:47:02,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:47:02,816 INFO L225 Difference]: With dead ends: 468 [2020-11-07 00:47:02,816 INFO L226 Difference]: Without dead ends: 465 [2020-11-07 00:47:02,817 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-11-07 00:47:02,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2020-11-07 00:47:02,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 384. [2020-11-07 00:47:02,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-11-07 00:47:02,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 503 transitions. [2020-11-07 00:47:02,894 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 503 transitions. Word has length 67 [2020-11-07 00:47:02,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:47:02,895 INFO L481 AbstractCegarLoop]: Abstraction has 384 states and 503 transitions. [2020-11-07 00:47:02,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:47:02,895 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 503 transitions. [2020-11-07 00:47:02,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-11-07 00:47:02,897 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:47:02,897 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:47:02,897 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 00:47:02,898 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:47:02,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:47:02,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1240186874, now seen corresponding path program 1 times [2020-11-07 00:47:02,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:47:02,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1096634144] [2020-11-07 00:47:02,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:47:02,901 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:47:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:02,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:47:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:02,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:47:02,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1096634144] [2020-11-07 00:47:02,975 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:47:02,975 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:47:02,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648551684] [2020-11-07 00:47:02,976 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:47:02,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:47:02,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:47:02,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:47:02,977 INFO L87 Difference]: Start difference. First operand 384 states and 503 transitions. Second operand 4 states. [2020-11-07 00:47:03,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:47:03,343 INFO L93 Difference]: Finished difference Result 1044 states and 1394 transitions. [2020-11-07 00:47:03,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:47:03,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2020-11-07 00:47:03,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:47:03,347 INFO L225 Difference]: With dead ends: 1044 [2020-11-07 00:47:03,348 INFO L226 Difference]: Without dead ends: 701 [2020-11-07 00:47:03,350 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-11-07 00:47:03,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2020-11-07 00:47:03,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 700. [2020-11-07 00:47:03,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2020-11-07 00:47:03,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 915 transitions. [2020-11-07 00:47:03,461 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 915 transitions. Word has length 67 [2020-11-07 00:47:03,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:47:03,462 INFO L481 AbstractCegarLoop]: Abstraction has 700 states and 915 transitions. [2020-11-07 00:47:03,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:47:03,462 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 915 transitions. [2020-11-07 00:47:03,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-11-07 00:47:03,463 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:47:03,463 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:47:03,464 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 00:47:03,464 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:47:03,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:47:03,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1889145293, now seen corresponding path program 1 times [2020-11-07 00:47:03,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:47:03,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1621518862] [2020-11-07 00:47:03,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:47:03,467 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:47:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:03,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:47:03,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:03,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:47:03,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1621518862] [2020-11-07 00:47:03,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:47:03,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:47:03,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019895354] [2020-11-07 00:47:03,527 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:47:03,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:47:03,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:47:03,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:47:03,529 INFO L87 Difference]: Start difference. First operand 700 states and 915 transitions. Second operand 4 states. [2020-11-07 00:47:03,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:47:03,908 INFO L93 Difference]: Finished difference Result 848 states and 1110 transitions. [2020-11-07 00:47:03,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:47:03,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2020-11-07 00:47:03,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:47:03,914 INFO L225 Difference]: With dead ends: 848 [2020-11-07 00:47:03,915 INFO L226 Difference]: Without dead ends: 845 [2020-11-07 00:47:03,916 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-11-07 00:47:03,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2020-11-07 00:47:04,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 700. [2020-11-07 00:47:04,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2020-11-07 00:47:04,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 907 transitions. [2020-11-07 00:47:04,024 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 907 transitions. Word has length 68 [2020-11-07 00:47:04,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:47:04,025 INFO L481 AbstractCegarLoop]: Abstraction has 700 states and 907 transitions. [2020-11-07 00:47:04,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:47:04,025 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 907 transitions. [2020-11-07 00:47:04,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-11-07 00:47:04,026 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:47:04,027 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:47:04,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 00:47:04,027 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:47:04,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:47:04,028 INFO L82 PathProgramCache]: Analyzing trace with hash 216534137, now seen corresponding path program 1 times [2020-11-07 00:47:04,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:47:04,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1801756799] [2020-11-07 00:47:04,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:47:04,031 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:47:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:04,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:47:04,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:04,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:47:04,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1801756799] [2020-11-07 00:47:04,088 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:47:04,088 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:47:04,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560086785] [2020-11-07 00:47:04,089 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:47:04,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:47:04,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:47:04,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:47:04,090 INFO L87 Difference]: Start difference. First operand 700 states and 907 transitions. Second operand 4 states. [2020-11-07 00:47:04,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:47:04,539 INFO L93 Difference]: Finished difference Result 1968 states and 2574 transitions. [2020-11-07 00:47:04,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:47:04,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2020-11-07 00:47:04,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:47:04,547 INFO L225 Difference]: With dead ends: 1968 [2020-11-07 00:47:04,547 INFO L226 Difference]: Without dead ends: 1309 [2020-11-07 00:47:04,549 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-11-07 00:47:04,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2020-11-07 00:47:04,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1308. [2020-11-07 00:47:04,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1308 states. [2020-11-07 00:47:04,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 1675 transitions. [2020-11-07 00:47:04,747 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 1675 transitions. Word has length 68 [2020-11-07 00:47:04,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:47:04,748 INFO L481 AbstractCegarLoop]: Abstraction has 1308 states and 1675 transitions. [2020-11-07 00:47:04,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:47:04,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1675 transitions. [2020-11-07 00:47:04,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-11-07 00:47:04,752 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:47:04,752 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:47:04,753 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 00:47:04,753 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:47:04,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:47:04,753 INFO L82 PathProgramCache]: Analyzing trace with hash 766882343, now seen corresponding path program 1 times [2020-11-07 00:47:04,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:47:04,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1958830080] [2020-11-07 00:47:04,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:47:04,758 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:47:04,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:04,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:47:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:04,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:47:04,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1958830080] [2020-11-07 00:47:04,830 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:47:04,830 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:47:04,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647626081] [2020-11-07 00:47:04,831 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:47:04,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:47:04,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:47:04,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:47:04,832 INFO L87 Difference]: Start difference. First operand 1308 states and 1675 transitions. Second operand 4 states. [2020-11-07 00:47:05,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:47:05,422 INFO L93 Difference]: Finished difference Result 1568 states and 1998 transitions. [2020-11-07 00:47:05,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:47:05,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2020-11-07 00:47:05,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:47:05,431 INFO L225 Difference]: With dead ends: 1568 [2020-11-07 00:47:05,431 INFO L226 Difference]: Without dead ends: 1565 [2020-11-07 00:47:05,433 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-11-07 00:47:05,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2020-11-07 00:47:05,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1308. [2020-11-07 00:47:05,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1308 states. [2020-11-07 00:47:05,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 1659 transitions. [2020-11-07 00:47:05,654 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 1659 transitions. Word has length 69 [2020-11-07 00:47:05,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:47:05,654 INFO L481 AbstractCegarLoop]: Abstraction has 1308 states and 1659 transitions. [2020-11-07 00:47:05,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:47:05,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1659 transitions. [2020-11-07 00:47:05,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-11-07 00:47:05,656 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:47:05,656 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:47:05,657 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 00:47:05,657 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:47:05,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:47:05,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1869743246, now seen corresponding path program 1 times [2020-11-07 00:47:05,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:47:05,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1074405951] [2020-11-07 00:47:05,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:47:05,661 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:47:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:05,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:47:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:05,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:47:05,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1074405951] [2020-11-07 00:47:05,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:47:05,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:47:05,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422140222] [2020-11-07 00:47:05,730 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:47:05,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:47:05,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:47:05,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:47:05,731 INFO L87 Difference]: Start difference. First operand 1308 states and 1659 transitions. Second operand 4 states. [2020-11-07 00:47:06,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:47:06,361 INFO L93 Difference]: Finished difference Result 3744 states and 4766 transitions. [2020-11-07 00:47:06,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:47:06,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2020-11-07 00:47:06,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:47:06,377 INFO L225 Difference]: With dead ends: 3744 [2020-11-07 00:47:06,377 INFO L226 Difference]: Without dead ends: 2477 [2020-11-07 00:47:06,381 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-11-07 00:47:06,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2020-11-07 00:47:06,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 2476. [2020-11-07 00:47:06,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2476 states. [2020-11-07 00:47:06,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 3083 transitions. [2020-11-07 00:47:06,778 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 3083 transitions. Word has length 69 [2020-11-07 00:47:06,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:47:06,778 INFO L481 AbstractCegarLoop]: Abstraction has 2476 states and 3083 transitions. [2020-11-07 00:47:06,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:47:06,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 3083 transitions. [2020-11-07 00:47:06,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-11-07 00:47:06,781 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:47:06,782 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-11-07 00:47:06,782 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 00:47:06,782 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:47:06,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:47:06,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1499371967, now seen corresponding path program 1 times [2020-11-07 00:47:06,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:47:06,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [811222567] [2020-11-07 00:47:06,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:47:06,785 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:47:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:06,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:47:06,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:06,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:47:06,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [811222567] [2020-11-07 00:47:06,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:47:06,849 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:47:06,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574636507] [2020-11-07 00:47:06,849 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:47:06,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:47:06,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:47:06,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:47:06,850 INFO L87 Difference]: Start difference. First operand 2476 states and 3083 transitions. Second operand 4 states. [2020-11-07 00:47:07,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:47:07,569 INFO L93 Difference]: Finished difference Result 2928 states and 3598 transitions. [2020-11-07 00:47:07,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:47:07,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2020-11-07 00:47:07,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:47:07,585 INFO L225 Difference]: With dead ends: 2928 [2020-11-07 00:47:07,585 INFO L226 Difference]: Without dead ends: 2925 [2020-11-07 00:47:07,592 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-11-07 00:47:07,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2020-11-07 00:47:08,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 2476. [2020-11-07 00:47:08,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2476 states. [2020-11-07 00:47:08,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 3051 transitions. [2020-11-07 00:47:08,011 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 3051 transitions. Word has length 70 [2020-11-07 00:47:08,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:47:08,011 INFO L481 AbstractCegarLoop]: Abstraction has 2476 states and 3051 transitions. [2020-11-07 00:47:08,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:47:08,012 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 3051 transitions. [2020-11-07 00:47:08,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-11-07 00:47:08,014 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:47:08,015 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-11-07 00:47:08,015 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 00:47:08,015 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:47:08,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:47:08,016 INFO L82 PathProgramCache]: Analyzing trace with hash -2119821147, now seen corresponding path program 1 times [2020-11-07 00:47:08,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:47:08,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [678568573] [2020-11-07 00:47:08,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:47:08,018 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:47:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:08,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:47:08,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:08,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:47:08,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [678568573] [2020-11-07 00:47:08,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:47:08,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:47:08,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617452229] [2020-11-07 00:47:08,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:47:08,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:47:08,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:47:08,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:47:08,083 INFO L87 Difference]: Start difference. First operand 2476 states and 3051 transitions. Second operand 4 states. [2020-11-07 00:47:09,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:47:09,119 INFO L93 Difference]: Finished difference Result 7151 states and 8813 transitions. [2020-11-07 00:47:09,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:47:09,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2020-11-07 00:47:09,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:47:09,131 INFO L225 Difference]: With dead ends: 7151 [2020-11-07 00:47:09,132 INFO L226 Difference]: Without dead ends: 2476 [2020-11-07 00:47:09,142 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-11-07 00:47:09,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2476 states. [2020-11-07 00:47:09,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2476 to 2476. [2020-11-07 00:47:09,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2476 states. [2020-11-07 00:47:09,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 2923 transitions. [2020-11-07 00:47:09,561 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 2923 transitions. Word has length 70 [2020-11-07 00:47:09,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:47:09,562 INFO L481 AbstractCegarLoop]: Abstraction has 2476 states and 2923 transitions. [2020-11-07 00:47:09,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:47:09,562 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 2923 transitions. [2020-11-07 00:47:09,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-11-07 00:47:09,565 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:47:09,565 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-11-07 00:47:09,565 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 00:47:09,565 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:47:09,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:47:09,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1563241933, now seen corresponding path program 1 times [2020-11-07 00:47:09,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:47:09,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1222038223] [2020-11-07 00:47:09,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:47:09,568 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:47:09,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:09,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:47:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:47:09,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:47:09,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1222038223] [2020-11-07 00:47:09,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:47:09,642 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 00:47:09,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110602587] [2020-11-07 00:47:09,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 00:47:09,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:47:09,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 00:47:09,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 00:47:09,644 INFO L87 Difference]: Start difference. First operand 2476 states and 2923 transitions. Second operand 4 states. [2020-11-07 00:47:10,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:47:10,205 INFO L93 Difference]: Finished difference Result 2476 states and 2923 transitions. [2020-11-07 00:47:10,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 00:47:10,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2020-11-07 00:47:10,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:47:10,207 INFO L225 Difference]: With dead ends: 2476 [2020-11-07 00:47:10,207 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 00:47:10,212 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-11-07 00:47:10,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 00:47:10,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 00:47:10,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 00:47:10,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 00:47:10,213 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 71 [2020-11-07 00:47:10,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:47:10,213 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 00:47:10,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 00:47:10,214 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 00:47:10,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 00:47:10,214 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 00:47:10,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 00:47:10,606 WARN L194 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 85 [2020-11-07 00:47:10,873 WARN L194 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 273 DAG size of output: 31 [2020-11-07 00:47:11,529 WARN L194 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 382 DAG size of output: 31 [2020-11-07 00:47:12,131 WARN L194 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 382 DAG size of output: 31 [2020-11-07 00:47:12,625 WARN L194 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 382 DAG size of output: 31 [2020-11-07 00:47:13,102 WARN L194 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 382 DAG size of output: 31 [2020-11-07 00:47:13,582 WARN L194 SmtUtils]: Spent 477.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2020-11-07 00:47:13,773 WARN L194 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 85 [2020-11-07 00:47:14,123 WARN L194 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 41 [2020-11-07 00:47:14,438 WARN L194 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 363 DAG size of output: 31 [2020-11-07 00:47:14,676 WARN L194 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2020-11-07 00:47:15,341 WARN L194 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 349 DAG size of output: 31 [2020-11-07 00:47:15,575 WARN L194 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 41 [2020-11-07 00:47:15,759 WARN L194 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 121 [2020-11-07 00:47:15,892 WARN L194 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2020-11-07 00:47:16,198 WARN L194 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 382 DAG size of output: 31 [2020-11-07 00:47:16,452 WARN L194 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 288 DAG size of output: 45 [2020-11-07 00:47:16,558 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 318 DAG size of output: 34 [2020-11-07 00:47:16,835 WARN L194 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 382 DAG size of output: 31 [2020-11-07 00:47:16,990 WARN L194 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 323 DAG size of output: 31 [2020-11-07 00:47:17,648 WARN L194 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 384 DAG size of output: 39 [2020-11-07 00:47:17,958 WARN L194 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 377 DAG size of output: 31 [2020-11-07 00:47:18,119 WARN L194 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 121 [2020-11-07 00:47:19,388 WARN L194 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-11-07 00:47:26,886 WARN L194 SmtUtils]: Spent 7.43 s on a formula simplification. DAG size of input: 179 DAG size of output: 159 [2020-11-07 00:47:28,010 WARN L194 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-11-07 00:47:28,240 WARN L194 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-11-07 00:47:28,486 WARN L194 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2020-11-07 00:47:29,666 WARN L194 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-11-07 00:47:32,799 WARN L194 SmtUtils]: Spent 3.13 s on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2020-11-07 00:47:33,284 WARN L194 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-11-07 00:47:33,402 WARN L194 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2020-11-07 00:47:34,820 WARN L194 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2020-11-07 00:47:35,306 WARN L194 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-11-07 00:47:35,519 WARN L194 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-11-07 00:47:38,399 WARN L194 SmtUtils]: Spent 2.82 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2020-11-07 00:47:41,637 WARN L194 SmtUtils]: Spent 3.14 s on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2020-11-07 00:47:42,189 WARN L194 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2020-11-07 00:47:42,697 WARN L194 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-11-07 00:47:45,624 WARN L194 SmtUtils]: Spent 2.79 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2020-11-07 00:47:46,892 WARN L194 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2020-11-07 00:47:47,138 WARN L194 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2020-11-07 00:47:47,451 WARN L194 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-11-07 00:47:50,241 WARN L194 SmtUtils]: Spent 2.78 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2020-11-07 00:47:50,790 WARN L194 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2020-11-07 00:47:50,906 WARN L194 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2020-11-07 00:47:50,911 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-11-07 00:47:50,911 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-11-07 00:47:50,911 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-11-07 00:47:50,912 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-11-07 00:47:50,912 INFO L269 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-11-07 00:47:50,912 INFO L269 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-11-07 00:47:50,912 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:47:50,912 INFO L269 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-11-07 00:47:50,912 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 00:47:50,912 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2020-11-07 00:47:50,913 INFO L262 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-11-07 00:47:50,913 INFO L269 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-11-07 00:47:50,913 INFO L269 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-11-07 00:47:50,913 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:47:50,913 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:47:50,913 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:47:50,913 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 00:47:50,913 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 00:47:50,914 INFO L262 CegarLoopResult]: At program point L93-1(lines 32 118) the Hoare annotation is: (let ((.cse0 (= main_~p5~0 0)) (.cse1 (= main_~lk6~0 1)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~p7~0 0)) (.cse5 (= main_~lk4~0 1)) (.cse6 (= main_~p6~0 0)) (.cse4 (= main_~lk5~0 1)) (.cse3 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse4 .cse3) (and .cse5 .cse6 .cse0 .cse7) (and .cse5 .cse0 .cse7 .cse1) (and .cse5 .cse6 .cse0 .cse3) (and .cse5 .cse0 .cse1 .cse3) (and .cse5 .cse1 .cse4 .cse3) (and .cse7 .cse1 .cse2 .cse4) (and .cse6 .cse0 .cse2 .cse3) (and .cse6 .cse7 .cse2 .cse4) (and .cse6 .cse0 .cse7 .cse2) (and .cse6 .cse2 .cse4 .cse3) (and .cse5 .cse7 .cse1 .cse4) (and .cse0 .cse7 .cse1 .cse2) (and .cse5 .cse6 .cse7 .cse4) (and .cse5 .cse6 .cse4 .cse3))) [2020-11-07 00:47:50,914 INFO L269 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-11-07 00:47:50,914 INFO L269 CegarLoopResult]: At program point mainEXIT(lines 6 123) the Hoare annotation is: true [2020-11-07 00:47:50,915 INFO L262 CegarLoopResult]: At program point L85(line 85) the Hoare annotation is: (let ((.cse9 (= main_~lk4~0 1)) (.cse12 (= main_~p2~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse8 (= main_~lk6~0 1)) (.cse11 (= main_~lk5~0 1)) (.cse6 (= main_~lk7~0 1)) (.cse1 (= main_~p6~0 0)) (.cse10 (= main_~p3~0 0)) (.cse2 (= main_~p5~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse7 (= main_~p7~0 0)) (.cse4 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse7 .cse8 .cse4 .cse5) (and .cse9 .cse1 .cse10 .cse3 .cse11 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse2 .cse7 .cse12 .cse5) (and .cse10 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse1 .cse10 .cse3 .cse4 .cse11 .cse5 .cse6) (and .cse9 .cse0 .cse2 .cse3 .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse1 .cse10 .cse2 .cse4 .cse12 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse3 .cse7 .cse11 .cse5) (and .cse10 .cse3 .cse7 .cse8 .cse4 .cse11 .cse5) (and .cse1 .cse10 .cse2 .cse7 .cse4 .cse12 .cse5) (and .cse9 .cse1 .cse10 .cse2 .cse3 .cse5 .cse6) (and .cse10 .cse7 .cse8 .cse4 .cse11 .cse12 .cse5) (and .cse9 .cse0 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse2 .cse12 .cse5 .cse6) (and .cse9 .cse10 .cse3 .cse7 .cse8 .cse11 .cse5) (and .cse9 .cse10 .cse3 .cse8 .cse11 .cse5 .cse6) (and .cse9 .cse0 .cse2 .cse7 .cse8 .cse12 .cse5) (and .cse9 .cse0 .cse1 .cse7 .cse11 .cse12 .cse5) (and .cse9 .cse1 .cse10 .cse7 .cse11 .cse12 .cse5) (and .cse10 .cse3 .cse8 .cse4 .cse11 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse4 .cse11 .cse12 .cse5) (and .cse9 .cse10 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse8 .cse12 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse3 .cse7 .cse8 .cse5) (and .cse9 .cse0 .cse3 .cse8 .cse11 .cse5 .cse6) (and .cse0 .cse3 .cse7 .cse8 .cse4 .cse11 .cse5) (and .cse0 .cse1 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse1 .cse10 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse2 .cse12 .cse5 .cse6) (and .cse9 .cse0 .cse8 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse9 .cse0 .cse1 .cse11 .cse12 .cse5 .cse6) (and .cse10 .cse2 .cse8 .cse4 .cse12 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse7 .cse8 .cse12 .cse5) (and .cse0 .cse1 .cse7 .cse4 .cse11 .cse12 .cse5) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse9 .cse10 .cse7 .cse8 .cse11 .cse12 .cse5) (and .cse9 .cse0 .cse1 .cse2 .cse7 .cse12 .cse5) (and .cse10 .cse2 .cse3 .cse7 .cse8 .cse4 .cse5) (and .cse10 .cse8 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse8 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse11 .cse5 .cse6) (and .cse1 .cse10 .cse3 .cse7 .cse4 .cse11 .cse5) (and .cse0 .cse2 .cse8 .cse4 .cse12 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse11 .cse12 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse2 .cse3 .cse7 .cse5) (and .cse0 .cse1 .cse2 .cse7 .cse4 .cse12 .cse5) (and .cse9 .cse0 .cse3 .cse7 .cse8 .cse11 .cse5) (and .cse0 .cse1 .cse3 .cse7 .cse4 .cse11 .cse5) (and .cse9 .cse0 .cse1 .cse3 .cse11 .cse5 .cse6) (and .cse10 .cse2 .cse7 .cse8 .cse4 .cse12 .cse5) (and .cse9 .cse0 .cse2 .cse8 .cse12 .cse5 .cse6) (and .cse1 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse0 .cse7 .cse8 .cse11 .cse12 .cse5) (and .cse0 .cse2 .cse7 .cse8 .cse4 .cse12 .cse5) (and .cse9 .cse10 .cse8 .cse11 .cse12 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse3 .cse7 .cse11 .cse5) (and .cse1 .cse10 .cse7 .cse4 .cse11 .cse12 .cse5) (and .cse0 .cse3 .cse8 .cse4 .cse11 .cse5 .cse6) (and .cse1 .cse10 .cse2 .cse3 .cse7 .cse4 .cse5))) [2020-11-07 00:47:50,915 INFO L262 CegarLoopResult]: At program point L110(line 110) the Hoare annotation is: (let ((.cse0 (= main_~lk6~0 1))) (or (and .cse0 (= main_~lk7~0 1)) (and (= main_~p7~0 0) .cse0))) [2020-11-07 00:47:50,916 INFO L262 CegarLoopResult]: At program point L77-1(lines 32 118) 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-11-07 00:47:50,916 INFO L269 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: true [2020-11-07 00:47:50,916 INFO L269 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: true [2020-11-07 00:47:50,916 INFO L269 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: true [2020-11-07 00:47:50,917 INFO L262 CegarLoopResult]: At program point L69-1(lines 32 118) 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-11-07 00:47:50,917 INFO L262 CegarLoopResult]: At program point L94(line 94) the Hoare annotation is: (let ((.cse5 (= main_~p7~0 0)) (.cse8 (= main_~lk6~0 1)) (.cse7 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse2 (= main_~p6~0 0)) (.cse6 (= main_~p5~0 0)) (.cse4 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse5 .cse3) (and .cse1 .cse2 .cse6 .cse7 .cse4) (and .cse1 .cse2 .cse7 .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse7 .cse3) (and .cse1 .cse8 .cse7 .cse3 .cse4) (and .cse1 .cse2 .cse6 .cse5 .cse7) (and .cse0 .cse1 .cse6 .cse5 .cse8) (and .cse0 .cse1 .cse5 .cse8 .cse3) (and .cse0 .cse1 .cse6 .cse8 .cse4) (and .cse0 .cse1 .cse2 .cse6 .cse5) (and .cse0 .cse1 .cse8 .cse3 .cse4) (and .cse1 .cse6 .cse8 .cse7 .cse4) (and .cse1 .cse6 .cse5 .cse8 .cse7) (and .cse1 .cse5 .cse8 .cse7 .cse3) (and .cse0 .cse1 .cse2 .cse6 .cse4))) [2020-11-07 00:47:50,917 INFO L262 CegarLoopResult]: At program point L61-1(lines 32 118) 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-11-07 00:47:50,917 INFO L269 CegarLoopResult]: At program point L119(lines 7 123) the Hoare annotation is: true [2020-11-07 00:47:50,918 INFO L269 CegarLoopResult]: At program point L53(lines 53 55) the Hoare annotation is: true [2020-11-07 00:47:50,918 INFO L269 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-11-07 00:47:50,918 INFO L269 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: true [2020-11-07 00:47:50,918 INFO L262 CegarLoopResult]: At program point L53-2(lines 32 118) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-11-07 00:47:50,918 INFO L269 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: true [2020-11-07 00:47:50,919 INFO L262 CegarLoopResult]: At program point L78(line 78) 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 .cse2 .cse11 .cse8 .cse6 .cse7 .cse9) (and .cse0 .cse10 .cse1 .cse8 .cse3 .cse5) (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 .cse10 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse9) (and .cse2 .cse11 .cse6 .cse7 .cse9 .cse4) (and .cse10 .cse1 .cse11 .cse7 .cse9 .cse4) (and .cse0 .cse10 .cse8 .cse6 .cse3 .cse9) (and .cse0 .cse10 .cse6 .cse3 .cse4 .cse5) (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 .cse10 .cse1 .cse11 .cse7 .cse4 .cse5) (and .cse1 .cse2 .cse7 .cse3 .cse9 .cse4) (and .cse1 .cse2 .cse8 .cse7 .cse3 .cse9) (and .cse0 .cse2 .cse8 .cse6 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse8 .cse5) (and .cse0 .cse2 .cse6 .cse3 .cse4 .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 .cse10 .cse1 .cse8 .cse7 .cse3 .cse9) (and .cse0 .cse1 .cse2 .cse11 .cse9 .cse4) (and .cse2 .cse6 .cse7 .cse3 .cse9 .cse4) (and .cse0 .cse10 .cse11 .cse8 .cse6 .cse9) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse10 .cse1 .cse11 .cse8 .cse7 .cse9) (and .cse2 .cse8 .cse6 .cse7 .cse3 .cse9) (and .cse2 .cse11 .cse8 .cse6 .cse7 .cse5) (and .cse0 .cse2 .cse11 .cse8 .cse6 .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-11-07 00:47:50,919 INFO L269 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: true [2020-11-07 00:47:50,919 INFO L269 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-11-07 00:47:50,919 INFO L262 CegarLoopResult]: At program point L70(line 70) 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-11-07 00:47:50,920 INFO L262 CegarLoopResult]: At program point L103-1(lines 32 118) the Hoare annotation is: (let ((.cse0 (= main_~lk6~0 1)) (.cse2 (= main_~p7~0 0)) (.cse3 (= main_~p6~0 0)) (.cse1 (= main_~lk7~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and .cse3 .cse2) (and .cse3 .cse1))) [2020-11-07 00:47:50,920 INFO L269 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: true [2020-11-07 00:47:50,920 INFO L262 CegarLoopResult]: At program point L95(line 95) the Hoare annotation is: (let ((.cse5 (= main_~p7~0 0)) (.cse8 (= main_~lk6~0 1)) (.cse7 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse2 (= main_~p6~0 0)) (.cse6 (= main_~p5~0 0)) (.cse4 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse5 .cse3) (and .cse1 .cse2 .cse6 .cse7 .cse4) (and .cse1 .cse2 .cse7 .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse7 .cse3) (and .cse1 .cse8 .cse7 .cse3 .cse4) (and .cse1 .cse2 .cse6 .cse5 .cse7) (and .cse0 .cse1 .cse6 .cse5 .cse8) (and .cse0 .cse1 .cse5 .cse8 .cse3) (and .cse0 .cse1 .cse6 .cse8 .cse4) (and .cse0 .cse1 .cse2 .cse6 .cse5) (and .cse0 .cse1 .cse8 .cse3 .cse4) (and .cse1 .cse6 .cse8 .cse7 .cse4) (and .cse1 .cse6 .cse5 .cse8 .cse7) (and .cse1 .cse5 .cse8 .cse7 .cse3) (and .cse0 .cse1 .cse2 .cse6 .cse4))) [2020-11-07 00:47:50,920 INFO L262 CegarLoopResult]: At program point L62(line 62) 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-11-07 00:47:50,920 INFO L269 CegarLoopResult]: At program point L54(line 54) the Hoare annotation is: true [2020-11-07 00:47:50,920 INFO L269 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-11-07 00:47:50,921 INFO L269 CegarLoopResult]: At program point mainFINAL(lines 6 123) the Hoare annotation is: true [2020-11-07 00:47:50,921 INFO L262 CegarLoopResult]: At program point L104(line 104) the Hoare annotation is: (let ((.cse0 (= main_~p6~0 0)) (.cse4 (= main_~lk7~0 1)) (.cse1 (= main_~p7~0 0)) (.cse3 (= main_~lk6~0 1)) (.cse2 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse2 .cse4) (and .cse0 .cse2 .cse4) (and .cse1 .cse3 .cse2))) [2020-11-07 00:47:50,921 INFO L269 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: true [2020-11-07 00:47:50,921 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 6 123) the Hoare annotation is: true [2020-11-07 00:47:50,921 INFO L262 CegarLoopResult]: At program point L121(line 121) the Hoare annotation is: false [2020-11-07 00:47:50,922 INFO L262 CegarLoopResult]: At program point L88-1(lines 32 118) the Hoare annotation is: (let ((.cse7 (= main_~lk6~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse9 (= main_~p5~0 0)) (.cse4 (= main_~lk7~0 1)) (.cse2 (= main_~p6~0 0)) (.cse6 (= main_~p3~0 0)) (.cse5 (= main_~p7~0 0)) (.cse8 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse5 .cse3) (and .cse6 .cse5 .cse7 .cse8 .cse3) (and .cse2 .cse6 .cse9 .cse8 .cse4) (and .cse1 .cse2 .cse9 .cse5 .cse8) (and .cse6 .cse9 .cse5 .cse7 .cse8) (and .cse0 .cse1 .cse5 .cse7 .cse3) (and .cse0 .cse1 .cse9 .cse7 .cse4) (and .cse0 .cse2 .cse6 .cse9 .cse5) (and .cse0 .cse6 .cse9 .cse7 .cse4) (and .cse0 .cse2 .cse6 .cse9 .cse4) (and .cse0 .cse2 .cse6 .cse5 .cse3) (and .cse1 .cse9 .cse7 .cse8 .cse4) (and .cse0 .cse2 .cse6 .cse3 .cse4) (and .cse1 .cse2 .cse9 .cse8 .cse4) (and .cse6 .cse7 .cse8 .cse3 .cse4) (and .cse1 .cse2 .cse8 .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse8 .cse3) (and .cse1 .cse7 .cse8 .cse3 .cse4) (and .cse2 .cse6 .cse9 .cse5 .cse8) (and .cse0 .cse1 .cse9 .cse5 .cse7) (and .cse6 .cse9 .cse7 .cse8 .cse4) (and .cse0 .cse6 .cse9 .cse5 .cse7) (and .cse0 .cse6 .cse5 .cse7 .cse3) (and .cse0 .cse1 .cse2 .cse9 .cse5) (and .cse2 .cse6 .cse8 .cse3 .cse4) (and .cse0 .cse1 .cse7 .cse3 .cse4) (and .cse1 .cse9 .cse5 .cse7 .cse8) (and .cse0 .cse6 .cse7 .cse3 .cse4) (and .cse1 .cse5 .cse7 .cse8 .cse3) (and .cse0 .cse1 .cse2 .cse9 .cse4) (and .cse2 .cse6 .cse5 .cse8 .cse3))) [2020-11-07 00:47:50,922 INFO L269 CegarLoopResult]: At program point L113-1(lines 32 118) the Hoare annotation is: true [2020-11-07 00:47:50,922 INFO L269 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: true [2020-11-07 00:47:50,922 INFO L269 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-11-07 00:47:50,922 INFO L269 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: true [2020-11-07 00:47:50,922 INFO L269 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: true [2020-11-07 00:47:50,923 INFO L262 CegarLoopResult]: At program point L105(line 105) the Hoare annotation is: (let ((.cse0 (= main_~p6~0 0)) (.cse4 (= main_~lk7~0 1)) (.cse1 (= main_~p7~0 0)) (.cse3 (= main_~lk6~0 1)) (.cse2 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse2 .cse4) (and .cse0 .cse2 .cse4) (and .cse1 .cse3 .cse2))) [2020-11-07 00:47:50,923 INFO L269 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: true [2020-11-07 00:47:50,923 INFO L262 CegarLoopResult]: At program point L122(line 122) the Hoare annotation is: false [2020-11-07 00:47:50,923 INFO L262 CegarLoopResult]: At program point L89(line 89) the Hoare annotation is: (let ((.cse8 (= main_~lk4~0 1)) (.cse1 (= main_~p3~0 0)) (.cse0 (= main_~p6~0 0)) (.cse3 (= main_~p7~0 0)) (.cse5 (= main_~lk5~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse9 (= main_~p5~0 0)) (.cse2 (= main_~lk2~0 1)) (.cse7 (= main_~lk6~0 1)) (.cse4 (= main_~p4~0 0)) (.cse10 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse3 .cse7) (and .cse8 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse6 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse2 .cse5 .cse10) (and .cse8 .cse6 .cse2 .cse3 .cse7 .cse5) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse7 .cse10) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse1 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse8 .cse6 .cse0 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4) (and .cse6 .cse0 .cse9 .cse2 .cse4 .cse10) (and .cse8 .cse1 .cse9 .cse2 .cse3 .cse7) (and .cse8 .cse1 .cse9 .cse2 .cse7 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse3) (and .cse6 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse8 .cse6 .cse0 .cse2 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse10) (and .cse1 .cse9 .cse2 .cse7 .cse4 .cse10) (and .cse6 .cse0 .cse2 .cse4 .cse5 .cse10) (and .cse6 .cse0 .cse9 .cse2 .cse3 .cse4) (and .cse8 .cse1 .cse2 .cse7 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse3) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10) (and .cse8 .cse6 .cse2 .cse7 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse10) (and .cse1 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse6 .cse0 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse9 .cse2 .cse7 .cse4 .cse10))) [2020-11-07 00:47:50,923 INFO L269 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: true [2020-11-07 00:47:50,924 INFO L269 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: true [2020-11-07 00:47:50,924 INFO L269 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: true [2020-11-07 00:47:50,924 INFO L262 CegarLoopResult]: At program point L114(line 114) the Hoare annotation is: (= main_~lk7~0 1) [2020-11-07 00:47:50,924 INFO L262 CegarLoopResult]: At program point L114-1(lines 7 123) the Hoare annotation is: false [2020-11-07 00:47:50,924 INFO L269 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-11-07 00:47:50,925 INFO L262 CegarLoopResult]: At program point L73-1(lines 32 118) 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-11-07 00:47:50,925 INFO L262 CegarLoopResult]: At program point L98-1(lines 32 118) the Hoare annotation is: (let ((.cse2 (= main_~lk5~0 1)) (.cse0 (= main_~p6~0 0)) (.cse5 (= main_~lk7~0 1)) (.cse3 (= main_~p5~0 0)) (.cse1 (= main_~p7~0 0)) (.cse4 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse1) (and .cse3 .cse4 .cse5) (and .cse4 .cse2 .cse5) (and .cse0 .cse2 .cse5) (and .cse1 .cse4 .cse2) (and .cse0 .cse3 .cse5) (and .cse3 .cse1 .cse4))) [2020-11-07 00:47:50,925 INFO L262 CegarLoopResult]: At program point L65-1(lines 32 118) 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-11-07 00:47:50,926 INFO L262 CegarLoopResult]: At program point L90(line 90) the Hoare annotation is: (let ((.cse8 (= main_~lk4~0 1)) (.cse1 (= main_~p3~0 0)) (.cse0 (= main_~p6~0 0)) (.cse3 (= main_~p7~0 0)) (.cse5 (= main_~lk5~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse9 (= main_~p5~0 0)) (.cse2 (= main_~lk2~0 1)) (.cse7 (= main_~lk6~0 1)) (.cse4 (= main_~p4~0 0)) (.cse10 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse3 .cse7) (and .cse8 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse6 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse2 .cse5 .cse10) (and .cse8 .cse6 .cse2 .cse3 .cse7 .cse5) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse7 .cse10) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse1 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse8 .cse6 .cse0 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4) (and .cse6 .cse0 .cse9 .cse2 .cse4 .cse10) (and .cse8 .cse1 .cse9 .cse2 .cse3 .cse7) (and .cse8 .cse1 .cse9 .cse2 .cse7 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse3) (and .cse6 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse8 .cse6 .cse0 .cse2 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse10) (and .cse1 .cse9 .cse2 .cse7 .cse4 .cse10) (and .cse6 .cse0 .cse2 .cse4 .cse5 .cse10) (and .cse6 .cse0 .cse9 .cse2 .cse3 .cse4) (and .cse8 .cse1 .cse2 .cse7 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse3) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10) (and .cse8 .cse6 .cse2 .cse7 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse10) (and .cse1 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse6 .cse0 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse9 .cse2 .cse7 .cse4 .cse10))) [2020-11-07 00:47:50,926 INFO L269 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-11-07 00:47:50,926 INFO L262 CegarLoopResult]: At program point L57-1(lines 32 118) 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-11-07 00:47:50,926 INFO L262 CegarLoopResult]: At program point L115(line 115) the Hoare annotation is: (= main_~lk7~0 1) [2020-11-07 00:47:50,926 INFO L269 CegarLoopResult]: At program point L49(line 49) the Hoare annotation is: true [2020-11-07 00:47:50,927 INFO L262 CegarLoopResult]: At program point L74(line 74) 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-11-07 00:47:50,927 INFO L269 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: true [2020-11-07 00:47:50,927 INFO L269 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: true [2020-11-07 00:47:50,927 INFO L269 CegarLoopResult]: At program point L8-1(line 8) the Hoare annotation is: true [2020-11-07 00:47:50,927 INFO L262 CegarLoopResult]: At program point L99(line 99) the Hoare annotation is: (let ((.cse2 (= main_~p5~0 0)) (.cse3 (= main_~p7~0 0)) (.cse1 (= main_~p6~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse4 (= main_~lk6~0 1)) (.cse5 (= main_~lk5~0 1)) (.cse6 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse6) (and .cse0 .cse2 .cse4 .cse6) (and .cse0 .cse1 .cse3 .cse5) (and .cse0 .cse1 .cse5 .cse6) (and .cse0 .cse4 .cse5 .cse6))) [2020-11-07 00:47:50,927 INFO L262 CegarLoopResult]: At program point L66(line 66) 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-11-07 00:47:50,928 INFO L269 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-11-07 00:47:50,928 INFO L269 CegarLoopResult]: At program point L33-1(line 33) the Hoare annotation is: true [2020-11-07 00:47:50,928 INFO L269 CegarLoopResult]: At program point L33-2(line 33) the Hoare annotation is: true [2020-11-07 00:47:50,928 INFO L262 CegarLoopResult]: At program point L58(line 58) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-11-07 00:47:50,929 INFO L262 CegarLoopResult]: At program point L83-1(lines 32 118) the Hoare annotation is: (let ((.cse5 (= main_~lk5~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse1 (= main_~p3~0 0)) (.cse0 (= main_~p6~0 0)) (.cse3 (= main_~p7~0 0)) (.cse11 (= main_~p2~0 0)) (.cse6 (= main_~lk3~0 1)) (.cse9 (= main_~p5~0 0)) (.cse2 (= main_~lk2~0 1)) (.cse7 (= main_~lk6~0 1)) (.cse4 (= main_~p4~0 0)) (.cse10 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse3 .cse7) (and .cse8 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse7 .cse10) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse1 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse0 .cse1 .cse4 .cse5 .cse11 .cse10) (and .cse1 .cse7 .cse4 .cse5 .cse11 .cse10) (and .cse8 .cse1 .cse9 .cse3 .cse7 .cse11) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse3) (and .cse8 .cse6 .cse0 .cse3 .cse5 .cse11) (and .cse6 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse8 .cse6 .cse0 .cse2 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse11 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse11 .cse10) (and .cse1 .cse3 .cse7 .cse4 .cse5 .cse11) (and .cse6 .cse0 .cse2 .cse4 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse5 .cse11 .cse10) (and .cse8 .cse0 .cse1 .cse3 .cse5 .cse11) (and .cse8 .cse6 .cse3 .cse7 .cse5 .cse11) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10) (and .cse8 .cse6 .cse2 .cse7 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse10) (and .cse8 .cse6 .cse7 .cse5 .cse11 .cse10) (and .cse1 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse1 .cse9 .cse3 .cse7 .cse4 .cse11) (and .cse8 .cse0 .cse1 .cse5 .cse11 .cse10) (and .cse6 .cse0 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse3 .cse4 .cse5 .cse11) (and .cse6 .cse9 .cse3 .cse7 .cse4 .cse11) (and .cse6 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse2 .cse5 .cse10) (and .cse6 .cse9 .cse7 .cse4 .cse11 .cse10) (and .cse8 .cse6 .cse2 .cse3 .cse7 .cse5) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse11) (and .cse8 .cse6 .cse9 .cse3 .cse7 .cse11) (and .cse8 .cse6 .cse0 .cse2 .cse3 .cse5) (and .cse8 .cse1 .cse3 .cse7 .cse5 .cse11) (and .cse8 .cse6 .cse9 .cse7 .cse11 .cse10) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4) (and .cse6 .cse0 .cse9 .cse2 .cse4 .cse10) (and .cse8 .cse1 .cse9 .cse2 .cse3 .cse7) (and .cse8 .cse1 .cse9 .cse2 .cse7 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse3 .cse11) (and .cse0 .cse1 .cse9 .cse4 .cse11 .cse10) (and .cse6 .cse0 .cse4 .cse5 .cse11 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse3 .cse11) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse10) (and .cse6 .cse3 .cse7 .cse4 .cse5 .cse11) (and .cse6 .cse0 .cse9 .cse4 .cse11 .cse10) (and .cse1 .cse9 .cse2 .cse7 .cse4 .cse10) (and .cse1 .cse9 .cse7 .cse4 .cse11 .cse10) (and .cse6 .cse7 .cse4 .cse5 .cse11 .cse10) (and .cse6 .cse0 .cse9 .cse2 .cse3 .cse4) (and .cse8 .cse1 .cse2 .cse7 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse3) (and .cse8 .cse1 .cse7 .cse5 .cse11 .cse10) (and .cse8 .cse1 .cse9 .cse7 .cse11 .cse10) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse11) (and .cse6 .cse0 .cse9 .cse3 .cse4 .cse11) (and .cse6 .cse9 .cse2 .cse7 .cse4 .cse10))) [2020-11-07 00:47:50,929 INFO L269 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-11-07 00:47:50,929 INFO L269 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-11-07 00:47:50,929 INFO L269 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: true [2020-11-07 00:47:50,929 INFO L262 CegarLoopResult]: At program point L108-1(lines 32 118) the Hoare annotation is: (or (= main_~p7~0 0) (= main_~lk7~0 1)) [2020-11-07 00:47:50,929 INFO L269 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-11-07 00:47:50,929 INFO L262 CegarLoopResult]: At program point L100(line 100) the Hoare annotation is: (let ((.cse2 (= main_~p5~0 0)) (.cse3 (= main_~p7~0 0)) (.cse1 (= main_~p6~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse4 (= main_~lk6~0 1)) (.cse5 (= main_~lk5~0 1)) (.cse6 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse6) (and .cse0 .cse2 .cse4 .cse6) (and .cse0 .cse1 .cse3 .cse5) (and .cse0 .cse1 .cse5 .cse6) (and .cse0 .cse4 .cse5 .cse6))) [2020-11-07 00:47:50,930 INFO L269 CegarLoopResult]: At program point L34(lines 34 36) the Hoare annotation is: true [2020-11-07 00:47:50,930 INFO L269 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: true [2020-11-07 00:47:50,930 INFO L269 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: true [2020-11-07 00:47:50,930 INFO L269 CegarLoopResult]: At program point L26-2(line 26) the Hoare annotation is: true [2020-11-07 00:47:50,931 INFO L262 CegarLoopResult]: At program point L84(line 84) the Hoare annotation is: (let ((.cse9 (= main_~lk4~0 1)) (.cse12 (= main_~p2~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse8 (= main_~lk6~0 1)) (.cse11 (= main_~lk5~0 1)) (.cse6 (= main_~lk7~0 1)) (.cse1 (= main_~p6~0 0)) (.cse10 (= main_~p3~0 0)) (.cse2 (= main_~p5~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse7 (= main_~p7~0 0)) (.cse4 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse7 .cse8 .cse4 .cse5) (and .cse9 .cse1 .cse10 .cse3 .cse11 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse2 .cse7 .cse12 .cse5) (and .cse10 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse1 .cse10 .cse3 .cse4 .cse11 .cse5 .cse6) (and .cse9 .cse0 .cse2 .cse3 .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse1 .cse10 .cse2 .cse4 .cse12 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse3 .cse7 .cse11 .cse5) (and .cse10 .cse3 .cse7 .cse8 .cse4 .cse11 .cse5) (and .cse1 .cse10 .cse2 .cse7 .cse4 .cse12 .cse5) (and .cse9 .cse1 .cse10 .cse2 .cse3 .cse5 .cse6) (and .cse10 .cse7 .cse8 .cse4 .cse11 .cse12 .cse5) (and .cse9 .cse0 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse2 .cse12 .cse5 .cse6) (and .cse9 .cse10 .cse3 .cse7 .cse8 .cse11 .cse5) (and .cse9 .cse10 .cse3 .cse8 .cse11 .cse5 .cse6) (and .cse9 .cse0 .cse2 .cse7 .cse8 .cse12 .cse5) (and .cse9 .cse0 .cse1 .cse7 .cse11 .cse12 .cse5) (and .cse9 .cse1 .cse10 .cse7 .cse11 .cse12 .cse5) (and .cse10 .cse3 .cse8 .cse4 .cse11 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse4 .cse11 .cse12 .cse5) (and .cse9 .cse10 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse8 .cse12 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse3 .cse7 .cse8 .cse5) (and .cse9 .cse0 .cse3 .cse8 .cse11 .cse5 .cse6) (and .cse0 .cse3 .cse7 .cse8 .cse4 .cse11 .cse5) (and .cse0 .cse1 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse1 .cse10 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse2 .cse12 .cse5 .cse6) (and .cse9 .cse0 .cse8 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse9 .cse0 .cse1 .cse11 .cse12 .cse5 .cse6) (and .cse10 .cse2 .cse8 .cse4 .cse12 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse7 .cse8 .cse12 .cse5) (and .cse0 .cse1 .cse7 .cse4 .cse11 .cse12 .cse5) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse9 .cse10 .cse7 .cse8 .cse11 .cse12 .cse5) (and .cse9 .cse0 .cse1 .cse2 .cse7 .cse12 .cse5) (and .cse10 .cse2 .cse3 .cse7 .cse8 .cse4 .cse5) (and .cse10 .cse8 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse8 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse11 .cse5 .cse6) (and .cse1 .cse10 .cse3 .cse7 .cse4 .cse11 .cse5) (and .cse0 .cse2 .cse8 .cse4 .cse12 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse11 .cse12 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse2 .cse3 .cse7 .cse5) (and .cse0 .cse1 .cse2 .cse7 .cse4 .cse12 .cse5) (and .cse9 .cse0 .cse3 .cse7 .cse8 .cse11 .cse5) (and .cse0 .cse1 .cse3 .cse7 .cse4 .cse11 .cse5) (and .cse9 .cse0 .cse1 .cse3 .cse11 .cse5 .cse6) (and .cse10 .cse2 .cse7 .cse8 .cse4 .cse12 .cse5) (and .cse9 .cse0 .cse2 .cse8 .cse12 .cse5 .cse6) (and .cse1 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse0 .cse7 .cse8 .cse11 .cse12 .cse5) (and .cse0 .cse2 .cse7 .cse8 .cse4 .cse12 .cse5) (and .cse9 .cse10 .cse8 .cse11 .cse12 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse3 .cse7 .cse11 .cse5) (and .cse1 .cse10 .cse7 .cse4 .cse11 .cse12 .cse5) (and .cse0 .cse3 .cse8 .cse4 .cse11 .cse5 .cse6) (and .cse1 .cse10 .cse2 .cse3 .cse7 .cse4 .cse5))) [2020-11-07 00:47:50,931 INFO L269 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-11-07 00:47:50,931 INFO L262 CegarLoopResult]: At program point L109(line 109) the Hoare annotation is: (let ((.cse0 (= main_~lk6~0 1))) (or (and .cse0 (= main_~lk7~0 1)) (and (= main_~p7~0 0) .cse0))) [2020-11-07 00:47:50,931 INFO L269 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: true [2020-11-07 00:47:50,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:47:50 BoogieIcfgContainer [2020-11-07 00:47:50,945 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 00:47:50,946 INFO L168 Benchmark]: Toolchain (without parser) took 52580.18 ms. Allocated memory was 163.6 MB in the beginning and 1.0 GB in the end (delta: 883.9 MB). Free memory was 139.3 MB in the beginning and 852.3 MB in the end (delta: -713.0 MB). Peak memory consumption was 659.5 MB. Max. memory is 8.0 GB. [2020-11-07 00:47:50,947 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 163.6 MB. Free memory was 136.7 MB in the beginning and 136.6 MB in the end (delta: 102.3 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 00:47:50,948 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.87 ms. Allocated memory is still 163.6 MB. Free memory was 138.5 MB in the beginning and 128.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2020-11-07 00:47:50,948 INFO L168 Benchmark]: Boogie Preprocessor took 40.61 ms. Allocated memory is still 163.6 MB. Free memory was 128.4 MB in the beginning and 126.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 00:47:50,949 INFO L168 Benchmark]: RCFGBuilder took 547.39 ms. Allocated memory is still 163.6 MB. Free memory was 126.6 MB in the beginning and 139.1 MB in the end (delta: -12.5 MB). Peak memory consumption was 19.0 MB. Max. memory is 8.0 GB. [2020-11-07 00:47:50,949 INFO L168 Benchmark]: TraceAbstraction took 51654.27 ms. Allocated memory was 163.6 MB in the beginning and 1.0 GB in the end (delta: 883.9 MB). Free memory was 138.5 MB in the beginning and 852.3 MB in the end (delta: -713.7 MB). Peak memory consumption was 658.3 MB. Max. memory is 8.0 GB. [2020-11-07 00:47:50,952 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.18 ms. Allocated memory is still 163.6 MB. Free memory was 136.7 MB in the beginning and 136.6 MB in the end (delta: 102.3 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 318.87 ms. Allocated memory is still 163.6 MB. Free memory was 138.5 MB in the beginning and 128.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 40.61 ms. Allocated memory is still 163.6 MB. Free memory was 128.4 MB in the beginning and 126.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 547.39 ms. Allocated memory is still 163.6 MB. Free memory was 126.6 MB in the beginning and 139.1 MB in the end (delta: -12.5 MB). Peak memory consumption was 19.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 51654.27 ms. Allocated memory was 163.6 MB in the beginning and 1.0 GB in the end (delta: 883.9 MB). Free memory was 138.5 MB in the beginning and 852.3 MB in the end (delta: -713.7 MB). Peak memory consumption was 658.3 MB. 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: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 32]: 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, 100 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 10.8s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 40.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1939 SDtfs, 2220 SDslu, 237 SDs, 0 SdLazy, 1392 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2476occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 1048 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 100 LocationsWithAnnotation, 152 PreInvPairs, 4832 NumberOfFragments, 13960 HoareAnnotationTreeSize, 152 FomulaSimplifications, 1343345 FormulaSimplificationTreeSizeReduction, 7.9s HoareSimplificationTime, 100 FomulaSimplificationsInter, 24188 FormulaSimplificationTreeSizeReductionInter, 32.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...