/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-b8ad66e [2020-10-23 20:31:25,237 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-23 20:31:25,242 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-23 20:31:25,299 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-23 20:31:25,299 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-23 20:31:25,304 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-23 20:31:25,308 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-23 20:31:25,316 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-23 20:31:25,319 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-23 20:31:25,327 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-23 20:31:25,328 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-23 20:31:25,329 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-23 20:31:25,329 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-23 20:31:25,332 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-23 20:31:25,334 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-23 20:31:25,336 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-23 20:31:25,337 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-23 20:31:25,341 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-23 20:31:25,348 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-23 20:31:25,351 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-23 20:31:25,352 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-23 20:31:25,357 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-23 20:31:25,358 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-23 20:31:25,360 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-23 20:31:25,365 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-23 20:31:25,366 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-23 20:31:25,366 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-23 20:31:25,368 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-23 20:31:25,369 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-23 20:31:25,370 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-23 20:31:25,371 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-23 20:31:25,371 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-23 20:31:25,373 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-23 20:31:25,374 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-23 20:31:25,375 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-23 20:31:25,375 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-23 20:31:25,376 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-23 20:31:25,376 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-23 20:31:25,376 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-23 20:31:25,377 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-23 20:31:25,378 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-23 20:31:25,379 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-23 20:31:25,397 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-23 20:31:25,397 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-23 20:31:25,406 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-23 20:31:25,406 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-23 20:31:25,406 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-23 20:31:25,407 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-23 20:31:25,407 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-23 20:31:25,407 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-23 20:31:25,407 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-23 20:31:25,407 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-23 20:31:25,408 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-23 20:31:25,408 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-23 20:31:25,408 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-23 20:31:25,408 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-23 20:31:25,408 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-23 20:31:25,409 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-23 20:31:25,409 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-23 20:31:25,409 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-23 20:31:25,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-23 20:31:25,409 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-23 20:31:25,410 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-23 20:31:25,410 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-23 20:31:25,410 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-10-23 20:31:25,780 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-23 20:31:25,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-23 20:31:25,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-23 20:31:25,811 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-23 20:31:25,812 INFO L275 PluginConnector]: CDTParser initialized [2020-10-23 20:31:25,813 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-10-23 20:31:25,883 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07c566a6d/c2c5d5743cea49bebb06bdc82730c107/FLAGb7e8e8418 [2020-10-23 20:31:26,523 INFO L306 CDTParser]: Found 1 translation units. [2020-10-23 20:31:26,523 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2020-10-23 20:31:26,533 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07c566a6d/c2c5d5743cea49bebb06bdc82730c107/FLAGb7e8e8418 [2020-10-23 20:31:26,858 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07c566a6d/c2c5d5743cea49bebb06bdc82730c107 [2020-10-23 20:31:26,861 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-23 20:31:26,873 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-23 20:31:26,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-23 20:31:26,876 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-23 20:31:26,880 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-23 20:31:26,881 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:31:26" (1/1) ... [2020-10-23 20:31:26,884 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@545e12b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:26, skipping insertion in model container [2020-10-23 20:31:26,885 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:31:26" (1/1) ... [2020-10-23 20:31:26,894 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-23 20:31:26,921 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-23 20:31:27,124 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 20:31:27,133 INFO L203 MainTranslator]: Completed pre-run [2020-10-23 20:31:27,159 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 20:31:27,174 INFO L208 MainTranslator]: Completed translation [2020-10-23 20:31:27,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:27 WrapperNode [2020-10-23 20:31:27,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-23 20:31:27,176 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-23 20:31:27,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-23 20:31:27,177 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-23 20:31:27,193 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:27" (1/1) ... [2020-10-23 20:31:27,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:27" (1/1) ... [2020-10-23 20:31:27,202 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:27" (1/1) ... [2020-10-23 20:31:27,203 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:27" (1/1) ... [2020-10-23 20:31:27,225 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:27" (1/1) ... [2020-10-23 20:31:27,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:27" (1/1) ... [2020-10-23 20:31:27,241 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:27" (1/1) ... [2020-10-23 20:31:27,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-23 20:31:27,252 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-23 20:31:27,253 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-23 20:31:27,253 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-23 20:31:27,254 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-23 20:31:27,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-23 20:31:27,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-23 20:31:27,336 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-23 20:31:27,337 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-23 20:31:27,337 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-23 20:31:27,337 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-23 20:31:27,337 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-23 20:31:27,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-23 20:31:27,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-23 20:31:27,338 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-23 20:31:27,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-23 20:31:27,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-23 20:31:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-23 20:31:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-23 20:31:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-23 20:31:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-23 20:31:28,043 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-23 20:31:28,044 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-23 20:31:28,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:31:28 BoogieIcfgContainer [2020-10-23 20:31:28,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-23 20:31:28,048 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-23 20:31:28,048 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-23 20:31:28,051 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-23 20:31:28,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 08:31:26" (1/3) ... [2020-10-23 20:31:28,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70709dc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:31:28, skipping insertion in model container [2020-10-23 20:31:28,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:31:27" (2/3) ... [2020-10-23 20:31:28,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70709dc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:31:28, skipping insertion in model container [2020-10-23 20:31:28,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:31:28" (3/3) ... [2020-10-23 20:31:28,055 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2020-10-23 20:31:28,066 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-23 20:31:28,071 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-23 20:31:28,082 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-23 20:31:28,106 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-23 20:31:28,106 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-23 20:31:28,106 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-10-23 20:31:28,106 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-23 20:31:28,107 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-23 20:31:28,107 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-23 20:31:28,107 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-23 20:31:28,107 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-23 20:31:28,124 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states. [2020-10-23 20:31:28,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-10-23 20:31:28,135 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:28,136 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-10-23 20:31:28,136 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:28,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:28,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1602311135, now seen corresponding path program 1 times [2020-10-23 20:31:28,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:28,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1835416586] [2020-10-23 20:31:28,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:28,226 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:28,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:28,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:28,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1835416586] [2020-10-23 20:31:28,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:28,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:28,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623524962] [2020-10-23 20:31:28,555 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:28,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:28,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:28,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:28,574 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 4 states. [2020-10-23 20:31:29,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:29,194 INFO L93 Difference]: Finished difference Result 203 states and 274 transitions. [2020-10-23 20:31:29,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:29,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2020-10-23 20:31:29,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:29,210 INFO L225 Difference]: With dead ends: 203 [2020-10-23 20:31:29,210 INFO L226 Difference]: Without dead ends: 136 [2020-10-23 20:31:29,214 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-23 20:31:29,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-10-23 20:31:29,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2020-10-23 20:31:29,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-10-23 20:31:29,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 173 transitions. [2020-10-23 20:31:29,292 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 173 transitions. Word has length 64 [2020-10-23 20:31:29,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:29,293 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 173 transitions. [2020-10-23 20:31:29,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:29,293 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 173 transitions. [2020-10-23 20:31:29,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-10-23 20:31:29,295 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:29,296 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-10-23 20:31:29,296 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-23 20:31:29,296 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:29,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:29,297 INFO L82 PathProgramCache]: Analyzing trace with hash 179683855, now seen corresponding path program 1 times [2020-10-23 20:31:29,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:29,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [583548266] [2020-10-23 20:31:29,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:29,301 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:29,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:29,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:29,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:29,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [583548266] [2020-10-23 20:31:29,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:29,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:29,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215805416] [2020-10-23 20:31:29,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:29,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:29,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:29,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:29,421 INFO L87 Difference]: Start difference. First operand 135 states and 173 transitions. Second operand 4 states. [2020-10-23 20:31:29,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:29,741 INFO L93 Difference]: Finished difference Result 163 states and 212 transitions. [2020-10-23 20:31:29,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:29,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2020-10-23 20:31:29,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:29,745 INFO L225 Difference]: With dead ends: 163 [2020-10-23 20:31:29,745 INFO L226 Difference]: Without dead ends: 160 [2020-10-23 20:31:29,746 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-23 20:31:29,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-10-23 20:31:29,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 135. [2020-10-23 20:31:29,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-10-23 20:31:29,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 172 transitions. [2020-10-23 20:31:29,778 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 172 transitions. Word has length 65 [2020-10-23 20:31:29,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:29,779 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 172 transitions. [2020-10-23 20:31:29,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:29,780 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 172 transitions. [2020-10-23 20:31:29,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-10-23 20:31:29,782 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:29,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] [2020-10-23 20:31:29,782 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-23 20:31:29,782 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:29,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:29,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1875549338, now seen corresponding path program 1 times [2020-10-23 20:31:29,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:29,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [389002467] [2020-10-23 20:31:29,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:29,787 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:29,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:29,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:29,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:29,981 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [389002467] [2020-10-23 20:31:29,981 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:29,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:29,982 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123602490] [2020-10-23 20:31:29,982 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:29,982 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:29,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:29,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:29,983 INFO L87 Difference]: Start difference. First operand 135 states and 172 transitions. Second operand 4 states. [2020-10-23 20:31:30,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:30,283 INFO L93 Difference]: Finished difference Result 315 states and 425 transitions. [2020-10-23 20:31:30,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:30,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2020-10-23 20:31:30,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:30,287 INFO L225 Difference]: With dead ends: 315 [2020-10-23 20:31:30,287 INFO L226 Difference]: Without dead ends: 221 [2020-10-23 20:31:30,289 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-23 20:31:30,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2020-10-23 20:31:30,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2020-10-23 20:31:30,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-10-23 20:31:30,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 289 transitions. [2020-10-23 20:31:30,356 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 289 transitions. Word has length 65 [2020-10-23 20:31:30,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:30,357 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 289 transitions. [2020-10-23 20:31:30,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:30,358 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 289 transitions. [2020-10-23 20:31:30,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-10-23 20:31:30,365 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:30,365 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-10-23 20:31:30,365 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-23 20:31:30,366 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:30,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:30,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1979914163, now seen corresponding path program 1 times [2020-10-23 20:31:30,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:30,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1975908666] [2020-10-23 20:31:30,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:30,376 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:30,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:30,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:30,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1975908666] [2020-10-23 20:31:30,514 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:30,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:30,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90398665] [2020-10-23 20:31:30,515 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:30,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:30,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:30,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:30,517 INFO L87 Difference]: Start difference. First operand 220 states and 289 transitions. Second operand 4 states. [2020-10-23 20:31:30,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:30,836 INFO L93 Difference]: Finished difference Result 564 states and 768 transitions. [2020-10-23 20:31:30,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:30,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2020-10-23 20:31:30,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:30,840 INFO L225 Difference]: With dead ends: 564 [2020-10-23 20:31:30,840 INFO L226 Difference]: Without dead ends: 385 [2020-10-23 20:31:30,842 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-23 20:31:30,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2020-10-23 20:31:30,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 384. [2020-10-23 20:31:30,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-10-23 20:31:30,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 511 transitions. [2020-10-23 20:31:30,917 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 511 transitions. Word has length 66 [2020-10-23 20:31:30,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:30,918 INFO L481 AbstractCegarLoop]: Abstraction has 384 states and 511 transitions. [2020-10-23 20:31:30,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:30,918 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 511 transitions. [2020-10-23 20:31:30,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-10-23 20:31:30,919 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:30,920 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-10-23 20:31:30,920 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-23 20:31:30,920 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:30,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:30,921 INFO L82 PathProgramCache]: Analyzing trace with hash 476041895, now seen corresponding path program 1 times [2020-10-23 20:31:30,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:30,921 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [758556297] [2020-10-23 20:31:30,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:30,924 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:31,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:31,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:31,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:31,090 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [758556297] [2020-10-23 20:31:31,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:31,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:31,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955505010] [2020-10-23 20:31:31,091 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:31,092 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:31,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:31,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:31,093 INFO L87 Difference]: Start difference. First operand 384 states and 511 transitions. Second operand 4 states. [2020-10-23 20:31:31,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:31,432 INFO L93 Difference]: Finished difference Result 472 states and 634 transitions. [2020-10-23 20:31:31,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:31,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2020-10-23 20:31:31,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:31,436 INFO L225 Difference]: With dead ends: 472 [2020-10-23 20:31:31,436 INFO L226 Difference]: Without dead ends: 469 [2020-10-23 20:31:31,438 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-23 20:31:31,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2020-10-23 20:31:31,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 384. [2020-10-23 20:31:31,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-10-23 20:31:31,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 507 transitions. [2020-10-23 20:31:31,513 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 507 transitions. Word has length 66 [2020-10-23 20:31:31,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:31,515 INFO L481 AbstractCegarLoop]: Abstraction has 384 states and 507 transitions. [2020-10-23 20:31:31,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:31,515 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 507 transitions. [2020-10-23 20:31:31,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-10-23 20:31:31,517 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:31,518 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-10-23 20:31:31,519 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-23 20:31:31,519 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:31,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:31,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1073218075, now seen corresponding path program 1 times [2020-10-23 20:31:31,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:31,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1119005265] [2020-10-23 20:31:31,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:31,523 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:31,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:31,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:31,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1119005265] [2020-10-23 20:31:31,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:31,669 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:31,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854281808] [2020-10-23 20:31:31,669 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:31,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:31,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:31,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:31,671 INFO L87 Difference]: Start difference. First operand 384 states and 507 transitions. Second operand 4 states. [2020-10-23 20:31:31,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:31,980 INFO L93 Difference]: Finished difference Result 468 states and 622 transitions. [2020-10-23 20:31:31,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:31,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2020-10-23 20:31:31,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:31,989 INFO L225 Difference]: With dead ends: 468 [2020-10-23 20:31:31,989 INFO L226 Difference]: Without dead ends: 465 [2020-10-23 20:31:31,990 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-23 20:31:31,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2020-10-23 20:31:32,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 384. [2020-10-23 20:31:32,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-10-23 20:31:32,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 503 transitions. [2020-10-23 20:31:32,060 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 503 transitions. Word has length 67 [2020-10-23 20:31:32,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:32,060 INFO L481 AbstractCegarLoop]: Abstraction has 384 states and 503 transitions. [2020-10-23 20:31:32,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:32,061 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 503 transitions. [2020-10-23 20:31:32,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-10-23 20:31:32,062 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:32,062 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-10-23 20:31:32,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-23 20:31:32,062 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:32,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:32,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1240186874, now seen corresponding path program 1 times [2020-10-23 20:31:32,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:32,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [942118516] [2020-10-23 20:31:32,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:32,067 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:32,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:32,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:32,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [942118516] [2020-10-23 20:31:32,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:32,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:32,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432203501] [2020-10-23 20:31:32,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:32,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:32,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:32,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:32,136 INFO L87 Difference]: Start difference. First operand 384 states and 503 transitions. Second operand 4 states. [2020-10-23 20:31:32,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:32,489 INFO L93 Difference]: Finished difference Result 1044 states and 1394 transitions. [2020-10-23 20:31:32,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:32,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2020-10-23 20:31:32,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:32,494 INFO L225 Difference]: With dead ends: 1044 [2020-10-23 20:31:32,494 INFO L226 Difference]: Without dead ends: 701 [2020-10-23 20:31:32,496 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-23 20:31:32,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2020-10-23 20:31:32,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 700. [2020-10-23 20:31:32,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2020-10-23 20:31:32,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 915 transitions. [2020-10-23 20:31:32,602 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 915 transitions. Word has length 67 [2020-10-23 20:31:32,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:32,602 INFO L481 AbstractCegarLoop]: Abstraction has 700 states and 915 transitions. [2020-10-23 20:31:32,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:32,603 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 915 transitions. [2020-10-23 20:31:32,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-10-23 20:31:32,604 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:32,604 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-10-23 20:31:32,604 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-23 20:31:32,604 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:32,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:32,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1889145293, now seen corresponding path program 1 times [2020-10-23 20:31:32,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:32,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [70235232] [2020-10-23 20:31:32,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:32,608 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:32,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:32,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:32,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [70235232] [2020-10-23 20:31:32,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:32,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:32,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21619271] [2020-10-23 20:31:32,703 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:32,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:32,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:32,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:32,704 INFO L87 Difference]: Start difference. First operand 700 states and 915 transitions. Second operand 4 states. [2020-10-23 20:31:33,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:33,069 INFO L93 Difference]: Finished difference Result 848 states and 1110 transitions. [2020-10-23 20:31:33,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:33,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2020-10-23 20:31:33,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:33,074 INFO L225 Difference]: With dead ends: 848 [2020-10-23 20:31:33,074 INFO L226 Difference]: Without dead ends: 845 [2020-10-23 20:31:33,075 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-23 20:31:33,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2020-10-23 20:31:33,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 700. [2020-10-23 20:31:33,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2020-10-23 20:31:33,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 907 transitions. [2020-10-23 20:31:33,195 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 907 transitions. Word has length 68 [2020-10-23 20:31:33,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:33,195 INFO L481 AbstractCegarLoop]: Abstraction has 700 states and 907 transitions. [2020-10-23 20:31:33,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:33,196 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 907 transitions. [2020-10-23 20:31:33,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-10-23 20:31:33,197 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:33,197 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-10-23 20:31:33,197 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-23 20:31:33,198 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:33,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:33,198 INFO L82 PathProgramCache]: Analyzing trace with hash 216534137, now seen corresponding path program 1 times [2020-10-23 20:31:33,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:33,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1691121533] [2020-10-23 20:31:33,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:33,201 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:33,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:33,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:33,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:33,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1691121533] [2020-10-23 20:31:33,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:33,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:33,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590916817] [2020-10-23 20:31:33,257 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:33,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:33,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:33,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:33,258 INFO L87 Difference]: Start difference. First operand 700 states and 907 transitions. Second operand 4 states. [2020-10-23 20:31:33,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:33,735 INFO L93 Difference]: Finished difference Result 1968 states and 2574 transitions. [2020-10-23 20:31:33,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:33,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2020-10-23 20:31:33,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:33,742 INFO L225 Difference]: With dead ends: 1968 [2020-10-23 20:31:33,743 INFO L226 Difference]: Without dead ends: 1309 [2020-10-23 20:31:33,744 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-23 20:31:33,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2020-10-23 20:31:33,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1308. [2020-10-23 20:31:33,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1308 states. [2020-10-23 20:31:33,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 1675 transitions. [2020-10-23 20:31:33,910 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 1675 transitions. Word has length 68 [2020-10-23 20:31:33,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:33,910 INFO L481 AbstractCegarLoop]: Abstraction has 1308 states and 1675 transitions. [2020-10-23 20:31:33,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:33,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1675 transitions. [2020-10-23 20:31:33,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-10-23 20:31:33,912 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:33,913 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-10-23 20:31:33,913 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-23 20:31:33,913 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:33,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:33,914 INFO L82 PathProgramCache]: Analyzing trace with hash 766882343, now seen corresponding path program 1 times [2020-10-23 20:31:33,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:33,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1857064634] [2020-10-23 20:31:33,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:33,917 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:34,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:34,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:34,018 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1857064634] [2020-10-23 20:31:34,018 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:34,018 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:34,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412983613] [2020-10-23 20:31:34,018 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:34,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:34,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:34,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:34,020 INFO L87 Difference]: Start difference. First operand 1308 states and 1675 transitions. Second operand 4 states. [2020-10-23 20:31:34,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:34,470 INFO L93 Difference]: Finished difference Result 1568 states and 1998 transitions. [2020-10-23 20:31:34,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:34,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2020-10-23 20:31:34,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:34,478 INFO L225 Difference]: With dead ends: 1568 [2020-10-23 20:31:34,479 INFO L226 Difference]: Without dead ends: 1565 [2020-10-23 20:31:34,480 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-23 20:31:34,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2020-10-23 20:31:34,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1308. [2020-10-23 20:31:34,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1308 states. [2020-10-23 20:31:34,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 1659 transitions. [2020-10-23 20:31:34,677 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 1659 transitions. Word has length 69 [2020-10-23 20:31:34,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:34,677 INFO L481 AbstractCegarLoop]: Abstraction has 1308 states and 1659 transitions. [2020-10-23 20:31:34,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:34,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1659 transitions. [2020-10-23 20:31:34,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-10-23 20:31:34,683 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:34,684 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-10-23 20:31:34,684 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-23 20:31:34,684 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:34,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:34,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1869743246, now seen corresponding path program 1 times [2020-10-23 20:31:34,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:34,685 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [905178041] [2020-10-23 20:31:34,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:34,688 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:34,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:34,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:34,766 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [905178041] [2020-10-23 20:31:34,766 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:34,766 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:34,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276767296] [2020-10-23 20:31:34,767 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:34,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:34,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:34,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:34,768 INFO L87 Difference]: Start difference. First operand 1308 states and 1659 transitions. Second operand 4 states. [2020-10-23 20:31:35,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:35,434 INFO L93 Difference]: Finished difference Result 3744 states and 4766 transitions. [2020-10-23 20:31:35,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:35,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2020-10-23 20:31:35,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:35,447 INFO L225 Difference]: With dead ends: 3744 [2020-10-23 20:31:35,447 INFO L226 Difference]: Without dead ends: 2477 [2020-10-23 20:31:35,451 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-23 20:31:35,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2020-10-23 20:31:35,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 2476. [2020-10-23 20:31:35,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2476 states. [2020-10-23 20:31:35,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 3083 transitions. [2020-10-23 20:31:35,836 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 3083 transitions. Word has length 69 [2020-10-23 20:31:35,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:35,836 INFO L481 AbstractCegarLoop]: Abstraction has 2476 states and 3083 transitions. [2020-10-23 20:31:35,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:35,836 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 3083 transitions. [2020-10-23 20:31:35,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-10-23 20:31:35,839 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:35,839 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:31:35,840 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-23 20:31:35,840 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:35,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:35,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1499371967, now seen corresponding path program 1 times [2020-10-23 20:31:35,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:35,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [761109876] [2020-10-23 20:31:35,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:35,843 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:35,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:35,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:35,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:35,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:35,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [761109876] [2020-10-23 20:31:35,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:35,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:35,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786636803] [2020-10-23 20:31:35,921 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:35,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:35,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:35,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:35,923 INFO L87 Difference]: Start difference. First operand 2476 states and 3083 transitions. Second operand 4 states. [2020-10-23 20:31:36,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:36,638 INFO L93 Difference]: Finished difference Result 2928 states and 3598 transitions. [2020-10-23 20:31:36,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:36,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2020-10-23 20:31:36,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:36,672 INFO L225 Difference]: With dead ends: 2928 [2020-10-23 20:31:36,672 INFO L226 Difference]: Without dead ends: 2925 [2020-10-23 20:31:36,677 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-23 20:31:36,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2020-10-23 20:31:37,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 2476. [2020-10-23 20:31:37,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2476 states. [2020-10-23 20:31:37,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 3051 transitions. [2020-10-23 20:31:37,072 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 3051 transitions. Word has length 70 [2020-10-23 20:31:37,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:37,072 INFO L481 AbstractCegarLoop]: Abstraction has 2476 states and 3051 transitions. [2020-10-23 20:31:37,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:37,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 3051 transitions. [2020-10-23 20:31:37,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-10-23 20:31:37,074 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:37,075 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:31:37,075 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-23 20:31:37,075 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:37,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:37,075 INFO L82 PathProgramCache]: Analyzing trace with hash -2119821147, now seen corresponding path program 1 times [2020-10-23 20:31:37,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:37,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [619116433] [2020-10-23 20:31:37,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:37,077 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:37,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:37,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:37,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:37,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:37,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [619116433] [2020-10-23 20:31:37,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:37,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:37,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14665064] [2020-10-23 20:31:37,132 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:37,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:37,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:37,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:37,133 INFO L87 Difference]: Start difference. First operand 2476 states and 3051 transitions. Second operand 4 states. [2020-10-23 20:31:37,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:37,952 INFO L93 Difference]: Finished difference Result 7151 states and 8813 transitions. [2020-10-23 20:31:37,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:37,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2020-10-23 20:31:37,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:37,964 INFO L225 Difference]: With dead ends: 7151 [2020-10-23 20:31:37,964 INFO L226 Difference]: Without dead ends: 2476 [2020-10-23 20:31:37,974 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-23 20:31:37,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2476 states. [2020-10-23 20:31:38,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2476 to 2476. [2020-10-23 20:31:38,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2476 states. [2020-10-23 20:31:38,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 2923 transitions. [2020-10-23 20:31:38,397 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 2923 transitions. Word has length 70 [2020-10-23 20:31:38,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:38,397 INFO L481 AbstractCegarLoop]: Abstraction has 2476 states and 2923 transitions. [2020-10-23 20:31:38,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:38,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 2923 transitions. [2020-10-23 20:31:38,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-10-23 20:31:38,400 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:31:38,400 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:31:38,400 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-23 20:31:38,400 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:31:38,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:31:38,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1563241933, now seen corresponding path program 1 times [2020-10-23 20:31:38,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:31:38,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [340819100] [2020-10-23 20:31:38,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:31:38,412 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:31:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:38,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:31:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:31:38,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:31:38,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [340819100] [2020-10-23 20:31:38,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:31:38,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-23 20:31:38,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216242174] [2020-10-23 20:31:38,481 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-23 20:31:38,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:31:38,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-23 20:31:38,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-23 20:31:38,482 INFO L87 Difference]: Start difference. First operand 2476 states and 2923 transitions. Second operand 4 states. [2020-10-23 20:31:39,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:31:39,127 INFO L93 Difference]: Finished difference Result 2476 states and 2923 transitions. [2020-10-23 20:31:39,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-23 20:31:39,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2020-10-23 20:31:39,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:31:39,128 INFO L225 Difference]: With dead ends: 2476 [2020-10-23 20:31:39,128 INFO L226 Difference]: Without dead ends: 0 [2020-10-23 20:31:39,133 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-23 20:31:39,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-23 20:31:39,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-23 20:31:39,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-23 20:31:39,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-23 20:31:39,134 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 71 [2020-10-23 20:31:39,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:31:39,134 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-23 20:31:39,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-23 20:31:39,134 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-23 20:31:39,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-23 20:31:39,135 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-23 20:31:39,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-23 20:31:39,405 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 85 [2020-10-23 20:31:39,692 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 273 DAG size of output: 31 [2020-10-23 20:31:40,498 WARN L193 SmtUtils]: Spent 767.00 ms on a formula simplification. DAG size of input: 382 DAG size of output: 31 [2020-10-23 20:31:41,039 WARN L193 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 382 DAG size of output: 31 [2020-10-23 20:31:41,497 WARN L193 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 382 DAG size of output: 31 [2020-10-23 20:31:42,068 WARN L193 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 382 DAG size of output: 31 [2020-10-23 20:31:42,618 WARN L193 SmtUtils]: Spent 548.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2020-10-23 20:31:42,805 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 85 [2020-10-23 20:31:43,084 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 41 [2020-10-23 20:31:43,389 WARN L193 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 363 DAG size of output: 31 [2020-10-23 20:31:43,574 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2020-10-23 20:31:43,728 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 65 [2020-10-23 20:31:43,927 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 318 DAG size of output: 34 [2020-10-23 20:31:44,335 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 349 DAG size of output: 31 [2020-10-23 20:31:44,543 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 41 [2020-10-23 20:31:44,718 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 121 [2020-10-23 20:31:45,113 WARN L193 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 382 DAG size of output: 31 [2020-10-23 20:31:45,334 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 288 DAG size of output: 45 [2020-10-23 20:31:45,457 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 318 DAG size of output: 34 [2020-10-23 20:31:45,724 WARN L193 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 382 DAG size of output: 31 [2020-10-23 20:31:45,870 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 323 DAG size of output: 31 [2020-10-23 20:31:46,458 WARN L193 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 384 DAG size of output: 39 [2020-10-23 20:31:46,722 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 377 DAG size of output: 31 [2020-10-23 20:31:46,907 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 121 [2020-10-23 20:31:48,403 WARN L193 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-10-23 20:31:57,077 WARN L193 SmtUtils]: Spent 8.60 s on a formula simplification. DAG size of input: 179 DAG size of output: 159 [2020-10-23 20:31:58,416 WARN L193 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-10-23 20:31:58,667 WARN L193 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-10-23 20:31:58,960 WARN L193 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2020-10-23 20:32:00,388 WARN L193 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2020-10-23 20:32:04,041 WARN L193 SmtUtils]: Spent 3.65 s on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2020-10-23 20:32:04,617 WARN L193 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-10-23 20:32:04,757 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2020-10-23 20:32:04,888 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2020-10-23 20:32:06,418 WARN L193 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2020-10-23 20:32:06,989 WARN L193 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-10-23 20:32:07,244 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-10-23 20:32:10,654 WARN L193 SmtUtils]: Spent 3.34 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2020-10-23 20:32:10,769 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2020-10-23 20:32:14,421 WARN L193 SmtUtils]: Spent 3.65 s on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2020-10-23 20:32:15,081 WARN L193 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2020-10-23 20:32:15,693 WARN L193 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-10-23 20:32:15,818 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2020-10-23 20:32:19,144 WARN L193 SmtUtils]: Spent 3.29 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2020-10-23 20:32:20,647 WARN L193 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2020-10-23 20:32:20,941 WARN L193 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2020-10-23 20:32:21,333 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2020-10-23 20:32:24,626 WARN L193 SmtUtils]: Spent 3.29 s on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2020-10-23 20:32:25,276 WARN L193 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2020-10-23 20:32:25,413 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2020-10-23 20:32:25,418 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-10-23 20:32:25,418 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-10-23 20:32:25,419 INFO L277 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-10-23 20:32:25,419 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-10-23 20:32:25,419 INFO L277 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-10-23 20:32:25,419 INFO L277 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-10-23 20:32:25,419 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-23 20:32:25,419 INFO L277 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-10-23 20:32:25,419 INFO L277 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-10-23 20:32:25,420 INFO L277 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2020-10-23 20:32:25,420 INFO L270 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-10-23 20:32:25,420 INFO L277 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-10-23 20:32:25,420 INFO L277 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-10-23 20:32:25,420 INFO L277 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-10-23 20:32:25,420 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-23 20:32:25,420 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-23 20:32:25,420 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-23 20:32:25,420 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-23 20:32:25,421 INFO L270 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-10-23 20:32:25,421 INFO L277 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-10-23 20:32:25,421 INFO L277 CegarLoopResult]: At program point mainEXIT(lines 6 123) the Hoare annotation is: true [2020-10-23 20:32:25,422 INFO L270 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-10-23 20:32:25,422 INFO L270 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-10-23 20:32:25,423 INFO L270 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-10-23 20:32:25,423 INFO L277 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: true [2020-10-23 20:32:25,423 INFO L277 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: true [2020-10-23 20:32:25,423 INFO L277 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: true [2020-10-23 20:32:25,424 INFO L270 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-10-23 20:32:25,424 INFO L270 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-10-23 20:32:25,424 INFO L270 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-10-23 20:32:25,424 INFO L277 CegarLoopResult]: At program point L119(lines 7 123) the Hoare annotation is: true [2020-10-23 20:32:25,424 INFO L277 CegarLoopResult]: At program point L53(lines 53 55) the Hoare annotation is: true [2020-10-23 20:32:25,425 INFO L277 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-10-23 20:32:25,425 INFO L277 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: true [2020-10-23 20:32:25,425 INFO L270 CegarLoopResult]: At program point L53-2(lines 32 118) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-10-23 20:32:25,425 INFO L277 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: true [2020-10-23 20:32:25,426 INFO L270 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-10-23 20:32:25,426 INFO L277 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: true [2020-10-23 20:32:25,426 INFO L277 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-10-23 20:32:25,426 INFO L270 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-10-23 20:32:25,426 INFO L270 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-10-23 20:32:25,426 INFO L277 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: true [2020-10-23 20:32:25,427 INFO L270 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-10-23 20:32:25,427 INFO L270 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-10-23 20:32:25,427 INFO L277 CegarLoopResult]: At program point L54(line 54) the Hoare annotation is: true [2020-10-23 20:32:25,427 INFO L277 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-10-23 20:32:25,427 INFO L277 CegarLoopResult]: At program point mainFINAL(lines 6 123) the Hoare annotation is: true [2020-10-23 20:32:25,427 INFO L270 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-10-23 20:32:25,428 INFO L277 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: true [2020-10-23 20:32:25,428 INFO L277 CegarLoopResult]: At program point mainENTRY(lines 6 123) the Hoare annotation is: true [2020-10-23 20:32:25,428 INFO L270 CegarLoopResult]: At program point L121(line 121) the Hoare annotation is: false [2020-10-23 20:32:25,428 INFO L270 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-10-23 20:32:25,428 INFO L277 CegarLoopResult]: At program point L113-1(lines 32 118) the Hoare annotation is: true [2020-10-23 20:32:25,428 INFO L277 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: true [2020-10-23 20:32:25,429 INFO L277 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-10-23 20:32:25,429 INFO L277 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: true [2020-10-23 20:32:25,429 INFO L277 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: true [2020-10-23 20:32:25,429 INFO L270 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-10-23 20:32:25,429 INFO L277 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: true [2020-10-23 20:32:25,429 INFO L270 CegarLoopResult]: At program point L122(line 122) the Hoare annotation is: false [2020-10-23 20:32:25,430 INFO L270 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-10-23 20:32:25,430 INFO L277 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: true [2020-10-23 20:32:25,430 INFO L277 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: true [2020-10-23 20:32:25,430 INFO L277 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: true [2020-10-23 20:32:25,430 INFO L270 CegarLoopResult]: At program point L114(line 114) the Hoare annotation is: (= main_~lk7~0 1) [2020-10-23 20:32:25,430 INFO L270 CegarLoopResult]: At program point L114-1(lines 7 123) the Hoare annotation is: false [2020-10-23 20:32:25,430 INFO L277 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-10-23 20:32:25,431 INFO L270 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-10-23 20:32:25,431 INFO L270 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-10-23 20:32:25,431 INFO L270 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-10-23 20:32:25,432 INFO L270 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-10-23 20:32:25,432 INFO L277 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-10-23 20:32:25,432 INFO L270 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-10-23 20:32:25,432 INFO L270 CegarLoopResult]: At program point L115(line 115) the Hoare annotation is: (= main_~lk7~0 1) [2020-10-23 20:32:25,432 INFO L277 CegarLoopResult]: At program point L49(line 49) the Hoare annotation is: true [2020-10-23 20:32:25,433 INFO L270 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-10-23 20:32:25,433 INFO L277 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: true [2020-10-23 20:32:25,433 INFO L277 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: true [2020-10-23 20:32:25,433 INFO L277 CegarLoopResult]: At program point L8-1(line 8) the Hoare annotation is: true [2020-10-23 20:32:25,433 INFO L270 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-10-23 20:32:25,433 INFO L270 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-10-23 20:32:25,434 INFO L277 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-10-23 20:32:25,434 INFO L277 CegarLoopResult]: At program point L33-1(line 33) the Hoare annotation is: true [2020-10-23 20:32:25,434 INFO L277 CegarLoopResult]: At program point L33-2(line 33) the Hoare annotation is: true [2020-10-23 20:32:25,434 INFO L270 CegarLoopResult]: At program point L58(line 58) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-10-23 20:32:25,435 INFO L270 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-10-23 20:32:25,435 INFO L277 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-10-23 20:32:25,435 INFO L277 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-10-23 20:32:25,435 INFO L277 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: true [2020-10-23 20:32:25,435 INFO L270 CegarLoopResult]: At program point L108-1(lines 32 118) the Hoare annotation is: (or (= main_~p7~0 0) (= main_~lk7~0 1)) [2020-10-23 20:32:25,435 INFO L277 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-10-23 20:32:25,435 INFO L270 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-10-23 20:32:25,435 INFO L277 CegarLoopResult]: At program point L34(lines 34 36) the Hoare annotation is: true [2020-10-23 20:32:25,436 INFO L277 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: true [2020-10-23 20:32:25,436 INFO L277 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: true [2020-10-23 20:32:25,436 INFO L277 CegarLoopResult]: At program point L26-2(line 26) the Hoare annotation is: true [2020-10-23 20:32:25,436 INFO L270 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-10-23 20:32:25,437 INFO L277 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-10-23 20:32:25,437 INFO L270 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-10-23 20:32:25,437 INFO L277 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: true [2020-10-23 20:32:25,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 08:32:25 BoogieIcfgContainer [2020-10-23 20:32:25,449 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-23 20:32:25,450 INFO L168 Benchmark]: Toolchain (without parser) took 58586.70 ms. Allocated memory was 157.3 MB in the beginning and 898.6 MB in the end (delta: 741.3 MB). Free memory was 134.0 MB in the beginning and 696.2 MB in the end (delta: -562.2 MB). Peak memory consumption was 563.1 MB. Max. memory is 8.0 GB. [2020-10-23 20:32:25,451 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 125.8 MB. Free memory is still 103.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-23 20:32:25,451 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.33 ms. Allocated memory is still 157.3 MB. Free memory was 133.4 MB in the beginning and 123.7 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-23 20:32:25,452 INFO L168 Benchmark]: Boogie Preprocessor took 74.38 ms. Allocated memory is still 157.3 MB. Free memory was 123.7 MB in the beginning and 122.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-10-23 20:32:25,452 INFO L168 Benchmark]: RCFGBuilder took 794.35 ms. Allocated memory is still 157.3 MB. Free memory was 121.9 MB in the beginning and 133.5 MB in the end (delta: -11.6 MB). Peak memory consumption was 17.8 MB. Max. memory is 8.0 GB. [2020-10-23 20:32:25,453 INFO L168 Benchmark]: TraceAbstraction took 57400.92 ms. Allocated memory was 157.3 MB in the beginning and 898.6 MB in the end (delta: 741.3 MB). Free memory was 133.0 MB in the beginning and 696.2 MB in the end (delta: -563.2 MB). Peak memory consumption was 562.4 MB. Max. memory is 8.0 GB. [2020-10-23 20:32:25,455 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.19 ms. Allocated memory is still 125.8 MB. Free memory is still 103.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 300.33 ms. Allocated memory is still 157.3 MB. Free memory was 133.4 MB in the beginning and 123.7 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 74.38 ms. Allocated memory is still 157.3 MB. Free memory was 123.7 MB in the beginning and 122.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 794.35 ms. Allocated memory is still 157.3 MB. Free memory was 121.9 MB in the beginning and 133.5 MB in the end (delta: -11.6 MB). Peak memory consumption was 17.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 57400.92 ms. Allocated memory was 157.3 MB in the beginning and 898.6 MB in the end (delta: 741.3 MB). Free memory was 133.0 MB in the beginning and 696.2 MB in the end (delta: -563.2 MB). Peak memory consumption was 562.4 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: 11.0s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 46.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1939 SDtfs, 2220 SDslu, 237 SDs, 0 SdLazy, 1392 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s 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.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 1048 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 100 LocationsWithAnnotation, 152 PreInvPairs, 4832 NumberOfFragments, 13960 HoareAnnotationTreeSize, 152 FomulaSimplifications, 1343345 FormulaSimplificationTreeSizeReduction, 7.8s HoareSimplificationTime, 100 FomulaSimplificationsInter, 24188 FormulaSimplificationTreeSizeReductionInter, 38.3s 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...