/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_8.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 22:16:08,396 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 22:16:08,399 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 22:16:08,418 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 22:16:08,418 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 22:16:08,420 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 22:16:08,422 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 22:16:08,433 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 22:16:08,435 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 22:16:08,436 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 22:16:08,437 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 22:16:08,438 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 22:16:08,438 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 22:16:08,439 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 22:16:08,440 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 22:16:08,441 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 22:16:08,442 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 22:16:08,443 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 22:16:08,444 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 22:16:08,446 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 22:16:08,447 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 22:16:08,448 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 22:16:08,449 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 22:16:08,450 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 22:16:08,452 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 22:16:08,452 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 22:16:08,452 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 22:16:08,453 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 22:16:08,454 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 22:16:08,455 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 22:16:08,455 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 22:16:08,456 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 22:16:08,456 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 22:16:08,457 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 22:16:08,458 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 22:16:08,458 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 22:16:08,459 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 22:16:08,459 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 22:16:08,459 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 22:16:08,460 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 22:16:08,461 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 22:16:08,462 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 22:16:08,470 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 22:16:08,471 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 22:16:08,472 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 22:16:08,472 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 22:16:08,472 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 22:16:08,473 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 22:16:08,473 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 22:16:08,473 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 22:16:08,473 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 22:16:08,473 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 22:16:08,474 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 22:16:08,474 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 22:16:08,474 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 22:16:08,474 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 22:16:08,474 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 22:16:08,475 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 22:16:08,475 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 22:16:08,475 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 22:16:08,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 22:16:08,475 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 22:16:08,475 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 22:16:08,476 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 22:16:08,476 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-08 22:16:08,770 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 22:16:08,783 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 22:16:08,789 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 22:16:08,790 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 22:16:08,791 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 22:16:08,791 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_8.c [2020-07-08 22:16:08,860 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cade2f927/c7f42a8911284a6b8378174adfcc2b9a/FLAGfbf764492 [2020-07-08 22:16:09,318 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 22:16:09,319 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c [2020-07-08 22:16:09,327 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cade2f927/c7f42a8911284a6b8378174adfcc2b9a/FLAGfbf764492 [2020-07-08 22:16:09,728 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cade2f927/c7f42a8911284a6b8378174adfcc2b9a [2020-07-08 22:16:09,738 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 22:16:09,741 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 22:16:09,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 22:16:09,742 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 22:16:09,745 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 22:16:09,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 10:16:09" (1/1) ... [2020-07-08 22:16:09,750 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13b0aaa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:16:09, skipping insertion in model container [2020-07-08 22:16:09,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 10:16:09" (1/1) ... [2020-07-08 22:16:09,759 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 22:16:09,781 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 22:16:09,962 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 22:16:09,968 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 22:16:09,996 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 22:16:10,011 INFO L208 MainTranslator]: Completed translation [2020-07-08 22:16:10,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:16:10 WrapperNode [2020-07-08 22:16:10,012 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 22:16:10,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 22:16:10,013 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 22:16:10,013 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 22:16:10,110 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:16:10" (1/1) ... [2020-07-08 22:16:10,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:16:10" (1/1) ... [2020-07-08 22:16:10,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:16:10" (1/1) ... [2020-07-08 22:16:10,118 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:16:10" (1/1) ... [2020-07-08 22:16:10,126 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:16:10" (1/1) ... [2020-07-08 22:16:10,136 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:16:10" (1/1) ... [2020-07-08 22:16:10,137 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:16:10" (1/1) ... [2020-07-08 22:16:10,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 22:16:10,141 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 22:16:10,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 22:16:10,141 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 22:16:10,142 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:16:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 22:16:10,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 22:16:10,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 22:16:10,213 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 22:16:10,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 22:16:10,214 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 22:16:10,214 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 22:16:10,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 22:16:10,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 22:16:10,753 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 22:16:10,754 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-08 22:16:10,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 10:16:10 BoogieIcfgContainer [2020-07-08 22:16:10,761 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 22:16:10,765 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 22:16:10,765 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 22:16:10,770 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 22:16:10,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 10:16:09" (1/3) ... [2020-07-08 22:16:10,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fdcd70a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 10:16:10, skipping insertion in model container [2020-07-08 22:16:10,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:16:10" (2/3) ... [2020-07-08 22:16:10,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fdcd70a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 10:16:10, skipping insertion in model container [2020-07-08 22:16:10,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 10:16:10" (3/3) ... [2020-07-08 22:16:10,775 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2020-07-08 22:16:10,786 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 22:16:10,797 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 22:16:10,812 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 22:16:10,836 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 22:16:10,837 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 22:16:10,837 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 22:16:10,837 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 22:16:10,837 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 22:16:10,837 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 22:16:10,837 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 22:16:10,838 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 22:16:10,853 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2020-07-08 22:16:10,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-08 22:16:10,866 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:16:10,867 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:16:10,867 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:16:10,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:16:10,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1717644884, now seen corresponding path program 1 times [2020-07-08 22:16:10,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:16:10,882 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1780827110] [2020-07-08 22:16:10,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:16:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:16:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:16:11,132 INFO L280 TraceCheckUtils]: 0: Hoare triple {101#true} assume true; {101#true} is VALID [2020-07-08 22:16:11,132 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {101#true} {101#true} #223#return; {101#true} is VALID [2020-07-08 22:16:11,135 INFO L263 TraceCheckUtils]: 0: Hoare triple {101#true} call ULTIMATE.init(); {101#true} is VALID [2020-07-08 22:16:11,135 INFO L280 TraceCheckUtils]: 1: Hoare triple {101#true} assume true; {101#true} is VALID [2020-07-08 22:16:11,136 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {101#true} {101#true} #223#return; {101#true} is VALID [2020-07-08 22:16:11,136 INFO L263 TraceCheckUtils]: 3: Hoare triple {101#true} call #t~ret9 := main(); {101#true} is VALID [2020-07-08 22:16:11,137 INFO L280 TraceCheckUtils]: 4: Hoare triple {101#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {101#true} is VALID [2020-07-08 22:16:11,137 INFO L280 TraceCheckUtils]: 5: Hoare triple {101#true} ~p1~0 := #t~nondet0; {101#true} is VALID [2020-07-08 22:16:11,138 INFO L280 TraceCheckUtils]: 6: Hoare triple {101#true} havoc #t~nondet0; {101#true} is VALID [2020-07-08 22:16:11,138 INFO L280 TraceCheckUtils]: 7: Hoare triple {101#true} havoc ~lk1~0; {101#true} is VALID [2020-07-08 22:16:11,138 INFO L280 TraceCheckUtils]: 8: Hoare triple {101#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {101#true} is VALID [2020-07-08 22:16:11,139 INFO L280 TraceCheckUtils]: 9: Hoare triple {101#true} ~p2~0 := #t~nondet1; {101#true} is VALID [2020-07-08 22:16:11,139 INFO L280 TraceCheckUtils]: 10: Hoare triple {101#true} havoc #t~nondet1; {101#true} is VALID [2020-07-08 22:16:11,140 INFO L280 TraceCheckUtils]: 11: Hoare triple {101#true} havoc ~lk2~0; {101#true} is VALID [2020-07-08 22:16:11,140 INFO L280 TraceCheckUtils]: 12: Hoare triple {101#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {101#true} is VALID [2020-07-08 22:16:11,140 INFO L280 TraceCheckUtils]: 13: Hoare triple {101#true} ~p3~0 := #t~nondet2; {101#true} is VALID [2020-07-08 22:16:11,141 INFO L280 TraceCheckUtils]: 14: Hoare triple {101#true} havoc #t~nondet2; {101#true} is VALID [2020-07-08 22:16:11,141 INFO L280 TraceCheckUtils]: 15: Hoare triple {101#true} havoc ~lk3~0; {101#true} is VALID [2020-07-08 22:16:11,141 INFO L280 TraceCheckUtils]: 16: Hoare triple {101#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {101#true} is VALID [2020-07-08 22:16:11,142 INFO L280 TraceCheckUtils]: 17: Hoare triple {101#true} ~p4~0 := #t~nondet3; {101#true} is VALID [2020-07-08 22:16:11,142 INFO L280 TraceCheckUtils]: 18: Hoare triple {101#true} havoc #t~nondet3; {101#true} is VALID [2020-07-08 22:16:11,143 INFO L280 TraceCheckUtils]: 19: Hoare triple {101#true} havoc ~lk4~0; {101#true} is VALID [2020-07-08 22:16:11,143 INFO L280 TraceCheckUtils]: 20: Hoare triple {101#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {101#true} is VALID [2020-07-08 22:16:11,143 INFO L280 TraceCheckUtils]: 21: Hoare triple {101#true} ~p5~0 := #t~nondet4; {101#true} is VALID [2020-07-08 22:16:11,144 INFO L280 TraceCheckUtils]: 22: Hoare triple {101#true} havoc #t~nondet4; {101#true} is VALID [2020-07-08 22:16:11,144 INFO L280 TraceCheckUtils]: 23: Hoare triple {101#true} havoc ~lk5~0; {101#true} is VALID [2020-07-08 22:16:11,145 INFO L280 TraceCheckUtils]: 24: Hoare triple {101#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {101#true} is VALID [2020-07-08 22:16:11,145 INFO L280 TraceCheckUtils]: 25: Hoare triple {101#true} ~p6~0 := #t~nondet5; {101#true} is VALID [2020-07-08 22:16:11,145 INFO L280 TraceCheckUtils]: 26: Hoare triple {101#true} havoc #t~nondet5; {101#true} is VALID [2020-07-08 22:16:11,146 INFO L280 TraceCheckUtils]: 27: Hoare triple {101#true} havoc ~lk6~0; {101#true} is VALID [2020-07-08 22:16:11,146 INFO L280 TraceCheckUtils]: 28: Hoare triple {101#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {101#true} is VALID [2020-07-08 22:16:11,147 INFO L280 TraceCheckUtils]: 29: Hoare triple {101#true} ~p7~0 := #t~nondet6; {101#true} is VALID [2020-07-08 22:16:11,147 INFO L280 TraceCheckUtils]: 30: Hoare triple {101#true} havoc #t~nondet6; {101#true} is VALID [2020-07-08 22:16:11,147 INFO L280 TraceCheckUtils]: 31: Hoare triple {101#true} havoc ~lk7~0; {101#true} is VALID [2020-07-08 22:16:11,148 INFO L280 TraceCheckUtils]: 32: Hoare triple {101#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {101#true} is VALID [2020-07-08 22:16:11,148 INFO L280 TraceCheckUtils]: 33: Hoare triple {101#true} ~p8~0 := #t~nondet7; {101#true} is VALID [2020-07-08 22:16:11,149 INFO L280 TraceCheckUtils]: 34: Hoare triple {101#true} havoc #t~nondet7; {101#true} is VALID [2020-07-08 22:16:11,149 INFO L280 TraceCheckUtils]: 35: Hoare triple {101#true} havoc ~lk8~0; {101#true} is VALID [2020-07-08 22:16:11,149 INFO L280 TraceCheckUtils]: 36: Hoare triple {101#true} havoc ~cond~0; {101#true} is VALID [2020-07-08 22:16:11,150 INFO L280 TraceCheckUtils]: 37: Hoare triple {101#true} assume !false; {101#true} is VALID [2020-07-08 22:16:11,150 INFO L280 TraceCheckUtils]: 38: Hoare triple {101#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {101#true} is VALID [2020-07-08 22:16:11,151 INFO L280 TraceCheckUtils]: 39: Hoare triple {101#true} ~cond~0 := #t~nondet8; {101#true} is VALID [2020-07-08 22:16:11,151 INFO L280 TraceCheckUtils]: 40: Hoare triple {101#true} havoc #t~nondet8; {101#true} is VALID [2020-07-08 22:16:11,151 INFO L280 TraceCheckUtils]: 41: Hoare triple {101#true} assume !(0 == ~cond~0); {101#true} is VALID [2020-07-08 22:16:11,152 INFO L280 TraceCheckUtils]: 42: Hoare triple {101#true} ~lk1~0 := 0; {101#true} is VALID [2020-07-08 22:16:11,152 INFO L280 TraceCheckUtils]: 43: Hoare triple {101#true} ~lk2~0 := 0; {101#true} is VALID [2020-07-08 22:16:11,153 INFO L280 TraceCheckUtils]: 44: Hoare triple {101#true} ~lk3~0 := 0; {101#true} is VALID [2020-07-08 22:16:11,153 INFO L280 TraceCheckUtils]: 45: Hoare triple {101#true} ~lk4~0 := 0; {101#true} is VALID [2020-07-08 22:16:11,153 INFO L280 TraceCheckUtils]: 46: Hoare triple {101#true} ~lk5~0 := 0; {101#true} is VALID [2020-07-08 22:16:11,154 INFO L280 TraceCheckUtils]: 47: Hoare triple {101#true} ~lk6~0 := 0; {101#true} is VALID [2020-07-08 22:16:11,154 INFO L280 TraceCheckUtils]: 48: Hoare triple {101#true} ~lk7~0 := 0; {101#true} is VALID [2020-07-08 22:16:11,154 INFO L280 TraceCheckUtils]: 49: Hoare triple {101#true} ~lk8~0 := 0; {101#true} is VALID [2020-07-08 22:16:11,156 INFO L280 TraceCheckUtils]: 50: Hoare triple {101#true} assume !(0 != ~p1~0); {105#(= 0 main_~p1~0)} is VALID [2020-07-08 22:16:11,157 INFO L280 TraceCheckUtils]: 51: Hoare triple {105#(= 0 main_~p1~0)} assume !(0 != ~p2~0); {105#(= 0 main_~p1~0)} is VALID [2020-07-08 22:16:11,158 INFO L280 TraceCheckUtils]: 52: Hoare triple {105#(= 0 main_~p1~0)} assume !(0 != ~p3~0); {105#(= 0 main_~p1~0)} is VALID [2020-07-08 22:16:11,159 INFO L280 TraceCheckUtils]: 53: Hoare triple {105#(= 0 main_~p1~0)} assume !(0 != ~p4~0); {105#(= 0 main_~p1~0)} is VALID [2020-07-08 22:16:11,160 INFO L280 TraceCheckUtils]: 54: Hoare triple {105#(= 0 main_~p1~0)} assume !(0 != ~p5~0); {105#(= 0 main_~p1~0)} is VALID [2020-07-08 22:16:11,161 INFO L280 TraceCheckUtils]: 55: Hoare triple {105#(= 0 main_~p1~0)} assume !(0 != ~p6~0); {105#(= 0 main_~p1~0)} is VALID [2020-07-08 22:16:11,162 INFO L280 TraceCheckUtils]: 56: Hoare triple {105#(= 0 main_~p1~0)} assume !(0 != ~p7~0); {105#(= 0 main_~p1~0)} is VALID [2020-07-08 22:16:11,163 INFO L280 TraceCheckUtils]: 57: Hoare triple {105#(= 0 main_~p1~0)} assume !(0 != ~p8~0); {105#(= 0 main_~p1~0)} is VALID [2020-07-08 22:16:11,165 INFO L280 TraceCheckUtils]: 58: Hoare triple {105#(= 0 main_~p1~0)} assume 0 != ~p1~0; {102#false} is VALID [2020-07-08 22:16:11,165 INFO L280 TraceCheckUtils]: 59: Hoare triple {102#false} assume 1 != ~lk1~0; {102#false} is VALID [2020-07-08 22:16:11,166 INFO L280 TraceCheckUtils]: 60: Hoare triple {102#false} assume !false; {102#false} is VALID [2020-07-08 22:16:11,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 22:16:11,176 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1780827110] [2020-07-08 22:16:11,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:16:11,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 22:16:11,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954291901] [2020-07-08 22:16:11,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-07-08 22:16:11,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:16:11,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 22:16:11,327 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:16:11,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 22:16:11,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:16:11,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 22:16:11,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 22:16:11,341 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 3 states. [2020-07-08 22:16:11,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:16:11,863 INFO L93 Difference]: Finished difference Result 213 states and 291 transitions. [2020-07-08 22:16:11,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 22:16:11,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-07-08 22:16:11,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:16:11,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 22:16:11,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2020-07-08 22:16:11,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 22:16:11,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2020-07-08 22:16:11,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 291 transitions. [2020-07-08 22:16:12,236 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 291 edges. 291 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:16:12,256 INFO L225 Difference]: With dead ends: 213 [2020-07-08 22:16:12,256 INFO L226 Difference]: Without dead ends: 144 [2020-07-08 22:16:12,260 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 22:16:12,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-07-08 22:16:12,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2020-07-08 22:16:12,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:16:12,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand 142 states. [2020-07-08 22:16:12,411 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 142 states. [2020-07-08 22:16:12,411 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 142 states. [2020-07-08 22:16:12,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:16:12,424 INFO L93 Difference]: Finished difference Result 144 states and 187 transitions. [2020-07-08 22:16:12,424 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 187 transitions. [2020-07-08 22:16:12,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:16:12,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:16:12,427 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 144 states. [2020-07-08 22:16:12,427 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 144 states. [2020-07-08 22:16:12,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:16:12,439 INFO L93 Difference]: Finished difference Result 144 states and 187 transitions. [2020-07-08 22:16:12,439 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 187 transitions. [2020-07-08 22:16:12,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:16:12,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:16:12,442 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:16:12,442 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:16:12,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-07-08 22:16:12,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 186 transitions. [2020-07-08 22:16:12,452 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 186 transitions. Word has length 61 [2020-07-08 22:16:12,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:16:12,453 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 186 transitions. [2020-07-08 22:16:12,453 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 22:16:12,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 142 states and 186 transitions. [2020-07-08 22:16:12,674 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:16:12,675 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 186 transitions. [2020-07-08 22:16:12,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-07-08 22:16:12,679 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:16:12,680 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:16:12,682 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 22:16:12,683 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:16:12,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:16:12,683 INFO L82 PathProgramCache]: Analyzing trace with hash 16380224, now seen corresponding path program 1 times [2020-07-08 22:16:12,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:16:12,684 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [609567744] [2020-07-08 22:16:12,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:16:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:16:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:16:12,768 INFO L280 TraceCheckUtils]: 0: Hoare triple {1106#true} assume true; {1106#true} is VALID [2020-07-08 22:16:12,768 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1106#true} {1106#true} #223#return; {1106#true} is VALID [2020-07-08 22:16:12,769 INFO L263 TraceCheckUtils]: 0: Hoare triple {1106#true} call ULTIMATE.init(); {1106#true} is VALID [2020-07-08 22:16:12,769 INFO L280 TraceCheckUtils]: 1: Hoare triple {1106#true} assume true; {1106#true} is VALID [2020-07-08 22:16:12,769 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1106#true} {1106#true} #223#return; {1106#true} is VALID [2020-07-08 22:16:12,769 INFO L263 TraceCheckUtils]: 3: Hoare triple {1106#true} call #t~ret9 := main(); {1106#true} is VALID [2020-07-08 22:16:12,770 INFO L280 TraceCheckUtils]: 4: Hoare triple {1106#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1106#true} is VALID [2020-07-08 22:16:12,770 INFO L280 TraceCheckUtils]: 5: Hoare triple {1106#true} ~p1~0 := #t~nondet0; {1106#true} is VALID [2020-07-08 22:16:12,770 INFO L280 TraceCheckUtils]: 6: Hoare triple {1106#true} havoc #t~nondet0; {1106#true} is VALID [2020-07-08 22:16:12,771 INFO L280 TraceCheckUtils]: 7: Hoare triple {1106#true} havoc ~lk1~0; {1106#true} is VALID [2020-07-08 22:16:12,771 INFO L280 TraceCheckUtils]: 8: Hoare triple {1106#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1106#true} is VALID [2020-07-08 22:16:12,771 INFO L280 TraceCheckUtils]: 9: Hoare triple {1106#true} ~p2~0 := #t~nondet1; {1106#true} is VALID [2020-07-08 22:16:12,771 INFO L280 TraceCheckUtils]: 10: Hoare triple {1106#true} havoc #t~nondet1; {1106#true} is VALID [2020-07-08 22:16:12,772 INFO L280 TraceCheckUtils]: 11: Hoare triple {1106#true} havoc ~lk2~0; {1106#true} is VALID [2020-07-08 22:16:12,772 INFO L280 TraceCheckUtils]: 12: Hoare triple {1106#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1106#true} is VALID [2020-07-08 22:16:12,772 INFO L280 TraceCheckUtils]: 13: Hoare triple {1106#true} ~p3~0 := #t~nondet2; {1106#true} is VALID [2020-07-08 22:16:12,773 INFO L280 TraceCheckUtils]: 14: Hoare triple {1106#true} havoc #t~nondet2; {1106#true} is VALID [2020-07-08 22:16:12,773 INFO L280 TraceCheckUtils]: 15: Hoare triple {1106#true} havoc ~lk3~0; {1106#true} is VALID [2020-07-08 22:16:12,773 INFO L280 TraceCheckUtils]: 16: Hoare triple {1106#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1106#true} is VALID [2020-07-08 22:16:12,773 INFO L280 TraceCheckUtils]: 17: Hoare triple {1106#true} ~p4~0 := #t~nondet3; {1106#true} is VALID [2020-07-08 22:16:12,774 INFO L280 TraceCheckUtils]: 18: Hoare triple {1106#true} havoc #t~nondet3; {1106#true} is VALID [2020-07-08 22:16:12,774 INFO L280 TraceCheckUtils]: 19: Hoare triple {1106#true} havoc ~lk4~0; {1106#true} is VALID [2020-07-08 22:16:12,774 INFO L280 TraceCheckUtils]: 20: Hoare triple {1106#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1106#true} is VALID [2020-07-08 22:16:12,775 INFO L280 TraceCheckUtils]: 21: Hoare triple {1106#true} ~p5~0 := #t~nondet4; {1106#true} is VALID [2020-07-08 22:16:12,775 INFO L280 TraceCheckUtils]: 22: Hoare triple {1106#true} havoc #t~nondet4; {1106#true} is VALID [2020-07-08 22:16:12,775 INFO L280 TraceCheckUtils]: 23: Hoare triple {1106#true} havoc ~lk5~0; {1106#true} is VALID [2020-07-08 22:16:12,776 INFO L280 TraceCheckUtils]: 24: Hoare triple {1106#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1106#true} is VALID [2020-07-08 22:16:12,776 INFO L280 TraceCheckUtils]: 25: Hoare triple {1106#true} ~p6~0 := #t~nondet5; {1106#true} is VALID [2020-07-08 22:16:12,776 INFO L280 TraceCheckUtils]: 26: Hoare triple {1106#true} havoc #t~nondet5; {1106#true} is VALID [2020-07-08 22:16:12,776 INFO L280 TraceCheckUtils]: 27: Hoare triple {1106#true} havoc ~lk6~0; {1106#true} is VALID [2020-07-08 22:16:12,777 INFO L280 TraceCheckUtils]: 28: Hoare triple {1106#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {1106#true} is VALID [2020-07-08 22:16:12,777 INFO L280 TraceCheckUtils]: 29: Hoare triple {1106#true} ~p7~0 := #t~nondet6; {1106#true} is VALID [2020-07-08 22:16:12,777 INFO L280 TraceCheckUtils]: 30: Hoare triple {1106#true} havoc #t~nondet6; {1106#true} is VALID [2020-07-08 22:16:12,777 INFO L280 TraceCheckUtils]: 31: Hoare triple {1106#true} havoc ~lk7~0; {1106#true} is VALID [2020-07-08 22:16:12,778 INFO L280 TraceCheckUtils]: 32: Hoare triple {1106#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {1106#true} is VALID [2020-07-08 22:16:12,778 INFO L280 TraceCheckUtils]: 33: Hoare triple {1106#true} ~p8~0 := #t~nondet7; {1106#true} is VALID [2020-07-08 22:16:12,778 INFO L280 TraceCheckUtils]: 34: Hoare triple {1106#true} havoc #t~nondet7; {1106#true} is VALID [2020-07-08 22:16:12,779 INFO L280 TraceCheckUtils]: 35: Hoare triple {1106#true} havoc ~lk8~0; {1106#true} is VALID [2020-07-08 22:16:12,779 INFO L280 TraceCheckUtils]: 36: Hoare triple {1106#true} havoc ~cond~0; {1106#true} is VALID [2020-07-08 22:16:12,779 INFO L280 TraceCheckUtils]: 37: Hoare triple {1106#true} assume !false; {1106#true} is VALID [2020-07-08 22:16:12,780 INFO L280 TraceCheckUtils]: 38: Hoare triple {1106#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {1106#true} is VALID [2020-07-08 22:16:12,780 INFO L280 TraceCheckUtils]: 39: Hoare triple {1106#true} ~cond~0 := #t~nondet8; {1106#true} is VALID [2020-07-08 22:16:12,780 INFO L280 TraceCheckUtils]: 40: Hoare triple {1106#true} havoc #t~nondet8; {1106#true} is VALID [2020-07-08 22:16:12,780 INFO L280 TraceCheckUtils]: 41: Hoare triple {1106#true} assume !(0 == ~cond~0); {1106#true} is VALID [2020-07-08 22:16:12,781 INFO L280 TraceCheckUtils]: 42: Hoare triple {1106#true} ~lk1~0 := 0; {1106#true} is VALID [2020-07-08 22:16:12,781 INFO L280 TraceCheckUtils]: 43: Hoare triple {1106#true} ~lk2~0 := 0; {1106#true} is VALID [2020-07-08 22:16:12,781 INFO L280 TraceCheckUtils]: 44: Hoare triple {1106#true} ~lk3~0 := 0; {1106#true} is VALID [2020-07-08 22:16:12,782 INFO L280 TraceCheckUtils]: 45: Hoare triple {1106#true} ~lk4~0 := 0; {1106#true} is VALID [2020-07-08 22:16:12,782 INFO L280 TraceCheckUtils]: 46: Hoare triple {1106#true} ~lk5~0 := 0; {1106#true} is VALID [2020-07-08 22:16:12,782 INFO L280 TraceCheckUtils]: 47: Hoare triple {1106#true} ~lk6~0 := 0; {1106#true} is VALID [2020-07-08 22:16:12,782 INFO L280 TraceCheckUtils]: 48: Hoare triple {1106#true} ~lk7~0 := 0; {1106#true} is VALID [2020-07-08 22:16:12,783 INFO L280 TraceCheckUtils]: 49: Hoare triple {1106#true} ~lk8~0 := 0; {1106#true} is VALID [2020-07-08 22:16:12,783 INFO L280 TraceCheckUtils]: 50: Hoare triple {1106#true} assume 0 != ~p1~0; {1106#true} is VALID [2020-07-08 22:16:12,784 INFO L280 TraceCheckUtils]: 51: Hoare triple {1106#true} ~lk1~0 := 1; {1110#(= 1 main_~lk1~0)} is VALID [2020-07-08 22:16:12,785 INFO L280 TraceCheckUtils]: 52: Hoare triple {1110#(= 1 main_~lk1~0)} assume !(0 != ~p2~0); {1110#(= 1 main_~lk1~0)} is VALID [2020-07-08 22:16:12,785 INFO L280 TraceCheckUtils]: 53: Hoare triple {1110#(= 1 main_~lk1~0)} assume !(0 != ~p3~0); {1110#(= 1 main_~lk1~0)} is VALID [2020-07-08 22:16:12,786 INFO L280 TraceCheckUtils]: 54: Hoare triple {1110#(= 1 main_~lk1~0)} assume !(0 != ~p4~0); {1110#(= 1 main_~lk1~0)} is VALID [2020-07-08 22:16:12,787 INFO L280 TraceCheckUtils]: 55: Hoare triple {1110#(= 1 main_~lk1~0)} assume !(0 != ~p5~0); {1110#(= 1 main_~lk1~0)} is VALID [2020-07-08 22:16:12,787 INFO L280 TraceCheckUtils]: 56: Hoare triple {1110#(= 1 main_~lk1~0)} assume !(0 != ~p6~0); {1110#(= 1 main_~lk1~0)} is VALID [2020-07-08 22:16:12,788 INFO L280 TraceCheckUtils]: 57: Hoare triple {1110#(= 1 main_~lk1~0)} assume !(0 != ~p7~0); {1110#(= 1 main_~lk1~0)} is VALID [2020-07-08 22:16:12,789 INFO L280 TraceCheckUtils]: 58: Hoare triple {1110#(= 1 main_~lk1~0)} assume !(0 != ~p8~0); {1110#(= 1 main_~lk1~0)} is VALID [2020-07-08 22:16:12,789 INFO L280 TraceCheckUtils]: 59: Hoare triple {1110#(= 1 main_~lk1~0)} assume 0 != ~p1~0; {1110#(= 1 main_~lk1~0)} is VALID [2020-07-08 22:16:12,790 INFO L280 TraceCheckUtils]: 60: Hoare triple {1110#(= 1 main_~lk1~0)} assume 1 != ~lk1~0; {1107#false} is VALID [2020-07-08 22:16:12,790 INFO L280 TraceCheckUtils]: 61: Hoare triple {1107#false} assume !false; {1107#false} is VALID [2020-07-08 22:16:12,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 22:16:12,795 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [609567744] [2020-07-08 22:16:12,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:16:12,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 22:16:12,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488429678] [2020-07-08 22:16:12,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-07-08 22:16:12,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:16:12,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 22:16:12,856 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:16:12,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 22:16:12,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:16:12,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 22:16:12,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 22:16:12,857 INFO L87 Difference]: Start difference. First operand 142 states and 186 transitions. Second operand 3 states. [2020-07-08 22:16:13,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:16:13,273 INFO L93 Difference]: Finished difference Result 173 states and 229 transitions. [2020-07-08 22:16:13,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 22:16:13,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-07-08 22:16:13,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:16:13,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 22:16:13,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2020-07-08 22:16:13,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 22:16:13,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2020-07-08 22:16:13,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 180 transitions. [2020-07-08 22:16:13,439 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:16:13,445 INFO L225 Difference]: With dead ends: 173 [2020-07-08 22:16:13,446 INFO L226 Difference]: Without dead ends: 171 [2020-07-08 22:16:13,447 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 22:16:13,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-07-08 22:16:13,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 142. [2020-07-08 22:16:13,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:16:13,574 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand 142 states. [2020-07-08 22:16:13,574 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand 142 states. [2020-07-08 22:16:13,574 INFO L87 Difference]: Start difference. First operand 171 states. Second operand 142 states. [2020-07-08 22:16:13,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:16:13,588 INFO L93 Difference]: Finished difference Result 171 states and 227 transitions. [2020-07-08 22:16:13,588 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 227 transitions. [2020-07-08 22:16:13,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:16:13,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:16:13,590 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 171 states. [2020-07-08 22:16:13,590 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 171 states. [2020-07-08 22:16:13,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:16:13,604 INFO L93 Difference]: Finished difference Result 171 states and 227 transitions. [2020-07-08 22:16:13,604 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 227 transitions. [2020-07-08 22:16:13,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:16:13,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:16:13,605 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:16:13,605 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:16:13,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-07-08 22:16:13,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 185 transitions. [2020-07-08 22:16:13,615 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 185 transitions. Word has length 62 [2020-07-08 22:16:13,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:16:13,615 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 185 transitions. [2020-07-08 22:16:13,616 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 22:16:13,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 142 states and 185 transitions. [2020-07-08 22:16:13,816 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:16:13,816 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 185 transitions. [2020-07-08 22:16:13,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-07-08 22:16:13,819 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:16:13,819 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:16:13,819 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 22:16:13,820 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:16:13,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:16:13,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1707628474, now seen corresponding path program 1 times [2020-07-08 22:16:13,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:16:13,821 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1226423767] [2020-07-08 22:16:13,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:16:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:16:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:16:13,880 INFO L280 TraceCheckUtils]: 0: Hoare triple {2085#true} assume true; {2085#true} is VALID [2020-07-08 22:16:13,881 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2085#true} {2085#true} #223#return; {2085#true} is VALID [2020-07-08 22:16:13,881 INFO L263 TraceCheckUtils]: 0: Hoare triple {2085#true} call ULTIMATE.init(); {2085#true} is VALID [2020-07-08 22:16:13,881 INFO L280 TraceCheckUtils]: 1: Hoare triple {2085#true} assume true; {2085#true} is VALID [2020-07-08 22:16:13,881 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2085#true} {2085#true} #223#return; {2085#true} is VALID [2020-07-08 22:16:13,882 INFO L263 TraceCheckUtils]: 3: Hoare triple {2085#true} call #t~ret9 := main(); {2085#true} is VALID [2020-07-08 22:16:13,882 INFO L280 TraceCheckUtils]: 4: Hoare triple {2085#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2085#true} is VALID [2020-07-08 22:16:13,882 INFO L280 TraceCheckUtils]: 5: Hoare triple {2085#true} ~p1~0 := #t~nondet0; {2085#true} is VALID [2020-07-08 22:16:13,882 INFO L280 TraceCheckUtils]: 6: Hoare triple {2085#true} havoc #t~nondet0; {2085#true} is VALID [2020-07-08 22:16:13,883 INFO L280 TraceCheckUtils]: 7: Hoare triple {2085#true} havoc ~lk1~0; {2085#true} is VALID [2020-07-08 22:16:13,883 INFO L280 TraceCheckUtils]: 8: Hoare triple {2085#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2085#true} is VALID [2020-07-08 22:16:13,883 INFO L280 TraceCheckUtils]: 9: Hoare triple {2085#true} ~p2~0 := #t~nondet1; {2085#true} is VALID [2020-07-08 22:16:13,883 INFO L280 TraceCheckUtils]: 10: Hoare triple {2085#true} havoc #t~nondet1; {2085#true} is VALID [2020-07-08 22:16:13,884 INFO L280 TraceCheckUtils]: 11: Hoare triple {2085#true} havoc ~lk2~0; {2085#true} is VALID [2020-07-08 22:16:13,884 INFO L280 TraceCheckUtils]: 12: Hoare triple {2085#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2085#true} is VALID [2020-07-08 22:16:13,884 INFO L280 TraceCheckUtils]: 13: Hoare triple {2085#true} ~p3~0 := #t~nondet2; {2085#true} is VALID [2020-07-08 22:16:13,884 INFO L280 TraceCheckUtils]: 14: Hoare triple {2085#true} havoc #t~nondet2; {2085#true} is VALID [2020-07-08 22:16:13,885 INFO L280 TraceCheckUtils]: 15: Hoare triple {2085#true} havoc ~lk3~0; {2085#true} is VALID [2020-07-08 22:16:13,885 INFO L280 TraceCheckUtils]: 16: Hoare triple {2085#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2085#true} is VALID [2020-07-08 22:16:13,885 INFO L280 TraceCheckUtils]: 17: Hoare triple {2085#true} ~p4~0 := #t~nondet3; {2085#true} is VALID [2020-07-08 22:16:13,885 INFO L280 TraceCheckUtils]: 18: Hoare triple {2085#true} havoc #t~nondet3; {2085#true} is VALID [2020-07-08 22:16:13,886 INFO L280 TraceCheckUtils]: 19: Hoare triple {2085#true} havoc ~lk4~0; {2085#true} is VALID [2020-07-08 22:16:13,886 INFO L280 TraceCheckUtils]: 20: Hoare triple {2085#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2085#true} is VALID [2020-07-08 22:16:13,886 INFO L280 TraceCheckUtils]: 21: Hoare triple {2085#true} ~p5~0 := #t~nondet4; {2085#true} is VALID [2020-07-08 22:16:13,886 INFO L280 TraceCheckUtils]: 22: Hoare triple {2085#true} havoc #t~nondet4; {2085#true} is VALID [2020-07-08 22:16:13,887 INFO L280 TraceCheckUtils]: 23: Hoare triple {2085#true} havoc ~lk5~0; {2085#true} is VALID [2020-07-08 22:16:13,887 INFO L280 TraceCheckUtils]: 24: Hoare triple {2085#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2085#true} is VALID [2020-07-08 22:16:13,887 INFO L280 TraceCheckUtils]: 25: Hoare triple {2085#true} ~p6~0 := #t~nondet5; {2085#true} is VALID [2020-07-08 22:16:13,887 INFO L280 TraceCheckUtils]: 26: Hoare triple {2085#true} havoc #t~nondet5; {2085#true} is VALID [2020-07-08 22:16:13,887 INFO L280 TraceCheckUtils]: 27: Hoare triple {2085#true} havoc ~lk6~0; {2085#true} is VALID [2020-07-08 22:16:13,888 INFO L280 TraceCheckUtils]: 28: Hoare triple {2085#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {2085#true} is VALID [2020-07-08 22:16:13,888 INFO L280 TraceCheckUtils]: 29: Hoare triple {2085#true} ~p7~0 := #t~nondet6; {2085#true} is VALID [2020-07-08 22:16:13,888 INFO L280 TraceCheckUtils]: 30: Hoare triple {2085#true} havoc #t~nondet6; {2085#true} is VALID [2020-07-08 22:16:13,888 INFO L280 TraceCheckUtils]: 31: Hoare triple {2085#true} havoc ~lk7~0; {2085#true} is VALID [2020-07-08 22:16:13,889 INFO L280 TraceCheckUtils]: 32: Hoare triple {2085#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {2085#true} is VALID [2020-07-08 22:16:13,889 INFO L280 TraceCheckUtils]: 33: Hoare triple {2085#true} ~p8~0 := #t~nondet7; {2085#true} is VALID [2020-07-08 22:16:13,889 INFO L280 TraceCheckUtils]: 34: Hoare triple {2085#true} havoc #t~nondet7; {2085#true} is VALID [2020-07-08 22:16:13,889 INFO L280 TraceCheckUtils]: 35: Hoare triple {2085#true} havoc ~lk8~0; {2085#true} is VALID [2020-07-08 22:16:13,890 INFO L280 TraceCheckUtils]: 36: Hoare triple {2085#true} havoc ~cond~0; {2085#true} is VALID [2020-07-08 22:16:13,890 INFO L280 TraceCheckUtils]: 37: Hoare triple {2085#true} assume !false; {2085#true} is VALID [2020-07-08 22:16:13,890 INFO L280 TraceCheckUtils]: 38: Hoare triple {2085#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {2085#true} is VALID [2020-07-08 22:16:13,890 INFO L280 TraceCheckUtils]: 39: Hoare triple {2085#true} ~cond~0 := #t~nondet8; {2085#true} is VALID [2020-07-08 22:16:13,891 INFO L280 TraceCheckUtils]: 40: Hoare triple {2085#true} havoc #t~nondet8; {2085#true} is VALID [2020-07-08 22:16:13,891 INFO L280 TraceCheckUtils]: 41: Hoare triple {2085#true} assume !(0 == ~cond~0); {2085#true} is VALID [2020-07-08 22:16:13,891 INFO L280 TraceCheckUtils]: 42: Hoare triple {2085#true} ~lk1~0 := 0; {2085#true} is VALID [2020-07-08 22:16:13,891 INFO L280 TraceCheckUtils]: 43: Hoare triple {2085#true} ~lk2~0 := 0; {2085#true} is VALID [2020-07-08 22:16:13,892 INFO L280 TraceCheckUtils]: 44: Hoare triple {2085#true} ~lk3~0 := 0; {2085#true} is VALID [2020-07-08 22:16:13,892 INFO L280 TraceCheckUtils]: 45: Hoare triple {2085#true} ~lk4~0 := 0; {2085#true} is VALID [2020-07-08 22:16:13,892 INFO L280 TraceCheckUtils]: 46: Hoare triple {2085#true} ~lk5~0 := 0; {2085#true} is VALID [2020-07-08 22:16:13,892 INFO L280 TraceCheckUtils]: 47: Hoare triple {2085#true} ~lk6~0 := 0; {2085#true} is VALID [2020-07-08 22:16:13,893 INFO L280 TraceCheckUtils]: 48: Hoare triple {2085#true} ~lk7~0 := 0; {2085#true} is VALID [2020-07-08 22:16:13,893 INFO L280 TraceCheckUtils]: 49: Hoare triple {2085#true} ~lk8~0 := 0; {2085#true} is VALID [2020-07-08 22:16:13,893 INFO L280 TraceCheckUtils]: 50: Hoare triple {2085#true} assume !(0 != ~p1~0); {2085#true} is VALID [2020-07-08 22:16:13,894 INFO L280 TraceCheckUtils]: 51: Hoare triple {2085#true} assume !(0 != ~p2~0); {2089#(= 0 main_~p2~0)} is VALID [2020-07-08 22:16:13,894 INFO L280 TraceCheckUtils]: 52: Hoare triple {2089#(= 0 main_~p2~0)} assume !(0 != ~p3~0); {2089#(= 0 main_~p2~0)} is VALID [2020-07-08 22:16:13,895 INFO L280 TraceCheckUtils]: 53: Hoare triple {2089#(= 0 main_~p2~0)} assume !(0 != ~p4~0); {2089#(= 0 main_~p2~0)} is VALID [2020-07-08 22:16:13,895 INFO L280 TraceCheckUtils]: 54: Hoare triple {2089#(= 0 main_~p2~0)} assume !(0 != ~p5~0); {2089#(= 0 main_~p2~0)} is VALID [2020-07-08 22:16:13,896 INFO L280 TraceCheckUtils]: 55: Hoare triple {2089#(= 0 main_~p2~0)} assume !(0 != ~p6~0); {2089#(= 0 main_~p2~0)} is VALID [2020-07-08 22:16:13,897 INFO L280 TraceCheckUtils]: 56: Hoare triple {2089#(= 0 main_~p2~0)} assume !(0 != ~p7~0); {2089#(= 0 main_~p2~0)} is VALID [2020-07-08 22:16:13,897 INFO L280 TraceCheckUtils]: 57: Hoare triple {2089#(= 0 main_~p2~0)} assume !(0 != ~p8~0); {2089#(= 0 main_~p2~0)} is VALID [2020-07-08 22:16:13,898 INFO L280 TraceCheckUtils]: 58: Hoare triple {2089#(= 0 main_~p2~0)} assume !(0 != ~p1~0); {2089#(= 0 main_~p2~0)} is VALID [2020-07-08 22:16:13,898 INFO L280 TraceCheckUtils]: 59: Hoare triple {2089#(= 0 main_~p2~0)} assume 0 != ~p2~0; {2086#false} is VALID [2020-07-08 22:16:13,899 INFO L280 TraceCheckUtils]: 60: Hoare triple {2086#false} assume 1 != ~lk2~0; {2086#false} is VALID [2020-07-08 22:16:13,899 INFO L280 TraceCheckUtils]: 61: Hoare triple {2086#false} assume !false; {2086#false} is VALID [2020-07-08 22:16:13,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 22:16:13,902 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1226423767] [2020-07-08 22:16:13,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:16:13,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 22:16:13,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360920142] [2020-07-08 22:16:13,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-07-08 22:16:13,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:16:13,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 22:16:13,953 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:16:13,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 22:16:13,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:16:13,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 22:16:13,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 22:16:13,954 INFO L87 Difference]: Start difference. First operand 142 states and 185 transitions. Second operand 3 states. [2020-07-08 22:16:14,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:16:14,427 INFO L93 Difference]: Finished difference Result 346 states and 473 transitions. [2020-07-08 22:16:14,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 22:16:14,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-07-08 22:16:14,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:16:14,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 22:16:14,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 264 transitions. [2020-07-08 22:16:14,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 22:16:14,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 264 transitions. [2020-07-08 22:16:14,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 264 transitions. [2020-07-08 22:16:14,652 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 264 edges. 264 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:16:14,658 INFO L225 Difference]: With dead ends: 346 [2020-07-08 22:16:14,658 INFO L226 Difference]: Without dead ends: 241 [2020-07-08 22:16:14,659 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 22:16:14,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2020-07-08 22:16:14,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 239. [2020-07-08 22:16:14,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:16:14,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 241 states. Second operand 239 states. [2020-07-08 22:16:14,877 INFO L74 IsIncluded]: Start isIncluded. First operand 241 states. Second operand 239 states. [2020-07-08 22:16:14,878 INFO L87 Difference]: Start difference. First operand 241 states. Second operand 239 states. [2020-07-08 22:16:14,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:16:14,888 INFO L93 Difference]: Finished difference Result 241 states and 321 transitions. [2020-07-08 22:16:14,888 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 321 transitions. [2020-07-08 22:16:14,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:16:14,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:16:14,889 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand 241 states. [2020-07-08 22:16:14,889 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 241 states. [2020-07-08 22:16:14,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:16:14,899 INFO L93 Difference]: Finished difference Result 241 states and 321 transitions. [2020-07-08 22:16:14,899 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 321 transitions. [2020-07-08 22:16:14,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:16:14,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:16:14,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:16:14,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:16:14,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2020-07-08 22:16:14,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 320 transitions. [2020-07-08 22:16:14,910 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 320 transitions. Word has length 62 [2020-07-08 22:16:14,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:16:14,910 INFO L479 AbstractCegarLoop]: Abstraction has 239 states and 320 transitions. [2020-07-08 22:16:14,910 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 22:16:14,911 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 239 states and 320 transitions. [2020-07-08 22:16:15,261 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 320 edges. 320 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:16:15,262 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 320 transitions. [2020-07-08 22:16:15,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-07-08 22:16:15,263 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:16:15,263 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:16:15,264 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 22:16:15,264 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:16:15,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:16:15,264 INFO L82 PathProgramCache]: Analyzing trace with hash -298745719, now seen corresponding path program 1 times [2020-07-08 22:16:15,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:16:15,265 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [549086597] [2020-07-08 22:16:15,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:16:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:16:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:16:15,330 INFO L280 TraceCheckUtils]: 0: Hoare triple {3744#true} assume true; {3744#true} is VALID [2020-07-08 22:16:15,330 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3744#true} {3744#true} #223#return; {3744#true} is VALID [2020-07-08 22:16:15,330 INFO L263 TraceCheckUtils]: 0: Hoare triple {3744#true} call ULTIMATE.init(); {3744#true} is VALID [2020-07-08 22:16:15,331 INFO L280 TraceCheckUtils]: 1: Hoare triple {3744#true} assume true; {3744#true} is VALID [2020-07-08 22:16:15,331 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3744#true} {3744#true} #223#return; {3744#true} is VALID [2020-07-08 22:16:15,331 INFO L263 TraceCheckUtils]: 3: Hoare triple {3744#true} call #t~ret9 := main(); {3744#true} is VALID [2020-07-08 22:16:15,332 INFO L280 TraceCheckUtils]: 4: Hoare triple {3744#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3744#true} is VALID [2020-07-08 22:16:15,332 INFO L280 TraceCheckUtils]: 5: Hoare triple {3744#true} ~p1~0 := #t~nondet0; {3744#true} is VALID [2020-07-08 22:16:15,332 INFO L280 TraceCheckUtils]: 6: Hoare triple {3744#true} havoc #t~nondet0; {3744#true} is VALID [2020-07-08 22:16:15,332 INFO L280 TraceCheckUtils]: 7: Hoare triple {3744#true} havoc ~lk1~0; {3744#true} is VALID [2020-07-08 22:16:15,333 INFO L280 TraceCheckUtils]: 8: Hoare triple {3744#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3744#true} is VALID [2020-07-08 22:16:15,333 INFO L280 TraceCheckUtils]: 9: Hoare triple {3744#true} ~p2~0 := #t~nondet1; {3744#true} is VALID [2020-07-08 22:16:15,333 INFO L280 TraceCheckUtils]: 10: Hoare triple {3744#true} havoc #t~nondet1; {3744#true} is VALID [2020-07-08 22:16:15,334 INFO L280 TraceCheckUtils]: 11: Hoare triple {3744#true} havoc ~lk2~0; {3744#true} is VALID [2020-07-08 22:16:15,334 INFO L280 TraceCheckUtils]: 12: Hoare triple {3744#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3744#true} is VALID [2020-07-08 22:16:15,334 INFO L280 TraceCheckUtils]: 13: Hoare triple {3744#true} ~p3~0 := #t~nondet2; {3744#true} is VALID [2020-07-08 22:16:15,334 INFO L280 TraceCheckUtils]: 14: Hoare triple {3744#true} havoc #t~nondet2; {3744#true} is VALID [2020-07-08 22:16:15,335 INFO L280 TraceCheckUtils]: 15: Hoare triple {3744#true} havoc ~lk3~0; {3744#true} is VALID [2020-07-08 22:16:15,335 INFO L280 TraceCheckUtils]: 16: Hoare triple {3744#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3744#true} is VALID [2020-07-08 22:16:15,335 INFO L280 TraceCheckUtils]: 17: Hoare triple {3744#true} ~p4~0 := #t~nondet3; {3744#true} is VALID [2020-07-08 22:16:15,335 INFO L280 TraceCheckUtils]: 18: Hoare triple {3744#true} havoc #t~nondet3; {3744#true} is VALID [2020-07-08 22:16:15,336 INFO L280 TraceCheckUtils]: 19: Hoare triple {3744#true} havoc ~lk4~0; {3744#true} is VALID [2020-07-08 22:16:15,336 INFO L280 TraceCheckUtils]: 20: Hoare triple {3744#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {3744#true} is VALID [2020-07-08 22:16:15,336 INFO L280 TraceCheckUtils]: 21: Hoare triple {3744#true} ~p5~0 := #t~nondet4; {3744#true} is VALID [2020-07-08 22:16:15,336 INFO L280 TraceCheckUtils]: 22: Hoare triple {3744#true} havoc #t~nondet4; {3744#true} is VALID [2020-07-08 22:16:15,337 INFO L280 TraceCheckUtils]: 23: Hoare triple {3744#true} havoc ~lk5~0; {3744#true} is VALID [2020-07-08 22:16:15,337 INFO L280 TraceCheckUtils]: 24: Hoare triple {3744#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3744#true} is VALID [2020-07-08 22:16:15,337 INFO L280 TraceCheckUtils]: 25: Hoare triple {3744#true} ~p6~0 := #t~nondet5; {3744#true} is VALID [2020-07-08 22:16:15,337 INFO L280 TraceCheckUtils]: 26: Hoare triple {3744#true} havoc #t~nondet5; {3744#true} is VALID [2020-07-08 22:16:15,337 INFO L280 TraceCheckUtils]: 27: Hoare triple {3744#true} havoc ~lk6~0; {3744#true} is VALID [2020-07-08 22:16:15,338 INFO L280 TraceCheckUtils]: 28: Hoare triple {3744#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {3744#true} is VALID [2020-07-08 22:16:15,338 INFO L280 TraceCheckUtils]: 29: Hoare triple {3744#true} ~p7~0 := #t~nondet6; {3744#true} is VALID [2020-07-08 22:16:15,338 INFO L280 TraceCheckUtils]: 30: Hoare triple {3744#true} havoc #t~nondet6; {3744#true} is VALID [2020-07-08 22:16:15,338 INFO L280 TraceCheckUtils]: 31: Hoare triple {3744#true} havoc ~lk7~0; {3744#true} is VALID [2020-07-08 22:16:15,338 INFO L280 TraceCheckUtils]: 32: Hoare triple {3744#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {3744#true} is VALID [2020-07-08 22:16:15,339 INFO L280 TraceCheckUtils]: 33: Hoare triple {3744#true} ~p8~0 := #t~nondet7; {3744#true} is VALID [2020-07-08 22:16:15,339 INFO L280 TraceCheckUtils]: 34: Hoare triple {3744#true} havoc #t~nondet7; {3744#true} is VALID [2020-07-08 22:16:15,339 INFO L280 TraceCheckUtils]: 35: Hoare triple {3744#true} havoc ~lk8~0; {3744#true} is VALID [2020-07-08 22:16:15,339 INFO L280 TraceCheckUtils]: 36: Hoare triple {3744#true} havoc ~cond~0; {3744#true} is VALID [2020-07-08 22:16:15,339 INFO L280 TraceCheckUtils]: 37: Hoare triple {3744#true} assume !false; {3744#true} is VALID [2020-07-08 22:16:15,340 INFO L280 TraceCheckUtils]: 38: Hoare triple {3744#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {3744#true} is VALID [2020-07-08 22:16:15,340 INFO L280 TraceCheckUtils]: 39: Hoare triple {3744#true} ~cond~0 := #t~nondet8; {3744#true} is VALID [2020-07-08 22:16:15,340 INFO L280 TraceCheckUtils]: 40: Hoare triple {3744#true} havoc #t~nondet8; {3744#true} is VALID [2020-07-08 22:16:15,340 INFO L280 TraceCheckUtils]: 41: Hoare triple {3744#true} assume !(0 == ~cond~0); {3744#true} is VALID [2020-07-08 22:16:15,341 INFO L280 TraceCheckUtils]: 42: Hoare triple {3744#true} ~lk1~0 := 0; {3744#true} is VALID [2020-07-08 22:16:15,341 INFO L280 TraceCheckUtils]: 43: Hoare triple {3744#true} ~lk2~0 := 0; {3744#true} is VALID [2020-07-08 22:16:15,341 INFO L280 TraceCheckUtils]: 44: Hoare triple {3744#true} ~lk3~0 := 0; {3744#true} is VALID [2020-07-08 22:16:15,341 INFO L280 TraceCheckUtils]: 45: Hoare triple {3744#true} ~lk4~0 := 0; {3744#true} is VALID [2020-07-08 22:16:15,341 INFO L280 TraceCheckUtils]: 46: Hoare triple {3744#true} ~lk5~0 := 0; {3744#true} is VALID [2020-07-08 22:16:15,351 INFO L280 TraceCheckUtils]: 47: Hoare triple {3744#true} ~lk6~0 := 0; {3744#true} is VALID [2020-07-08 22:16:15,351 INFO L280 TraceCheckUtils]: 48: Hoare triple {3744#true} ~lk7~0 := 0; {3744#true} is VALID [2020-07-08 22:16:15,351 INFO L280 TraceCheckUtils]: 49: Hoare triple {3744#true} ~lk8~0 := 0; {3744#true} is VALID [2020-07-08 22:16:15,352 INFO L280 TraceCheckUtils]: 50: Hoare triple {3744#true} assume !(0 != ~p1~0); {3744#true} is VALID [2020-07-08 22:16:15,352 INFO L280 TraceCheckUtils]: 51: Hoare triple {3744#true} assume 0 != ~p2~0; {3744#true} is VALID [2020-07-08 22:16:15,353 INFO L280 TraceCheckUtils]: 52: Hoare triple {3744#true} ~lk2~0 := 1; {3748#(= 1 main_~lk2~0)} is VALID [2020-07-08 22:16:15,353 INFO L280 TraceCheckUtils]: 53: Hoare triple {3748#(= 1 main_~lk2~0)} assume !(0 != ~p3~0); {3748#(= 1 main_~lk2~0)} is VALID [2020-07-08 22:16:15,354 INFO L280 TraceCheckUtils]: 54: Hoare triple {3748#(= 1 main_~lk2~0)} assume !(0 != ~p4~0); {3748#(= 1 main_~lk2~0)} is VALID [2020-07-08 22:16:15,354 INFO L280 TraceCheckUtils]: 55: Hoare triple {3748#(= 1 main_~lk2~0)} assume !(0 != ~p5~0); {3748#(= 1 main_~lk2~0)} is VALID [2020-07-08 22:16:15,355 INFO L280 TraceCheckUtils]: 56: Hoare triple {3748#(= 1 main_~lk2~0)} assume !(0 != ~p6~0); {3748#(= 1 main_~lk2~0)} is VALID [2020-07-08 22:16:15,355 INFO L280 TraceCheckUtils]: 57: Hoare triple {3748#(= 1 main_~lk2~0)} assume !(0 != ~p7~0); {3748#(= 1 main_~lk2~0)} is VALID [2020-07-08 22:16:15,356 INFO L280 TraceCheckUtils]: 58: Hoare triple {3748#(= 1 main_~lk2~0)} assume !(0 != ~p8~0); {3748#(= 1 main_~lk2~0)} is VALID [2020-07-08 22:16:15,356 INFO L280 TraceCheckUtils]: 59: Hoare triple {3748#(= 1 main_~lk2~0)} assume !(0 != ~p1~0); {3748#(= 1 main_~lk2~0)} is VALID [2020-07-08 22:16:15,357 INFO L280 TraceCheckUtils]: 60: Hoare triple {3748#(= 1 main_~lk2~0)} assume 0 != ~p2~0; {3748#(= 1 main_~lk2~0)} is VALID [2020-07-08 22:16:15,357 INFO L280 TraceCheckUtils]: 61: Hoare triple {3748#(= 1 main_~lk2~0)} assume 1 != ~lk2~0; {3745#false} is VALID [2020-07-08 22:16:15,358 INFO L280 TraceCheckUtils]: 62: Hoare triple {3745#false} assume !false; {3745#false} is VALID [2020-07-08 22:16:15,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 22:16:15,361 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [549086597] [2020-07-08 22:16:15,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:16:15,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 22:16:15,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581065340] [2020-07-08 22:16:15,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-07-08 22:16:15,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:16:15,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 22:16:15,418 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:16:15,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 22:16:15,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:16:15,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 22:16:15,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 22:16:15,419 INFO L87 Difference]: Start difference. First operand 239 states and 320 transitions. Second operand 3 states. [2020-07-08 22:16:15,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:16:15,892 INFO L93 Difference]: Finished difference Result 293 states and 396 transitions. [2020-07-08 22:16:15,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 22:16:15,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-07-08 22:16:15,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:16:15,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 22:16:15,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2020-07-08 22:16:15,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 22:16:15,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2020-07-08 22:16:15,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 176 transitions. [2020-07-08 22:16:16,046 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:16:16,054 INFO L225 Difference]: With dead ends: 293 [2020-07-08 22:16:16,054 INFO L226 Difference]: Without dead ends: 291 [2020-07-08 22:16:16,055 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 22:16:16,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-07-08 22:16:16,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 239. [2020-07-08 22:16:16,350 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:16:16,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 291 states. Second operand 239 states. [2020-07-08 22:16:16,351 INFO L74 IsIncluded]: Start isIncluded. First operand 291 states. Second operand 239 states. [2020-07-08 22:16:16,351 INFO L87 Difference]: Start difference. First operand 291 states. Second operand 239 states. [2020-07-08 22:16:16,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:16:16,363 INFO L93 Difference]: Finished difference Result 291 states and 393 transitions. [2020-07-08 22:16:16,363 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 393 transitions. [2020-07-08 22:16:16,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:16:16,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:16:16,364 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand 291 states. [2020-07-08 22:16:16,364 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 291 states. [2020-07-08 22:16:16,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:16:16,376 INFO L93 Difference]: Finished difference Result 291 states and 393 transitions. [2020-07-08 22:16:16,376 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 393 transitions. [2020-07-08 22:16:16,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:16:16,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:16:16,377 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:16:16,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:16:16,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2020-07-08 22:16:16,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 318 transitions. [2020-07-08 22:16:16,386 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 318 transitions. Word has length 63 [2020-07-08 22:16:16,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:16:16,386 INFO L479 AbstractCegarLoop]: Abstraction has 239 states and 318 transitions. [2020-07-08 22:16:16,387 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 22:16:16,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 239 states and 318 transitions. [2020-07-08 22:16:16,708 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 318 edges. 318 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:16:16,708 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 318 transitions. [2020-07-08 22:16:16,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-07-08 22:16:16,709 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:16:16,710 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:16:16,710 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 22:16:16,710 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:16:16,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:16:16,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1397120136, now seen corresponding path program 1 times [2020-07-08 22:16:16,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:16:16,711 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1738451563] [2020-07-08 22:16:16,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:16:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:16:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:16:16,771 INFO L280 TraceCheckUtils]: 0: Hoare triple {5397#true} assume true; {5397#true} is VALID [2020-07-08 22:16:16,772 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5397#true} {5397#true} #223#return; {5397#true} is VALID [2020-07-08 22:16:16,772 INFO L263 TraceCheckUtils]: 0: Hoare triple {5397#true} call ULTIMATE.init(); {5397#true} is VALID [2020-07-08 22:16:16,772 INFO L280 TraceCheckUtils]: 1: Hoare triple {5397#true} assume true; {5397#true} is VALID [2020-07-08 22:16:16,772 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5397#true} {5397#true} #223#return; {5397#true} is VALID [2020-07-08 22:16:16,772 INFO L263 TraceCheckUtils]: 3: Hoare triple {5397#true} call #t~ret9 := main(); {5397#true} is VALID [2020-07-08 22:16:16,773 INFO L280 TraceCheckUtils]: 4: Hoare triple {5397#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {5397#true} is VALID [2020-07-08 22:16:16,773 INFO L280 TraceCheckUtils]: 5: Hoare triple {5397#true} ~p1~0 := #t~nondet0; {5397#true} is VALID [2020-07-08 22:16:16,773 INFO L280 TraceCheckUtils]: 6: Hoare triple {5397#true} havoc #t~nondet0; {5397#true} is VALID [2020-07-08 22:16:16,773 INFO L280 TraceCheckUtils]: 7: Hoare triple {5397#true} havoc ~lk1~0; {5397#true} is VALID [2020-07-08 22:16:16,773 INFO L280 TraceCheckUtils]: 8: Hoare triple {5397#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {5397#true} is VALID [2020-07-08 22:16:16,774 INFO L280 TraceCheckUtils]: 9: Hoare triple {5397#true} ~p2~0 := #t~nondet1; {5397#true} is VALID [2020-07-08 22:16:16,774 INFO L280 TraceCheckUtils]: 10: Hoare triple {5397#true} havoc #t~nondet1; {5397#true} is VALID [2020-07-08 22:16:16,774 INFO L280 TraceCheckUtils]: 11: Hoare triple {5397#true} havoc ~lk2~0; {5397#true} is VALID [2020-07-08 22:16:16,774 INFO L280 TraceCheckUtils]: 12: Hoare triple {5397#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {5397#true} is VALID [2020-07-08 22:16:16,774 INFO L280 TraceCheckUtils]: 13: Hoare triple {5397#true} ~p3~0 := #t~nondet2; {5397#true} is VALID [2020-07-08 22:16:16,774 INFO L280 TraceCheckUtils]: 14: Hoare triple {5397#true} havoc #t~nondet2; {5397#true} is VALID [2020-07-08 22:16:16,775 INFO L280 TraceCheckUtils]: 15: Hoare triple {5397#true} havoc ~lk3~0; {5397#true} is VALID [2020-07-08 22:16:16,775 INFO L280 TraceCheckUtils]: 16: Hoare triple {5397#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {5397#true} is VALID [2020-07-08 22:16:16,775 INFO L280 TraceCheckUtils]: 17: Hoare triple {5397#true} ~p4~0 := #t~nondet3; {5397#true} is VALID [2020-07-08 22:16:16,775 INFO L280 TraceCheckUtils]: 18: Hoare triple {5397#true} havoc #t~nondet3; {5397#true} is VALID [2020-07-08 22:16:16,775 INFO L280 TraceCheckUtils]: 19: Hoare triple {5397#true} havoc ~lk4~0; {5397#true} is VALID [2020-07-08 22:16:16,776 INFO L280 TraceCheckUtils]: 20: Hoare triple {5397#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {5397#true} is VALID [2020-07-08 22:16:16,776 INFO L280 TraceCheckUtils]: 21: Hoare triple {5397#true} ~p5~0 := #t~nondet4; {5397#true} is VALID [2020-07-08 22:16:16,776 INFO L280 TraceCheckUtils]: 22: Hoare triple {5397#true} havoc #t~nondet4; {5397#true} is VALID [2020-07-08 22:16:16,776 INFO L280 TraceCheckUtils]: 23: Hoare triple {5397#true} havoc ~lk5~0; {5397#true} is VALID [2020-07-08 22:16:16,776 INFO L280 TraceCheckUtils]: 24: Hoare triple {5397#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {5397#true} is VALID [2020-07-08 22:16:16,777 INFO L280 TraceCheckUtils]: 25: Hoare triple {5397#true} ~p6~0 := #t~nondet5; {5397#true} is VALID [2020-07-08 22:16:16,777 INFO L280 TraceCheckUtils]: 26: Hoare triple {5397#true} havoc #t~nondet5; {5397#true} is VALID [2020-07-08 22:16:16,777 INFO L280 TraceCheckUtils]: 27: Hoare triple {5397#true} havoc ~lk6~0; {5397#true} is VALID [2020-07-08 22:16:16,777 INFO L280 TraceCheckUtils]: 28: Hoare triple {5397#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {5397#true} is VALID [2020-07-08 22:16:16,777 INFO L280 TraceCheckUtils]: 29: Hoare triple {5397#true} ~p7~0 := #t~nondet6; {5397#true} is VALID [2020-07-08 22:16:16,777 INFO L280 TraceCheckUtils]: 30: Hoare triple {5397#true} havoc #t~nondet6; {5397#true} is VALID [2020-07-08 22:16:16,778 INFO L280 TraceCheckUtils]: 31: Hoare triple {5397#true} havoc ~lk7~0; {5397#true} is VALID [2020-07-08 22:16:16,778 INFO L280 TraceCheckUtils]: 32: Hoare triple {5397#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {5397#true} is VALID [2020-07-08 22:16:16,778 INFO L280 TraceCheckUtils]: 33: Hoare triple {5397#true} ~p8~0 := #t~nondet7; {5397#true} is VALID [2020-07-08 22:16:16,778 INFO L280 TraceCheckUtils]: 34: Hoare triple {5397#true} havoc #t~nondet7; {5397#true} is VALID [2020-07-08 22:16:16,778 INFO L280 TraceCheckUtils]: 35: Hoare triple {5397#true} havoc ~lk8~0; {5397#true} is VALID [2020-07-08 22:16:16,778 INFO L280 TraceCheckUtils]: 36: Hoare triple {5397#true} havoc ~cond~0; {5397#true} is VALID [2020-07-08 22:16:16,778 INFO L280 TraceCheckUtils]: 37: Hoare triple {5397#true} assume !false; {5397#true} is VALID [2020-07-08 22:16:16,779 INFO L280 TraceCheckUtils]: 38: Hoare triple {5397#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {5397#true} is VALID [2020-07-08 22:16:16,779 INFO L280 TraceCheckUtils]: 39: Hoare triple {5397#true} ~cond~0 := #t~nondet8; {5397#true} is VALID [2020-07-08 22:16:16,779 INFO L280 TraceCheckUtils]: 40: Hoare triple {5397#true} havoc #t~nondet8; {5397#true} is VALID [2020-07-08 22:16:16,779 INFO L280 TraceCheckUtils]: 41: Hoare triple {5397#true} assume !(0 == ~cond~0); {5397#true} is VALID [2020-07-08 22:16:16,779 INFO L280 TraceCheckUtils]: 42: Hoare triple {5397#true} ~lk1~0 := 0; {5397#true} is VALID [2020-07-08 22:16:16,779 INFO L280 TraceCheckUtils]: 43: Hoare triple {5397#true} ~lk2~0 := 0; {5397#true} is VALID [2020-07-08 22:16:16,780 INFO L280 TraceCheckUtils]: 44: Hoare triple {5397#true} ~lk3~0 := 0; {5397#true} is VALID [2020-07-08 22:16:16,780 INFO L280 TraceCheckUtils]: 45: Hoare triple {5397#true} ~lk4~0 := 0; {5397#true} is VALID [2020-07-08 22:16:16,780 INFO L280 TraceCheckUtils]: 46: Hoare triple {5397#true} ~lk5~0 := 0; {5397#true} is VALID [2020-07-08 22:16:16,780 INFO L280 TraceCheckUtils]: 47: Hoare triple {5397#true} ~lk6~0 := 0; {5397#true} is VALID [2020-07-08 22:16:16,781 INFO L280 TraceCheckUtils]: 48: Hoare triple {5397#true} ~lk7~0 := 0; {5397#true} is VALID [2020-07-08 22:16:16,781 INFO L280 TraceCheckUtils]: 49: Hoare triple {5397#true} ~lk8~0 := 0; {5397#true} is VALID [2020-07-08 22:16:16,781 INFO L280 TraceCheckUtils]: 50: Hoare triple {5397#true} assume !(0 != ~p1~0); {5397#true} is VALID [2020-07-08 22:16:16,781 INFO L280 TraceCheckUtils]: 51: Hoare triple {5397#true} assume !(0 != ~p2~0); {5397#true} is VALID [2020-07-08 22:16:16,782 INFO L280 TraceCheckUtils]: 52: Hoare triple {5397#true} assume !(0 != ~p3~0); {5401#(= 0 main_~p3~0)} is VALID [2020-07-08 22:16:16,783 INFO L280 TraceCheckUtils]: 53: Hoare triple {5401#(= 0 main_~p3~0)} assume !(0 != ~p4~0); {5401#(= 0 main_~p3~0)} is VALID [2020-07-08 22:16:16,783 INFO L280 TraceCheckUtils]: 54: Hoare triple {5401#(= 0 main_~p3~0)} assume !(0 != ~p5~0); {5401#(= 0 main_~p3~0)} is VALID [2020-07-08 22:16:16,783 INFO L280 TraceCheckUtils]: 55: Hoare triple {5401#(= 0 main_~p3~0)} assume !(0 != ~p6~0); {5401#(= 0 main_~p3~0)} is VALID [2020-07-08 22:16:16,784 INFO L280 TraceCheckUtils]: 56: Hoare triple {5401#(= 0 main_~p3~0)} assume !(0 != ~p7~0); {5401#(= 0 main_~p3~0)} is VALID [2020-07-08 22:16:16,784 INFO L280 TraceCheckUtils]: 57: Hoare triple {5401#(= 0 main_~p3~0)} assume !(0 != ~p8~0); {5401#(= 0 main_~p3~0)} is VALID [2020-07-08 22:16:16,785 INFO L280 TraceCheckUtils]: 58: Hoare triple {5401#(= 0 main_~p3~0)} assume !(0 != ~p1~0); {5401#(= 0 main_~p3~0)} is VALID [2020-07-08 22:16:16,785 INFO L280 TraceCheckUtils]: 59: Hoare triple {5401#(= 0 main_~p3~0)} assume !(0 != ~p2~0); {5401#(= 0 main_~p3~0)} is VALID [2020-07-08 22:16:16,786 INFO L280 TraceCheckUtils]: 60: Hoare triple {5401#(= 0 main_~p3~0)} assume 0 != ~p3~0; {5398#false} is VALID [2020-07-08 22:16:16,786 INFO L280 TraceCheckUtils]: 61: Hoare triple {5398#false} assume 1 != ~lk3~0; {5398#false} is VALID [2020-07-08 22:16:16,786 INFO L280 TraceCheckUtils]: 62: Hoare triple {5398#false} assume !false; {5398#false} is VALID [2020-07-08 22:16:16,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 22:16:16,789 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1738451563] [2020-07-08 22:16:16,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:16:16,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 22:16:16,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418444039] [2020-07-08 22:16:16,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-07-08 22:16:16,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:16:16,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 22:16:16,846 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:16:16,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 22:16:16,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:16:16,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 22:16:16,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 22:16:16,847 INFO L87 Difference]: Start difference. First operand 239 states and 318 transitions. Second operand 3 states. [2020-07-08 22:16:17,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:16:17,711 INFO L93 Difference]: Finished difference Result 631 states and 864 transitions. [2020-07-08 22:16:17,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 22:16:17,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-07-08 22:16:17,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:16:17,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 22:16:17,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions. [2020-07-08 22:16:17,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 22:16:17,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions. [2020-07-08 22:16:17,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 261 transitions. [2020-07-08 22:16:17,953 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:16:17,967 INFO L225 Difference]: With dead ends: 631 [2020-07-08 22:16:17,968 INFO L226 Difference]: Without dead ends: 429 [2020-07-08 22:16:17,970 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 22:16:17,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2020-07-08 22:16:18,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 427. [2020-07-08 22:16:18,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:16:18,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 429 states. Second operand 427 states. [2020-07-08 22:16:18,527 INFO L74 IsIncluded]: Start isIncluded. First operand 429 states. Second operand 427 states. [2020-07-08 22:16:18,527 INFO L87 Difference]: Start difference. First operand 429 states. Second operand 427 states. [2020-07-08 22:16:18,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:16:18,546 INFO L93 Difference]: Finished difference Result 429 states and 575 transitions. [2020-07-08 22:16:18,547 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 575 transitions. [2020-07-08 22:16:18,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:16:18,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:16:18,548 INFO L74 IsIncluded]: Start isIncluded. First operand 427 states. Second operand 429 states. [2020-07-08 22:16:18,548 INFO L87 Difference]: Start difference. First operand 427 states. Second operand 429 states. [2020-07-08 22:16:18,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:16:18,566 INFO L93 Difference]: Finished difference Result 429 states and 575 transitions. [2020-07-08 22:16:18,566 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 575 transitions. [2020-07-08 22:16:18,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:16:18,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:16:18,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:16:18,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:16:18,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2020-07-08 22:16:18,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 574 transitions. [2020-07-08 22:16:18,584 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 574 transitions. Word has length 63 [2020-07-08 22:16:18,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:16:18,584 INFO L479 AbstractCegarLoop]: Abstraction has 427 states and 574 transitions. [2020-07-08 22:16:18,584 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 22:16:18,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 427 states and 574 transitions. [2020-07-08 22:16:19,182 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 574 edges. 574 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:16:19,183 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 574 transitions. [2020-07-08 22:16:19,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-07-08 22:16:19,184 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:16:19,184 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:16:19,185 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 22:16:19,185 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:16:19,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:16:19,186 INFO L82 PathProgramCache]: Analyzing trace with hash 361296622, now seen corresponding path program 1 times [2020-07-08 22:16:19,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:16:19,186 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1364796418] [2020-07-08 22:16:19,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:16:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:16:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:16:19,245 INFO L280 TraceCheckUtils]: 0: Hoare triple {8378#true} assume true; {8378#true} is VALID [2020-07-08 22:16:19,246 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {8378#true} {8378#true} #223#return; {8378#true} is VALID [2020-07-08 22:16:19,246 INFO L263 TraceCheckUtils]: 0: Hoare triple {8378#true} call ULTIMATE.init(); {8378#true} is VALID [2020-07-08 22:16:19,246 INFO L280 TraceCheckUtils]: 1: Hoare triple {8378#true} assume true; {8378#true} is VALID [2020-07-08 22:16:19,247 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8378#true} {8378#true} #223#return; {8378#true} is VALID [2020-07-08 22:16:19,247 INFO L263 TraceCheckUtils]: 3: Hoare triple {8378#true} call #t~ret9 := main(); {8378#true} is VALID [2020-07-08 22:16:19,247 INFO L280 TraceCheckUtils]: 4: Hoare triple {8378#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {8378#true} is VALID [2020-07-08 22:16:19,247 INFO L280 TraceCheckUtils]: 5: Hoare triple {8378#true} ~p1~0 := #t~nondet0; {8378#true} is VALID [2020-07-08 22:16:19,247 INFO L280 TraceCheckUtils]: 6: Hoare triple {8378#true} havoc #t~nondet0; {8378#true} is VALID [2020-07-08 22:16:19,248 INFO L280 TraceCheckUtils]: 7: Hoare triple {8378#true} havoc ~lk1~0; {8378#true} is VALID [2020-07-08 22:16:19,248 INFO L280 TraceCheckUtils]: 8: Hoare triple {8378#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {8378#true} is VALID [2020-07-08 22:16:19,248 INFO L280 TraceCheckUtils]: 9: Hoare triple {8378#true} ~p2~0 := #t~nondet1; {8378#true} is VALID [2020-07-08 22:16:19,248 INFO L280 TraceCheckUtils]: 10: Hoare triple {8378#true} havoc #t~nondet1; {8378#true} is VALID [2020-07-08 22:16:19,248 INFO L280 TraceCheckUtils]: 11: Hoare triple {8378#true} havoc ~lk2~0; {8378#true} is VALID [2020-07-08 22:16:19,249 INFO L280 TraceCheckUtils]: 12: Hoare triple {8378#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {8378#true} is VALID [2020-07-08 22:16:19,249 INFO L280 TraceCheckUtils]: 13: Hoare triple {8378#true} ~p3~0 := #t~nondet2; {8378#true} is VALID [2020-07-08 22:16:19,249 INFO L280 TraceCheckUtils]: 14: Hoare triple {8378#true} havoc #t~nondet2; {8378#true} is VALID [2020-07-08 22:16:19,249 INFO L280 TraceCheckUtils]: 15: Hoare triple {8378#true} havoc ~lk3~0; {8378#true} is VALID [2020-07-08 22:16:19,250 INFO L280 TraceCheckUtils]: 16: Hoare triple {8378#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {8378#true} is VALID [2020-07-08 22:16:19,250 INFO L280 TraceCheckUtils]: 17: Hoare triple {8378#true} ~p4~0 := #t~nondet3; {8378#true} is VALID [2020-07-08 22:16:19,250 INFO L280 TraceCheckUtils]: 18: Hoare triple {8378#true} havoc #t~nondet3; {8378#true} is VALID [2020-07-08 22:16:19,250 INFO L280 TraceCheckUtils]: 19: Hoare triple {8378#true} havoc ~lk4~0; {8378#true} is VALID [2020-07-08 22:16:19,251 INFO L280 TraceCheckUtils]: 20: Hoare triple {8378#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {8378#true} is VALID [2020-07-08 22:16:19,251 INFO L280 TraceCheckUtils]: 21: Hoare triple {8378#true} ~p5~0 := #t~nondet4; {8378#true} is VALID [2020-07-08 22:16:19,251 INFO L280 TraceCheckUtils]: 22: Hoare triple {8378#true} havoc #t~nondet4; {8378#true} is VALID [2020-07-08 22:16:19,251 INFO L280 TraceCheckUtils]: 23: Hoare triple {8378#true} havoc ~lk5~0; {8378#true} is VALID [2020-07-08 22:16:19,251 INFO L280 TraceCheckUtils]: 24: Hoare triple {8378#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {8378#true} is VALID [2020-07-08 22:16:19,252 INFO L280 TraceCheckUtils]: 25: Hoare triple {8378#true} ~p6~0 := #t~nondet5; {8378#true} is VALID [2020-07-08 22:16:19,252 INFO L280 TraceCheckUtils]: 26: Hoare triple {8378#true} havoc #t~nondet5; {8378#true} is VALID [2020-07-08 22:16:19,252 INFO L280 TraceCheckUtils]: 27: Hoare triple {8378#true} havoc ~lk6~0; {8378#true} is VALID [2020-07-08 22:16:19,252 INFO L280 TraceCheckUtils]: 28: Hoare triple {8378#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {8378#true} is VALID [2020-07-08 22:16:19,252 INFO L280 TraceCheckUtils]: 29: Hoare triple {8378#true} ~p7~0 := #t~nondet6; {8378#true} is VALID [2020-07-08 22:16:19,253 INFO L280 TraceCheckUtils]: 30: Hoare triple {8378#true} havoc #t~nondet6; {8378#true} is VALID [2020-07-08 22:16:19,253 INFO L280 TraceCheckUtils]: 31: Hoare triple {8378#true} havoc ~lk7~0; {8378#true} is VALID [2020-07-08 22:16:19,253 INFO L280 TraceCheckUtils]: 32: Hoare triple {8378#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {8378#true} is VALID [2020-07-08 22:16:19,253 INFO L280 TraceCheckUtils]: 33: Hoare triple {8378#true} ~p8~0 := #t~nondet7; {8378#true} is VALID [2020-07-08 22:16:19,253 INFO L280 TraceCheckUtils]: 34: Hoare triple {8378#true} havoc #t~nondet7; {8378#true} is VALID [2020-07-08 22:16:19,254 INFO L280 TraceCheckUtils]: 35: Hoare triple {8378#true} havoc ~lk8~0; {8378#true} is VALID [2020-07-08 22:16:19,254 INFO L280 TraceCheckUtils]: 36: Hoare triple {8378#true} havoc ~cond~0; {8378#true} is VALID [2020-07-08 22:16:19,254 INFO L280 TraceCheckUtils]: 37: Hoare triple {8378#true} assume !false; {8378#true} is VALID [2020-07-08 22:16:19,254 INFO L280 TraceCheckUtils]: 38: Hoare triple {8378#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {8378#true} is VALID [2020-07-08 22:16:19,255 INFO L280 TraceCheckUtils]: 39: Hoare triple {8378#true} ~cond~0 := #t~nondet8; {8378#true} is VALID [2020-07-08 22:16:19,255 INFO L280 TraceCheckUtils]: 40: Hoare triple {8378#true} havoc #t~nondet8; {8378#true} is VALID [2020-07-08 22:16:19,255 INFO L280 TraceCheckUtils]: 41: Hoare triple {8378#true} assume !(0 == ~cond~0); {8378#true} is VALID [2020-07-08 22:16:19,255 INFO L280 TraceCheckUtils]: 42: Hoare triple {8378#true} ~lk1~0 := 0; {8378#true} is VALID [2020-07-08 22:16:19,255 INFO L280 TraceCheckUtils]: 43: Hoare triple {8378#true} ~lk2~0 := 0; {8378#true} is VALID [2020-07-08 22:16:19,256 INFO L280 TraceCheckUtils]: 44: Hoare triple {8378#true} ~lk3~0 := 0; {8378#true} is VALID [2020-07-08 22:16:19,256 INFO L280 TraceCheckUtils]: 45: Hoare triple {8378#true} ~lk4~0 := 0; {8378#true} is VALID [2020-07-08 22:16:19,256 INFO L280 TraceCheckUtils]: 46: Hoare triple {8378#true} ~lk5~0 := 0; {8378#true} is VALID [2020-07-08 22:16:19,256 INFO L280 TraceCheckUtils]: 47: Hoare triple {8378#true} ~lk6~0 := 0; {8378#true} is VALID [2020-07-08 22:16:19,257 INFO L280 TraceCheckUtils]: 48: Hoare triple {8378#true} ~lk7~0 := 0; {8378#true} is VALID [2020-07-08 22:16:19,257 INFO L280 TraceCheckUtils]: 49: Hoare triple {8378#true} ~lk8~0 := 0; {8378#true} is VALID [2020-07-08 22:16:19,257 INFO L280 TraceCheckUtils]: 50: Hoare triple {8378#true} assume !(0 != ~p1~0); {8378#true} is VALID [2020-07-08 22:16:19,258 INFO L280 TraceCheckUtils]: 51: Hoare triple {8378#true} assume !(0 != ~p2~0); {8378#true} is VALID [2020-07-08 22:16:19,258 INFO L280 TraceCheckUtils]: 52: Hoare triple {8378#true} assume !(0 != ~p3~0); {8378#true} is VALID [2020-07-08 22:16:19,259 INFO L280 TraceCheckUtils]: 53: Hoare triple {8378#true} assume !(0 != ~p4~0); {8382#(= 0 main_~p4~0)} is VALID [2020-07-08 22:16:19,259 INFO L280 TraceCheckUtils]: 54: Hoare triple {8382#(= 0 main_~p4~0)} assume !(0 != ~p5~0); {8382#(= 0 main_~p4~0)} is VALID [2020-07-08 22:16:19,260 INFO L280 TraceCheckUtils]: 55: Hoare triple {8382#(= 0 main_~p4~0)} assume !(0 != ~p6~0); {8382#(= 0 main_~p4~0)} is VALID [2020-07-08 22:16:19,261 INFO L280 TraceCheckUtils]: 56: Hoare triple {8382#(= 0 main_~p4~0)} assume !(0 != ~p7~0); {8382#(= 0 main_~p4~0)} is VALID [2020-07-08 22:16:19,265 INFO L280 TraceCheckUtils]: 57: Hoare triple {8382#(= 0 main_~p4~0)} assume !(0 != ~p8~0); {8382#(= 0 main_~p4~0)} is VALID [2020-07-08 22:16:19,266 INFO L280 TraceCheckUtils]: 58: Hoare triple {8382#(= 0 main_~p4~0)} assume !(0 != ~p1~0); {8382#(= 0 main_~p4~0)} is VALID [2020-07-08 22:16:19,267 INFO L280 TraceCheckUtils]: 59: Hoare triple {8382#(= 0 main_~p4~0)} assume !(0 != ~p2~0); {8382#(= 0 main_~p4~0)} is VALID [2020-07-08 22:16:19,268 INFO L280 TraceCheckUtils]: 60: Hoare triple {8382#(= 0 main_~p4~0)} assume !(0 != ~p3~0); {8382#(= 0 main_~p4~0)} is VALID [2020-07-08 22:16:19,268 INFO L280 TraceCheckUtils]: 61: Hoare triple {8382#(= 0 main_~p4~0)} assume 0 != ~p4~0; {8379#false} is VALID [2020-07-08 22:16:19,268 INFO L280 TraceCheckUtils]: 62: Hoare triple {8379#false} assume 1 != ~lk4~0; {8379#false} is VALID [2020-07-08 22:16:19,269 INFO L280 TraceCheckUtils]: 63: Hoare triple {8379#false} assume !false; {8379#false} is VALID [2020-07-08 22:16:19,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 22:16:19,271 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1364796418] [2020-07-08 22:16:19,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:16:19,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 22:16:19,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122078525] [2020-07-08 22:16:19,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-07-08 22:16:19,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:16:19,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 22:16:19,337 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:16:19,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 22:16:19,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:16:19,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 22:16:19,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 22:16:19,338 INFO L87 Difference]: Start difference. First operand 427 states and 574 transitions. Second operand 3 states. [2020-07-08 22:16:20,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:16:20,891 INFO L93 Difference]: Finished difference Result 1183 states and 1616 transitions. [2020-07-08 22:16:20,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 22:16:20,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-07-08 22:16:20,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:16:20,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 22:16:20,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions. [2020-07-08 22:16:20,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 22:16:20,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions. [2020-07-08 22:16:20,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 261 transitions. [2020-07-08 22:16:21,122 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:16:21,173 INFO L225 Difference]: With dead ends: 1183 [2020-07-08 22:16:21,173 INFO L226 Difference]: Without dead ends: 793 [2020-07-08 22:16:21,178 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 22:16:21,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2020-07-08 22:16:22,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 791. [2020-07-08 22:16:22,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:16:22,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 793 states. Second operand 791 states. [2020-07-08 22:16:22,412 INFO L74 IsIncluded]: Start isIncluded. First operand 793 states. Second operand 791 states. [2020-07-08 22:16:22,412 INFO L87 Difference]: Start difference. First operand 793 states. Second operand 791 states. [2020-07-08 22:16:22,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:16:22,448 INFO L93 Difference]: Finished difference Result 793 states and 1063 transitions. [2020-07-08 22:16:22,449 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1063 transitions. [2020-07-08 22:16:22,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:16:22,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:16:22,452 INFO L74 IsIncluded]: Start isIncluded. First operand 791 states. Second operand 793 states. [2020-07-08 22:16:22,453 INFO L87 Difference]: Start difference. First operand 791 states. Second operand 793 states. [2020-07-08 22:16:22,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:16:22,491 INFO L93 Difference]: Finished difference Result 793 states and 1063 transitions. [2020-07-08 22:16:22,491 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1063 transitions. [2020-07-08 22:16:22,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:16:22,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:16:22,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:16:22,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:16:22,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-07-08 22:16:22,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1062 transitions. [2020-07-08 22:16:22,535 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1062 transitions. Word has length 64 [2020-07-08 22:16:22,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:16:22,535 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 1062 transitions. [2020-07-08 22:16:22,536 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 22:16:22,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 791 states and 1062 transitions. [2020-07-08 22:16:23,746 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 1062 edges. 1062 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:16:23,746 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1062 transitions. [2020-07-08 22:16:23,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-07-08 22:16:23,748 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:16:23,748 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:16:23,749 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 22:16:23,749 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:16:23,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:16:23,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1477714988, now seen corresponding path program 1 times [2020-07-08 22:16:23,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:16:23,750 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1708681815] [2020-07-08 22:16:23,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:16:23,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:16:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:16:23,805 INFO L280 TraceCheckUtils]: 0: Hoare triple {13919#true} assume true; {13919#true} is VALID [2020-07-08 22:16:23,806 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {13919#true} {13919#true} #223#return; {13919#true} is VALID [2020-07-08 22:16:23,806 INFO L263 TraceCheckUtils]: 0: Hoare triple {13919#true} call ULTIMATE.init(); {13919#true} is VALID [2020-07-08 22:16:23,806 INFO L280 TraceCheckUtils]: 1: Hoare triple {13919#true} assume true; {13919#true} is VALID [2020-07-08 22:16:23,806 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {13919#true} {13919#true} #223#return; {13919#true} is VALID [2020-07-08 22:16:23,806 INFO L263 TraceCheckUtils]: 3: Hoare triple {13919#true} call #t~ret9 := main(); {13919#true} is VALID [2020-07-08 22:16:23,807 INFO L280 TraceCheckUtils]: 4: Hoare triple {13919#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {13919#true} is VALID [2020-07-08 22:16:23,807 INFO L280 TraceCheckUtils]: 5: Hoare triple {13919#true} ~p1~0 := #t~nondet0; {13919#true} is VALID [2020-07-08 22:16:23,807 INFO L280 TraceCheckUtils]: 6: Hoare triple {13919#true} havoc #t~nondet0; {13919#true} is VALID [2020-07-08 22:16:23,807 INFO L280 TraceCheckUtils]: 7: Hoare triple {13919#true} havoc ~lk1~0; {13919#true} is VALID [2020-07-08 22:16:23,807 INFO L280 TraceCheckUtils]: 8: Hoare triple {13919#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {13919#true} is VALID [2020-07-08 22:16:23,807 INFO L280 TraceCheckUtils]: 9: Hoare triple {13919#true} ~p2~0 := #t~nondet1; {13919#true} is VALID [2020-07-08 22:16:23,807 INFO L280 TraceCheckUtils]: 10: Hoare triple {13919#true} havoc #t~nondet1; {13919#true} is VALID [2020-07-08 22:16:23,808 INFO L280 TraceCheckUtils]: 11: Hoare triple {13919#true} havoc ~lk2~0; {13919#true} is VALID [2020-07-08 22:16:23,808 INFO L280 TraceCheckUtils]: 12: Hoare triple {13919#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {13919#true} is VALID [2020-07-08 22:16:23,808 INFO L280 TraceCheckUtils]: 13: Hoare triple {13919#true} ~p3~0 := #t~nondet2; {13919#true} is VALID [2020-07-08 22:16:23,808 INFO L280 TraceCheckUtils]: 14: Hoare triple {13919#true} havoc #t~nondet2; {13919#true} is VALID [2020-07-08 22:16:23,808 INFO L280 TraceCheckUtils]: 15: Hoare triple {13919#true} havoc ~lk3~0; {13919#true} is VALID [2020-07-08 22:16:23,808 INFO L280 TraceCheckUtils]: 16: Hoare triple {13919#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {13919#true} is VALID [2020-07-08 22:16:23,808 INFO L280 TraceCheckUtils]: 17: Hoare triple {13919#true} ~p4~0 := #t~nondet3; {13919#true} is VALID [2020-07-08 22:16:23,809 INFO L280 TraceCheckUtils]: 18: Hoare triple {13919#true} havoc #t~nondet3; {13919#true} is VALID [2020-07-08 22:16:23,809 INFO L280 TraceCheckUtils]: 19: Hoare triple {13919#true} havoc ~lk4~0; {13919#true} is VALID [2020-07-08 22:16:23,809 INFO L280 TraceCheckUtils]: 20: Hoare triple {13919#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {13919#true} is VALID [2020-07-08 22:16:23,809 INFO L280 TraceCheckUtils]: 21: Hoare triple {13919#true} ~p5~0 := #t~nondet4; {13919#true} is VALID [2020-07-08 22:16:23,809 INFO L280 TraceCheckUtils]: 22: Hoare triple {13919#true} havoc #t~nondet4; {13919#true} is VALID [2020-07-08 22:16:23,809 INFO L280 TraceCheckUtils]: 23: Hoare triple {13919#true} havoc ~lk5~0; {13919#true} is VALID [2020-07-08 22:16:23,809 INFO L280 TraceCheckUtils]: 24: Hoare triple {13919#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {13919#true} is VALID [2020-07-08 22:16:23,810 INFO L280 TraceCheckUtils]: 25: Hoare triple {13919#true} ~p6~0 := #t~nondet5; {13919#true} is VALID [2020-07-08 22:16:23,810 INFO L280 TraceCheckUtils]: 26: Hoare triple {13919#true} havoc #t~nondet5; {13919#true} is VALID [2020-07-08 22:16:23,810 INFO L280 TraceCheckUtils]: 27: Hoare triple {13919#true} havoc ~lk6~0; {13919#true} is VALID [2020-07-08 22:16:23,810 INFO L280 TraceCheckUtils]: 28: Hoare triple {13919#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {13919#true} is VALID [2020-07-08 22:16:23,810 INFO L280 TraceCheckUtils]: 29: Hoare triple {13919#true} ~p7~0 := #t~nondet6; {13919#true} is VALID [2020-07-08 22:16:23,810 INFO L280 TraceCheckUtils]: 30: Hoare triple {13919#true} havoc #t~nondet6; {13919#true} is VALID [2020-07-08 22:16:23,810 INFO L280 TraceCheckUtils]: 31: Hoare triple {13919#true} havoc ~lk7~0; {13919#true} is VALID [2020-07-08 22:16:23,811 INFO L280 TraceCheckUtils]: 32: Hoare triple {13919#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {13919#true} is VALID [2020-07-08 22:16:23,811 INFO L280 TraceCheckUtils]: 33: Hoare triple {13919#true} ~p8~0 := #t~nondet7; {13919#true} is VALID [2020-07-08 22:16:23,811 INFO L280 TraceCheckUtils]: 34: Hoare triple {13919#true} havoc #t~nondet7; {13919#true} is VALID [2020-07-08 22:16:23,811 INFO L280 TraceCheckUtils]: 35: Hoare triple {13919#true} havoc ~lk8~0; {13919#true} is VALID [2020-07-08 22:16:23,811 INFO L280 TraceCheckUtils]: 36: Hoare triple {13919#true} havoc ~cond~0; {13919#true} is VALID [2020-07-08 22:16:23,811 INFO L280 TraceCheckUtils]: 37: Hoare triple {13919#true} assume !false; {13919#true} is VALID [2020-07-08 22:16:23,811 INFO L280 TraceCheckUtils]: 38: Hoare triple {13919#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {13919#true} is VALID [2020-07-08 22:16:23,812 INFO L280 TraceCheckUtils]: 39: Hoare triple {13919#true} ~cond~0 := #t~nondet8; {13919#true} is VALID [2020-07-08 22:16:23,812 INFO L280 TraceCheckUtils]: 40: Hoare triple {13919#true} havoc #t~nondet8; {13919#true} is VALID [2020-07-08 22:16:23,812 INFO L280 TraceCheckUtils]: 41: Hoare triple {13919#true} assume !(0 == ~cond~0); {13919#true} is VALID [2020-07-08 22:16:23,812 INFO L280 TraceCheckUtils]: 42: Hoare triple {13919#true} ~lk1~0 := 0; {13919#true} is VALID [2020-07-08 22:16:23,812 INFO L280 TraceCheckUtils]: 43: Hoare triple {13919#true} ~lk2~0 := 0; {13919#true} is VALID [2020-07-08 22:16:23,812 INFO L280 TraceCheckUtils]: 44: Hoare triple {13919#true} ~lk3~0 := 0; {13919#true} is VALID [2020-07-08 22:16:23,813 INFO L280 TraceCheckUtils]: 45: Hoare triple {13919#true} ~lk4~0 := 0; {13919#true} is VALID [2020-07-08 22:16:23,813 INFO L280 TraceCheckUtils]: 46: Hoare triple {13919#true} ~lk5~0 := 0; {13919#true} is VALID [2020-07-08 22:16:23,813 INFO L280 TraceCheckUtils]: 47: Hoare triple {13919#true} ~lk6~0 := 0; {13919#true} is VALID [2020-07-08 22:16:23,813 INFO L280 TraceCheckUtils]: 48: Hoare triple {13919#true} ~lk7~0 := 0; {13919#true} is VALID [2020-07-08 22:16:23,813 INFO L280 TraceCheckUtils]: 49: Hoare triple {13919#true} ~lk8~0 := 0; {13919#true} is VALID [2020-07-08 22:16:23,814 INFO L280 TraceCheckUtils]: 50: Hoare triple {13919#true} assume !(0 != ~p1~0); {13919#true} is VALID [2020-07-08 22:16:23,814 INFO L280 TraceCheckUtils]: 51: Hoare triple {13919#true} assume !(0 != ~p2~0); {13919#true} is VALID [2020-07-08 22:16:23,814 INFO L280 TraceCheckUtils]: 52: Hoare triple {13919#true} assume 0 != ~p3~0; {13919#true} is VALID [2020-07-08 22:16:23,819 INFO L280 TraceCheckUtils]: 53: Hoare triple {13919#true} ~lk3~0 := 1; {13923#(= 1 main_~lk3~0)} is VALID [2020-07-08 22:16:23,821 INFO L280 TraceCheckUtils]: 54: Hoare triple {13923#(= 1 main_~lk3~0)} assume !(0 != ~p4~0); {13923#(= 1 main_~lk3~0)} is VALID [2020-07-08 22:16:23,821 INFO L280 TraceCheckUtils]: 55: Hoare triple {13923#(= 1 main_~lk3~0)} assume !(0 != ~p5~0); {13923#(= 1 main_~lk3~0)} is VALID [2020-07-08 22:16:23,822 INFO L280 TraceCheckUtils]: 56: Hoare triple {13923#(= 1 main_~lk3~0)} assume !(0 != ~p6~0); {13923#(= 1 main_~lk3~0)} is VALID [2020-07-08 22:16:23,822 INFO L280 TraceCheckUtils]: 57: Hoare triple {13923#(= 1 main_~lk3~0)} assume !(0 != ~p7~0); {13923#(= 1 main_~lk3~0)} is VALID [2020-07-08 22:16:23,822 INFO L280 TraceCheckUtils]: 58: Hoare triple {13923#(= 1 main_~lk3~0)} assume !(0 != ~p8~0); {13923#(= 1 main_~lk3~0)} is VALID [2020-07-08 22:16:23,823 INFO L280 TraceCheckUtils]: 59: Hoare triple {13923#(= 1 main_~lk3~0)} assume !(0 != ~p1~0); {13923#(= 1 main_~lk3~0)} is VALID [2020-07-08 22:16:23,823 INFO L280 TraceCheckUtils]: 60: Hoare triple {13923#(= 1 main_~lk3~0)} assume !(0 != ~p2~0); {13923#(= 1 main_~lk3~0)} is VALID [2020-07-08 22:16:23,824 INFO L280 TraceCheckUtils]: 61: Hoare triple {13923#(= 1 main_~lk3~0)} assume 0 != ~p3~0; {13923#(= 1 main_~lk3~0)} is VALID [2020-07-08 22:16:23,824 INFO L280 TraceCheckUtils]: 62: Hoare triple {13923#(= 1 main_~lk3~0)} assume 1 != ~lk3~0; {13920#false} is VALID [2020-07-08 22:16:23,825 INFO L280 TraceCheckUtils]: 63: Hoare triple {13920#false} assume !false; {13920#false} is VALID [2020-07-08 22:16:23,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 22:16:23,827 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1708681815] [2020-07-08 22:16:23,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:16:23,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 22:16:23,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264131506] [2020-07-08 22:16:23,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-07-08 22:16:23,828 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:16:23,829 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 22:16:23,885 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:16:23,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 22:16:23,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:16:23,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 22:16:23,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 22:16:23,887 INFO L87 Difference]: Start difference. First operand 791 states and 1062 transitions. Second operand 3 states. [2020-07-08 22:16:25,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:16:25,731 INFO L93 Difference]: Finished difference Result 971 states and 1312 transitions. [2020-07-08 22:16:25,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 22:16:25,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-07-08 22:16:25,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:16:25,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 22:16:25,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2020-07-08 22:16:25,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 22:16:25,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2020-07-08 22:16:25,735 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 172 transitions. [2020-07-08 22:16:25,926 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:16:26,025 INFO L225 Difference]: With dead ends: 971 [2020-07-08 22:16:26,025 INFO L226 Difference]: Without dead ends: 969 [2020-07-08 22:16:26,027 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 22:16:26,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2020-07-08 22:16:27,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 791. [2020-07-08 22:16:27,330 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:16:27,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 969 states. Second operand 791 states. [2020-07-08 22:16:27,330 INFO L74 IsIncluded]: Start isIncluded. First operand 969 states. Second operand 791 states. [2020-07-08 22:16:27,331 INFO L87 Difference]: Start difference. First operand 969 states. Second operand 791 states. [2020-07-08 22:16:27,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:16:27,384 INFO L93 Difference]: Finished difference Result 969 states and 1303 transitions. [2020-07-08 22:16:27,384 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1303 transitions. [2020-07-08 22:16:27,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:16:27,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:16:27,386 INFO L74 IsIncluded]: Start isIncluded. First operand 791 states. Second operand 969 states. [2020-07-08 22:16:27,387 INFO L87 Difference]: Start difference. First operand 791 states. Second operand 969 states. [2020-07-08 22:16:27,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:16:27,443 INFO L93 Difference]: Finished difference Result 969 states and 1303 transitions. [2020-07-08 22:16:27,443 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1303 transitions. [2020-07-08 22:16:27,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:16:27,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:16:27,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:16:27,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:16:27,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-07-08 22:16:27,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1054 transitions. [2020-07-08 22:16:27,493 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1054 transitions. Word has length 64 [2020-07-08 22:16:27,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:16:27,493 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 1054 transitions. [2020-07-08 22:16:27,493 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 22:16:27,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 791 states and 1054 transitions. [2020-07-08 22:16:28,699 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 1054 edges. 1054 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:16:28,700 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1054 transitions. [2020-07-08 22:16:28,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-08 22:16:28,701 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:16:28,701 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:16:28,701 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-08 22:16:28,702 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:16:28,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:16:28,702 INFO L82 PathProgramCache]: Analyzing trace with hash 628943709, now seen corresponding path program 1 times [2020-07-08 22:16:28,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:16:28,703 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [625391426] [2020-07-08 22:16:28,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:16:28,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:16:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:16:28,754 INFO L280 TraceCheckUtils]: 0: Hoare triple {19388#true} assume true; {19388#true} is VALID [2020-07-08 22:16:28,754 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {19388#true} {19388#true} #223#return; {19388#true} is VALID [2020-07-08 22:16:28,754 INFO L263 TraceCheckUtils]: 0: Hoare triple {19388#true} call ULTIMATE.init(); {19388#true} is VALID [2020-07-08 22:16:28,754 INFO L280 TraceCheckUtils]: 1: Hoare triple {19388#true} assume true; {19388#true} is VALID [2020-07-08 22:16:28,755 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {19388#true} {19388#true} #223#return; {19388#true} is VALID [2020-07-08 22:16:28,755 INFO L263 TraceCheckUtils]: 3: Hoare triple {19388#true} call #t~ret9 := main(); {19388#true} is VALID [2020-07-08 22:16:28,755 INFO L280 TraceCheckUtils]: 4: Hoare triple {19388#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {19388#true} is VALID [2020-07-08 22:16:28,755 INFO L280 TraceCheckUtils]: 5: Hoare triple {19388#true} ~p1~0 := #t~nondet0; {19388#true} is VALID [2020-07-08 22:16:28,755 INFO L280 TraceCheckUtils]: 6: Hoare triple {19388#true} havoc #t~nondet0; {19388#true} is VALID [2020-07-08 22:16:28,756 INFO L280 TraceCheckUtils]: 7: Hoare triple {19388#true} havoc ~lk1~0; {19388#true} is VALID [2020-07-08 22:16:28,756 INFO L280 TraceCheckUtils]: 8: Hoare triple {19388#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {19388#true} is VALID [2020-07-08 22:16:28,756 INFO L280 TraceCheckUtils]: 9: Hoare triple {19388#true} ~p2~0 := #t~nondet1; {19388#true} is VALID [2020-07-08 22:16:28,756 INFO L280 TraceCheckUtils]: 10: Hoare triple {19388#true} havoc #t~nondet1; {19388#true} is VALID [2020-07-08 22:16:28,756 INFO L280 TraceCheckUtils]: 11: Hoare triple {19388#true} havoc ~lk2~0; {19388#true} is VALID [2020-07-08 22:16:28,756 INFO L280 TraceCheckUtils]: 12: Hoare triple {19388#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {19388#true} is VALID [2020-07-08 22:16:28,756 INFO L280 TraceCheckUtils]: 13: Hoare triple {19388#true} ~p3~0 := #t~nondet2; {19388#true} is VALID [2020-07-08 22:16:28,756 INFO L280 TraceCheckUtils]: 14: Hoare triple {19388#true} havoc #t~nondet2; {19388#true} is VALID [2020-07-08 22:16:28,757 INFO L280 TraceCheckUtils]: 15: Hoare triple {19388#true} havoc ~lk3~0; {19388#true} is VALID [2020-07-08 22:16:28,757 INFO L280 TraceCheckUtils]: 16: Hoare triple {19388#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {19388#true} is VALID [2020-07-08 22:16:28,757 INFO L280 TraceCheckUtils]: 17: Hoare triple {19388#true} ~p4~0 := #t~nondet3; {19388#true} is VALID [2020-07-08 22:16:28,757 INFO L280 TraceCheckUtils]: 18: Hoare triple {19388#true} havoc #t~nondet3; {19388#true} is VALID [2020-07-08 22:16:28,757 INFO L280 TraceCheckUtils]: 19: Hoare triple {19388#true} havoc ~lk4~0; {19388#true} is VALID [2020-07-08 22:16:28,757 INFO L280 TraceCheckUtils]: 20: Hoare triple {19388#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {19388#true} is VALID [2020-07-08 22:16:28,757 INFO L280 TraceCheckUtils]: 21: Hoare triple {19388#true} ~p5~0 := #t~nondet4; {19388#true} is VALID [2020-07-08 22:16:28,758 INFO L280 TraceCheckUtils]: 22: Hoare triple {19388#true} havoc #t~nondet4; {19388#true} is VALID [2020-07-08 22:16:28,758 INFO L280 TraceCheckUtils]: 23: Hoare triple {19388#true} havoc ~lk5~0; {19388#true} is VALID [2020-07-08 22:16:28,758 INFO L280 TraceCheckUtils]: 24: Hoare triple {19388#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {19388#true} is VALID [2020-07-08 22:16:28,758 INFO L280 TraceCheckUtils]: 25: Hoare triple {19388#true} ~p6~0 := #t~nondet5; {19388#true} is VALID [2020-07-08 22:16:28,758 INFO L280 TraceCheckUtils]: 26: Hoare triple {19388#true} havoc #t~nondet5; {19388#true} is VALID [2020-07-08 22:16:28,758 INFO L280 TraceCheckUtils]: 27: Hoare triple {19388#true} havoc ~lk6~0; {19388#true} is VALID [2020-07-08 22:16:28,759 INFO L280 TraceCheckUtils]: 28: Hoare triple {19388#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {19388#true} is VALID [2020-07-08 22:16:28,759 INFO L280 TraceCheckUtils]: 29: Hoare triple {19388#true} ~p7~0 := #t~nondet6; {19388#true} is VALID [2020-07-08 22:16:28,759 INFO L280 TraceCheckUtils]: 30: Hoare triple {19388#true} havoc #t~nondet6; {19388#true} is VALID [2020-07-08 22:16:28,759 INFO L280 TraceCheckUtils]: 31: Hoare triple {19388#true} havoc ~lk7~0; {19388#true} is VALID [2020-07-08 22:16:28,759 INFO L280 TraceCheckUtils]: 32: Hoare triple {19388#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {19388#true} is VALID [2020-07-08 22:16:28,759 INFO L280 TraceCheckUtils]: 33: Hoare triple {19388#true} ~p8~0 := #t~nondet7; {19388#true} is VALID [2020-07-08 22:16:28,760 INFO L280 TraceCheckUtils]: 34: Hoare triple {19388#true} havoc #t~nondet7; {19388#true} is VALID [2020-07-08 22:16:28,760 INFO L280 TraceCheckUtils]: 35: Hoare triple {19388#true} havoc ~lk8~0; {19388#true} is VALID [2020-07-08 22:16:28,760 INFO L280 TraceCheckUtils]: 36: Hoare triple {19388#true} havoc ~cond~0; {19388#true} is VALID [2020-07-08 22:16:28,760 INFO L280 TraceCheckUtils]: 37: Hoare triple {19388#true} assume !false; {19388#true} is VALID [2020-07-08 22:16:28,760 INFO L280 TraceCheckUtils]: 38: Hoare triple {19388#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {19388#true} is VALID [2020-07-08 22:16:28,761 INFO L280 TraceCheckUtils]: 39: Hoare triple {19388#true} ~cond~0 := #t~nondet8; {19388#true} is VALID [2020-07-08 22:16:28,761 INFO L280 TraceCheckUtils]: 40: Hoare triple {19388#true} havoc #t~nondet8; {19388#true} is VALID [2020-07-08 22:16:28,761 INFO L280 TraceCheckUtils]: 41: Hoare triple {19388#true} assume !(0 == ~cond~0); {19388#true} is VALID [2020-07-08 22:16:28,761 INFO L280 TraceCheckUtils]: 42: Hoare triple {19388#true} ~lk1~0 := 0; {19388#true} is VALID [2020-07-08 22:16:28,761 INFO L280 TraceCheckUtils]: 43: Hoare triple {19388#true} ~lk2~0 := 0; {19388#true} is VALID [2020-07-08 22:16:28,761 INFO L280 TraceCheckUtils]: 44: Hoare triple {19388#true} ~lk3~0 := 0; {19388#true} is VALID [2020-07-08 22:16:28,762 INFO L280 TraceCheckUtils]: 45: Hoare triple {19388#true} ~lk4~0 := 0; {19388#true} is VALID [2020-07-08 22:16:28,762 INFO L280 TraceCheckUtils]: 46: Hoare triple {19388#true} ~lk5~0 := 0; {19388#true} is VALID [2020-07-08 22:16:28,762 INFO L280 TraceCheckUtils]: 47: Hoare triple {19388#true} ~lk6~0 := 0; {19388#true} is VALID [2020-07-08 22:16:28,762 INFO L280 TraceCheckUtils]: 48: Hoare triple {19388#true} ~lk7~0 := 0; {19388#true} is VALID [2020-07-08 22:16:28,762 INFO L280 TraceCheckUtils]: 49: Hoare triple {19388#true} ~lk8~0 := 0; {19388#true} is VALID [2020-07-08 22:16:28,763 INFO L280 TraceCheckUtils]: 50: Hoare triple {19388#true} assume !(0 != ~p1~0); {19388#true} is VALID [2020-07-08 22:16:28,763 INFO L280 TraceCheckUtils]: 51: Hoare triple {19388#true} assume !(0 != ~p2~0); {19388#true} is VALID [2020-07-08 22:16:28,763 INFO L280 TraceCheckUtils]: 52: Hoare triple {19388#true} assume !(0 != ~p3~0); {19388#true} is VALID [2020-07-08 22:16:28,763 INFO L280 TraceCheckUtils]: 53: Hoare triple {19388#true} assume 0 != ~p4~0; {19388#true} is VALID [2020-07-08 22:16:28,764 INFO L280 TraceCheckUtils]: 54: Hoare triple {19388#true} ~lk4~0 := 1; {19392#(= 1 main_~lk4~0)} is VALID [2020-07-08 22:16:28,764 INFO L280 TraceCheckUtils]: 55: Hoare triple {19392#(= 1 main_~lk4~0)} assume !(0 != ~p5~0); {19392#(= 1 main_~lk4~0)} is VALID [2020-07-08 22:16:28,765 INFO L280 TraceCheckUtils]: 56: Hoare triple {19392#(= 1 main_~lk4~0)} assume !(0 != ~p6~0); {19392#(= 1 main_~lk4~0)} is VALID [2020-07-08 22:16:28,765 INFO L280 TraceCheckUtils]: 57: Hoare triple {19392#(= 1 main_~lk4~0)} assume !(0 != ~p7~0); {19392#(= 1 main_~lk4~0)} is VALID [2020-07-08 22:16:28,767 INFO L280 TraceCheckUtils]: 58: Hoare triple {19392#(= 1 main_~lk4~0)} assume !(0 != ~p8~0); {19392#(= 1 main_~lk4~0)} is VALID [2020-07-08 22:16:28,770 INFO L280 TraceCheckUtils]: 59: Hoare triple {19392#(= 1 main_~lk4~0)} assume !(0 != ~p1~0); {19392#(= 1 main_~lk4~0)} is VALID [2020-07-08 22:16:28,772 INFO L280 TraceCheckUtils]: 60: Hoare triple {19392#(= 1 main_~lk4~0)} assume !(0 != ~p2~0); {19392#(= 1 main_~lk4~0)} is VALID [2020-07-08 22:16:28,773 INFO L280 TraceCheckUtils]: 61: Hoare triple {19392#(= 1 main_~lk4~0)} assume !(0 != ~p3~0); {19392#(= 1 main_~lk4~0)} is VALID [2020-07-08 22:16:28,773 INFO L280 TraceCheckUtils]: 62: Hoare triple {19392#(= 1 main_~lk4~0)} assume 0 != ~p4~0; {19392#(= 1 main_~lk4~0)} is VALID [2020-07-08 22:16:28,774 INFO L280 TraceCheckUtils]: 63: Hoare triple {19392#(= 1 main_~lk4~0)} assume 1 != ~lk4~0; {19389#false} is VALID [2020-07-08 22:16:28,774 INFO L280 TraceCheckUtils]: 64: Hoare triple {19389#false} assume !false; {19389#false} is VALID [2020-07-08 22:16:28,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 22:16:28,777 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [625391426] [2020-07-08 22:16:28,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:16:28,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 22:16:28,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257070693] [2020-07-08 22:16:28,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-07-08 22:16:28,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:16:28,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 22:16:28,834 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:16:28,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 22:16:28,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:16:28,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 22:16:28,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 22:16:28,835 INFO L87 Difference]: Start difference. First operand 791 states and 1054 transitions. Second operand 3 states. [2020-07-08 22:16:30,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:16:30,744 INFO L93 Difference]: Finished difference Result 963 states and 1288 transitions. [2020-07-08 22:16:30,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 22:16:30,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-07-08 22:16:30,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:16:30,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 22:16:30,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-08 22:16:30,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 22:16:30,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-08 22:16:30,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 168 transitions. [2020-07-08 22:16:30,886 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:16:30,957 INFO L225 Difference]: With dead ends: 963 [2020-07-08 22:16:30,958 INFO L226 Difference]: Without dead ends: 961 [2020-07-08 22:16:30,958 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 22:16:30,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2020-07-08 22:16:32,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 791. [2020-07-08 22:16:32,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:16:32,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 961 states. Second operand 791 states. [2020-07-08 22:16:32,345 INFO L74 IsIncluded]: Start isIncluded. First operand 961 states. Second operand 791 states. [2020-07-08 22:16:32,345 INFO L87 Difference]: Start difference. First operand 961 states. Second operand 791 states. [2020-07-08 22:16:32,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:16:32,397 INFO L93 Difference]: Finished difference Result 961 states and 1279 transitions. [2020-07-08 22:16:32,397 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1279 transitions. [2020-07-08 22:16:32,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:16:32,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:16:32,400 INFO L74 IsIncluded]: Start isIncluded. First operand 791 states. Second operand 961 states. [2020-07-08 22:16:32,400 INFO L87 Difference]: Start difference. First operand 791 states. Second operand 961 states. [2020-07-08 22:16:32,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:16:32,454 INFO L93 Difference]: Finished difference Result 961 states and 1279 transitions. [2020-07-08 22:16:32,454 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1279 transitions. [2020-07-08 22:16:32,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:16:32,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:16:32,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:16:32,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:16:32,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-07-08 22:16:32,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1046 transitions. [2020-07-08 22:16:32,500 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1046 transitions. Word has length 65 [2020-07-08 22:16:32,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:16:32,501 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 1046 transitions. [2020-07-08 22:16:32,501 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 22:16:32,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 791 states and 1046 transitions. [2020-07-08 22:16:33,703 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 1046 edges. 1046 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:16:33,704 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1046 transitions. [2020-07-08 22:16:33,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-08 22:16:33,705 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:16:33,706 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:16:33,706 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-08 22:16:33,706 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:16:33,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:16:33,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1684460868, now seen corresponding path program 1 times [2020-07-08 22:16:33,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:16:33,707 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [938351203] [2020-07-08 22:16:33,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:16:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:16:33,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:16:33,774 INFO L280 TraceCheckUtils]: 0: Hoare triple {24825#true} assume true; {24825#true} is VALID [2020-07-08 22:16:33,775 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {24825#true} {24825#true} #223#return; {24825#true} is VALID [2020-07-08 22:16:33,775 INFO L263 TraceCheckUtils]: 0: Hoare triple {24825#true} call ULTIMATE.init(); {24825#true} is VALID [2020-07-08 22:16:33,775 INFO L280 TraceCheckUtils]: 1: Hoare triple {24825#true} assume true; {24825#true} is VALID [2020-07-08 22:16:33,775 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {24825#true} {24825#true} #223#return; {24825#true} is VALID [2020-07-08 22:16:33,776 INFO L263 TraceCheckUtils]: 3: Hoare triple {24825#true} call #t~ret9 := main(); {24825#true} is VALID [2020-07-08 22:16:33,776 INFO L280 TraceCheckUtils]: 4: Hoare triple {24825#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {24825#true} is VALID [2020-07-08 22:16:33,776 INFO L280 TraceCheckUtils]: 5: Hoare triple {24825#true} ~p1~0 := #t~nondet0; {24825#true} is VALID [2020-07-08 22:16:33,776 INFO L280 TraceCheckUtils]: 6: Hoare triple {24825#true} havoc #t~nondet0; {24825#true} is VALID [2020-07-08 22:16:33,776 INFO L280 TraceCheckUtils]: 7: Hoare triple {24825#true} havoc ~lk1~0; {24825#true} is VALID [2020-07-08 22:16:33,776 INFO L280 TraceCheckUtils]: 8: Hoare triple {24825#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {24825#true} is VALID [2020-07-08 22:16:33,777 INFO L280 TraceCheckUtils]: 9: Hoare triple {24825#true} ~p2~0 := #t~nondet1; {24825#true} is VALID [2020-07-08 22:16:33,777 INFO L280 TraceCheckUtils]: 10: Hoare triple {24825#true} havoc #t~nondet1; {24825#true} is VALID [2020-07-08 22:16:33,777 INFO L280 TraceCheckUtils]: 11: Hoare triple {24825#true} havoc ~lk2~0; {24825#true} is VALID [2020-07-08 22:16:33,777 INFO L280 TraceCheckUtils]: 12: Hoare triple {24825#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {24825#true} is VALID [2020-07-08 22:16:33,777 INFO L280 TraceCheckUtils]: 13: Hoare triple {24825#true} ~p3~0 := #t~nondet2; {24825#true} is VALID [2020-07-08 22:16:33,777 INFO L280 TraceCheckUtils]: 14: Hoare triple {24825#true} havoc #t~nondet2; {24825#true} is VALID [2020-07-08 22:16:33,778 INFO L280 TraceCheckUtils]: 15: Hoare triple {24825#true} havoc ~lk3~0; {24825#true} is VALID [2020-07-08 22:16:33,778 INFO L280 TraceCheckUtils]: 16: Hoare triple {24825#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {24825#true} is VALID [2020-07-08 22:16:33,778 INFO L280 TraceCheckUtils]: 17: Hoare triple {24825#true} ~p4~0 := #t~nondet3; {24825#true} is VALID [2020-07-08 22:16:33,778 INFO L280 TraceCheckUtils]: 18: Hoare triple {24825#true} havoc #t~nondet3; {24825#true} is VALID [2020-07-08 22:16:33,778 INFO L280 TraceCheckUtils]: 19: Hoare triple {24825#true} havoc ~lk4~0; {24825#true} is VALID [2020-07-08 22:16:33,779 INFO L280 TraceCheckUtils]: 20: Hoare triple {24825#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {24825#true} is VALID [2020-07-08 22:16:33,779 INFO L280 TraceCheckUtils]: 21: Hoare triple {24825#true} ~p5~0 := #t~nondet4; {24825#true} is VALID [2020-07-08 22:16:33,779 INFO L280 TraceCheckUtils]: 22: Hoare triple {24825#true} havoc #t~nondet4; {24825#true} is VALID [2020-07-08 22:16:33,779 INFO L280 TraceCheckUtils]: 23: Hoare triple {24825#true} havoc ~lk5~0; {24825#true} is VALID [2020-07-08 22:16:33,779 INFO L280 TraceCheckUtils]: 24: Hoare triple {24825#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {24825#true} is VALID [2020-07-08 22:16:33,779 INFO L280 TraceCheckUtils]: 25: Hoare triple {24825#true} ~p6~0 := #t~nondet5; {24825#true} is VALID [2020-07-08 22:16:33,780 INFO L280 TraceCheckUtils]: 26: Hoare triple {24825#true} havoc #t~nondet5; {24825#true} is VALID [2020-07-08 22:16:33,780 INFO L280 TraceCheckUtils]: 27: Hoare triple {24825#true} havoc ~lk6~0; {24825#true} is VALID [2020-07-08 22:16:33,780 INFO L280 TraceCheckUtils]: 28: Hoare triple {24825#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {24825#true} is VALID [2020-07-08 22:16:33,780 INFO L280 TraceCheckUtils]: 29: Hoare triple {24825#true} ~p7~0 := #t~nondet6; {24825#true} is VALID [2020-07-08 22:16:33,780 INFO L280 TraceCheckUtils]: 30: Hoare triple {24825#true} havoc #t~nondet6; {24825#true} is VALID [2020-07-08 22:16:33,780 INFO L280 TraceCheckUtils]: 31: Hoare triple {24825#true} havoc ~lk7~0; {24825#true} is VALID [2020-07-08 22:16:33,781 INFO L280 TraceCheckUtils]: 32: Hoare triple {24825#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {24825#true} is VALID [2020-07-08 22:16:33,781 INFO L280 TraceCheckUtils]: 33: Hoare triple {24825#true} ~p8~0 := #t~nondet7; {24825#true} is VALID [2020-07-08 22:16:33,781 INFO L280 TraceCheckUtils]: 34: Hoare triple {24825#true} havoc #t~nondet7; {24825#true} is VALID [2020-07-08 22:16:33,781 INFO L280 TraceCheckUtils]: 35: Hoare triple {24825#true} havoc ~lk8~0; {24825#true} is VALID [2020-07-08 22:16:33,781 INFO L280 TraceCheckUtils]: 36: Hoare triple {24825#true} havoc ~cond~0; {24825#true} is VALID [2020-07-08 22:16:33,781 INFO L280 TraceCheckUtils]: 37: Hoare triple {24825#true} assume !false; {24825#true} is VALID [2020-07-08 22:16:33,782 INFO L280 TraceCheckUtils]: 38: Hoare triple {24825#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {24825#true} is VALID [2020-07-08 22:16:33,782 INFO L280 TraceCheckUtils]: 39: Hoare triple {24825#true} ~cond~0 := #t~nondet8; {24825#true} is VALID [2020-07-08 22:16:33,782 INFO L280 TraceCheckUtils]: 40: Hoare triple {24825#true} havoc #t~nondet8; {24825#true} is VALID [2020-07-08 22:16:33,782 INFO L280 TraceCheckUtils]: 41: Hoare triple {24825#true} assume !(0 == ~cond~0); {24825#true} is VALID [2020-07-08 22:16:33,782 INFO L280 TraceCheckUtils]: 42: Hoare triple {24825#true} ~lk1~0 := 0; {24825#true} is VALID [2020-07-08 22:16:33,782 INFO L280 TraceCheckUtils]: 43: Hoare triple {24825#true} ~lk2~0 := 0; {24825#true} is VALID [2020-07-08 22:16:33,783 INFO L280 TraceCheckUtils]: 44: Hoare triple {24825#true} ~lk3~0 := 0; {24825#true} is VALID [2020-07-08 22:16:33,783 INFO L280 TraceCheckUtils]: 45: Hoare triple {24825#true} ~lk4~0 := 0; {24825#true} is VALID [2020-07-08 22:16:33,783 INFO L280 TraceCheckUtils]: 46: Hoare triple {24825#true} ~lk5~0 := 0; {24825#true} is VALID [2020-07-08 22:16:33,783 INFO L280 TraceCheckUtils]: 47: Hoare triple {24825#true} ~lk6~0 := 0; {24825#true} is VALID [2020-07-08 22:16:33,783 INFO L280 TraceCheckUtils]: 48: Hoare triple {24825#true} ~lk7~0 := 0; {24825#true} is VALID [2020-07-08 22:16:33,783 INFO L280 TraceCheckUtils]: 49: Hoare triple {24825#true} ~lk8~0 := 0; {24825#true} is VALID [2020-07-08 22:16:33,784 INFO L280 TraceCheckUtils]: 50: Hoare triple {24825#true} assume !(0 != ~p1~0); {24825#true} is VALID [2020-07-08 22:16:33,784 INFO L280 TraceCheckUtils]: 51: Hoare triple {24825#true} assume !(0 != ~p2~0); {24825#true} is VALID [2020-07-08 22:16:33,784 INFO L280 TraceCheckUtils]: 52: Hoare triple {24825#true} assume !(0 != ~p3~0); {24825#true} is VALID [2020-07-08 22:16:33,784 INFO L280 TraceCheckUtils]: 53: Hoare triple {24825#true} assume !(0 != ~p4~0); {24825#true} is VALID [2020-07-08 22:16:33,785 INFO L280 TraceCheckUtils]: 54: Hoare triple {24825#true} assume !(0 != ~p5~0); {24829#(= 0 main_~p5~0)} is VALID [2020-07-08 22:16:33,785 INFO L280 TraceCheckUtils]: 55: Hoare triple {24829#(= 0 main_~p5~0)} assume !(0 != ~p6~0); {24829#(= 0 main_~p5~0)} is VALID [2020-07-08 22:16:33,786 INFO L280 TraceCheckUtils]: 56: Hoare triple {24829#(= 0 main_~p5~0)} assume !(0 != ~p7~0); {24829#(= 0 main_~p5~0)} is VALID [2020-07-08 22:16:33,786 INFO L280 TraceCheckUtils]: 57: Hoare triple {24829#(= 0 main_~p5~0)} assume !(0 != ~p8~0); {24829#(= 0 main_~p5~0)} is VALID [2020-07-08 22:16:33,787 INFO L280 TraceCheckUtils]: 58: Hoare triple {24829#(= 0 main_~p5~0)} assume !(0 != ~p1~0); {24829#(= 0 main_~p5~0)} is VALID [2020-07-08 22:16:33,787 INFO L280 TraceCheckUtils]: 59: Hoare triple {24829#(= 0 main_~p5~0)} assume !(0 != ~p2~0); {24829#(= 0 main_~p5~0)} is VALID [2020-07-08 22:16:33,788 INFO L280 TraceCheckUtils]: 60: Hoare triple {24829#(= 0 main_~p5~0)} assume !(0 != ~p3~0); {24829#(= 0 main_~p5~0)} is VALID [2020-07-08 22:16:33,788 INFO L280 TraceCheckUtils]: 61: Hoare triple {24829#(= 0 main_~p5~0)} assume !(0 != ~p4~0); {24829#(= 0 main_~p5~0)} is VALID [2020-07-08 22:16:33,789 INFO L280 TraceCheckUtils]: 62: Hoare triple {24829#(= 0 main_~p5~0)} assume 0 != ~p5~0; {24826#false} is VALID [2020-07-08 22:16:33,789 INFO L280 TraceCheckUtils]: 63: Hoare triple {24826#false} assume 1 != ~lk5~0; {24826#false} is VALID [2020-07-08 22:16:33,789 INFO L280 TraceCheckUtils]: 64: Hoare triple {24826#false} assume !false; {24826#false} is VALID [2020-07-08 22:16:33,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 22:16:33,792 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [938351203] [2020-07-08 22:16:33,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:16:33,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 22:16:33,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641711835] [2020-07-08 22:16:33,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-07-08 22:16:33,793 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:16:33,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 22:16:33,850 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:16:33,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 22:16:33,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:16:33,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 22:16:33,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 22:16:33,851 INFO L87 Difference]: Start difference. First operand 791 states and 1046 transitions. Second operand 3 states. [2020-07-08 22:16:37,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:16:37,443 INFO L93 Difference]: Finished difference Result 2251 states and 3000 transitions. [2020-07-08 22:16:37,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 22:16:37,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-07-08 22:16:37,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:16:37,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 22:16:37,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 255 transitions. [2020-07-08 22:16:37,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 22:16:37,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 255 transitions. [2020-07-08 22:16:37,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 255 transitions. [2020-07-08 22:16:37,646 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 255 edges. 255 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:16:37,732 INFO L225 Difference]: With dead ends: 2251 [2020-07-08 22:16:37,732 INFO L226 Difference]: Without dead ends: 1497 [2020-07-08 22:16:37,734 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 22:16:37,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2020-07-08 22:16:40,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1495. [2020-07-08 22:16:40,782 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:16:40,783 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1497 states. Second operand 1495 states. [2020-07-08 22:16:40,783 INFO L74 IsIncluded]: Start isIncluded. First operand 1497 states. Second operand 1495 states. [2020-07-08 22:16:40,783 INFO L87 Difference]: Start difference. First operand 1497 states. Second operand 1495 states. [2020-07-08 22:16:40,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:16:40,850 INFO L93 Difference]: Finished difference Result 1497 states and 1959 transitions. [2020-07-08 22:16:40,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 1959 transitions. [2020-07-08 22:16:40,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:16:40,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:16:40,853 INFO L74 IsIncluded]: Start isIncluded. First operand 1495 states. Second operand 1497 states. [2020-07-08 22:16:40,853 INFO L87 Difference]: Start difference. First operand 1495 states. Second operand 1497 states. [2020-07-08 22:16:40,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:16:40,961 INFO L93 Difference]: Finished difference Result 1497 states and 1959 transitions. [2020-07-08 22:16:40,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 1959 transitions. [2020-07-08 22:16:40,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:16:40,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:16:40,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:16:40,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:16:40,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1495 states. [2020-07-08 22:16:41,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 1958 transitions. [2020-07-08 22:16:41,066 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 1958 transitions. Word has length 65 [2020-07-08 22:16:41,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:16:41,066 INFO L479 AbstractCegarLoop]: Abstraction has 1495 states and 1958 transitions. [2020-07-08 22:16:41,066 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 22:16:41,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 1495 states and 1958 transitions. [2020-07-08 22:16:43,470 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 1958 edges. 1958 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:16:43,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1958 transitions. [2020-07-08 22:16:43,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-08 22:16:43,472 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:16:43,473 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:16:43,473 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-08 22:16:43,473 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:16:43,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:16:43,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1510854248, now seen corresponding path program 1 times [2020-07-08 22:16:43,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:16:43,473 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1935498205] [2020-07-08 22:16:43,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:16:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:16:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:16:43,535 INFO L280 TraceCheckUtils]: 0: Hoare triple {35318#true} assume true; {35318#true} is VALID [2020-07-08 22:16:43,536 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {35318#true} {35318#true} #223#return; {35318#true} is VALID [2020-07-08 22:16:43,536 INFO L263 TraceCheckUtils]: 0: Hoare triple {35318#true} call ULTIMATE.init(); {35318#true} is VALID [2020-07-08 22:16:43,536 INFO L280 TraceCheckUtils]: 1: Hoare triple {35318#true} assume true; {35318#true} is VALID [2020-07-08 22:16:43,536 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {35318#true} {35318#true} #223#return; {35318#true} is VALID [2020-07-08 22:16:43,536 INFO L263 TraceCheckUtils]: 3: Hoare triple {35318#true} call #t~ret9 := main(); {35318#true} is VALID [2020-07-08 22:16:43,537 INFO L280 TraceCheckUtils]: 4: Hoare triple {35318#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {35318#true} is VALID [2020-07-08 22:16:43,537 INFO L280 TraceCheckUtils]: 5: Hoare triple {35318#true} ~p1~0 := #t~nondet0; {35318#true} is VALID [2020-07-08 22:16:43,537 INFO L280 TraceCheckUtils]: 6: Hoare triple {35318#true} havoc #t~nondet0; {35318#true} is VALID [2020-07-08 22:16:43,537 INFO L280 TraceCheckUtils]: 7: Hoare triple {35318#true} havoc ~lk1~0; {35318#true} is VALID [2020-07-08 22:16:43,537 INFO L280 TraceCheckUtils]: 8: Hoare triple {35318#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {35318#true} is VALID [2020-07-08 22:16:43,537 INFO L280 TraceCheckUtils]: 9: Hoare triple {35318#true} ~p2~0 := #t~nondet1; {35318#true} is VALID [2020-07-08 22:16:43,538 INFO L280 TraceCheckUtils]: 10: Hoare triple {35318#true} havoc #t~nondet1; {35318#true} is VALID [2020-07-08 22:16:43,538 INFO L280 TraceCheckUtils]: 11: Hoare triple {35318#true} havoc ~lk2~0; {35318#true} is VALID [2020-07-08 22:16:43,538 INFO L280 TraceCheckUtils]: 12: Hoare triple {35318#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {35318#true} is VALID [2020-07-08 22:16:43,538 INFO L280 TraceCheckUtils]: 13: Hoare triple {35318#true} ~p3~0 := #t~nondet2; {35318#true} is VALID [2020-07-08 22:16:43,538 INFO L280 TraceCheckUtils]: 14: Hoare triple {35318#true} havoc #t~nondet2; {35318#true} is VALID [2020-07-08 22:16:43,538 INFO L280 TraceCheckUtils]: 15: Hoare triple {35318#true} havoc ~lk3~0; {35318#true} is VALID [2020-07-08 22:16:43,539 INFO L280 TraceCheckUtils]: 16: Hoare triple {35318#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {35318#true} is VALID [2020-07-08 22:16:43,539 INFO L280 TraceCheckUtils]: 17: Hoare triple {35318#true} ~p4~0 := #t~nondet3; {35318#true} is VALID [2020-07-08 22:16:43,539 INFO L280 TraceCheckUtils]: 18: Hoare triple {35318#true} havoc #t~nondet3; {35318#true} is VALID [2020-07-08 22:16:43,539 INFO L280 TraceCheckUtils]: 19: Hoare triple {35318#true} havoc ~lk4~0; {35318#true} is VALID [2020-07-08 22:16:43,539 INFO L280 TraceCheckUtils]: 20: Hoare triple {35318#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {35318#true} is VALID [2020-07-08 22:16:43,540 INFO L280 TraceCheckUtils]: 21: Hoare triple {35318#true} ~p5~0 := #t~nondet4; {35318#true} is VALID [2020-07-08 22:16:43,540 INFO L280 TraceCheckUtils]: 22: Hoare triple {35318#true} havoc #t~nondet4; {35318#true} is VALID [2020-07-08 22:16:43,540 INFO L280 TraceCheckUtils]: 23: Hoare triple {35318#true} havoc ~lk5~0; {35318#true} is VALID [2020-07-08 22:16:43,540 INFO L280 TraceCheckUtils]: 24: Hoare triple {35318#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {35318#true} is VALID [2020-07-08 22:16:43,540 INFO L280 TraceCheckUtils]: 25: Hoare triple {35318#true} ~p6~0 := #t~nondet5; {35318#true} is VALID [2020-07-08 22:16:43,540 INFO L280 TraceCheckUtils]: 26: Hoare triple {35318#true} havoc #t~nondet5; {35318#true} is VALID [2020-07-08 22:16:43,541 INFO L280 TraceCheckUtils]: 27: Hoare triple {35318#true} havoc ~lk6~0; {35318#true} is VALID [2020-07-08 22:16:43,541 INFO L280 TraceCheckUtils]: 28: Hoare triple {35318#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {35318#true} is VALID [2020-07-08 22:16:43,541 INFO L280 TraceCheckUtils]: 29: Hoare triple {35318#true} ~p7~0 := #t~nondet6; {35318#true} is VALID [2020-07-08 22:16:43,541 INFO L280 TraceCheckUtils]: 30: Hoare triple {35318#true} havoc #t~nondet6; {35318#true} is VALID [2020-07-08 22:16:43,541 INFO L280 TraceCheckUtils]: 31: Hoare triple {35318#true} havoc ~lk7~0; {35318#true} is VALID [2020-07-08 22:16:43,541 INFO L280 TraceCheckUtils]: 32: Hoare triple {35318#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {35318#true} is VALID [2020-07-08 22:16:43,542 INFO L280 TraceCheckUtils]: 33: Hoare triple {35318#true} ~p8~0 := #t~nondet7; {35318#true} is VALID [2020-07-08 22:16:43,542 INFO L280 TraceCheckUtils]: 34: Hoare triple {35318#true} havoc #t~nondet7; {35318#true} is VALID [2020-07-08 22:16:43,542 INFO L280 TraceCheckUtils]: 35: Hoare triple {35318#true} havoc ~lk8~0; {35318#true} is VALID [2020-07-08 22:16:43,542 INFO L280 TraceCheckUtils]: 36: Hoare triple {35318#true} havoc ~cond~0; {35318#true} is VALID [2020-07-08 22:16:43,542 INFO L280 TraceCheckUtils]: 37: Hoare triple {35318#true} assume !false; {35318#true} is VALID [2020-07-08 22:16:43,542 INFO L280 TraceCheckUtils]: 38: Hoare triple {35318#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {35318#true} is VALID [2020-07-08 22:16:43,543 INFO L280 TraceCheckUtils]: 39: Hoare triple {35318#true} ~cond~0 := #t~nondet8; {35318#true} is VALID [2020-07-08 22:16:43,543 INFO L280 TraceCheckUtils]: 40: Hoare triple {35318#true} havoc #t~nondet8; {35318#true} is VALID [2020-07-08 22:16:43,543 INFO L280 TraceCheckUtils]: 41: Hoare triple {35318#true} assume !(0 == ~cond~0); {35318#true} is VALID [2020-07-08 22:16:43,543 INFO L280 TraceCheckUtils]: 42: Hoare triple {35318#true} ~lk1~0 := 0; {35318#true} is VALID [2020-07-08 22:16:43,543 INFO L280 TraceCheckUtils]: 43: Hoare triple {35318#true} ~lk2~0 := 0; {35318#true} is VALID [2020-07-08 22:16:43,543 INFO L280 TraceCheckUtils]: 44: Hoare triple {35318#true} ~lk3~0 := 0; {35318#true} is VALID [2020-07-08 22:16:43,544 INFO L280 TraceCheckUtils]: 45: Hoare triple {35318#true} ~lk4~0 := 0; {35318#true} is VALID [2020-07-08 22:16:43,544 INFO L280 TraceCheckUtils]: 46: Hoare triple {35318#true} ~lk5~0 := 0; {35318#true} is VALID [2020-07-08 22:16:43,544 INFO L280 TraceCheckUtils]: 47: Hoare triple {35318#true} ~lk6~0 := 0; {35318#true} is VALID [2020-07-08 22:16:43,544 INFO L280 TraceCheckUtils]: 48: Hoare triple {35318#true} ~lk7~0 := 0; {35318#true} is VALID [2020-07-08 22:16:43,544 INFO L280 TraceCheckUtils]: 49: Hoare triple {35318#true} ~lk8~0 := 0; {35318#true} is VALID [2020-07-08 22:16:43,544 INFO L280 TraceCheckUtils]: 50: Hoare triple {35318#true} assume !(0 != ~p1~0); {35318#true} is VALID [2020-07-08 22:16:43,545 INFO L280 TraceCheckUtils]: 51: Hoare triple {35318#true} assume !(0 != ~p2~0); {35318#true} is VALID [2020-07-08 22:16:43,545 INFO L280 TraceCheckUtils]: 52: Hoare triple {35318#true} assume !(0 != ~p3~0); {35318#true} is VALID [2020-07-08 22:16:43,545 INFO L280 TraceCheckUtils]: 53: Hoare triple {35318#true} assume !(0 != ~p4~0); {35318#true} is VALID [2020-07-08 22:16:43,545 INFO L280 TraceCheckUtils]: 54: Hoare triple {35318#true} assume 0 != ~p5~0; {35318#true} is VALID [2020-07-08 22:16:43,546 INFO L280 TraceCheckUtils]: 55: Hoare triple {35318#true} ~lk5~0 := 1; {35322#(= 1 main_~lk5~0)} is VALID [2020-07-08 22:16:43,546 INFO L280 TraceCheckUtils]: 56: Hoare triple {35322#(= 1 main_~lk5~0)} assume !(0 != ~p6~0); {35322#(= 1 main_~lk5~0)} is VALID [2020-07-08 22:16:43,547 INFO L280 TraceCheckUtils]: 57: Hoare triple {35322#(= 1 main_~lk5~0)} assume !(0 != ~p7~0); {35322#(= 1 main_~lk5~0)} is VALID [2020-07-08 22:16:43,547 INFO L280 TraceCheckUtils]: 58: Hoare triple {35322#(= 1 main_~lk5~0)} assume !(0 != ~p8~0); {35322#(= 1 main_~lk5~0)} is VALID [2020-07-08 22:16:43,548 INFO L280 TraceCheckUtils]: 59: Hoare triple {35322#(= 1 main_~lk5~0)} assume !(0 != ~p1~0); {35322#(= 1 main_~lk5~0)} is VALID [2020-07-08 22:16:43,548 INFO L280 TraceCheckUtils]: 60: Hoare triple {35322#(= 1 main_~lk5~0)} assume !(0 != ~p2~0); {35322#(= 1 main_~lk5~0)} is VALID [2020-07-08 22:16:43,549 INFO L280 TraceCheckUtils]: 61: Hoare triple {35322#(= 1 main_~lk5~0)} assume !(0 != ~p3~0); {35322#(= 1 main_~lk5~0)} is VALID [2020-07-08 22:16:43,549 INFO L280 TraceCheckUtils]: 62: Hoare triple {35322#(= 1 main_~lk5~0)} assume !(0 != ~p4~0); {35322#(= 1 main_~lk5~0)} is VALID [2020-07-08 22:16:43,550 INFO L280 TraceCheckUtils]: 63: Hoare triple {35322#(= 1 main_~lk5~0)} assume 0 != ~p5~0; {35322#(= 1 main_~lk5~0)} is VALID [2020-07-08 22:16:43,550 INFO L280 TraceCheckUtils]: 64: Hoare triple {35322#(= 1 main_~lk5~0)} assume 1 != ~lk5~0; {35319#false} is VALID [2020-07-08 22:16:43,550 INFO L280 TraceCheckUtils]: 65: Hoare triple {35319#false} assume !false; {35319#false} is VALID [2020-07-08 22:16:43,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 22:16:43,553 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1935498205] [2020-07-08 22:16:43,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:16:43,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 22:16:43,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924057450] [2020-07-08 22:16:43,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-08 22:16:43,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:16:43,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 22:16:43,602 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:16:43,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 22:16:43,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:16:43,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 22:16:43,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 22:16:43,603 INFO L87 Difference]: Start difference. First operand 1495 states and 1958 transitions. Second operand 3 states. [2020-07-08 22:16:47,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:16:47,837 INFO L93 Difference]: Finished difference Result 1803 states and 2360 transitions. [2020-07-08 22:16:47,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 22:16:47,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-08 22:16:47,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:16:47,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 22:16:47,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2020-07-08 22:16:47,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 22:16:47,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2020-07-08 22:16:47,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 164 transitions. [2020-07-08 22:16:47,991 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:16:48,102 INFO L225 Difference]: With dead ends: 1803 [2020-07-08 22:16:48,102 INFO L226 Difference]: Without dead ends: 1801 [2020-07-08 22:16:48,103 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 22:16:48,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states. [2020-07-08 22:16:51,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1495. [2020-07-08 22:16:51,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:16:51,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1801 states. Second operand 1495 states. [2020-07-08 22:16:51,393 INFO L74 IsIncluded]: Start isIncluded. First operand 1801 states. Second operand 1495 states. [2020-07-08 22:16:51,393 INFO L87 Difference]: Start difference. First operand 1801 states. Second operand 1495 states. [2020-07-08 22:16:51,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:16:51,498 INFO L93 Difference]: Finished difference Result 1801 states and 2343 transitions. [2020-07-08 22:16:51,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2343 transitions. [2020-07-08 22:16:51,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:16:51,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:16:51,500 INFO L74 IsIncluded]: Start isIncluded. First operand 1495 states. Second operand 1801 states. [2020-07-08 22:16:51,500 INFO L87 Difference]: Start difference. First operand 1495 states. Second operand 1801 states. [2020-07-08 22:16:51,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:16:51,608 INFO L93 Difference]: Finished difference Result 1801 states and 2343 transitions. [2020-07-08 22:16:51,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2343 transitions. [2020-07-08 22:16:51,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:16:51,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:16:51,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:16:51,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:16:51,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1495 states. [2020-07-08 22:16:51,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 1942 transitions. [2020-07-08 22:16:51,681 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 1942 transitions. Word has length 66 [2020-07-08 22:16:51,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:16:51,681 INFO L479 AbstractCegarLoop]: Abstraction has 1495 states and 1942 transitions. [2020-07-08 22:16:51,681 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 22:16:51,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 1495 states and 1942 transitions. [2020-07-08 22:16:54,282 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 1942 edges. 1942 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:16:54,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1942 transitions. [2020-07-08 22:16:54,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-08 22:16:54,284 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:16:54,284 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:16:54,284 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-08 22:16:54,284 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:16:54,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:16:54,285 INFO L82 PathProgramCache]: Analyzing trace with hash -678433246, now seen corresponding path program 1 times [2020-07-08 22:16:54,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:16:54,285 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [107119860] [2020-07-08 22:16:54,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:16:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:16:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:16:54,325 INFO L280 TraceCheckUtils]: 0: Hoare triple {45523#true} assume true; {45523#true} is VALID [2020-07-08 22:16:54,326 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {45523#true} {45523#true} #223#return; {45523#true} is VALID [2020-07-08 22:16:54,326 INFO L263 TraceCheckUtils]: 0: Hoare triple {45523#true} call ULTIMATE.init(); {45523#true} is VALID [2020-07-08 22:16:54,326 INFO L280 TraceCheckUtils]: 1: Hoare triple {45523#true} assume true; {45523#true} is VALID [2020-07-08 22:16:54,326 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {45523#true} {45523#true} #223#return; {45523#true} is VALID [2020-07-08 22:16:54,326 INFO L263 TraceCheckUtils]: 3: Hoare triple {45523#true} call #t~ret9 := main(); {45523#true} is VALID [2020-07-08 22:16:54,326 INFO L280 TraceCheckUtils]: 4: Hoare triple {45523#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {45523#true} is VALID [2020-07-08 22:16:54,327 INFO L280 TraceCheckUtils]: 5: Hoare triple {45523#true} ~p1~0 := #t~nondet0; {45523#true} is VALID [2020-07-08 22:16:54,327 INFO L280 TraceCheckUtils]: 6: Hoare triple {45523#true} havoc #t~nondet0; {45523#true} is VALID [2020-07-08 22:16:54,327 INFO L280 TraceCheckUtils]: 7: Hoare triple {45523#true} havoc ~lk1~0; {45523#true} is VALID [2020-07-08 22:16:54,327 INFO L280 TraceCheckUtils]: 8: Hoare triple {45523#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {45523#true} is VALID [2020-07-08 22:16:54,327 INFO L280 TraceCheckUtils]: 9: Hoare triple {45523#true} ~p2~0 := #t~nondet1; {45523#true} is VALID [2020-07-08 22:16:54,327 INFO L280 TraceCheckUtils]: 10: Hoare triple {45523#true} havoc #t~nondet1; {45523#true} is VALID [2020-07-08 22:16:54,328 INFO L280 TraceCheckUtils]: 11: Hoare triple {45523#true} havoc ~lk2~0; {45523#true} is VALID [2020-07-08 22:16:54,328 INFO L280 TraceCheckUtils]: 12: Hoare triple {45523#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {45523#true} is VALID [2020-07-08 22:16:54,328 INFO L280 TraceCheckUtils]: 13: Hoare triple {45523#true} ~p3~0 := #t~nondet2; {45523#true} is VALID [2020-07-08 22:16:54,328 INFO L280 TraceCheckUtils]: 14: Hoare triple {45523#true} havoc #t~nondet2; {45523#true} is VALID [2020-07-08 22:16:54,328 INFO L280 TraceCheckUtils]: 15: Hoare triple {45523#true} havoc ~lk3~0; {45523#true} is VALID [2020-07-08 22:16:54,329 INFO L280 TraceCheckUtils]: 16: Hoare triple {45523#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {45523#true} is VALID [2020-07-08 22:16:54,329 INFO L280 TraceCheckUtils]: 17: Hoare triple {45523#true} ~p4~0 := #t~nondet3; {45523#true} is VALID [2020-07-08 22:16:54,329 INFO L280 TraceCheckUtils]: 18: Hoare triple {45523#true} havoc #t~nondet3; {45523#true} is VALID [2020-07-08 22:16:54,329 INFO L280 TraceCheckUtils]: 19: Hoare triple {45523#true} havoc ~lk4~0; {45523#true} is VALID [2020-07-08 22:16:54,329 INFO L280 TraceCheckUtils]: 20: Hoare triple {45523#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {45523#true} is VALID [2020-07-08 22:16:54,329 INFO L280 TraceCheckUtils]: 21: Hoare triple {45523#true} ~p5~0 := #t~nondet4; {45523#true} is VALID [2020-07-08 22:16:54,330 INFO L280 TraceCheckUtils]: 22: Hoare triple {45523#true} havoc #t~nondet4; {45523#true} is VALID [2020-07-08 22:16:54,330 INFO L280 TraceCheckUtils]: 23: Hoare triple {45523#true} havoc ~lk5~0; {45523#true} is VALID [2020-07-08 22:16:54,330 INFO L280 TraceCheckUtils]: 24: Hoare triple {45523#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {45523#true} is VALID [2020-07-08 22:16:54,330 INFO L280 TraceCheckUtils]: 25: Hoare triple {45523#true} ~p6~0 := #t~nondet5; {45523#true} is VALID [2020-07-08 22:16:54,330 INFO L280 TraceCheckUtils]: 26: Hoare triple {45523#true} havoc #t~nondet5; {45523#true} is VALID [2020-07-08 22:16:54,331 INFO L280 TraceCheckUtils]: 27: Hoare triple {45523#true} havoc ~lk6~0; {45523#true} is VALID [2020-07-08 22:16:54,331 INFO L280 TraceCheckUtils]: 28: Hoare triple {45523#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {45523#true} is VALID [2020-07-08 22:16:54,331 INFO L280 TraceCheckUtils]: 29: Hoare triple {45523#true} ~p7~0 := #t~nondet6; {45523#true} is VALID [2020-07-08 22:16:54,331 INFO L280 TraceCheckUtils]: 30: Hoare triple {45523#true} havoc #t~nondet6; {45523#true} is VALID [2020-07-08 22:16:54,331 INFO L280 TraceCheckUtils]: 31: Hoare triple {45523#true} havoc ~lk7~0; {45523#true} is VALID [2020-07-08 22:16:54,331 INFO L280 TraceCheckUtils]: 32: Hoare triple {45523#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {45523#true} is VALID [2020-07-08 22:16:54,332 INFO L280 TraceCheckUtils]: 33: Hoare triple {45523#true} ~p8~0 := #t~nondet7; {45523#true} is VALID [2020-07-08 22:16:54,332 INFO L280 TraceCheckUtils]: 34: Hoare triple {45523#true} havoc #t~nondet7; {45523#true} is VALID [2020-07-08 22:16:54,332 INFO L280 TraceCheckUtils]: 35: Hoare triple {45523#true} havoc ~lk8~0; {45523#true} is VALID [2020-07-08 22:16:54,332 INFO L280 TraceCheckUtils]: 36: Hoare triple {45523#true} havoc ~cond~0; {45523#true} is VALID [2020-07-08 22:16:54,332 INFO L280 TraceCheckUtils]: 37: Hoare triple {45523#true} assume !false; {45523#true} is VALID [2020-07-08 22:16:54,332 INFO L280 TraceCheckUtils]: 38: Hoare triple {45523#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {45523#true} is VALID [2020-07-08 22:16:54,333 INFO L280 TraceCheckUtils]: 39: Hoare triple {45523#true} ~cond~0 := #t~nondet8; {45523#true} is VALID [2020-07-08 22:16:54,333 INFO L280 TraceCheckUtils]: 40: Hoare triple {45523#true} havoc #t~nondet8; {45523#true} is VALID [2020-07-08 22:16:54,333 INFO L280 TraceCheckUtils]: 41: Hoare triple {45523#true} assume !(0 == ~cond~0); {45523#true} is VALID [2020-07-08 22:16:54,333 INFO L280 TraceCheckUtils]: 42: Hoare triple {45523#true} ~lk1~0 := 0; {45523#true} is VALID [2020-07-08 22:16:54,333 INFO L280 TraceCheckUtils]: 43: Hoare triple {45523#true} ~lk2~0 := 0; {45523#true} is VALID [2020-07-08 22:16:54,334 INFO L280 TraceCheckUtils]: 44: Hoare triple {45523#true} ~lk3~0 := 0; {45523#true} is VALID [2020-07-08 22:16:54,334 INFO L280 TraceCheckUtils]: 45: Hoare triple {45523#true} ~lk4~0 := 0; {45523#true} is VALID [2020-07-08 22:16:54,334 INFO L280 TraceCheckUtils]: 46: Hoare triple {45523#true} ~lk5~0 := 0; {45523#true} is VALID [2020-07-08 22:16:54,334 INFO L280 TraceCheckUtils]: 47: Hoare triple {45523#true} ~lk6~0 := 0; {45523#true} is VALID [2020-07-08 22:16:54,334 INFO L280 TraceCheckUtils]: 48: Hoare triple {45523#true} ~lk7~0 := 0; {45523#true} is VALID [2020-07-08 22:16:54,334 INFO L280 TraceCheckUtils]: 49: Hoare triple {45523#true} ~lk8~0 := 0; {45523#true} is VALID [2020-07-08 22:16:54,335 INFO L280 TraceCheckUtils]: 50: Hoare triple {45523#true} assume !(0 != ~p1~0); {45523#true} is VALID [2020-07-08 22:16:54,335 INFO L280 TraceCheckUtils]: 51: Hoare triple {45523#true} assume !(0 != ~p2~0); {45523#true} is VALID [2020-07-08 22:16:54,335 INFO L280 TraceCheckUtils]: 52: Hoare triple {45523#true} assume !(0 != ~p3~0); {45523#true} is VALID [2020-07-08 22:16:54,335 INFO L280 TraceCheckUtils]: 53: Hoare triple {45523#true} assume !(0 != ~p4~0); {45523#true} is VALID [2020-07-08 22:16:54,335 INFO L280 TraceCheckUtils]: 54: Hoare triple {45523#true} assume !(0 != ~p5~0); {45523#true} is VALID [2020-07-08 22:16:54,336 INFO L280 TraceCheckUtils]: 55: Hoare triple {45523#true} assume !(0 != ~p6~0); {45527#(= 0 main_~p6~0)} is VALID [2020-07-08 22:16:54,337 INFO L280 TraceCheckUtils]: 56: Hoare triple {45527#(= 0 main_~p6~0)} assume !(0 != ~p7~0); {45527#(= 0 main_~p6~0)} is VALID [2020-07-08 22:16:54,337 INFO L280 TraceCheckUtils]: 57: Hoare triple {45527#(= 0 main_~p6~0)} assume !(0 != ~p8~0); {45527#(= 0 main_~p6~0)} is VALID [2020-07-08 22:16:54,337 INFO L280 TraceCheckUtils]: 58: Hoare triple {45527#(= 0 main_~p6~0)} assume !(0 != ~p1~0); {45527#(= 0 main_~p6~0)} is VALID [2020-07-08 22:16:54,338 INFO L280 TraceCheckUtils]: 59: Hoare triple {45527#(= 0 main_~p6~0)} assume !(0 != ~p2~0); {45527#(= 0 main_~p6~0)} is VALID [2020-07-08 22:16:54,338 INFO L280 TraceCheckUtils]: 60: Hoare triple {45527#(= 0 main_~p6~0)} assume !(0 != ~p3~0); {45527#(= 0 main_~p6~0)} is VALID [2020-07-08 22:16:54,339 INFO L280 TraceCheckUtils]: 61: Hoare triple {45527#(= 0 main_~p6~0)} assume !(0 != ~p4~0); {45527#(= 0 main_~p6~0)} is VALID [2020-07-08 22:16:54,339 INFO L280 TraceCheckUtils]: 62: Hoare triple {45527#(= 0 main_~p6~0)} assume !(0 != ~p5~0); {45527#(= 0 main_~p6~0)} is VALID [2020-07-08 22:16:54,340 INFO L280 TraceCheckUtils]: 63: Hoare triple {45527#(= 0 main_~p6~0)} assume 0 != ~p6~0; {45524#false} is VALID [2020-07-08 22:16:54,340 INFO L280 TraceCheckUtils]: 64: Hoare triple {45524#false} assume 1 != ~lk6~0; {45524#false} is VALID [2020-07-08 22:16:54,340 INFO L280 TraceCheckUtils]: 65: Hoare triple {45524#false} assume !false; {45524#false} is VALID [2020-07-08 22:16:54,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 22:16:54,343 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [107119860] [2020-07-08 22:16:54,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:16:54,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 22:16:54,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816425998] [2020-07-08 22:16:54,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-08 22:16:54,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:16:54,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 22:16:54,416 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:16:54,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 22:16:54,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:16:54,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 22:16:54,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 22:16:54,417 INFO L87 Difference]: Start difference. First operand 1495 states and 1942 transitions. Second operand 3 states. [2020-07-08 22:17:02,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:17:02,830 INFO L93 Difference]: Finished difference Result 4315 states and 5624 transitions. [2020-07-08 22:17:02,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 22:17:02,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-08 22:17:02,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:17:02,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 22:17:02,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2020-07-08 22:17:02,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 22:17:02,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2020-07-08 22:17:02,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 252 transitions. [2020-07-08 22:17:03,063 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:17:03,340 INFO L225 Difference]: With dead ends: 4315 [2020-07-08 22:17:03,341 INFO L226 Difference]: Without dead ends: 2857 [2020-07-08 22:17:03,343 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 22:17:03,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2857 states. [2020-07-08 22:17:10,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2857 to 2855. [2020-07-08 22:17:10,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:17:10,288 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2857 states. Second operand 2855 states. [2020-07-08 22:17:10,288 INFO L74 IsIncluded]: Start isIncluded. First operand 2857 states. Second operand 2855 states. [2020-07-08 22:17:10,288 INFO L87 Difference]: Start difference. First operand 2857 states. Second operand 2855 states. [2020-07-08 22:17:10,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:17:10,512 INFO L93 Difference]: Finished difference Result 2857 states and 3655 transitions. [2020-07-08 22:17:10,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2857 states and 3655 transitions. [2020-07-08 22:17:10,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:17:10,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:17:10,515 INFO L74 IsIncluded]: Start isIncluded. First operand 2855 states. Second operand 2857 states. [2020-07-08 22:17:10,516 INFO L87 Difference]: Start difference. First operand 2855 states. Second operand 2857 states. [2020-07-08 22:17:10,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:17:10,756 INFO L93 Difference]: Finished difference Result 2857 states and 3655 transitions. [2020-07-08 22:17:10,756 INFO L276 IsEmpty]: Start isEmpty. Operand 2857 states and 3655 transitions. [2020-07-08 22:17:10,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:17:10,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:17:10,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:17:10,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:17:10,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2855 states. [2020-07-08 22:17:11,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2855 states to 2855 states and 3654 transitions. [2020-07-08 22:17:11,008 INFO L78 Accepts]: Start accepts. Automaton has 2855 states and 3654 transitions. Word has length 66 [2020-07-08 22:17:11,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:17:11,008 INFO L479 AbstractCegarLoop]: Abstraction has 2855 states and 3654 transitions. [2020-07-08 22:17:11,008 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 22:17:11,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2855 states and 3654 transitions. [2020-07-08 22:17:15,887 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3654 edges. 3654 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:17:15,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2855 states and 3654 transitions. [2020-07-08 22:17:15,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-08 22:17:15,889 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:17:15,890 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:17:15,890 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-08 22:17:15,890 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:17:15,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:17:15,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1214689743, now seen corresponding path program 1 times [2020-07-08 22:17:15,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:17:15,891 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [846561933] [2020-07-08 22:17:15,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:17:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:17:15,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:17:15,933 INFO L280 TraceCheckUtils]: 0: Hoare triple {65584#true} assume true; {65584#true} is VALID [2020-07-08 22:17:15,933 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {65584#true} {65584#true} #223#return; {65584#true} is VALID [2020-07-08 22:17:15,934 INFO L263 TraceCheckUtils]: 0: Hoare triple {65584#true} call ULTIMATE.init(); {65584#true} is VALID [2020-07-08 22:17:15,934 INFO L280 TraceCheckUtils]: 1: Hoare triple {65584#true} assume true; {65584#true} is VALID [2020-07-08 22:17:15,934 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {65584#true} {65584#true} #223#return; {65584#true} is VALID [2020-07-08 22:17:15,934 INFO L263 TraceCheckUtils]: 3: Hoare triple {65584#true} call #t~ret9 := main(); {65584#true} is VALID [2020-07-08 22:17:15,934 INFO L280 TraceCheckUtils]: 4: Hoare triple {65584#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {65584#true} is VALID [2020-07-08 22:17:15,935 INFO L280 TraceCheckUtils]: 5: Hoare triple {65584#true} ~p1~0 := #t~nondet0; {65584#true} is VALID [2020-07-08 22:17:15,935 INFO L280 TraceCheckUtils]: 6: Hoare triple {65584#true} havoc #t~nondet0; {65584#true} is VALID [2020-07-08 22:17:15,935 INFO L280 TraceCheckUtils]: 7: Hoare triple {65584#true} havoc ~lk1~0; {65584#true} is VALID [2020-07-08 22:17:15,935 INFO L280 TraceCheckUtils]: 8: Hoare triple {65584#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {65584#true} is VALID [2020-07-08 22:17:15,935 INFO L280 TraceCheckUtils]: 9: Hoare triple {65584#true} ~p2~0 := #t~nondet1; {65584#true} is VALID [2020-07-08 22:17:15,935 INFO L280 TraceCheckUtils]: 10: Hoare triple {65584#true} havoc #t~nondet1; {65584#true} is VALID [2020-07-08 22:17:15,936 INFO L280 TraceCheckUtils]: 11: Hoare triple {65584#true} havoc ~lk2~0; {65584#true} is VALID [2020-07-08 22:17:15,936 INFO L280 TraceCheckUtils]: 12: Hoare triple {65584#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {65584#true} is VALID [2020-07-08 22:17:15,936 INFO L280 TraceCheckUtils]: 13: Hoare triple {65584#true} ~p3~0 := #t~nondet2; {65584#true} is VALID [2020-07-08 22:17:15,936 INFO L280 TraceCheckUtils]: 14: Hoare triple {65584#true} havoc #t~nondet2; {65584#true} is VALID [2020-07-08 22:17:15,936 INFO L280 TraceCheckUtils]: 15: Hoare triple {65584#true} havoc ~lk3~0; {65584#true} is VALID [2020-07-08 22:17:15,937 INFO L280 TraceCheckUtils]: 16: Hoare triple {65584#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {65584#true} is VALID [2020-07-08 22:17:15,937 INFO L280 TraceCheckUtils]: 17: Hoare triple {65584#true} ~p4~0 := #t~nondet3; {65584#true} is VALID [2020-07-08 22:17:15,937 INFO L280 TraceCheckUtils]: 18: Hoare triple {65584#true} havoc #t~nondet3; {65584#true} is VALID [2020-07-08 22:17:15,937 INFO L280 TraceCheckUtils]: 19: Hoare triple {65584#true} havoc ~lk4~0; {65584#true} is VALID [2020-07-08 22:17:15,937 INFO L280 TraceCheckUtils]: 20: Hoare triple {65584#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {65584#true} is VALID [2020-07-08 22:17:15,937 INFO L280 TraceCheckUtils]: 21: Hoare triple {65584#true} ~p5~0 := #t~nondet4; {65584#true} is VALID [2020-07-08 22:17:15,938 INFO L280 TraceCheckUtils]: 22: Hoare triple {65584#true} havoc #t~nondet4; {65584#true} is VALID [2020-07-08 22:17:15,938 INFO L280 TraceCheckUtils]: 23: Hoare triple {65584#true} havoc ~lk5~0; {65584#true} is VALID [2020-07-08 22:17:15,938 INFO L280 TraceCheckUtils]: 24: Hoare triple {65584#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {65584#true} is VALID [2020-07-08 22:17:15,938 INFO L280 TraceCheckUtils]: 25: Hoare triple {65584#true} ~p6~0 := #t~nondet5; {65584#true} is VALID [2020-07-08 22:17:15,938 INFO L280 TraceCheckUtils]: 26: Hoare triple {65584#true} havoc #t~nondet5; {65584#true} is VALID [2020-07-08 22:17:15,939 INFO L280 TraceCheckUtils]: 27: Hoare triple {65584#true} havoc ~lk6~0; {65584#true} is VALID [2020-07-08 22:17:15,939 INFO L280 TraceCheckUtils]: 28: Hoare triple {65584#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {65584#true} is VALID [2020-07-08 22:17:15,939 INFO L280 TraceCheckUtils]: 29: Hoare triple {65584#true} ~p7~0 := #t~nondet6; {65584#true} is VALID [2020-07-08 22:17:15,939 INFO L280 TraceCheckUtils]: 30: Hoare triple {65584#true} havoc #t~nondet6; {65584#true} is VALID [2020-07-08 22:17:15,939 INFO L280 TraceCheckUtils]: 31: Hoare triple {65584#true} havoc ~lk7~0; {65584#true} is VALID [2020-07-08 22:17:15,940 INFO L280 TraceCheckUtils]: 32: Hoare triple {65584#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {65584#true} is VALID [2020-07-08 22:17:15,940 INFO L280 TraceCheckUtils]: 33: Hoare triple {65584#true} ~p8~0 := #t~nondet7; {65584#true} is VALID [2020-07-08 22:17:15,940 INFO L280 TraceCheckUtils]: 34: Hoare triple {65584#true} havoc #t~nondet7; {65584#true} is VALID [2020-07-08 22:17:15,940 INFO L280 TraceCheckUtils]: 35: Hoare triple {65584#true} havoc ~lk8~0; {65584#true} is VALID [2020-07-08 22:17:15,940 INFO L280 TraceCheckUtils]: 36: Hoare triple {65584#true} havoc ~cond~0; {65584#true} is VALID [2020-07-08 22:17:15,940 INFO L280 TraceCheckUtils]: 37: Hoare triple {65584#true} assume !false; {65584#true} is VALID [2020-07-08 22:17:15,941 INFO L280 TraceCheckUtils]: 38: Hoare triple {65584#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {65584#true} is VALID [2020-07-08 22:17:15,941 INFO L280 TraceCheckUtils]: 39: Hoare triple {65584#true} ~cond~0 := #t~nondet8; {65584#true} is VALID [2020-07-08 22:17:15,941 INFO L280 TraceCheckUtils]: 40: Hoare triple {65584#true} havoc #t~nondet8; {65584#true} is VALID [2020-07-08 22:17:15,941 INFO L280 TraceCheckUtils]: 41: Hoare triple {65584#true} assume !(0 == ~cond~0); {65584#true} is VALID [2020-07-08 22:17:15,941 INFO L280 TraceCheckUtils]: 42: Hoare triple {65584#true} ~lk1~0 := 0; {65584#true} is VALID [2020-07-08 22:17:15,941 INFO L280 TraceCheckUtils]: 43: Hoare triple {65584#true} ~lk2~0 := 0; {65584#true} is VALID [2020-07-08 22:17:15,942 INFO L280 TraceCheckUtils]: 44: Hoare triple {65584#true} ~lk3~0 := 0; {65584#true} is VALID [2020-07-08 22:17:15,942 INFO L280 TraceCheckUtils]: 45: Hoare triple {65584#true} ~lk4~0 := 0; {65584#true} is VALID [2020-07-08 22:17:15,942 INFO L280 TraceCheckUtils]: 46: Hoare triple {65584#true} ~lk5~0 := 0; {65584#true} is VALID [2020-07-08 22:17:15,942 INFO L280 TraceCheckUtils]: 47: Hoare triple {65584#true} ~lk6~0 := 0; {65584#true} is VALID [2020-07-08 22:17:15,942 INFO L280 TraceCheckUtils]: 48: Hoare triple {65584#true} ~lk7~0 := 0; {65584#true} is VALID [2020-07-08 22:17:15,943 INFO L280 TraceCheckUtils]: 49: Hoare triple {65584#true} ~lk8~0 := 0; {65584#true} is VALID [2020-07-08 22:17:15,943 INFO L280 TraceCheckUtils]: 50: Hoare triple {65584#true} assume !(0 != ~p1~0); {65584#true} is VALID [2020-07-08 22:17:15,943 INFO L280 TraceCheckUtils]: 51: Hoare triple {65584#true} assume !(0 != ~p2~0); {65584#true} is VALID [2020-07-08 22:17:15,943 INFO L280 TraceCheckUtils]: 52: Hoare triple {65584#true} assume !(0 != ~p3~0); {65584#true} is VALID [2020-07-08 22:17:15,943 INFO L280 TraceCheckUtils]: 53: Hoare triple {65584#true} assume !(0 != ~p4~0); {65584#true} is VALID [2020-07-08 22:17:15,943 INFO L280 TraceCheckUtils]: 54: Hoare triple {65584#true} assume !(0 != ~p5~0); {65584#true} is VALID [2020-07-08 22:17:15,944 INFO L280 TraceCheckUtils]: 55: Hoare triple {65584#true} assume 0 != ~p6~0; {65584#true} is VALID [2020-07-08 22:17:15,945 INFO L280 TraceCheckUtils]: 56: Hoare triple {65584#true} ~lk6~0 := 1; {65588#(= 1 main_~lk6~0)} is VALID [2020-07-08 22:17:15,945 INFO L280 TraceCheckUtils]: 57: Hoare triple {65588#(= 1 main_~lk6~0)} assume !(0 != ~p7~0); {65588#(= 1 main_~lk6~0)} is VALID [2020-07-08 22:17:15,946 INFO L280 TraceCheckUtils]: 58: Hoare triple {65588#(= 1 main_~lk6~0)} assume !(0 != ~p8~0); {65588#(= 1 main_~lk6~0)} is VALID [2020-07-08 22:17:15,946 INFO L280 TraceCheckUtils]: 59: Hoare triple {65588#(= 1 main_~lk6~0)} assume !(0 != ~p1~0); {65588#(= 1 main_~lk6~0)} is VALID [2020-07-08 22:17:15,947 INFO L280 TraceCheckUtils]: 60: Hoare triple {65588#(= 1 main_~lk6~0)} assume !(0 != ~p2~0); {65588#(= 1 main_~lk6~0)} is VALID [2020-07-08 22:17:15,947 INFO L280 TraceCheckUtils]: 61: Hoare triple {65588#(= 1 main_~lk6~0)} assume !(0 != ~p3~0); {65588#(= 1 main_~lk6~0)} is VALID [2020-07-08 22:17:15,950 INFO L280 TraceCheckUtils]: 62: Hoare triple {65588#(= 1 main_~lk6~0)} assume !(0 != ~p4~0); {65588#(= 1 main_~lk6~0)} is VALID [2020-07-08 22:17:15,954 INFO L280 TraceCheckUtils]: 63: Hoare triple {65588#(= 1 main_~lk6~0)} assume !(0 != ~p5~0); {65588#(= 1 main_~lk6~0)} is VALID [2020-07-08 22:17:15,956 INFO L280 TraceCheckUtils]: 64: Hoare triple {65588#(= 1 main_~lk6~0)} assume 0 != ~p6~0; {65588#(= 1 main_~lk6~0)} is VALID [2020-07-08 22:17:15,958 INFO L280 TraceCheckUtils]: 65: Hoare triple {65588#(= 1 main_~lk6~0)} assume 1 != ~lk6~0; {65585#false} is VALID [2020-07-08 22:17:15,959 INFO L280 TraceCheckUtils]: 66: Hoare triple {65585#false} assume !false; {65585#false} is VALID [2020-07-08 22:17:15,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 22:17:15,962 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [846561933] [2020-07-08 22:17:15,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:17:15,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 22:17:15,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13434061] [2020-07-08 22:17:15,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2020-07-08 22:17:15,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:17:15,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 22:17:16,024 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:17:16,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 22:17:16,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:17:16,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 22:17:16,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 22:17:16,025 INFO L87 Difference]: Start difference. First operand 2855 states and 3654 transitions. Second operand 3 states. [2020-07-08 22:17:25,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:17:25,347 INFO L93 Difference]: Finished difference Result 3403 states and 4328 transitions. [2020-07-08 22:17:25,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 22:17:25,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2020-07-08 22:17:25,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:17:25,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 22:17:25,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2020-07-08 22:17:25,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 22:17:25,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2020-07-08 22:17:25,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 160 transitions. [2020-07-08 22:17:25,497 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:17:25,894 INFO L225 Difference]: With dead ends: 3403 [2020-07-08 22:17:25,894 INFO L226 Difference]: Without dead ends: 3401 [2020-07-08 22:17:25,896 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 22:17:25,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3401 states. [2020-07-08 22:17:33,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3401 to 2855. [2020-07-08 22:17:33,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:17:33,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3401 states. Second operand 2855 states. [2020-07-08 22:17:33,345 INFO L74 IsIncluded]: Start isIncluded. First operand 3401 states. Second operand 2855 states. [2020-07-08 22:17:33,345 INFO L87 Difference]: Start difference. First operand 3401 states. Second operand 2855 states. [2020-07-08 22:17:33,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:17:33,758 INFO L93 Difference]: Finished difference Result 3401 states and 4295 transitions. [2020-07-08 22:17:33,759 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 4295 transitions. [2020-07-08 22:17:33,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:17:33,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:17:33,762 INFO L74 IsIncluded]: Start isIncluded. First operand 2855 states. Second operand 3401 states. [2020-07-08 22:17:33,762 INFO L87 Difference]: Start difference. First operand 2855 states. Second operand 3401 states. [2020-07-08 22:17:34,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:17:34,139 INFO L93 Difference]: Finished difference Result 3401 states and 4295 transitions. [2020-07-08 22:17:34,139 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 4295 transitions. [2020-07-08 22:17:34,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:17:34,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:17:34,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:17:34,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:17:34,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2855 states. [2020-07-08 22:17:34,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2855 states to 2855 states and 3622 transitions. [2020-07-08 22:17:34,405 INFO L78 Accepts]: Start accepts. Automaton has 2855 states and 3622 transitions. Word has length 67 [2020-07-08 22:17:34,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:17:34,406 INFO L479 AbstractCegarLoop]: Abstraction has 2855 states and 3622 transitions. [2020-07-08 22:17:34,406 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 22:17:34,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2855 states and 3622 transitions. [2020-07-08 22:17:39,159 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3622 edges. 3622 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:17:39,159 INFO L276 IsEmpty]: Start isEmpty. Operand 2855 states and 3622 transitions. [2020-07-08 22:17:39,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-08 22:17:39,161 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:17:39,162 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:17:39,162 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-08 22:17:39,162 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:17:39,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:17:39,162 INFO L82 PathProgramCache]: Analyzing trace with hash 443652336, now seen corresponding path program 1 times [2020-07-08 22:17:39,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:17:39,162 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [611550786] [2020-07-08 22:17:39,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:17:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:17:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:17:39,197 INFO L280 TraceCheckUtils]: 0: Hoare triple {84909#true} assume true; {84909#true} is VALID [2020-07-08 22:17:39,197 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {84909#true} {84909#true} #223#return; {84909#true} is VALID [2020-07-08 22:17:39,198 INFO L263 TraceCheckUtils]: 0: Hoare triple {84909#true} call ULTIMATE.init(); {84909#true} is VALID [2020-07-08 22:17:39,198 INFO L280 TraceCheckUtils]: 1: Hoare triple {84909#true} assume true; {84909#true} is VALID [2020-07-08 22:17:39,198 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {84909#true} {84909#true} #223#return; {84909#true} is VALID [2020-07-08 22:17:39,198 INFO L263 TraceCheckUtils]: 3: Hoare triple {84909#true} call #t~ret9 := main(); {84909#true} is VALID [2020-07-08 22:17:39,198 INFO L280 TraceCheckUtils]: 4: Hoare triple {84909#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {84909#true} is VALID [2020-07-08 22:17:39,199 INFO L280 TraceCheckUtils]: 5: Hoare triple {84909#true} ~p1~0 := #t~nondet0; {84909#true} is VALID [2020-07-08 22:17:39,199 INFO L280 TraceCheckUtils]: 6: Hoare triple {84909#true} havoc #t~nondet0; {84909#true} is VALID [2020-07-08 22:17:39,199 INFO L280 TraceCheckUtils]: 7: Hoare triple {84909#true} havoc ~lk1~0; {84909#true} is VALID [2020-07-08 22:17:39,199 INFO L280 TraceCheckUtils]: 8: Hoare triple {84909#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {84909#true} is VALID [2020-07-08 22:17:39,199 INFO L280 TraceCheckUtils]: 9: Hoare triple {84909#true} ~p2~0 := #t~nondet1; {84909#true} is VALID [2020-07-08 22:17:39,200 INFO L280 TraceCheckUtils]: 10: Hoare triple {84909#true} havoc #t~nondet1; {84909#true} is VALID [2020-07-08 22:17:39,200 INFO L280 TraceCheckUtils]: 11: Hoare triple {84909#true} havoc ~lk2~0; {84909#true} is VALID [2020-07-08 22:17:39,200 INFO L280 TraceCheckUtils]: 12: Hoare triple {84909#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {84909#true} is VALID [2020-07-08 22:17:39,200 INFO L280 TraceCheckUtils]: 13: Hoare triple {84909#true} ~p3~0 := #t~nondet2; {84909#true} is VALID [2020-07-08 22:17:39,200 INFO L280 TraceCheckUtils]: 14: Hoare triple {84909#true} havoc #t~nondet2; {84909#true} is VALID [2020-07-08 22:17:39,201 INFO L280 TraceCheckUtils]: 15: Hoare triple {84909#true} havoc ~lk3~0; {84909#true} is VALID [2020-07-08 22:17:39,201 INFO L280 TraceCheckUtils]: 16: Hoare triple {84909#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {84909#true} is VALID [2020-07-08 22:17:39,201 INFO L280 TraceCheckUtils]: 17: Hoare triple {84909#true} ~p4~0 := #t~nondet3; {84909#true} is VALID [2020-07-08 22:17:39,201 INFO L280 TraceCheckUtils]: 18: Hoare triple {84909#true} havoc #t~nondet3; {84909#true} is VALID [2020-07-08 22:17:39,201 INFO L280 TraceCheckUtils]: 19: Hoare triple {84909#true} havoc ~lk4~0; {84909#true} is VALID [2020-07-08 22:17:39,201 INFO L280 TraceCheckUtils]: 20: Hoare triple {84909#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {84909#true} is VALID [2020-07-08 22:17:39,202 INFO L280 TraceCheckUtils]: 21: Hoare triple {84909#true} ~p5~0 := #t~nondet4; {84909#true} is VALID [2020-07-08 22:17:39,202 INFO L280 TraceCheckUtils]: 22: Hoare triple {84909#true} havoc #t~nondet4; {84909#true} is VALID [2020-07-08 22:17:39,202 INFO L280 TraceCheckUtils]: 23: Hoare triple {84909#true} havoc ~lk5~0; {84909#true} is VALID [2020-07-08 22:17:39,202 INFO L280 TraceCheckUtils]: 24: Hoare triple {84909#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {84909#true} is VALID [2020-07-08 22:17:39,202 INFO L280 TraceCheckUtils]: 25: Hoare triple {84909#true} ~p6~0 := #t~nondet5; {84909#true} is VALID [2020-07-08 22:17:39,203 INFO L280 TraceCheckUtils]: 26: Hoare triple {84909#true} havoc #t~nondet5; {84909#true} is VALID [2020-07-08 22:17:39,203 INFO L280 TraceCheckUtils]: 27: Hoare triple {84909#true} havoc ~lk6~0; {84909#true} is VALID [2020-07-08 22:17:39,203 INFO L280 TraceCheckUtils]: 28: Hoare triple {84909#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {84909#true} is VALID [2020-07-08 22:17:39,203 INFO L280 TraceCheckUtils]: 29: Hoare triple {84909#true} ~p7~0 := #t~nondet6; {84909#true} is VALID [2020-07-08 22:17:39,203 INFO L280 TraceCheckUtils]: 30: Hoare triple {84909#true} havoc #t~nondet6; {84909#true} is VALID [2020-07-08 22:17:39,203 INFO L280 TraceCheckUtils]: 31: Hoare triple {84909#true} havoc ~lk7~0; {84909#true} is VALID [2020-07-08 22:17:39,204 INFO L280 TraceCheckUtils]: 32: Hoare triple {84909#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {84909#true} is VALID [2020-07-08 22:17:39,204 INFO L280 TraceCheckUtils]: 33: Hoare triple {84909#true} ~p8~0 := #t~nondet7; {84909#true} is VALID [2020-07-08 22:17:39,204 INFO L280 TraceCheckUtils]: 34: Hoare triple {84909#true} havoc #t~nondet7; {84909#true} is VALID [2020-07-08 22:17:39,204 INFO L280 TraceCheckUtils]: 35: Hoare triple {84909#true} havoc ~lk8~0; {84909#true} is VALID [2020-07-08 22:17:39,204 INFO L280 TraceCheckUtils]: 36: Hoare triple {84909#true} havoc ~cond~0; {84909#true} is VALID [2020-07-08 22:17:39,205 INFO L280 TraceCheckUtils]: 37: Hoare triple {84909#true} assume !false; {84909#true} is VALID [2020-07-08 22:17:39,205 INFO L280 TraceCheckUtils]: 38: Hoare triple {84909#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {84909#true} is VALID [2020-07-08 22:17:39,205 INFO L280 TraceCheckUtils]: 39: Hoare triple {84909#true} ~cond~0 := #t~nondet8; {84909#true} is VALID [2020-07-08 22:17:39,205 INFO L280 TraceCheckUtils]: 40: Hoare triple {84909#true} havoc #t~nondet8; {84909#true} is VALID [2020-07-08 22:17:39,205 INFO L280 TraceCheckUtils]: 41: Hoare triple {84909#true} assume !(0 == ~cond~0); {84909#true} is VALID [2020-07-08 22:17:39,205 INFO L280 TraceCheckUtils]: 42: Hoare triple {84909#true} ~lk1~0 := 0; {84909#true} is VALID [2020-07-08 22:17:39,206 INFO L280 TraceCheckUtils]: 43: Hoare triple {84909#true} ~lk2~0 := 0; {84909#true} is VALID [2020-07-08 22:17:39,206 INFO L280 TraceCheckUtils]: 44: Hoare triple {84909#true} ~lk3~0 := 0; {84909#true} is VALID [2020-07-08 22:17:39,206 INFO L280 TraceCheckUtils]: 45: Hoare triple {84909#true} ~lk4~0 := 0; {84909#true} is VALID [2020-07-08 22:17:39,206 INFO L280 TraceCheckUtils]: 46: Hoare triple {84909#true} ~lk5~0 := 0; {84909#true} is VALID [2020-07-08 22:17:39,206 INFO L280 TraceCheckUtils]: 47: Hoare triple {84909#true} ~lk6~0 := 0; {84909#true} is VALID [2020-07-08 22:17:39,207 INFO L280 TraceCheckUtils]: 48: Hoare triple {84909#true} ~lk7~0 := 0; {84909#true} is VALID [2020-07-08 22:17:39,207 INFO L280 TraceCheckUtils]: 49: Hoare triple {84909#true} ~lk8~0 := 0; {84909#true} is VALID [2020-07-08 22:17:39,207 INFO L280 TraceCheckUtils]: 50: Hoare triple {84909#true} assume !(0 != ~p1~0); {84909#true} is VALID [2020-07-08 22:17:39,207 INFO L280 TraceCheckUtils]: 51: Hoare triple {84909#true} assume !(0 != ~p2~0); {84909#true} is VALID [2020-07-08 22:17:39,207 INFO L280 TraceCheckUtils]: 52: Hoare triple {84909#true} assume !(0 != ~p3~0); {84909#true} is VALID [2020-07-08 22:17:39,208 INFO L280 TraceCheckUtils]: 53: Hoare triple {84909#true} assume !(0 != ~p4~0); {84909#true} is VALID [2020-07-08 22:17:39,208 INFO L280 TraceCheckUtils]: 54: Hoare triple {84909#true} assume !(0 != ~p5~0); {84909#true} is VALID [2020-07-08 22:17:39,208 INFO L280 TraceCheckUtils]: 55: Hoare triple {84909#true} assume !(0 != ~p6~0); {84909#true} is VALID [2020-07-08 22:17:39,209 INFO L280 TraceCheckUtils]: 56: Hoare triple {84909#true} assume !(0 != ~p7~0); {84913#(= 0 main_~p7~0)} is VALID [2020-07-08 22:17:39,209 INFO L280 TraceCheckUtils]: 57: Hoare triple {84913#(= 0 main_~p7~0)} assume !(0 != ~p8~0); {84913#(= 0 main_~p7~0)} is VALID [2020-07-08 22:17:39,209 INFO L280 TraceCheckUtils]: 58: Hoare triple {84913#(= 0 main_~p7~0)} assume !(0 != ~p1~0); {84913#(= 0 main_~p7~0)} is VALID [2020-07-08 22:17:39,210 INFO L280 TraceCheckUtils]: 59: Hoare triple {84913#(= 0 main_~p7~0)} assume !(0 != ~p2~0); {84913#(= 0 main_~p7~0)} is VALID [2020-07-08 22:17:39,210 INFO L280 TraceCheckUtils]: 60: Hoare triple {84913#(= 0 main_~p7~0)} assume !(0 != ~p3~0); {84913#(= 0 main_~p7~0)} is VALID [2020-07-08 22:17:39,211 INFO L280 TraceCheckUtils]: 61: Hoare triple {84913#(= 0 main_~p7~0)} assume !(0 != ~p4~0); {84913#(= 0 main_~p7~0)} is VALID [2020-07-08 22:17:39,211 INFO L280 TraceCheckUtils]: 62: Hoare triple {84913#(= 0 main_~p7~0)} assume !(0 != ~p5~0); {84913#(= 0 main_~p7~0)} is VALID [2020-07-08 22:17:39,212 INFO L280 TraceCheckUtils]: 63: Hoare triple {84913#(= 0 main_~p7~0)} assume !(0 != ~p6~0); {84913#(= 0 main_~p7~0)} is VALID [2020-07-08 22:17:39,213 INFO L280 TraceCheckUtils]: 64: Hoare triple {84913#(= 0 main_~p7~0)} assume 0 != ~p7~0; {84910#false} is VALID [2020-07-08 22:17:39,213 INFO L280 TraceCheckUtils]: 65: Hoare triple {84910#false} assume 1 != ~lk7~0; {84910#false} is VALID [2020-07-08 22:17:39,213 INFO L280 TraceCheckUtils]: 66: Hoare triple {84910#false} assume !false; {84910#false} is VALID [2020-07-08 22:17:39,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 22:17:39,216 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [611550786] [2020-07-08 22:17:39,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:17:39,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 22:17:39,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908561804] [2020-07-08 22:17:39,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2020-07-08 22:17:39,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:17:39,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 22:17:39,271 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:17:39,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 22:17:39,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:17:39,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 22:17:39,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 22:17:39,272 INFO L87 Difference]: Start difference. First operand 2855 states and 3622 transitions. Second operand 3 states. [2020-07-08 22:17:58,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:17:58,399 INFO L93 Difference]: Finished difference Result 8299 states and 10536 transitions. [2020-07-08 22:17:58,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 22:17:58,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2020-07-08 22:17:58,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:17:58,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 22:17:58,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2020-07-08 22:17:58,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 22:17:58,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2020-07-08 22:17:58,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 249 transitions. [2020-07-08 22:17:58,632 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 249 edges. 249 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:17:59,743 INFO L225 Difference]: With dead ends: 8299 [2020-07-08 22:17:59,743 INFO L226 Difference]: Without dead ends: 5481 [2020-07-08 22:17:59,748 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 22:17:59,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5481 states. [2020-07-08 22:18:15,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5481 to 5479. [2020-07-08 22:18:15,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:18:15,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5481 states. Second operand 5479 states. [2020-07-08 22:18:15,106 INFO L74 IsIncluded]: Start isIncluded. First operand 5481 states. Second operand 5479 states. [2020-07-08 22:18:15,106 INFO L87 Difference]: Start difference. First operand 5481 states. Second operand 5479 states. [2020-07-08 22:18:16,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:18:16,031 INFO L93 Difference]: Finished difference Result 5481 states and 6823 transitions. [2020-07-08 22:18:16,031 INFO L276 IsEmpty]: Start isEmpty. Operand 5481 states and 6823 transitions. [2020-07-08 22:18:16,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:18:16,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:18:16,037 INFO L74 IsIncluded]: Start isIncluded. First operand 5479 states. Second operand 5481 states. [2020-07-08 22:18:16,038 INFO L87 Difference]: Start difference. First operand 5479 states. Second operand 5481 states. [2020-07-08 22:18:17,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:18:17,002 INFO L93 Difference]: Finished difference Result 5481 states and 6823 transitions. [2020-07-08 22:18:17,002 INFO L276 IsEmpty]: Start isEmpty. Operand 5481 states and 6823 transitions. [2020-07-08 22:18:17,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:18:17,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:18:17,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:18:17,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:18:17,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5479 states. [2020-07-08 22:18:17,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5479 states to 5479 states and 6822 transitions. [2020-07-08 22:18:17,993 INFO L78 Accepts]: Start accepts. Automaton has 5479 states and 6822 transitions. Word has length 67 [2020-07-08 22:18:17,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:18:17,994 INFO L479 AbstractCegarLoop]: Abstraction has 5479 states and 6822 transitions. [2020-07-08 22:18:17,994 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 22:18:17,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5479 states and 6822 transitions. [2020-07-08 22:18:27,365 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6822 edges. 6822 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:18:27,366 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 6822 transitions. [2020-07-08 22:18:27,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-07-08 22:18:27,369 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:18:27,369 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:18:27,369 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-08 22:18:27,369 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:18:27,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:18:27,370 INFO L82 PathProgramCache]: Analyzing trace with hash 192792828, now seen corresponding path program 1 times [2020-07-08 22:18:27,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:18:27,370 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [227853173] [2020-07-08 22:18:27,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:18:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:18:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:18:27,414 INFO L280 TraceCheckUtils]: 0: Hoare triple {123434#true} assume true; {123434#true} is VALID [2020-07-08 22:18:27,415 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {123434#true} {123434#true} #223#return; {123434#true} is VALID [2020-07-08 22:18:27,415 INFO L263 TraceCheckUtils]: 0: Hoare triple {123434#true} call ULTIMATE.init(); {123434#true} is VALID [2020-07-08 22:18:27,415 INFO L280 TraceCheckUtils]: 1: Hoare triple {123434#true} assume true; {123434#true} is VALID [2020-07-08 22:18:27,415 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {123434#true} {123434#true} #223#return; {123434#true} is VALID [2020-07-08 22:18:27,415 INFO L263 TraceCheckUtils]: 3: Hoare triple {123434#true} call #t~ret9 := main(); {123434#true} is VALID [2020-07-08 22:18:27,416 INFO L280 TraceCheckUtils]: 4: Hoare triple {123434#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {123434#true} is VALID [2020-07-08 22:18:27,416 INFO L280 TraceCheckUtils]: 5: Hoare triple {123434#true} ~p1~0 := #t~nondet0; {123434#true} is VALID [2020-07-08 22:18:27,416 INFO L280 TraceCheckUtils]: 6: Hoare triple {123434#true} havoc #t~nondet0; {123434#true} is VALID [2020-07-08 22:18:27,416 INFO L280 TraceCheckUtils]: 7: Hoare triple {123434#true} havoc ~lk1~0; {123434#true} is VALID [2020-07-08 22:18:27,416 INFO L280 TraceCheckUtils]: 8: Hoare triple {123434#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {123434#true} is VALID [2020-07-08 22:18:27,416 INFO L280 TraceCheckUtils]: 9: Hoare triple {123434#true} ~p2~0 := #t~nondet1; {123434#true} is VALID [2020-07-08 22:18:27,416 INFO L280 TraceCheckUtils]: 10: Hoare triple {123434#true} havoc #t~nondet1; {123434#true} is VALID [2020-07-08 22:18:27,416 INFO L280 TraceCheckUtils]: 11: Hoare triple {123434#true} havoc ~lk2~0; {123434#true} is VALID [2020-07-08 22:18:27,417 INFO L280 TraceCheckUtils]: 12: Hoare triple {123434#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {123434#true} is VALID [2020-07-08 22:18:27,417 INFO L280 TraceCheckUtils]: 13: Hoare triple {123434#true} ~p3~0 := #t~nondet2; {123434#true} is VALID [2020-07-08 22:18:27,417 INFO L280 TraceCheckUtils]: 14: Hoare triple {123434#true} havoc #t~nondet2; {123434#true} is VALID [2020-07-08 22:18:27,417 INFO L280 TraceCheckUtils]: 15: Hoare triple {123434#true} havoc ~lk3~0; {123434#true} is VALID [2020-07-08 22:18:27,417 INFO L280 TraceCheckUtils]: 16: Hoare triple {123434#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {123434#true} is VALID [2020-07-08 22:18:27,417 INFO L280 TraceCheckUtils]: 17: Hoare triple {123434#true} ~p4~0 := #t~nondet3; {123434#true} is VALID [2020-07-08 22:18:27,417 INFO L280 TraceCheckUtils]: 18: Hoare triple {123434#true} havoc #t~nondet3; {123434#true} is VALID [2020-07-08 22:18:27,417 INFO L280 TraceCheckUtils]: 19: Hoare triple {123434#true} havoc ~lk4~0; {123434#true} is VALID [2020-07-08 22:18:27,418 INFO L280 TraceCheckUtils]: 20: Hoare triple {123434#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {123434#true} is VALID [2020-07-08 22:18:27,418 INFO L280 TraceCheckUtils]: 21: Hoare triple {123434#true} ~p5~0 := #t~nondet4; {123434#true} is VALID [2020-07-08 22:18:27,418 INFO L280 TraceCheckUtils]: 22: Hoare triple {123434#true} havoc #t~nondet4; {123434#true} is VALID [2020-07-08 22:18:27,418 INFO L280 TraceCheckUtils]: 23: Hoare triple {123434#true} havoc ~lk5~0; {123434#true} is VALID [2020-07-08 22:18:27,418 INFO L280 TraceCheckUtils]: 24: Hoare triple {123434#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {123434#true} is VALID [2020-07-08 22:18:27,419 INFO L280 TraceCheckUtils]: 25: Hoare triple {123434#true} ~p6~0 := #t~nondet5; {123434#true} is VALID [2020-07-08 22:18:27,419 INFO L280 TraceCheckUtils]: 26: Hoare triple {123434#true} havoc #t~nondet5; {123434#true} is VALID [2020-07-08 22:18:27,419 INFO L280 TraceCheckUtils]: 27: Hoare triple {123434#true} havoc ~lk6~0; {123434#true} is VALID [2020-07-08 22:18:27,419 INFO L280 TraceCheckUtils]: 28: Hoare triple {123434#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {123434#true} is VALID [2020-07-08 22:18:27,419 INFO L280 TraceCheckUtils]: 29: Hoare triple {123434#true} ~p7~0 := #t~nondet6; {123434#true} is VALID [2020-07-08 22:18:27,419 INFO L280 TraceCheckUtils]: 30: Hoare triple {123434#true} havoc #t~nondet6; {123434#true} is VALID [2020-07-08 22:18:27,420 INFO L280 TraceCheckUtils]: 31: Hoare triple {123434#true} havoc ~lk7~0; {123434#true} is VALID [2020-07-08 22:18:27,420 INFO L280 TraceCheckUtils]: 32: Hoare triple {123434#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {123434#true} is VALID [2020-07-08 22:18:27,420 INFO L280 TraceCheckUtils]: 33: Hoare triple {123434#true} ~p8~0 := #t~nondet7; {123434#true} is VALID [2020-07-08 22:18:27,420 INFO L280 TraceCheckUtils]: 34: Hoare triple {123434#true} havoc #t~nondet7; {123434#true} is VALID [2020-07-08 22:18:27,420 INFO L280 TraceCheckUtils]: 35: Hoare triple {123434#true} havoc ~lk8~0; {123434#true} is VALID [2020-07-08 22:18:27,421 INFO L280 TraceCheckUtils]: 36: Hoare triple {123434#true} havoc ~cond~0; {123434#true} is VALID [2020-07-08 22:18:27,421 INFO L280 TraceCheckUtils]: 37: Hoare triple {123434#true} assume !false; {123434#true} is VALID [2020-07-08 22:18:27,421 INFO L280 TraceCheckUtils]: 38: Hoare triple {123434#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {123434#true} is VALID [2020-07-08 22:18:27,421 INFO L280 TraceCheckUtils]: 39: Hoare triple {123434#true} ~cond~0 := #t~nondet8; {123434#true} is VALID [2020-07-08 22:18:27,421 INFO L280 TraceCheckUtils]: 40: Hoare triple {123434#true} havoc #t~nondet8; {123434#true} is VALID [2020-07-08 22:18:27,422 INFO L280 TraceCheckUtils]: 41: Hoare triple {123434#true} assume !(0 == ~cond~0); {123434#true} is VALID [2020-07-08 22:18:27,422 INFO L280 TraceCheckUtils]: 42: Hoare triple {123434#true} ~lk1~0 := 0; {123434#true} is VALID [2020-07-08 22:18:27,422 INFO L280 TraceCheckUtils]: 43: Hoare triple {123434#true} ~lk2~0 := 0; {123434#true} is VALID [2020-07-08 22:18:27,422 INFO L280 TraceCheckUtils]: 44: Hoare triple {123434#true} ~lk3~0 := 0; {123434#true} is VALID [2020-07-08 22:18:27,422 INFO L280 TraceCheckUtils]: 45: Hoare triple {123434#true} ~lk4~0 := 0; {123434#true} is VALID [2020-07-08 22:18:27,423 INFO L280 TraceCheckUtils]: 46: Hoare triple {123434#true} ~lk5~0 := 0; {123434#true} is VALID [2020-07-08 22:18:27,423 INFO L280 TraceCheckUtils]: 47: Hoare triple {123434#true} ~lk6~0 := 0; {123434#true} is VALID [2020-07-08 22:18:27,423 INFO L280 TraceCheckUtils]: 48: Hoare triple {123434#true} ~lk7~0 := 0; {123434#true} is VALID [2020-07-08 22:18:27,423 INFO L280 TraceCheckUtils]: 49: Hoare triple {123434#true} ~lk8~0 := 0; {123434#true} is VALID [2020-07-08 22:18:27,423 INFO L280 TraceCheckUtils]: 50: Hoare triple {123434#true} assume !(0 != ~p1~0); {123434#true} is VALID [2020-07-08 22:18:27,423 INFO L280 TraceCheckUtils]: 51: Hoare triple {123434#true} assume !(0 != ~p2~0); {123434#true} is VALID [2020-07-08 22:18:27,424 INFO L280 TraceCheckUtils]: 52: Hoare triple {123434#true} assume !(0 != ~p3~0); {123434#true} is VALID [2020-07-08 22:18:27,424 INFO L280 TraceCheckUtils]: 53: Hoare triple {123434#true} assume !(0 != ~p4~0); {123434#true} is VALID [2020-07-08 22:18:27,424 INFO L280 TraceCheckUtils]: 54: Hoare triple {123434#true} assume !(0 != ~p5~0); {123434#true} is VALID [2020-07-08 22:18:27,424 INFO L280 TraceCheckUtils]: 55: Hoare triple {123434#true} assume !(0 != ~p6~0); {123434#true} is VALID [2020-07-08 22:18:27,424 INFO L280 TraceCheckUtils]: 56: Hoare triple {123434#true} assume 0 != ~p7~0; {123434#true} is VALID [2020-07-08 22:18:27,425 INFO L280 TraceCheckUtils]: 57: Hoare triple {123434#true} ~lk7~0 := 1; {123438#(= main_~lk7~0 1)} is VALID [2020-07-08 22:18:27,426 INFO L280 TraceCheckUtils]: 58: Hoare triple {123438#(= main_~lk7~0 1)} assume !(0 != ~p8~0); {123438#(= main_~lk7~0 1)} is VALID [2020-07-08 22:18:27,426 INFO L280 TraceCheckUtils]: 59: Hoare triple {123438#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {123438#(= main_~lk7~0 1)} is VALID [2020-07-08 22:18:27,426 INFO L280 TraceCheckUtils]: 60: Hoare triple {123438#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {123438#(= main_~lk7~0 1)} is VALID [2020-07-08 22:18:27,427 INFO L280 TraceCheckUtils]: 61: Hoare triple {123438#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {123438#(= main_~lk7~0 1)} is VALID [2020-07-08 22:18:27,427 INFO L280 TraceCheckUtils]: 62: Hoare triple {123438#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {123438#(= main_~lk7~0 1)} is VALID [2020-07-08 22:18:27,428 INFO L280 TraceCheckUtils]: 63: Hoare triple {123438#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {123438#(= main_~lk7~0 1)} is VALID [2020-07-08 22:18:27,428 INFO L280 TraceCheckUtils]: 64: Hoare triple {123438#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {123438#(= main_~lk7~0 1)} is VALID [2020-07-08 22:18:27,429 INFO L280 TraceCheckUtils]: 65: Hoare triple {123438#(= main_~lk7~0 1)} assume 0 != ~p7~0; {123438#(= main_~lk7~0 1)} is VALID [2020-07-08 22:18:27,429 INFO L280 TraceCheckUtils]: 66: Hoare triple {123438#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {123435#false} is VALID [2020-07-08 22:18:27,430 INFO L280 TraceCheckUtils]: 67: Hoare triple {123435#false} assume !false; {123435#false} is VALID [2020-07-08 22:18:27,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 22:18:27,433 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [227853173] [2020-07-08 22:18:27,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:18:27,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 22:18:27,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679197212] [2020-07-08 22:18:27,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2020-07-08 22:18:27,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:18:27,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 22:18:27,485 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:18:27,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 22:18:27,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:18:27,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 22:18:27,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 22:18:27,486 INFO L87 Difference]: Start difference. First operand 5479 states and 6822 transitions. Second operand 3 states. [2020-07-08 22:18:48,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:18:48,862 INFO L93 Difference]: Finished difference Result 6443 states and 7912 transitions. [2020-07-08 22:18:48,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 22:18:48,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2020-07-08 22:18:48,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:18:48,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 22:18:48,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2020-07-08 22:18:48,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 22:18:48,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2020-07-08 22:18:48,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 156 transitions. [2020-07-08 22:18:49,015 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:18:50,522 INFO L225 Difference]: With dead ends: 6443 [2020-07-08 22:18:50,522 INFO L226 Difference]: Without dead ends: 6441 [2020-07-08 22:18:50,524 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 22:18:50,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6441 states. [2020-07-08 22:19:07,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6441 to 5479. [2020-07-08 22:19:07,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:19:07,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6441 states. Second operand 5479 states. [2020-07-08 22:19:07,656 INFO L74 IsIncluded]: Start isIncluded. First operand 6441 states. Second operand 5479 states. [2020-07-08 22:19:07,656 INFO L87 Difference]: Start difference. First operand 6441 states. Second operand 5479 states. [2020-07-08 22:19:08,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:19:08,979 INFO L93 Difference]: Finished difference Result 6441 states and 7847 transitions. [2020-07-08 22:19:08,979 INFO L276 IsEmpty]: Start isEmpty. Operand 6441 states and 7847 transitions. [2020-07-08 22:19:08,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:19:08,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:19:08,986 INFO L74 IsIncluded]: Start isIncluded. First operand 5479 states. Second operand 6441 states. [2020-07-08 22:19:08,986 INFO L87 Difference]: Start difference. First operand 5479 states. Second operand 6441 states. [2020-07-08 22:19:10,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:19:10,344 INFO L93 Difference]: Finished difference Result 6441 states and 7847 transitions. [2020-07-08 22:19:10,344 INFO L276 IsEmpty]: Start isEmpty. Operand 6441 states and 7847 transitions. [2020-07-08 22:19:10,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:19:10,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:19:10,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:19:10,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:19:10,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5479 states. [2020-07-08 22:19:11,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5479 states to 5479 states and 6758 transitions. [2020-07-08 22:19:11,390 INFO L78 Accepts]: Start accepts. Automaton has 5479 states and 6758 transitions. Word has length 68 [2020-07-08 22:19:11,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:19:11,390 INFO L479 AbstractCegarLoop]: Abstraction has 5479 states and 6758 transitions. [2020-07-08 22:19:11,390 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 22:19:11,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5479 states and 6758 transitions. [2020-07-08 22:19:20,889 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6758 edges. 6758 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:19:20,890 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 6758 transitions. [2020-07-08 22:19:20,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-07-08 22:19:20,894 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:19:20,894 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:19:20,894 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-08 22:19:20,894 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:19:20,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:19:20,895 INFO L82 PathProgramCache]: Analyzing trace with hash 868567382, now seen corresponding path program 1 times [2020-07-08 22:19:20,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:19:20,895 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1126598826] [2020-07-08 22:19:20,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:19:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:19:20,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:19:20,927 INFO L280 TraceCheckUtils]: 0: Hoare triple {160167#true} assume true; {160167#true} is VALID [2020-07-08 22:19:20,927 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {160167#true} {160167#true} #223#return; {160167#true} is VALID [2020-07-08 22:19:20,927 INFO L263 TraceCheckUtils]: 0: Hoare triple {160167#true} call ULTIMATE.init(); {160167#true} is VALID [2020-07-08 22:19:20,927 INFO L280 TraceCheckUtils]: 1: Hoare triple {160167#true} assume true; {160167#true} is VALID [2020-07-08 22:19:20,928 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {160167#true} {160167#true} #223#return; {160167#true} is VALID [2020-07-08 22:19:20,928 INFO L263 TraceCheckUtils]: 3: Hoare triple {160167#true} call #t~ret9 := main(); {160167#true} is VALID [2020-07-08 22:19:20,928 INFO L280 TraceCheckUtils]: 4: Hoare triple {160167#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {160167#true} is VALID [2020-07-08 22:19:20,928 INFO L280 TraceCheckUtils]: 5: Hoare triple {160167#true} ~p1~0 := #t~nondet0; {160167#true} is VALID [2020-07-08 22:19:20,928 INFO L280 TraceCheckUtils]: 6: Hoare triple {160167#true} havoc #t~nondet0; {160167#true} is VALID [2020-07-08 22:19:20,928 INFO L280 TraceCheckUtils]: 7: Hoare triple {160167#true} havoc ~lk1~0; {160167#true} is VALID [2020-07-08 22:19:20,929 INFO L280 TraceCheckUtils]: 8: Hoare triple {160167#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {160167#true} is VALID [2020-07-08 22:19:20,929 INFO L280 TraceCheckUtils]: 9: Hoare triple {160167#true} ~p2~0 := #t~nondet1; {160167#true} is VALID [2020-07-08 22:19:20,929 INFO L280 TraceCheckUtils]: 10: Hoare triple {160167#true} havoc #t~nondet1; {160167#true} is VALID [2020-07-08 22:19:20,929 INFO L280 TraceCheckUtils]: 11: Hoare triple {160167#true} havoc ~lk2~0; {160167#true} is VALID [2020-07-08 22:19:20,929 INFO L280 TraceCheckUtils]: 12: Hoare triple {160167#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {160167#true} is VALID [2020-07-08 22:19:20,930 INFO L280 TraceCheckUtils]: 13: Hoare triple {160167#true} ~p3~0 := #t~nondet2; {160167#true} is VALID [2020-07-08 22:19:20,930 INFO L280 TraceCheckUtils]: 14: Hoare triple {160167#true} havoc #t~nondet2; {160167#true} is VALID [2020-07-08 22:19:20,930 INFO L280 TraceCheckUtils]: 15: Hoare triple {160167#true} havoc ~lk3~0; {160167#true} is VALID [2020-07-08 22:19:20,930 INFO L280 TraceCheckUtils]: 16: Hoare triple {160167#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {160167#true} is VALID [2020-07-08 22:19:20,930 INFO L280 TraceCheckUtils]: 17: Hoare triple {160167#true} ~p4~0 := #t~nondet3; {160167#true} is VALID [2020-07-08 22:19:20,930 INFO L280 TraceCheckUtils]: 18: Hoare triple {160167#true} havoc #t~nondet3; {160167#true} is VALID [2020-07-08 22:19:20,931 INFO L280 TraceCheckUtils]: 19: Hoare triple {160167#true} havoc ~lk4~0; {160167#true} is VALID [2020-07-08 22:19:20,931 INFO L280 TraceCheckUtils]: 20: Hoare triple {160167#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {160167#true} is VALID [2020-07-08 22:19:20,931 INFO L280 TraceCheckUtils]: 21: Hoare triple {160167#true} ~p5~0 := #t~nondet4; {160167#true} is VALID [2020-07-08 22:19:20,931 INFO L280 TraceCheckUtils]: 22: Hoare triple {160167#true} havoc #t~nondet4; {160167#true} is VALID [2020-07-08 22:19:20,931 INFO L280 TraceCheckUtils]: 23: Hoare triple {160167#true} havoc ~lk5~0; {160167#true} is VALID [2020-07-08 22:19:20,932 INFO L280 TraceCheckUtils]: 24: Hoare triple {160167#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {160167#true} is VALID [2020-07-08 22:19:20,932 INFO L280 TraceCheckUtils]: 25: Hoare triple {160167#true} ~p6~0 := #t~nondet5; {160167#true} is VALID [2020-07-08 22:19:20,932 INFO L280 TraceCheckUtils]: 26: Hoare triple {160167#true} havoc #t~nondet5; {160167#true} is VALID [2020-07-08 22:19:20,932 INFO L280 TraceCheckUtils]: 27: Hoare triple {160167#true} havoc ~lk6~0; {160167#true} is VALID [2020-07-08 22:19:20,932 INFO L280 TraceCheckUtils]: 28: Hoare triple {160167#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {160167#true} is VALID [2020-07-08 22:19:20,932 INFO L280 TraceCheckUtils]: 29: Hoare triple {160167#true} ~p7~0 := #t~nondet6; {160167#true} is VALID [2020-07-08 22:19:20,933 INFO L280 TraceCheckUtils]: 30: Hoare triple {160167#true} havoc #t~nondet6; {160167#true} is VALID [2020-07-08 22:19:20,933 INFO L280 TraceCheckUtils]: 31: Hoare triple {160167#true} havoc ~lk7~0; {160167#true} is VALID [2020-07-08 22:19:20,933 INFO L280 TraceCheckUtils]: 32: Hoare triple {160167#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {160167#true} is VALID [2020-07-08 22:19:20,933 INFO L280 TraceCheckUtils]: 33: Hoare triple {160167#true} ~p8~0 := #t~nondet7; {160167#true} is VALID [2020-07-08 22:19:20,933 INFO L280 TraceCheckUtils]: 34: Hoare triple {160167#true} havoc #t~nondet7; {160167#true} is VALID [2020-07-08 22:19:20,933 INFO L280 TraceCheckUtils]: 35: Hoare triple {160167#true} havoc ~lk8~0; {160167#true} is VALID [2020-07-08 22:19:20,934 INFO L280 TraceCheckUtils]: 36: Hoare triple {160167#true} havoc ~cond~0; {160167#true} is VALID [2020-07-08 22:19:20,934 INFO L280 TraceCheckUtils]: 37: Hoare triple {160167#true} assume !false; {160167#true} is VALID [2020-07-08 22:19:20,934 INFO L280 TraceCheckUtils]: 38: Hoare triple {160167#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {160167#true} is VALID [2020-07-08 22:19:20,934 INFO L280 TraceCheckUtils]: 39: Hoare triple {160167#true} ~cond~0 := #t~nondet8; {160167#true} is VALID [2020-07-08 22:19:20,934 INFO L280 TraceCheckUtils]: 40: Hoare triple {160167#true} havoc #t~nondet8; {160167#true} is VALID [2020-07-08 22:19:20,934 INFO L280 TraceCheckUtils]: 41: Hoare triple {160167#true} assume !(0 == ~cond~0); {160167#true} is VALID [2020-07-08 22:19:20,935 INFO L280 TraceCheckUtils]: 42: Hoare triple {160167#true} ~lk1~0 := 0; {160167#true} is VALID [2020-07-08 22:19:20,935 INFO L280 TraceCheckUtils]: 43: Hoare triple {160167#true} ~lk2~0 := 0; {160167#true} is VALID [2020-07-08 22:19:20,935 INFO L280 TraceCheckUtils]: 44: Hoare triple {160167#true} ~lk3~0 := 0; {160167#true} is VALID [2020-07-08 22:19:20,935 INFO L280 TraceCheckUtils]: 45: Hoare triple {160167#true} ~lk4~0 := 0; {160167#true} is VALID [2020-07-08 22:19:20,935 INFO L280 TraceCheckUtils]: 46: Hoare triple {160167#true} ~lk5~0 := 0; {160167#true} is VALID [2020-07-08 22:19:20,935 INFO L280 TraceCheckUtils]: 47: Hoare triple {160167#true} ~lk6~0 := 0; {160167#true} is VALID [2020-07-08 22:19:20,936 INFO L280 TraceCheckUtils]: 48: Hoare triple {160167#true} ~lk7~0 := 0; {160167#true} is VALID [2020-07-08 22:19:20,936 INFO L280 TraceCheckUtils]: 49: Hoare triple {160167#true} ~lk8~0 := 0; {160167#true} is VALID [2020-07-08 22:19:20,936 INFO L280 TraceCheckUtils]: 50: Hoare triple {160167#true} assume !(0 != ~p1~0); {160167#true} is VALID [2020-07-08 22:19:20,936 INFO L280 TraceCheckUtils]: 51: Hoare triple {160167#true} assume !(0 != ~p2~0); {160167#true} is VALID [2020-07-08 22:19:20,936 INFO L280 TraceCheckUtils]: 52: Hoare triple {160167#true} assume !(0 != ~p3~0); {160167#true} is VALID [2020-07-08 22:19:20,936 INFO L280 TraceCheckUtils]: 53: Hoare triple {160167#true} assume !(0 != ~p4~0); {160167#true} is VALID [2020-07-08 22:19:20,937 INFO L280 TraceCheckUtils]: 54: Hoare triple {160167#true} assume !(0 != ~p5~0); {160167#true} is VALID [2020-07-08 22:19:20,937 INFO L280 TraceCheckUtils]: 55: Hoare triple {160167#true} assume !(0 != ~p6~0); {160167#true} is VALID [2020-07-08 22:19:20,937 INFO L280 TraceCheckUtils]: 56: Hoare triple {160167#true} assume !(0 != ~p7~0); {160167#true} is VALID [2020-07-08 22:19:20,938 INFO L280 TraceCheckUtils]: 57: Hoare triple {160167#true} assume !(0 != ~p8~0); {160171#(= 0 main_~p8~0)} is VALID [2020-07-08 22:19:20,938 INFO L280 TraceCheckUtils]: 58: Hoare triple {160171#(= 0 main_~p8~0)} assume !(0 != ~p1~0); {160171#(= 0 main_~p8~0)} is VALID [2020-07-08 22:19:20,939 INFO L280 TraceCheckUtils]: 59: Hoare triple {160171#(= 0 main_~p8~0)} assume !(0 != ~p2~0); {160171#(= 0 main_~p8~0)} is VALID [2020-07-08 22:19:20,939 INFO L280 TraceCheckUtils]: 60: Hoare triple {160171#(= 0 main_~p8~0)} assume !(0 != ~p3~0); {160171#(= 0 main_~p8~0)} is VALID [2020-07-08 22:19:20,939 INFO L280 TraceCheckUtils]: 61: Hoare triple {160171#(= 0 main_~p8~0)} assume !(0 != ~p4~0); {160171#(= 0 main_~p8~0)} is VALID [2020-07-08 22:19:20,940 INFO L280 TraceCheckUtils]: 62: Hoare triple {160171#(= 0 main_~p8~0)} assume !(0 != ~p5~0); {160171#(= 0 main_~p8~0)} is VALID [2020-07-08 22:19:20,940 INFO L280 TraceCheckUtils]: 63: Hoare triple {160171#(= 0 main_~p8~0)} assume !(0 != ~p6~0); {160171#(= 0 main_~p8~0)} is VALID [2020-07-08 22:19:20,941 INFO L280 TraceCheckUtils]: 64: Hoare triple {160171#(= 0 main_~p8~0)} assume !(0 != ~p7~0); {160171#(= 0 main_~p8~0)} is VALID [2020-07-08 22:19:20,941 INFO L280 TraceCheckUtils]: 65: Hoare triple {160171#(= 0 main_~p8~0)} assume 0 != ~p8~0; {160168#false} is VALID [2020-07-08 22:19:20,942 INFO L280 TraceCheckUtils]: 66: Hoare triple {160168#false} assume 1 != ~lk8~0; {160168#false} is VALID [2020-07-08 22:19:20,942 INFO L280 TraceCheckUtils]: 67: Hoare triple {160168#false} assume !false; {160168#false} is VALID [2020-07-08 22:19:20,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 22:19:20,945 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1126598826] [2020-07-08 22:19:20,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:19:20,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 22:19:20,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447642176] [2020-07-08 22:19:20,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2020-07-08 22:19:20,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:19:20,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 22:19:21,005 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:19:21,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 22:19:21,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:19:21,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 22:19:21,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 22:19:21,006 INFO L87 Difference]: Start difference. First operand 5479 states and 6758 transitions. Second operand 3 states. [2020-07-08 22:20:10,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:20:10,803 INFO L93 Difference]: Finished difference Result 15977 states and 19687 transitions. [2020-07-08 22:20:10,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 22:20:10,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2020-07-08 22:20:10,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:20:10,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 22:20:10,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2020-07-08 22:20:10,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 22:20:10,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2020-07-08 22:20:10,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 245 transitions. [2020-07-08 22:20:11,043 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 245 edges. 245 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:20:12,241 INFO L225 Difference]: With dead ends: 15977 [2020-07-08 22:20:12,241 INFO L226 Difference]: Without dead ends: 5479 [2020-07-08 22:20:12,255 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 22:20:12,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2020-07-08 22:20:31,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 5479. [2020-07-08 22:20:31,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:20:31,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5479 states. Second operand 5479 states. [2020-07-08 22:20:31,183 INFO L74 IsIncluded]: Start isIncluded. First operand 5479 states. Second operand 5479 states. [2020-07-08 22:20:31,184 INFO L87 Difference]: Start difference. First operand 5479 states. Second operand 5479 states. [2020-07-08 22:20:32,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:20:32,078 INFO L93 Difference]: Finished difference Result 5479 states and 6502 transitions. [2020-07-08 22:20:32,078 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 6502 transitions. [2020-07-08 22:20:32,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:20:32,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:20:32,085 INFO L74 IsIncluded]: Start isIncluded. First operand 5479 states. Second operand 5479 states. [2020-07-08 22:20:32,085 INFO L87 Difference]: Start difference. First operand 5479 states. Second operand 5479 states. [2020-07-08 22:20:33,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:20:33,024 INFO L93 Difference]: Finished difference Result 5479 states and 6502 transitions. [2020-07-08 22:20:33,024 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 6502 transitions. [2020-07-08 22:20:33,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:20:33,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:20:33,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:20:33,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:20:33,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5479 states. [2020-07-08 22:20:33,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5479 states to 5479 states and 6502 transitions. [2020-07-08 22:20:33,999 INFO L78 Accepts]: Start accepts. Automaton has 5479 states and 6502 transitions. Word has length 68 [2020-07-08 22:20:34,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:20:34,000 INFO L479 AbstractCegarLoop]: Abstraction has 5479 states and 6502 transitions. [2020-07-08 22:20:34,000 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 22:20:34,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5479 states and 6502 transitions. [2020-07-08 22:20:43,645 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6502 edges. 6502 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:20:43,645 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 6502 transitions. [2020-07-08 22:20:43,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-07-08 22:20:43,648 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:20:43,649 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:20:43,649 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-08 22:20:43,649 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:20:43,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:20:43,649 INFO L82 PathProgramCache]: Analyzing trace with hash 875079941, now seen corresponding path program 1 times [2020-07-08 22:20:43,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:20:43,650 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1775841338] [2020-07-08 22:20:43,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:20:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:20:43,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:20:43,689 INFO L280 TraceCheckUtils]: 0: Hoare triple {214044#true} assume true; {214044#true} is VALID [2020-07-08 22:20:43,690 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {214044#true} {214044#true} #223#return; {214044#true} is VALID [2020-07-08 22:20:43,690 INFO L263 TraceCheckUtils]: 0: Hoare triple {214044#true} call ULTIMATE.init(); {214044#true} is VALID [2020-07-08 22:20:43,690 INFO L280 TraceCheckUtils]: 1: Hoare triple {214044#true} assume true; {214044#true} is VALID [2020-07-08 22:20:43,691 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {214044#true} {214044#true} #223#return; {214044#true} is VALID [2020-07-08 22:20:43,691 INFO L263 TraceCheckUtils]: 3: Hoare triple {214044#true} call #t~ret9 := main(); {214044#true} is VALID [2020-07-08 22:20:43,691 INFO L280 TraceCheckUtils]: 4: Hoare triple {214044#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {214044#true} is VALID [2020-07-08 22:20:43,691 INFO L280 TraceCheckUtils]: 5: Hoare triple {214044#true} ~p1~0 := #t~nondet0; {214044#true} is VALID [2020-07-08 22:20:43,691 INFO L280 TraceCheckUtils]: 6: Hoare triple {214044#true} havoc #t~nondet0; {214044#true} is VALID [2020-07-08 22:20:43,691 INFO L280 TraceCheckUtils]: 7: Hoare triple {214044#true} havoc ~lk1~0; {214044#true} is VALID [2020-07-08 22:20:43,692 INFO L280 TraceCheckUtils]: 8: Hoare triple {214044#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {214044#true} is VALID [2020-07-08 22:20:43,692 INFO L280 TraceCheckUtils]: 9: Hoare triple {214044#true} ~p2~0 := #t~nondet1; {214044#true} is VALID [2020-07-08 22:20:43,692 INFO L280 TraceCheckUtils]: 10: Hoare triple {214044#true} havoc #t~nondet1; {214044#true} is VALID [2020-07-08 22:20:43,692 INFO L280 TraceCheckUtils]: 11: Hoare triple {214044#true} havoc ~lk2~0; {214044#true} is VALID [2020-07-08 22:20:43,692 INFO L280 TraceCheckUtils]: 12: Hoare triple {214044#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {214044#true} is VALID [2020-07-08 22:20:43,692 INFO L280 TraceCheckUtils]: 13: Hoare triple {214044#true} ~p3~0 := #t~nondet2; {214044#true} is VALID [2020-07-08 22:20:43,693 INFO L280 TraceCheckUtils]: 14: Hoare triple {214044#true} havoc #t~nondet2; {214044#true} is VALID [2020-07-08 22:20:43,693 INFO L280 TraceCheckUtils]: 15: Hoare triple {214044#true} havoc ~lk3~0; {214044#true} is VALID [2020-07-08 22:20:43,693 INFO L280 TraceCheckUtils]: 16: Hoare triple {214044#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {214044#true} is VALID [2020-07-08 22:20:43,693 INFO L280 TraceCheckUtils]: 17: Hoare triple {214044#true} ~p4~0 := #t~nondet3; {214044#true} is VALID [2020-07-08 22:20:43,693 INFO L280 TraceCheckUtils]: 18: Hoare triple {214044#true} havoc #t~nondet3; {214044#true} is VALID [2020-07-08 22:20:43,693 INFO L280 TraceCheckUtils]: 19: Hoare triple {214044#true} havoc ~lk4~0; {214044#true} is VALID [2020-07-08 22:20:43,694 INFO L280 TraceCheckUtils]: 20: Hoare triple {214044#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {214044#true} is VALID [2020-07-08 22:20:43,694 INFO L280 TraceCheckUtils]: 21: Hoare triple {214044#true} ~p5~0 := #t~nondet4; {214044#true} is VALID [2020-07-08 22:20:43,694 INFO L280 TraceCheckUtils]: 22: Hoare triple {214044#true} havoc #t~nondet4; {214044#true} is VALID [2020-07-08 22:20:43,694 INFO L280 TraceCheckUtils]: 23: Hoare triple {214044#true} havoc ~lk5~0; {214044#true} is VALID [2020-07-08 22:20:43,694 INFO L280 TraceCheckUtils]: 24: Hoare triple {214044#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {214044#true} is VALID [2020-07-08 22:20:43,695 INFO L280 TraceCheckUtils]: 25: Hoare triple {214044#true} ~p6~0 := #t~nondet5; {214044#true} is VALID [2020-07-08 22:20:43,695 INFO L280 TraceCheckUtils]: 26: Hoare triple {214044#true} havoc #t~nondet5; {214044#true} is VALID [2020-07-08 22:20:43,695 INFO L280 TraceCheckUtils]: 27: Hoare triple {214044#true} havoc ~lk6~0; {214044#true} is VALID [2020-07-08 22:20:43,695 INFO L280 TraceCheckUtils]: 28: Hoare triple {214044#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {214044#true} is VALID [2020-07-08 22:20:43,695 INFO L280 TraceCheckUtils]: 29: Hoare triple {214044#true} ~p7~0 := #t~nondet6; {214044#true} is VALID [2020-07-08 22:20:43,695 INFO L280 TraceCheckUtils]: 30: Hoare triple {214044#true} havoc #t~nondet6; {214044#true} is VALID [2020-07-08 22:20:43,696 INFO L280 TraceCheckUtils]: 31: Hoare triple {214044#true} havoc ~lk7~0; {214044#true} is VALID [2020-07-08 22:20:43,696 INFO L280 TraceCheckUtils]: 32: Hoare triple {214044#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {214044#true} is VALID [2020-07-08 22:20:43,696 INFO L280 TraceCheckUtils]: 33: Hoare triple {214044#true} ~p8~0 := #t~nondet7; {214044#true} is VALID [2020-07-08 22:20:43,696 INFO L280 TraceCheckUtils]: 34: Hoare triple {214044#true} havoc #t~nondet7; {214044#true} is VALID [2020-07-08 22:20:43,696 INFO L280 TraceCheckUtils]: 35: Hoare triple {214044#true} havoc ~lk8~0; {214044#true} is VALID [2020-07-08 22:20:43,696 INFO L280 TraceCheckUtils]: 36: Hoare triple {214044#true} havoc ~cond~0; {214044#true} is VALID [2020-07-08 22:20:43,697 INFO L280 TraceCheckUtils]: 37: Hoare triple {214044#true} assume !false; {214044#true} is VALID [2020-07-08 22:20:43,697 INFO L280 TraceCheckUtils]: 38: Hoare triple {214044#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {214044#true} is VALID [2020-07-08 22:20:43,697 INFO L280 TraceCheckUtils]: 39: Hoare triple {214044#true} ~cond~0 := #t~nondet8; {214044#true} is VALID [2020-07-08 22:20:43,697 INFO L280 TraceCheckUtils]: 40: Hoare triple {214044#true} havoc #t~nondet8; {214044#true} is VALID [2020-07-08 22:20:43,697 INFO L280 TraceCheckUtils]: 41: Hoare triple {214044#true} assume !(0 == ~cond~0); {214044#true} is VALID [2020-07-08 22:20:43,698 INFO L280 TraceCheckUtils]: 42: Hoare triple {214044#true} ~lk1~0 := 0; {214044#true} is VALID [2020-07-08 22:20:43,698 INFO L280 TraceCheckUtils]: 43: Hoare triple {214044#true} ~lk2~0 := 0; {214044#true} is VALID [2020-07-08 22:20:43,698 INFO L280 TraceCheckUtils]: 44: Hoare triple {214044#true} ~lk3~0 := 0; {214044#true} is VALID [2020-07-08 22:20:43,698 INFO L280 TraceCheckUtils]: 45: Hoare triple {214044#true} ~lk4~0 := 0; {214044#true} is VALID [2020-07-08 22:20:43,698 INFO L280 TraceCheckUtils]: 46: Hoare triple {214044#true} ~lk5~0 := 0; {214044#true} is VALID [2020-07-08 22:20:43,698 INFO L280 TraceCheckUtils]: 47: Hoare triple {214044#true} ~lk6~0 := 0; {214044#true} is VALID [2020-07-08 22:20:43,699 INFO L280 TraceCheckUtils]: 48: Hoare triple {214044#true} ~lk7~0 := 0; {214044#true} is VALID [2020-07-08 22:20:43,699 INFO L280 TraceCheckUtils]: 49: Hoare triple {214044#true} ~lk8~0 := 0; {214044#true} is VALID [2020-07-08 22:20:43,699 INFO L280 TraceCheckUtils]: 50: Hoare triple {214044#true} assume !(0 != ~p1~0); {214044#true} is VALID [2020-07-08 22:20:43,699 INFO L280 TraceCheckUtils]: 51: Hoare triple {214044#true} assume !(0 != ~p2~0); {214044#true} is VALID [2020-07-08 22:20:43,699 INFO L280 TraceCheckUtils]: 52: Hoare triple {214044#true} assume !(0 != ~p3~0); {214044#true} is VALID [2020-07-08 22:20:43,700 INFO L280 TraceCheckUtils]: 53: Hoare triple {214044#true} assume !(0 != ~p4~0); {214044#true} is VALID [2020-07-08 22:20:43,700 INFO L280 TraceCheckUtils]: 54: Hoare triple {214044#true} assume !(0 != ~p5~0); {214044#true} is VALID [2020-07-08 22:20:43,700 INFO L280 TraceCheckUtils]: 55: Hoare triple {214044#true} assume !(0 != ~p6~0); {214044#true} is VALID [2020-07-08 22:20:43,700 INFO L280 TraceCheckUtils]: 56: Hoare triple {214044#true} assume !(0 != ~p7~0); {214044#true} is VALID [2020-07-08 22:20:43,700 INFO L280 TraceCheckUtils]: 57: Hoare triple {214044#true} assume 0 != ~p8~0; {214044#true} is VALID [2020-07-08 22:20:43,701 INFO L280 TraceCheckUtils]: 58: Hoare triple {214044#true} ~lk8~0 := 1; {214048#(= 1 main_~lk8~0)} is VALID [2020-07-08 22:20:43,702 INFO L280 TraceCheckUtils]: 59: Hoare triple {214048#(= 1 main_~lk8~0)} assume !(0 != ~p1~0); {214048#(= 1 main_~lk8~0)} is VALID [2020-07-08 22:20:43,702 INFO L280 TraceCheckUtils]: 60: Hoare triple {214048#(= 1 main_~lk8~0)} assume !(0 != ~p2~0); {214048#(= 1 main_~lk8~0)} is VALID [2020-07-08 22:20:43,703 INFO L280 TraceCheckUtils]: 61: Hoare triple {214048#(= 1 main_~lk8~0)} assume !(0 != ~p3~0); {214048#(= 1 main_~lk8~0)} is VALID [2020-07-08 22:20:43,703 INFO L280 TraceCheckUtils]: 62: Hoare triple {214048#(= 1 main_~lk8~0)} assume !(0 != ~p4~0); {214048#(= 1 main_~lk8~0)} is VALID [2020-07-08 22:20:43,704 INFO L280 TraceCheckUtils]: 63: Hoare triple {214048#(= 1 main_~lk8~0)} assume !(0 != ~p5~0); {214048#(= 1 main_~lk8~0)} is VALID [2020-07-08 22:20:43,704 INFO L280 TraceCheckUtils]: 64: Hoare triple {214048#(= 1 main_~lk8~0)} assume !(0 != ~p6~0); {214048#(= 1 main_~lk8~0)} is VALID [2020-07-08 22:20:43,705 INFO L280 TraceCheckUtils]: 65: Hoare triple {214048#(= 1 main_~lk8~0)} assume !(0 != ~p7~0); {214048#(= 1 main_~lk8~0)} is VALID [2020-07-08 22:20:43,705 INFO L280 TraceCheckUtils]: 66: Hoare triple {214048#(= 1 main_~lk8~0)} assume 0 != ~p8~0; {214048#(= 1 main_~lk8~0)} is VALID [2020-07-08 22:20:43,706 INFO L280 TraceCheckUtils]: 67: Hoare triple {214048#(= 1 main_~lk8~0)} assume 1 != ~lk8~0; {214045#false} is VALID [2020-07-08 22:20:43,706 INFO L280 TraceCheckUtils]: 68: Hoare triple {214045#false} assume !false; {214045#false} is VALID [2020-07-08 22:20:43,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 22:20:43,709 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1775841338] [2020-07-08 22:20:43,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:20:43,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 22:20:43,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561213502] [2020-07-08 22:20:43,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2020-07-08 22:20:43,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:20:43,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 22:20:43,770 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:20:43,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 22:20:43,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:20:43,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 22:20:43,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 22:20:43,770 INFO L87 Difference]: Start difference. First operand 5479 states and 6502 transitions. Second operand 3 states. [2020-07-08 22:21:04,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:21:04,570 INFO L93 Difference]: Finished difference Result 5479 states and 6502 transitions. [2020-07-08 22:21:04,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 22:21:04,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2020-07-08 22:21:04,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:21:04,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 22:21:04,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2020-07-08 22:21:04,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 22:21:04,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2020-07-08 22:21:04,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 106 transitions. [2020-07-08 22:21:04,672 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:21:04,673 INFO L225 Difference]: With dead ends: 5479 [2020-07-08 22:21:04,673 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 22:21:04,683 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 22:21:04,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 22:21:04,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 22:21:04,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:21:04,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 22:21:04,684 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 22:21:04,684 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 22:21:04,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:21:04,684 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 22:21:04,684 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 22:21:04,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:21:04,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:21:04,685 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 22:21:04,685 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 22:21:04,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:21:04,685 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 22:21:04,685 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 22:21:04,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:21:04,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:21:04,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:21:04,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:21:04,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 22:21:04,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 22:21:04,686 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2020-07-08 22:21:04,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:21:04,687 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 22:21:04,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 22:21:04,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-08 22:21:04,687 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:21:04,687 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 22:21:04,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:21:04,687 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-08 22:21:04,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 22:21:05,653 WARN L193 SmtUtils]: Spent 940.00 ms on a formula simplification. DAG size of input: 289 DAG size of output: 159 [2020-07-08 22:21:05,769 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 23 [2020-07-08 22:21:06,204 WARN L193 SmtUtils]: Spent 431.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2020-07-08 22:21:06,351 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 57 [2020-07-08 22:21:06,502 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 55 [2020-07-08 22:21:06,878 WARN L193 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 387 DAG size of output: 23 [2020-07-08 22:21:07,215 WARN L193 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 352 DAG size of output: 11 [2020-07-08 22:21:07,534 WARN L193 SmtUtils]: Spent 315.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2020-07-08 22:21:07,746 WARN L193 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 93 [2020-07-08 22:21:08,047 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 279 DAG size of output: 15 [2020-07-08 22:21:08,600 WARN L193 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 482 DAG size of output: 15 [2020-07-08 22:21:08,928 WARN L193 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 542 DAG size of output: 3 [2020-07-08 22:21:09,111 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 283 DAG size of output: 35 [2020-07-08 22:21:09,588 WARN L193 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 293 DAG size of output: 159 [2020-07-08 22:21:10,033 WARN L193 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 91 [2020-07-08 22:21:10,659 WARN L193 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 671 DAG size of output: 7 [2020-07-08 22:21:11,117 WARN L193 SmtUtils]: Spent 452.00 ms on a formula simplification that was a NOOP. DAG size: 291 [2020-07-08 22:21:11,257 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 298 DAG size of output: 91 [2020-07-08 22:21:11,452 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 17 [2020-07-08 22:21:11,575 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 91 [2020-07-08 22:21:11,697 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2020-07-08 22:21:11,862 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 321 DAG size of output: 55 [2020-07-08 22:21:12,001 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 352 DAG size of output: 11 [2020-07-08 22:21:12,181 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 93 [2020-07-08 22:21:12,552 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 542 DAG size of output: 3 [2020-07-08 22:21:15,403 WARN L193 SmtUtils]: Spent 2.84 s on a formula simplification that was a NOOP. DAG size: 159 [2020-07-08 22:21:18,613 WARN L193 SmtUtils]: Spent 3.14 s on a formula simplification that was a NOOP. DAG size: 161 [2020-07-08 22:21:19,035 WARN L193 SmtUtils]: Spent 413.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-08 22:21:19,395 WARN L193 SmtUtils]: Spent 351.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-08 22:21:22,241 WARN L193 SmtUtils]: Spent 2.76 s on a formula simplification that was a NOOP. DAG size: 159 [2020-07-08 22:21:23,348 WARN L193 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 93 [2020-07-08 22:21:23,525 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-08 22:21:23,740 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-08 22:21:26,499 WARN L193 SmtUtils]: Spent 2.74 s on a formula simplification that was a NOOP. DAG size: 159 [2020-07-08 22:21:26,931 WARN L193 SmtUtils]: Spent 422.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-08 22:21:27,982 WARN L193 SmtUtils]: Spent 956.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-08 22:21:37,056 WARN L193 SmtUtils]: Spent 9.01 s on a formula simplification that was a NOOP. DAG size: 291 [2020-07-08 22:21:38,022 WARN L193 SmtUtils]: Spent 955.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-08 22:21:38,161 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-08 22:21:38,328 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-08 22:21:39,324 WARN L193 SmtUtils]: Spent 951.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-08 22:21:42,414 WARN L193 SmtUtils]: Spent 3.08 s on a formula simplification that was a NOOP. DAG size: 161 [2020-07-08 22:21:42,782 WARN L193 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-08 22:21:44,010 WARN L193 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 93 [2020-07-08 22:21:44,367 WARN L193 SmtUtils]: Spent 347.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-08 22:21:44,512 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-08 22:21:44,563 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 22:21:44,563 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-08 22:21:44,563 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-08 22:21:44,564 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 22:21:44,564 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 22:21:44,564 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-08 22:21:44,564 INFO L264 CegarLoopResult]: At program point L126(line 126) the Hoare annotation is: (= 1 main_~lk8~0) [2020-07-08 22:21:44,565 INFO L264 CegarLoopResult]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2020-07-08 22:21:44,565 INFO L271 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-07-08 22:21:44,565 INFO L264 CegarLoopResult]: At program point L60-1(lines 33 130) the Hoare annotation is: (let ((.cse0 (= 0 main_~p2~0)) (.cse1 (= 0 main_~p1~0)) (.cse3 (= 1 main_~lk2~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse3 .cse1) (and .cse3 .cse2))) [2020-07-08 22:21:44,565 INFO L271 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: true [2020-07-08 22:21:44,566 INFO L271 CegarLoopResult]: At program point L27-2(line 27) the Hoare annotation is: true [2020-07-08 22:21:44,566 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 4 135) the Hoare annotation is: true [2020-07-08 22:21:44,568 INFO L264 CegarLoopResult]: At program point L85(line 85) the Hoare annotation is: (let ((.cse1 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p2~0)) (.cse11 (= 1 main_~lk6~0)) (.cse12 (= 0 main_~p3~0)) (.cse0 (= main_~lk7~0 1)) (.cse5 (= 0 main_~p1~0)) (.cse6 (= 1 main_~lk5~0)) (.cse13 (= 0 main_~p7~0)) (.cse7 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk3~0)) (.cse8 (= 0 main_~p5~0)) (.cse4 (= 0 main_~p6~0)) (.cse9 (= 1 main_~lk1~0)) (.cse10 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse3 .cse8 .cse4 .cse9 .cse10) (and .cse11 .cse12 .cse7 .cse0 .cse1 .cse8 .cse5) (and .cse11 .cse7 .cse0 .cse1 .cse3 .cse8 .cse9) (and .cse13 .cse12 .cse1 .cse2 .cse4 .cse6 .cse9) (and .cse11 .cse0 .cse2 .cse3 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse9 .cse10) (and .cse12 .cse7 .cse0 .cse1 .cse8 .cse4 .cse5) (and .cse13 .cse12 .cse1 .cse2 .cse8 .cse4 .cse9) (and .cse13 .cse7 .cse1 .cse3 .cse8 .cse4 .cse5) (and .cse11 .cse7 .cse0 .cse3 .cse8 .cse5 .cse10) (and .cse11 .cse13 .cse12 .cse7 .cse1 .cse8 .cse9) (and .cse13 .cse12 .cse7 .cse1 .cse8 .cse4 .cse5) (and .cse13 .cse7 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse11 .cse13 .cse12 .cse2 .cse8 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse6 .cse9) (and .cse11 .cse12 .cse7 .cse0 .cse1 .cse8 .cse9) (and .cse11 .cse13 .cse12 .cse2 .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse7 .cse0 .cse8 .cse5 .cse10) (and .cse13 .cse12 .cse7 .cse8 .cse4 .cse5 .cse10) (and .cse11 .cse13 .cse12 .cse2 .cse6 .cse9 .cse10) (and .cse11 .cse13 .cse12 .cse2 .cse5 .cse6 .cse10) (and .cse11 .cse0 .cse2 .cse3 .cse5 .cse6 .cse10) (and .cse11 .cse12 .cse0 .cse2 .cse5 .cse6 .cse10) (and .cse13 .cse12 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse11 .cse13 .cse7 .cse1 .cse3 .cse5 .cse6) (and .cse13 .cse1 .cse2 .cse3 .cse8 .cse4 .cse5) (and .cse11 .cse0 .cse2 .cse3 .cse8 .cse5 .cse10) (and .cse11 .cse12 .cse0 .cse2 .cse8 .cse5 .cse10) (and .cse11 .cse13 .cse12 .cse7 .cse1 .cse8 .cse5) (and .cse11 .cse12 .cse0 .cse2 .cse6 .cse9 .cse10) (and .cse11 .cse13 .cse7 .cse3 .cse5 .cse6 .cse10) (and .cse7 .cse0 .cse3 .cse8 .cse4 .cse5 .cse10) (and .cse11 .cse7 .cse0 .cse1 .cse3 .cse6 .cse9) (and .cse12 .cse0 .cse1 .cse2 .cse4 .cse6 .cse9) (and .cse11 .cse13 .cse12 .cse7 .cse1 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse3 .cse8 .cse4 .cse9) (and .cse11 .cse12 .cse0 .cse1 .cse2 .cse8 .cse9) (and .cse7 .cse0 .cse1 .cse3 .cse8 .cse4 .cse5) (and .cse7 .cse0 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse13 .cse12 .cse1 .cse2 .cse8 .cse4 .cse5) (and .cse11 .cse13 .cse2 .cse3 .cse6 .cse9 .cse10) (and .cse11 .cse13 .cse7 .cse3 .cse8 .cse5 .cse10) (and .cse11 .cse7 .cse0 .cse3 .cse6 .cse9 .cse10) (and .cse11 .cse13 .cse12 .cse1 .cse2 .cse6 .cse9) (and .cse13 .cse1 .cse2 .cse3 .cse4 .cse6 .cse9) (and .cse11 .cse13 .cse7 .cse3 .cse8 .cse9 .cse10) (and .cse11 .cse7 .cse0 .cse1 .cse3 .cse8 .cse5) (and .cse12 .cse7 .cse0 .cse1 .cse8 .cse4 .cse9) (and .cse13 .cse12 .cse2 .cse8 .cse4 .cse5 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 .cse5) (and .cse11 .cse12 .cse0 .cse2 .cse8 .cse9 .cse10) (and .cse13 .cse12 .cse7 .cse4 .cse6 .cse9 .cse10) (and .cse13 .cse2 .cse3 .cse8 .cse4 .cse5 .cse10) (and .cse13 .cse12 .cse7 .cse1 .cse8 .cse4 .cse9) (and .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse12 .cse0 .cse2 .cse4 .cse6 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse12 .cse7 .cse0 .cse8 .cse4 .cse9 .cse10) (and .cse11 .cse13 .cse12 .cse1 .cse2 .cse8 .cse5) (and .cse13 .cse12 .cse7 .cse1 .cse4 .cse5 .cse6) (and .cse13 .cse7 .cse3 .cse4 .cse6 .cse9 .cse10) (and .cse13 .cse1 .cse2 .cse3 .cse8 .cse4 .cse9) (and .cse13 .cse12 .cse2 .cse4 .cse5 .cse6 .cse10) (and .cse12 .cse0 .cse2 .cse4 .cse5 .cse6 .cse10) (and .cse11 .cse12 .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse5 .cse10) (and .cse11 .cse12 .cse7 .cse0 .cse6 .cse9 .cse10) (and .cse11 .cse7 .cse0 .cse3 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse11 .cse13 .cse1 .cse2 .cse3 .cse8 .cse9) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse6 .cse9) (and .cse12 .cse7 .cse0 .cse4 .cse6 .cse9 .cse10) (and .cse13 .cse7 .cse1 .cse3 .cse8 .cse4 .cse9) (and .cse11 .cse12 .cse7 .cse0 .cse1 .cse6 .cse9) (and .cse13 .cse7 .cse1 .cse3 .cse4 .cse6 .cse9) (and .cse11 .cse12 .cse7 .cse0 .cse8 .cse9 .cse10) (and .cse13 .cse7 .cse3 .cse8 .cse4 .cse5 .cse10) (and .cse12 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse8 .cse9) (and .cse11 .cse13 .cse12 .cse7 .cse6 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse13 .cse12 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse13 .cse12 .cse1 .cse2 .cse5 .cse6) (and .cse11 .cse13 .cse2 .cse3 .cse5 .cse6 .cse10) (and .cse11 .cse13 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse12 .cse0 .cse2 .cse8 .cse4 .cse5 .cse10) (and .cse12 .cse7 .cse0 .cse1 .cse4 .cse5 .cse6) (and .cse11 .cse13 .cse2 .cse3 .cse8 .cse9 .cse10) (and .cse13 .cse2 .cse3 .cse4 .cse6 .cse9 .cse10) (and .cse11 .cse0 .cse2 .cse3 .cse6 .cse9 .cse10) (and .cse11 .cse12 .cse0 .cse1 .cse2 .cse8 .cse5) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse9 .cse10) (and .cse11 .cse13 .cse12 .cse1 .cse2 .cse8 .cse9) (and .cse11 .cse7 .cse0 .cse1 .cse3 .cse5 .cse6) (and .cse7 .cse0 .cse3 .cse4 .cse6 .cse9 .cse10) (and .cse11 .cse13 .cse7 .cse3 .cse6 .cse9 .cse10) (and .cse12 .cse0 .cse2 .cse8 .cse4 .cse9 .cse10) (and .cse13 .cse12 .cse7 .cse4 .cse5 .cse6 .cse10) (and .cse11 .cse13 .cse12 .cse7 .cse1 .cse6 .cse9) (and .cse11 .cse13 .cse7 .cse1 .cse3 .cse6 .cse9) (and .cse13 .cse12 .cse7 .cse1 .cse4 .cse6 .cse9) (and .cse13 .cse7 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse11 .cse12 .cse0 .cse1 .cse2 .cse5 .cse6) (and .cse11 .cse13 .cse1 .cse2 .cse3 .cse6 .cse9) (and .cse13 .cse2 .cse3 .cse8 .cse4 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse9) (and .cse11 .cse13 .cse2 .cse3 .cse8 .cse5 .cse10) (and .cse11 .cse13 .cse12 .cse7 .cse8 .cse5 .cse10) (and .cse12 .cse7 .cse0 .cse4 .cse5 .cse6 .cse10) (and .cse13 .cse12 .cse2 .cse8 .cse4 .cse9 .cse10) (and .cse13 .cse12 .cse2 .cse4 .cse6 .cse9 .cse10) (and .cse11 .cse12 .cse7 .cse0 .cse1 .cse5 .cse6) (and .cse11 .cse13 .cse1 .cse2 .cse3 .cse8 .cse5) (and .cse12 .cse0 .cse1 .cse2 .cse8 .cse4 .cse9) (and .cse13 .cse12 .cse7 .cse8 .cse4 .cse9 .cse10) (and .cse12 .cse7 .cse0 .cse1 .cse4 .cse6 .cse9) (and .cse11 .cse13 .cse7 .cse1 .cse3 .cse8 .cse5) (and .cse11 .cse13 .cse7 .cse1 .cse3 .cse8 .cse9) (and .cse12 .cse7 .cse0 .cse8 .cse4 .cse5 .cse10) (and .cse11 .cse13 .cse12 .cse7 .cse5 .cse6 .cse10) (and .cse13 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse11 .cse7 .cse0 .cse3 .cse5 .cse6 .cse10) (and .cse12 .cse0 .cse1 .cse2 .cse8 .cse4 .cse5) (and .cse11 .cse12 .cse7 .cse0 .cse5 .cse6 .cse10) (and .cse13 .cse7 .cse3 .cse8 .cse4 .cse9 .cse10))) [2020-07-08 22:21:44,568 INFO L271 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: true [2020-07-08 22:21:44,568 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-08 22:21:44,569 INFO L264 CegarLoopResult]: At program point L77(line 77) the Hoare annotation is: (let ((.cse1 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk5~0)) (.cse5 (= 0 main_~p3~0)) (.cse9 (= 0 main_~p1~0)) (.cse7 (= 0 main_~p2~0)) (.cse2 (= 1 main_~lk3~0)) (.cse6 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk1~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse4) (and .cse5 .cse7 .cse3 .cse4 .cse8) (and .cse7 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse5 .cse7 .cse9 .cse3 .cse8) (and .cse1 .cse7 .cse2 .cse6 .cse4) (and .cse7 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse9 .cse3) (and .cse0 .cse2 .cse6 .cse4 .cse8) (and .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse9 .cse3 .cse8) (and .cse5 .cse7 .cse6 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse5 .cse1 .cse7 .cse6 .cse4) (and .cse0 .cse2 .cse6 .cse9 .cse8) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse9 .cse3) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse6 .cse4 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse8) (and .cse7 .cse2 .cse6 .cse9 .cse8) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse1 .cse7 .cse9 .cse3) (and .cse5 .cse0 .cse6 .cse9 .cse8) (and .cse0 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse6 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse9) (and .cse5 .cse0 .cse3 .cse4 .cse8) (and .cse5 .cse7 .cse6 .cse9 .cse8) (and .cse7 .cse2 .cse6 .cse4 .cse8))) [2020-07-08 22:21:44,569 INFO L264 CegarLoopResult]: At program point L110-1(lines 33 130) the Hoare annotation is: (let ((.cse1 (= 0 main_~p6~0)) (.cse0 (= 1 main_~lk7~0)) (.cse2 (= 0 main_~p8~0)) (.cse3 (= 1 main_~lk6~0)) (.cse4 (= 0 main_~p7~0)) (.cse5 (= 1 main_~lk8~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse4 .cse1 .cse2) (and .cse5 .cse0 .cse1) (and .cse3 .cse5 .cse0) (and .cse4 .cse5 .cse1) (and .cse3 .cse0 .cse2) (and .cse3 .cse4 .cse5))) [2020-07-08 22:21:44,569 INFO L271 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: true [2020-07-08 22:21:44,569 INFO L264 CegarLoopResult]: At program point L102(line 102) the Hoare annotation is: (let ((.cse9 (= 0 main_~p5~0)) (.cse6 (= 1 main_~lk6~0)) (.cse7 (= 0 main_~p7~0)) (.cse8 (= 0 main_~p4~0)) (.cse3 (= 0 main_~p8~0)) (.cse10 (= 1 main_~lk8~0)) (.cse0 (= 1 main_~lk7~0)) (.cse1 (= 1 main_~lk3~0)) (.cse2 (= 0 main_~p6~0)) (.cse4 (= 1 main_~lk5~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse1 .cse3 .cse4) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse7 .cse1 .cse9 .cse2 .cse3 .cse5) (and .cse6 .cse10 .cse0 .cse8 .cse1 .cse9) (and .cse6 .cse7 .cse10 .cse1 .cse4 .cse5) (and .cse6 .cse10 .cse0 .cse8 .cse1 .cse4) (and .cse0 .cse8 .cse1 .cse9 .cse2 .cse3) (and .cse6 .cse7 .cse8 .cse1 .cse9 .cse3) (and .cse6 .cse10 .cse0 .cse1 .cse4 .cse5) (and .cse6 .cse7 .cse10 .cse1 .cse9 .cse5) (and .cse6 .cse7 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5) (and .cse6 .cse7 .cse10 .cse8 .cse1 .cse9) (and .cse10 .cse0 .cse8 .cse1 .cse2 .cse4) (and .cse7 .cse10 .cse8 .cse1 .cse2 .cse4) (and .cse6 .cse10 .cse0 .cse1 .cse9 .cse5) (and .cse10 .cse0 .cse8 .cse1 .cse9 .cse2) (and .cse6 .cse7 .cse1 .cse9 .cse3 .cse5) (and .cse6 .cse0 .cse8 .cse1 .cse9 .cse3) (and .cse6 .cse0 .cse1 .cse9 .cse3 .cse5) (and .cse7 .cse10 .cse8 .cse1 .cse9 .cse2) (and .cse7 .cse10 .cse1 .cse9 .cse2 .cse5) (and .cse10 .cse0 .cse1 .cse9 .cse2 .cse5) (and .cse7 .cse8 .cse1 .cse9 .cse2 .cse3) (and .cse6 .cse7 .cse10 .cse8 .cse1 .cse4) (and .cse6 .cse0 .cse8 .cse1 .cse3 .cse4) (and .cse7 .cse10 .cse1 .cse2 .cse4 .cse5) (and .cse7 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse7 .cse8 .cse1 .cse2 .cse3 .cse4) (and .cse10 .cse0 .cse1 .cse2 .cse4 .cse5))) [2020-07-08 22:21:44,569 INFO L264 CegarLoopResult]: At program point L69(line 69) the Hoare annotation is: (let ((.cse5 (= 0 main_~p1~0)) (.cse3 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse4 (= 0 main_~p2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse4 .cse1 .cse5) (and .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse5) (and .cse3 .cse0 .cse5) (and .cse3 .cse0 .cse2) (and .cse4 .cse1 .cse2))) [2020-07-08 22:21:44,570 INFO L264 CegarLoopResult]: At program point L127(line 127) the Hoare annotation is: (= 1 main_~lk8~0) [2020-07-08 22:21:44,570 INFO L264 CegarLoopResult]: At program point L61(line 61) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-08 22:21:44,570 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-07-08 22:21:44,570 INFO L264 CegarLoopResult]: At program point L111(line 111) the Hoare annotation is: (let ((.cse5 (= 1 main_~lk8~0)) (.cse1 (= 0 main_~p6~0)) (.cse0 (= 0 main_~p7~0)) (.cse4 (= 1 main_~lk6~0)) (.cse6 (= 1 main_~lk7~0)) (.cse2 (= 0 main_~p8~0)) (.cse3 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse3) (and .cse4 .cse5 .cse6 .cse3) (and .cse5 .cse6 .cse1 .cse3) (and .cse6 .cse1 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse4 .cse6 .cse2 .cse3))) [2020-07-08 22:21:44,570 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-07-08 22:21:44,570 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-07-08 22:21:44,571 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-07-08 22:21:44,571 INFO L264 CegarLoopResult]: At program point L95-1(lines 33 130) the Hoare annotation is: (let ((.cse4 (= 0 main_~p8~0)) (.cse0 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p7~0)) (.cse8 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p4~0)) (.cse10 (= 0 main_~p5~0)) (.cse9 (= 1 main_~lk8~0)) (.cse6 (= 1 main_~lk7~0)) (.cse3 (= 1 main_~lk3~0)) (.cse7 (= 0 main_~p6~0)) (.cse5 (= 1 main_~lk5~0)) (.cse11 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse9 .cse6 .cse2 .cse5) (and .cse1 .cse3 .cse10 .cse7 .cse4 .cse11) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse10) (and .cse0 .cse1 .cse8 .cse2 .cse10 .cse4) (and .cse0 .cse1 .cse9 .cse3 .cse5 .cse11) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse5) (and .cse0 .cse8 .cse9 .cse6 .cse10 .cse11) (and .cse6 .cse2 .cse3 .cse10 .cse7 .cse4) (and .cse8 .cse9 .cse6 .cse2 .cse7 .cse5) (and .cse0 .cse8 .cse6 .cse4 .cse5 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse11) (and .cse0 .cse8 .cse9 .cse6 .cse2 .cse10) (and .cse0 .cse1 .cse8 .cse9 .cse5 .cse11) (and .cse9 .cse6 .cse2 .cse3 .cse7 .cse5) (and .cse1 .cse9 .cse2 .cse3 .cse7 .cse5) (and .cse0 .cse1 .cse8 .cse2 .cse4 .cse5) (and .cse0 .cse1 .cse8 .cse4 .cse5 .cse11) (and .cse1 .cse8 .cse7 .cse4 .cse5 .cse11) (and .cse0 .cse6 .cse3 .cse10 .cse4 .cse11) (and .cse1 .cse8 .cse9 .cse2 .cse10 .cse7) (and .cse1 .cse9 .cse2 .cse3 .cse10 .cse7) (and .cse9 .cse6 .cse3 .cse10 .cse7 .cse11) (and .cse1 .cse2 .cse3 .cse10 .cse7 .cse4) (and .cse1 .cse8 .cse9 .cse10 .cse7 .cse11) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5) (and .cse1 .cse8 .cse9 .cse7 .cse5 .cse11) (and .cse1 .cse9 .cse3 .cse7 .cse5 .cse11) (and .cse1 .cse3 .cse7 .cse4 .cse5 .cse11) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse6 .cse3 .cse7 .cse4 .cse5 .cse11) (and .cse0 .cse6 .cse3 .cse4 .cse5 .cse11) (and .cse8 .cse6 .cse7 .cse4 .cse5 .cse11) (and .cse0 .cse1 .cse8 .cse10 .cse4 .cse11) (and .cse8 .cse6 .cse2 .cse7 .cse4 .cse5) (and .cse1 .cse8 .cse2 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse6 .cse2 .cse10 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4) (and .cse8 .cse6 .cse2 .cse10 .cse7 .cse4) (and .cse0 .cse9 .cse6 .cse3 .cse5 .cse11) (and .cse0 .cse1 .cse9 .cse3 .cse10 .cse11) (and .cse6 .cse3 .cse10 .cse7 .cse4 .cse11) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse10) (and .cse0 .cse8 .cse6 .cse2 .cse4 .cse5) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse9 .cse6 .cse3 .cse10 .cse11) (and .cse9 .cse6 .cse2 .cse3 .cse10 .cse7) (and .cse8 .cse9 .cse6 .cse10 .cse7 .cse11) (and .cse0 .cse8 .cse6 .cse10 .cse4 .cse11) (and .cse8 .cse9 .cse6 .cse2 .cse10 .cse7) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse11) (and .cse0 .cse6 .cse2 .cse3 .cse10 .cse4) (and .cse8 .cse9 .cse6 .cse7 .cse5 .cse11) (and .cse1 .cse9 .cse3 .cse10 .cse7 .cse11) (and .cse0 .cse8 .cse9 .cse6 .cse5 .cse11) (and .cse0 .cse1 .cse8 .cse9 .cse2 .cse5) (and .cse1 .cse8 .cse10 .cse7 .cse4 .cse11) (and .cse8 .cse6 .cse10 .cse7 .cse4 .cse11) (and .cse1 .cse8 .cse2 .cse10 .cse7 .cse4) (and .cse1 .cse8 .cse9 .cse2 .cse7 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse8 .cse9 .cse2 .cse10) (and .cse9 .cse6 .cse3 .cse7 .cse5 .cse11))) [2020-07-08 22:21:44,572 INFO L264 CegarLoopResult]: At program point L120-1(lines 33 130) the Hoare annotation is: (or (= 1 main_~lk8~0) (= 0 main_~p8~0)) [2020-07-08 22:21:44,572 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-07-08 22:21:44,572 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-07-08 22:21:44,572 INFO L271 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: true [2020-07-08 22:21:44,572 INFO L264 CegarLoopResult]: At program point L112(line 112) the Hoare annotation is: (let ((.cse5 (= 1 main_~lk8~0)) (.cse1 (= 0 main_~p6~0)) (.cse0 (= 0 main_~p7~0)) (.cse4 (= 1 main_~lk6~0)) (.cse6 (= 1 main_~lk7~0)) (.cse2 (= 0 main_~p8~0)) (.cse3 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse3) (and .cse4 .cse5 .cse6 .cse3) (and .cse5 .cse6 .cse1 .cse3) (and .cse6 .cse1 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse4 .cse6 .cse2 .cse3))) [2020-07-08 22:21:44,572 INFO L271 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: true [2020-07-08 22:21:44,572 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-07-08 22:21:44,573 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 4 135) the Hoare annotation is: true [2020-07-08 22:21:44,573 INFO L271 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: true [2020-07-08 22:21:44,573 INFO L264 CegarLoopResult]: At program point L96(line 96) the Hoare annotation is: (let ((.cse9 (= 0 main_~p7~0)) (.cse6 (= 0 main_~p8~0)) (.cse7 (= 1 main_~lk6~0)) (.cse8 (= 0 main_~p3~0)) (.cse12 (= 1 main_~lk5~0)) (.cse11 (= 1 main_~lk4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse10 (= 1 main_~lk8~0)) (.cse1 (= 1 main_~lk7~0)) (.cse2 (= 0 main_~p4~0)) (.cse3 (= 1 main_~lk3~0)) (.cse4 (= 0 main_~p5~0)) (.cse5 (= 0 main_~p6~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse4 .cse6) (and .cse9 .cse0 .cse10 .cse3 .cse4 .cse5 .cse11) (and .cse9 .cse8 .cse0 .cse4 .cse5 .cse6 .cse11) (and .cse8 .cse0 .cse1 .cse5 .cse6 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse4 .cse6 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse9 .cse0 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse2 .cse4) (and .cse7 .cse9 .cse0 .cse10 .cse3 .cse4 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse6 .cse11) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse6 .cse12) (and .cse7 .cse0 .cse10 .cse1 .cse3 .cse4 .cse11) (and .cse7 .cse9 .cse0 .cse10 .cse2 .cse3 .cse4) (and .cse9 .cse0 .cse10 .cse2 .cse3 .cse5 .cse12) (and .cse7 .cse0 .cse10 .cse1 .cse2 .cse3 .cse12) (and .cse0 .cse10 .cse1 .cse3 .cse4 .cse5 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse2 .cse4) (and .cse7 .cse9 .cse8 .cse0 .cse2 .cse6 .cse12) (and .cse7 .cse9 .cse0 .cse3 .cse6 .cse12 .cse11) (and .cse7 .cse8 .cse0 .cse1 .cse6 .cse12 .cse11) (and .cse8 .cse0 .cse10 .cse1 .cse4 .cse5 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse12 .cse11) (and .cse9 .cse0 .cse3 .cse5 .cse6 .cse12 .cse11) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse5 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse9 .cse8 .cse0 .cse6 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse2 .cse4 .cse6) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse2 .cse12) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse4 .cse11) (and .cse7 .cse9 .cse0 .cse10 .cse2 .cse3 .cse12) (and .cse9 .cse8 .cse0 .cse2 .cse5 .cse6 .cse12) (and .cse7 .cse9 .cse0 .cse2 .cse3 .cse6 .cse12) (and .cse7 .cse0 .cse10 .cse1 .cse3 .cse12 .cse11) (and .cse7 .cse0 .cse10 .cse1 .cse2 .cse3 .cse4) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse12 .cse11) (and .cse9 .cse8 .cse0 .cse10 .cse5 .cse12 .cse11) (and .cse9 .cse0 .cse2 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse9 .cse0 .cse10 .cse3 .cse12 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse6 .cse12 .cse11) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse12 .cse11) (and .cse9 .cse8 .cse0 .cse10 .cse2 .cse5 .cse12) (and .cse8 .cse0 .cse1 .cse4 .cse5 .cse6 .cse11) (and .cse8 .cse0 .cse10 .cse1 .cse2 .cse4 .cse5) (and .cse7 .cse8 .cse0 .cse1 .cse4 .cse6 .cse11) (and .cse8 .cse0 .cse1 .cse2 .cse5 .cse6 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse6 .cse12) (and .cse9 .cse8 .cse0 .cse2 .cse4 .cse5 .cse6) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse9 .cse0 .cse3 .cse4 .cse6 .cse11) (and .cse9 .cse8 .cse0 .cse10 .cse2 .cse4 .cse5) (and .cse8 .cse0 .cse10 .cse1 .cse2 .cse5 .cse12) (and .cse9 .cse8 .cse0 .cse5 .cse6 .cse12 .cse11) (and .cse7 .cse9 .cse0 .cse2 .cse3 .cse4 .cse6) (and .cse9 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse8 .cse0 .cse10 .cse4 .cse5 .cse11) (and .cse9 .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse10 .cse1 .cse5 .cse12 .cse11) (and .cse9 .cse0 .cse10 .cse3 .cse5 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse4 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse2 .cse12) (and .cse0 .cse10 .cse1 .cse3 .cse5 .cse12 .cse11) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse4 .cse5))) [2020-07-08 22:21:44,574 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) the Hoare annotation is: false [2020-07-08 22:21:44,574 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 135) the Hoare annotation is: true [2020-07-08 22:21:44,574 INFO L264 CegarLoopResult]: At program point L121(line 121) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk7~0))) (or (and .cse0 (= 0 main_~p8~0)) (and (= 1 main_~lk8~0) .cse0))) [2020-07-08 22:21:44,574 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-07-08 22:21:44,576 INFO L264 CegarLoopResult]: At program point L80-1(lines 33 130) the Hoare annotation is: (let ((.cse1 (= 0 main_~p3~0)) (.cse5 (= 1 main_~lk5~0)) (.cse2 (= 0 main_~p4~0)) (.cse0 (= 0 main_~p7~0)) (.cse13 (= 1 main_~lk2~0)) (.cse4 (= 0 main_~p6~0)) (.cse6 (= 1 main_~lk1~0)) (.cse9 (= 1 main_~lk6~0)) (.cse7 (= 1 main_~lk7~0)) (.cse3 (= 0 main_~p2~0)) (.cse10 (= 1 main_~lk3~0)) (.cse8 (= 0 main_~p5~0)) (.cse12 (= 0 main_~p1~0)) (.cse11 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse7 .cse2 .cse3 .cse8 .cse4 .cse6) (and .cse9 .cse7 .cse3 .cse10 .cse5 .cse6 .cse11) (and .cse1 .cse7 .cse2 .cse3 .cse8 .cse4 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 .cse6) (and .cse7 .cse2 .cse3 .cse10 .cse8 .cse4 .cse12) (and .cse0 .cse13 .cse2 .cse10 .cse8 .cse4 .cse12) (and .cse9 .cse13 .cse7 .cse10 .cse8 .cse6 .cse11) (and .cse9 .cse1 .cse7 .cse3 .cse5 .cse6 .cse11) (and .cse9 .cse0 .cse1 .cse13 .cse2 .cse8 .cse6) (and .cse13 .cse7 .cse10 .cse4 .cse12 .cse5 .cse11) (and .cse0 .cse1 .cse13 .cse2 .cse8 .cse4 .cse12) (and .cse0 .cse13 .cse10 .cse4 .cse12 .cse5 .cse11) (and .cse1 .cse7 .cse2 .cse3 .cse4 .cse12 .cse5) (and .cse13 .cse7 .cse2 .cse10 .cse4 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse3 .cse8 .cse12 .cse11) (and .cse9 .cse0 .cse1 .cse3 .cse8 .cse6 .cse11) (and .cse0 .cse1 .cse13 .cse8 .cse4 .cse12 .cse11) (and .cse9 .cse0 .cse1 .cse3 .cse5 .cse6 .cse11) (and .cse9 .cse0 .cse1 .cse3 .cse12 .cse5 .cse11) (and .cse13 .cse7 .cse10 .cse8 .cse4 .cse6 .cse11) (and .cse9 .cse1 .cse13 .cse7 .cse2 .cse8 .cse6) (and .cse9 .cse7 .cse2 .cse3 .cse10 .cse12 .cse5) (and .cse1 .cse7 .cse3 .cse8 .cse4 .cse6 .cse11) (and .cse9 .cse0 .cse13 .cse2 .cse10 .cse12 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse5) (and .cse9 .cse1 .cse13 .cse7 .cse2 .cse12 .cse5) (and .cse9 .cse1 .cse13 .cse7 .cse12 .cse5 .cse11) (and .cse0 .cse2 .cse3 .cse10 .cse8 .cse4 .cse12) (and .cse1 .cse7 .cse3 .cse8 .cse4 .cse12 .cse11) (and .cse9 .cse0 .cse13 .cse10 .cse12 .cse5 .cse11) (and .cse9 .cse1 .cse7 .cse3 .cse8 .cse6 .cse11) (and .cse1 .cse13 .cse7 .cse2 .cse8 .cse4 .cse12) (and .cse9 .cse0 .cse1 .cse13 .cse2 .cse8 .cse12) (and .cse9 .cse0 .cse1 .cse13 .cse2 .cse12 .cse5) (and .cse1 .cse13 .cse7 .cse2 .cse4 .cse5 .cse6) (and .cse1 .cse13 .cse7 .cse2 .cse4 .cse12 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 .cse12) (and .cse9 .cse0 .cse3 .cse10 .cse5 .cse6 .cse11) (and .cse9 .cse0 .cse13 .cse10 .cse8 .cse12 .cse11) (and .cse1 .cse7 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse4 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse9 .cse0 .cse13 .cse10 .cse8 .cse6 .cse11) (and .cse9 .cse1 .cse13 .cse7 .cse2 .cse5 .cse6) (and .cse9 .cse13 .cse7 .cse10 .cse8 .cse12 .cse11) (and .cse9 .cse7 .cse2 .cse3 .cse10 .cse8 .cse12) (and .cse0 .cse1 .cse3 .cse8 .cse4 .cse12 .cse11) (and .cse0 .cse3 .cse10 .cse8 .cse4 .cse12 .cse11) (and .cse0 .cse1 .cse13 .cse4 .cse5 .cse6 .cse11) (and .cse9 .cse1 .cse7 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse13 .cse2 .cse8 .cse4 .cse6) (and .cse0 .cse3 .cse10 .cse4 .cse12 .cse5 .cse11) (and .cse9 .cse1 .cse7 .cse3 .cse12 .cse5 .cse11) (and .cse7 .cse2 .cse3 .cse10 .cse4 .cse5 .cse6) (and .cse9 .cse13 .cse7 .cse2 .cse10 .cse12 .cse5) (and .cse13 .cse7 .cse10 .cse8 .cse4 .cse12 .cse11) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse8 .cse12) (and .cse0 .cse1 .cse13 .cse2 .cse4 .cse12 .cse5) (and .cse0 .cse13 .cse10 .cse4 .cse5 .cse6 .cse11) (and .cse9 .cse1 .cse7 .cse2 .cse3 .cse12 .cse5) (and .cse9 .cse1 .cse7 .cse2 .cse3 .cse8 .cse12) (and .cse9 .cse1 .cse13 .cse7 .cse2 .cse8 .cse12) (and .cse0 .cse2 .cse3 .cse10 .cse8 .cse4 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse12 .cse5 .cse11) (and .cse9 .cse13 .cse7 .cse10 .cse12 .cse5 .cse11) (and .cse13 .cse7 .cse10 .cse4 .cse5 .cse6 .cse11) (and .cse9 .cse1 .cse13 .cse7 .cse5 .cse6 .cse11) (and .cse7 .cse3 .cse10 .cse8 .cse4 .cse12 .cse11) (and .cse9 .cse1 .cse7 .cse3 .cse8 .cse12 .cse11) (and .cse9 .cse7 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse9 .cse0 .cse2 .cse3 .cse10 .cse8 .cse6) (and .cse0 .cse13 .cse2 .cse10 .cse8 .cse4 .cse6) (and .cse1 .cse13 .cse7 .cse8 .cse4 .cse6 .cse11) (and .cse0 .cse13 .cse2 .cse10 .cse4 .cse5 .cse6) (and .cse0 .cse13 .cse10 .cse8 .cse4 .cse12 .cse11) (and .cse9 .cse0 .cse1 .cse13 .cse5 .cse6 .cse11) (and .cse9 .cse0 .cse1 .cse13 .cse8 .cse6 .cse11) (and .cse7 .cse3 .cse10 .cse4 .cse12 .cse5 .cse11) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse12 .cse5) (and .cse9 .cse1 .cse7 .cse2 .cse3 .cse8 .cse6) (and .cse9 .cse0 .cse3 .cse10 .cse12 .cse5 .cse11) (and .cse9 .cse1 .cse13 .cse7 .cse8 .cse12 .cse11) (and .cse9 .cse13 .cse7 .cse2 .cse10 .cse8 .cse6) (and .cse9 .cse0 .cse2 .cse3 .cse10 .cse12 .cse5) (and .cse7 .cse2 .cse3 .cse10 .cse4 .cse12 .cse5) (and .cse9 .cse0 .cse3 .cse10 .cse8 .cse6 .cse11) (and .cse0 .cse3 .cse10 .cse4 .cse5 .cse6 .cse11) (and .cse1 .cse13 .cse7 .cse8 .cse4 .cse12 .cse11) (and .cse13 .cse7 .cse2 .cse10 .cse8 .cse4 .cse6) (and .cse7 .cse2 .cse3 .cse10 .cse8 .cse4 .cse6) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse8 .cse6) (and .cse9 .cse7 .cse3 .cse10 .cse8 .cse6 .cse11) (and .cse9 .cse0 .cse13 .cse10 .cse5 .cse6 .cse11) (and .cse9 .cse7 .cse2 .cse3 .cse10 .cse8 .cse6) (and .cse0 .cse1 .cse13 .cse4 .cse12 .cse5 .cse11) (and .cse9 .cse0 .cse1 .cse13 .cse2 .cse5 .cse6) (and .cse9 .cse0 .cse13 .cse2 .cse10 .cse5 .cse6) (and .cse0 .cse1 .cse13 .cse2 .cse4 .cse5 .cse6) (and .cse0 .cse13 .cse2 .cse10 .cse4 .cse12 .cse5) (and .cse1 .cse7 .cse3 .cse4 .cse12 .cse5 .cse11) (and .cse0 .cse3 .cse10 .cse8 .cse4 .cse6 .cse11) (and .cse9 .cse0 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse7 .cse3 .cse10 .cse8 .cse4 .cse6 .cse11) (and .cse13 .cse7 .cse2 .cse10 .cse4 .cse12 .cse5) (and .cse9 .cse0 .cse3 .cse10 .cse8 .cse12 .cse11) (and .cse9 .cse7 .cse3 .cse10 .cse12 .cse5 .cse11) (and .cse9 .cse0 .cse1 .cse13 .cse8 .cse12 .cse11) (and .cse1 .cse13 .cse7 .cse4 .cse12 .cse5 .cse11) (and .cse1 .cse7 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse1 .cse13 .cse7 .cse2 .cse8 .cse4 .cse6) (and .cse0 .cse1 .cse3 .cse8 .cse4 .cse6 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse9 .cse13 .cse7 .cse2 .cse10 .cse8 .cse12) (and .cse9 .cse0 .cse2 .cse3 .cse10 .cse8 .cse12) (and .cse9 .cse13 .cse7 .cse10 .cse5 .cse6 .cse11) (and .cse7 .cse3 .cse10 .cse4 .cse5 .cse6 .cse11) (and .cse0 .cse1 .cse13 .cse8 .cse4 .cse6 .cse11) (and .cse9 .cse1 .cse13 .cse7 .cse8 .cse6 .cse11) (and .cse9 .cse0 .cse13 .cse2 .cse10 .cse8 .cse12) (and .cse1 .cse13 .cse7 .cse4 .cse5 .cse6 .cse11) (and .cse9 .cse0 .cse13 .cse2 .cse10 .cse8 .cse6) (and .cse9 .cse13 .cse7 .cse2 .cse10 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse4 .cse12 .cse5) (and .cse9 .cse0 .cse1 .cse13 .cse12 .cse5 .cse11) (and .cse13 .cse7 .cse2 .cse10 .cse8 .cse4 .cse12) (and .cse0 .cse13 .cse10 .cse8 .cse4 .cse6 .cse11) (and .cse9 .cse7 .cse3 .cse10 .cse8 .cse12 .cse11))) [2020-07-08 22:21:44,576 INFO L264 CegarLoopResult]: At program point L105-1(lines 33 130) the Hoare annotation is: (let ((.cse6 (= 0 main_~p5~0)) (.cse0 (= 0 main_~p7~0)) (.cse7 (= 1 main_~lk8~0)) (.cse1 (= 0 main_~p6~0)) (.cse4 (= 1 main_~lk6~0)) (.cse5 (= 1 main_~lk7~0)) (.cse2 (= 0 main_~p8~0)) (.cse3 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse2) (and .cse7 .cse5 .cse1 .cse3) (and .cse5 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse6 .cse2) (and .cse5 .cse6 .cse1 .cse2) (and .cse4 .cse0 .cse7 .cse6) (and .cse0 .cse6 .cse1 .cse2) (and .cse4 .cse7 .cse5 .cse6) (and .cse4 .cse0 .cse7 .cse3) (and .cse4 .cse7 .cse5 .cse3) (and .cse0 .cse7 .cse6 .cse1) (and .cse4 .cse0 .cse2 .cse3) (and .cse7 .cse5 .cse6 .cse1) (and .cse0 .cse7 .cse1 .cse3) (and .cse4 .cse5 .cse2 .cse3))) [2020-07-08 22:21:44,576 INFO L264 CegarLoopResult]: At program point L72-1(lines 33 130) the Hoare annotation is: (let ((.cse1 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk5~0)) (.cse5 (= 0 main_~p3~0)) (.cse9 (= 0 main_~p1~0)) (.cse7 (= 0 main_~p2~0)) (.cse2 (= 1 main_~lk3~0)) (.cse6 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk1~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse4) (and .cse5 .cse7 .cse3 .cse4 .cse8) (and .cse7 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse5 .cse7 .cse9 .cse3 .cse8) (and .cse1 .cse7 .cse2 .cse6 .cse4) (and .cse7 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse9 .cse3) (and .cse0 .cse2 .cse6 .cse4 .cse8) (and .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse9 .cse3 .cse8) (and .cse5 .cse7 .cse6 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse5 .cse1 .cse7 .cse6 .cse4) (and .cse0 .cse2 .cse6 .cse9 .cse8) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse9 .cse3) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse6 .cse4 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse8) (and .cse7 .cse2 .cse6 .cse9 .cse8) (and .cse5 .cse1 .cse7 .cse9 .cse3) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse6 .cse9 .cse8) (and .cse0 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse6 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse9) (and .cse5 .cse0 .cse3 .cse4 .cse8) (and .cse5 .cse7 .cse6 .cse9 .cse8) (and .cse7 .cse2 .cse6 .cse4 .cse8))) [2020-07-08 22:21:44,577 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-08 22:21:44,577 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-07-08 22:21:44,577 INFO L264 CegarLoopResult]: At program point L97(line 97) the Hoare annotation is: (let ((.cse9 (= 0 main_~p7~0)) (.cse6 (= 0 main_~p8~0)) (.cse7 (= 1 main_~lk6~0)) (.cse8 (= 0 main_~p3~0)) (.cse12 (= 1 main_~lk5~0)) (.cse11 (= 1 main_~lk4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse10 (= 1 main_~lk8~0)) (.cse1 (= 1 main_~lk7~0)) (.cse2 (= 0 main_~p4~0)) (.cse3 (= 1 main_~lk3~0)) (.cse4 (= 0 main_~p5~0)) (.cse5 (= 0 main_~p6~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse4 .cse6) (and .cse9 .cse0 .cse10 .cse3 .cse4 .cse5 .cse11) (and .cse9 .cse8 .cse0 .cse4 .cse5 .cse6 .cse11) (and .cse8 .cse0 .cse1 .cse5 .cse6 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse4 .cse6 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse9 .cse0 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse2 .cse4) (and .cse7 .cse9 .cse0 .cse10 .cse3 .cse4 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse6 .cse11) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse6 .cse12) (and .cse7 .cse0 .cse10 .cse1 .cse3 .cse4 .cse11) (and .cse7 .cse9 .cse0 .cse10 .cse2 .cse3 .cse4) (and .cse9 .cse0 .cse10 .cse2 .cse3 .cse5 .cse12) (and .cse7 .cse0 .cse10 .cse1 .cse2 .cse3 .cse12) (and .cse0 .cse10 .cse1 .cse3 .cse4 .cse5 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse2 .cse4) (and .cse7 .cse9 .cse8 .cse0 .cse2 .cse6 .cse12) (and .cse7 .cse9 .cse0 .cse3 .cse6 .cse12 .cse11) (and .cse7 .cse8 .cse0 .cse1 .cse6 .cse12 .cse11) (and .cse8 .cse0 .cse10 .cse1 .cse4 .cse5 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse12 .cse11) (and .cse9 .cse0 .cse3 .cse5 .cse6 .cse12 .cse11) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse5 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse9 .cse8 .cse0 .cse6 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse2 .cse4 .cse6) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse2 .cse12) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse4 .cse11) (and .cse7 .cse9 .cse0 .cse10 .cse2 .cse3 .cse12) (and .cse9 .cse8 .cse0 .cse2 .cse5 .cse6 .cse12) (and .cse7 .cse9 .cse0 .cse2 .cse3 .cse6 .cse12) (and .cse7 .cse0 .cse10 .cse1 .cse3 .cse12 .cse11) (and .cse7 .cse0 .cse10 .cse1 .cse2 .cse3 .cse4) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse12 .cse11) (and .cse9 .cse8 .cse0 .cse10 .cse5 .cse12 .cse11) (and .cse9 .cse0 .cse2 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse9 .cse0 .cse10 .cse3 .cse12 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse6 .cse12 .cse11) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse12 .cse11) (and .cse9 .cse8 .cse0 .cse10 .cse2 .cse5 .cse12) (and .cse8 .cse0 .cse1 .cse4 .cse5 .cse6 .cse11) (and .cse8 .cse0 .cse10 .cse1 .cse2 .cse4 .cse5) (and .cse7 .cse8 .cse0 .cse1 .cse4 .cse6 .cse11) (and .cse8 .cse0 .cse1 .cse2 .cse5 .cse6 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse6 .cse12) (and .cse9 .cse8 .cse0 .cse2 .cse4 .cse5 .cse6) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse9 .cse0 .cse3 .cse4 .cse6 .cse11) (and .cse9 .cse8 .cse0 .cse10 .cse2 .cse4 .cse5) (and .cse8 .cse0 .cse10 .cse1 .cse2 .cse5 .cse12) (and .cse9 .cse8 .cse0 .cse5 .cse6 .cse12 .cse11) (and .cse7 .cse9 .cse0 .cse2 .cse3 .cse4 .cse6) (and .cse9 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse8 .cse0 .cse10 .cse4 .cse5 .cse11) (and .cse9 .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse10 .cse1 .cse5 .cse12 .cse11) (and .cse9 .cse0 .cse10 .cse3 .cse5 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse4 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse2 .cse12) (and .cse0 .cse10 .cse1 .cse3 .cse5 .cse12 .cse11) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse4 .cse5))) [2020-07-08 22:21:44,578 INFO L271 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-07-08 22:21:44,578 INFO L264 CegarLoopResult]: At program point L64-1(lines 33 130) the Hoare annotation is: (let ((.cse5 (= 0 main_~p1~0)) (.cse3 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse4 (= 0 main_~p2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse4 .cse1 .cse5) (and .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse5) (and .cse3 .cse0 .cse5) (and .cse3 .cse0 .cse2) (and .cse4 .cse1 .cse2))) [2020-07-08 22:21:44,578 INFO L264 CegarLoopResult]: At program point L122(line 122) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk7~0))) (or (and .cse0 (= 0 main_~p8~0)) (and (= 1 main_~lk8~0) .cse0))) [2020-07-08 22:21:44,578 INFO L271 CegarLoopResult]: At program point L56(lines 56 58) the Hoare annotation is: true [2020-07-08 22:21:44,578 INFO L264 CegarLoopResult]: At program point L56-2(lines 33 130) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-08 22:21:44,579 INFO L264 CegarLoopResult]: At program point L81(line 81) the Hoare annotation is: (let ((.cse6 (= 0 main_~p2~0)) (.cse10 (= 1 main_~lk3~0)) (.cse11 (= 1 main_~lk6~0)) (.cse2 (= 0 main_~p5~0)) (.cse9 (= 0 main_~p4~0)) (.cse8 (= 1 main_~lk1~0)) (.cse0 (= 0 main_~p3~0)) (.cse1 (= 1 main_~lk2~0)) (.cse3 (= 0 main_~p6~0)) (.cse4 (= 0 main_~p1~0)) (.cse7 (= 1 main_~lk5~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse3 .cse7 .cse8 .cse5) (and .cse0 .cse9 .cse6 .cse3 .cse4 .cse7) (and .cse9 .cse6 .cse10 .cse2 .cse3 .cse8) (and .cse6 .cse10 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse4 .cse7 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse4 .cse7) (and .cse11 .cse0 .cse9 .cse6 .cse2 .cse4) (and .cse6 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse8 .cse5) (and .cse1 .cse10 .cse3 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse6 .cse2 .cse4 .cse5) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse4) (and .cse1 .cse9 .cse10 .cse2 .cse3 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse2 .cse3 .cse4) (and .cse11 .cse1 .cse9 .cse10 .cse7 .cse8) (and .cse11 .cse1 .cse10 .cse2 .cse4 .cse5) (and .cse11 .cse0 .cse6 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse6 .cse7 .cse8 .cse5) (and .cse1 .cse9 .cse10 .cse3 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse6 .cse10 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse7 .cse8 .cse5) (and .cse1 .cse10 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse6 .cse2 .cse8 .cse5) (and .cse6 .cse10 .cse3 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse6 .cse3 .cse7 .cse8) (and .cse11 .cse1 .cse9 .cse10 .cse2 .cse4) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse4) (and .cse11 .cse6 .cse10 .cse2 .cse4 .cse5) (and .cse9 .cse6 .cse10 .cse3 .cse4 .cse7) (and .cse11 .cse1 .cse10 .cse4 .cse7 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse11 .cse6 .cse10 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse2 .cse8) (and .cse9 .cse6 .cse10 .cse3 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse7 .cse8) (and .cse11 .cse1 .cse10 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse9 .cse4 .cse7) (and .cse11 .cse1 .cse10 .cse2 .cse8 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse4 .cse7) (and .cse11 .cse9 .cse6 .cse10 .cse4 .cse7) (and .cse11 .cse9 .cse6 .cse10 .cse7 .cse8) (and .cse11 .cse6 .cse10 .cse2 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse8) (and .cse6 .cse10 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse2 .cse8) (and .cse0 .cse6 .cse3 .cse4 .cse7 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse8) (and .cse0 .cse1 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse9 .cse6 .cse10 .cse2 .cse4) (and .cse11 .cse9 .cse6 .cse10 .cse2 .cse8) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse7) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4) (and .cse11 .cse0 .cse1 .cse2 .cse8 .cse5) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse8) (and .cse1 .cse10 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse6 .cse10 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse0 .cse1 .cse9 .cse3 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse7 .cse5))) [2020-07-08 22:21:44,579 INFO L271 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: true [2020-07-08 22:21:44,579 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-08 22:21:44,579 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-07-08 22:21:44,579 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-07-08 22:21:44,580 INFO L264 CegarLoopResult]: At program point L106(line 106) the Hoare annotation is: (let ((.cse2 (= 1 main_~lk7~0)) (.cse6 (= 0 main_~p6~0)) (.cse7 (= 0 main_~p8~0)) (.cse8 (= 1 main_~lk5~0)) (.cse0 (= 1 main_~lk6~0)) (.cse5 (= 0 main_~p7~0)) (.cse1 (= 1 main_~lk8~0)) (.cse3 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse3 .cse6 .cse7 .cse4) (and .cse0 .cse1 .cse2 .cse8 .cse4) (and .cse5 .cse1 .cse3 .cse6 .cse4) (and .cse1 .cse2 .cse6 .cse8 .cse4) (and .cse2 .cse3 .cse6 .cse7 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse4) (and .cse1 .cse2 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse7 .cse8 .cse4) (and .cse5 .cse1 .cse6 .cse8 .cse4) (and .cse0 .cse2 .cse3 .cse7 .cse4) (and .cse0 .cse5 .cse3 .cse7 .cse4) (and .cse2 .cse6 .cse7 .cse8 .cse4) (and .cse0 .cse5 .cse1 .cse8 .cse4) (and .cse0 .cse5 .cse7 .cse8 .cse4) (and .cse0 .cse5 .cse1 .cse3 .cse4))) [2020-07-08 22:21:44,580 INFO L264 CegarLoopResult]: At program point L73(line 73) the Hoare annotation is: (let ((.cse7 (= 0 main_~p2~0)) (.cse4 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p1~0)) (.cse5 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse6 (= 1 main_~lk1~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6) (and .cse7 .cse1 .cse6 .cse3) (and .cse5 .cse7 .cse1 .cse6) (and .cse4 .cse0 .cse6 .cse3) (and .cse4 .cse7 .cse6 .cse3) (and .cse7 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse7 .cse6) (and .cse5 .cse7 .cse1 .cse2) (and .cse4 .cse0 .cse5 .cse2) (and .cse4 .cse5 .cse7 .cse2) (and .cse4 .cse7 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2) (and .cse0 .cse5 .cse1 .cse6) (and .cse0 .cse1 .cse6 .cse3))) [2020-07-08 22:21:44,580 INFO L271 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: true [2020-07-08 22:21:44,580 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-07-08 22:21:44,580 INFO L271 CegarLoopResult]: At program point L131(lines 5 135) the Hoare annotation is: true [2020-07-08 22:21:44,581 INFO L264 CegarLoopResult]: At program point L65(line 65) the Hoare annotation is: (let ((.cse0 (= 0 main_~p2~0)) (.cse1 (= 0 main_~p1~0)) (.cse3 (= 1 main_~lk2~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse3 .cse1) (and .cse3 .cse2))) [2020-07-08 22:21:44,581 INFO L271 CegarLoopResult]: At program point L57(line 57) the Hoare annotation is: true [2020-07-08 22:21:44,582 INFO L264 CegarLoopResult]: At program point L90-1(lines 33 130) the Hoare annotation is: (let ((.cse7 (= 1 main_~lk6~0)) (.cse12 (= 1 main_~lk5~0)) (.cse9 (= 0 main_~p7~0)) (.cse0 (= 1 main_~lk2~0)) (.cse10 (= 1 main_~lk8~0)) (.cse2 (= 0 main_~p4~0)) (.cse3 (= 1 main_~lk3~0)) (.cse8 (= 0 main_~p3~0)) (.cse1 (= 1 main_~lk7~0)) (.cse13 (= 0 main_~p2~0)) (.cse4 (= 0 main_~p5~0)) (.cse5 (= 0 main_~p6~0)) (.cse6 (= 0 main_~p8~0)) (.cse11 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse4 .cse6) (and .cse9 .cse0 .cse10 .cse3 .cse4 .cse5 .cse11) (and .cse8 .cse0 .cse1 .cse5 .cse6 .cse12 .cse11) (and .cse8 .cse10 .cse1 .cse13 .cse4 .cse5 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse9 .cse8 .cse10 .cse13 .cse5 .cse12 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse6 .cse11) (and .cse7 .cse9 .cse0 .cse10 .cse3 .cse4 .cse11) (and .cse7 .cse0 .cse10 .cse1 .cse3 .cse4 .cse11) (and .cse0 .cse10 .cse1 .cse3 .cse4 .cse5 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse2 .cse4) (and .cse9 .cse8 .cse2 .cse13 .cse5 .cse6 .cse12) (and .cse7 .cse9 .cse8 .cse0 .cse2 .cse6 .cse12) (and .cse9 .cse10 .cse13 .cse3 .cse5 .cse12 .cse11) (and .cse7 .cse9 .cse0 .cse3 .cse6 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse10 .cse13 .cse4 .cse11) (and .cse8 .cse0 .cse10 .cse1 .cse4 .cse5 .cse11) (and .cse7 .cse8 .cse10 .cse1 .cse13 .cse4 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse12 .cse11) (and .cse9 .cse0 .cse3 .cse5 .cse6 .cse12 .cse11) (and .cse1 .cse13 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse5 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse9 .cse8 .cse0 .cse2 .cse4 .cse6) (and .cse8 .cse1 .cse13 .cse5 .cse6 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse6 .cse12 .cse11) (and .cse7 .cse8 .cse1 .cse2 .cse13 .cse6 .cse12) (and .cse7 .cse9 .cse10 .cse13 .cse3 .cse12 .cse11) (and .cse8 .cse1 .cse2 .cse13 .cse5 .cse6 .cse12) (and .cse7 .cse9 .cse0 .cse2 .cse3 .cse6 .cse12) (and .cse7 .cse0 .cse10 .cse1 .cse2 .cse3 .cse4) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse12 .cse11) (and .cse9 .cse8 .cse0 .cse10 .cse5 .cse12 .cse11) (and .cse9 .cse0 .cse2 .cse3 .cse5 .cse6 .cse12) (and .cse8 .cse1 .cse2 .cse13 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse3 .cse6 .cse12 .cse11) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse12 .cse11) (and .cse8 .cse0 .cse1 .cse4 .cse5 .cse6 .cse11) (and .cse8 .cse0 .cse10 .cse1 .cse2 .cse4 .cse5) (and .cse7 .cse8 .cse1 .cse13 .cse6 .cse12 .cse11) (and .cse7 .cse1 .cse2 .cse13 .cse3 .cse6 .cse12) (and .cse7 .cse9 .cse10 .cse2 .cse13 .cse3 .cse12) (and .cse7 .cse9 .cse8 .cse13 .cse4 .cse6 .cse11) (and .cse7 .cse8 .cse0 .cse1 .cse4 .cse6 .cse11) (and .cse9 .cse10 .cse2 .cse13 .cse3 .cse5 .cse12) (and .cse7 .cse9 .cse10 .cse13 .cse3 .cse4 .cse11) (and .cse7 .cse10 .cse1 .cse2 .cse13 .cse3 .cse4) (and .cse7 .cse1 .cse2 .cse13 .cse3 .cse4 .cse6) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse9 .cse0 .cse3 .cse4 .cse6 .cse11) (and .cse8 .cse0 .cse10 .cse1 .cse2 .cse5 .cse12) (and .cse7 .cse9 .cse10 .cse2 .cse13 .cse3 .cse4) (and .cse1 .cse13 .cse3 .cse5 .cse6 .cse12 .cse11) (and .cse9 .cse8 .cse0 .cse10 .cse4 .cse5 .cse11) (and .cse9 .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse8 .cse0 .cse10 .cse1 .cse5 .cse12 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse4 .cse11) (and .cse7 .cse9 .cse8 .cse13 .cse6 .cse12 .cse11) (and .cse0 .cse10 .cse1 .cse3 .cse5 .cse12 .cse11) (and .cse7 .cse8 .cse1 .cse13 .cse4 .cse6 .cse11) (and .cse7 .cse9 .cse2 .cse13 .cse3 .cse4 .cse6) (and .cse9 .cse8 .cse0 .cse4 .cse5 .cse6 .cse11) (and .cse9 .cse8 .cse13 .cse5 .cse6 .cse12 .cse11) (and .cse7 .cse8 .cse10 .cse1 .cse2 .cse13 .cse12) (and .cse7 .cse9 .cse8 .cse0 .cse4 .cse6 .cse11) (and .cse9 .cse13 .cse3 .cse5 .cse6 .cse12 .cse11) (and .cse9 .cse0 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse2 .cse4) (and .cse10 .cse1 .cse13 .cse3 .cse4 .cse5 .cse11) (and .cse1 .cse2 .cse13 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse6 .cse12) (and .cse7 .cse9 .cse13 .cse3 .cse6 .cse12 .cse11) (and .cse7 .cse9 .cse0 .cse10 .cse2 .cse3 .cse4) (and .cse9 .cse0 .cse10 .cse2 .cse3 .cse5 .cse12) (and .cse7 .cse8 .cse10 .cse1 .cse13 .cse12 .cse11) (and .cse10 .cse1 .cse2 .cse13 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse10 .cse1 .cse2 .cse3 .cse12) (and .cse7 .cse1 .cse13 .cse3 .cse4 .cse6 .cse11) (and .cse7 .cse8 .cse10 .cse1 .cse2 .cse13 .cse4) (and .cse7 .cse8 .cse1 .cse2 .cse13 .cse4 .cse6) (and .cse7 .cse8 .cse0 .cse1 .cse6 .cse12 .cse11) (and .cse8 .cse10 .cse1 .cse2 .cse13 .cse5 .cse12) (and .cse7 .cse10 .cse1 .cse13 .cse3 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse0 .cse10 .cse2 .cse12) (and .cse9 .cse8 .cse2 .cse13 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse4 .cse11) (and .cse7 .cse9 .cse0 .cse10 .cse2 .cse3 .cse12) (and .cse7 .cse9 .cse13 .cse3 .cse4 .cse6 .cse11) (and .cse9 .cse8 .cse0 .cse2 .cse5 .cse6 .cse12) (and .cse7 .cse0 .cse10 .cse1 .cse3 .cse12 .cse11) (and .cse9 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse9 .cse0 .cse10 .cse3 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse2 .cse13 .cse4 .cse6) (and .cse9 .cse8 .cse0 .cse10 .cse2 .cse5 .cse12) (and .cse10 .cse1 .cse2 .cse13 .cse3 .cse5 .cse12) (and .cse9 .cse8 .cse10 .cse13 .cse4 .cse5 .cse11) (and .cse9 .cse8 .cse10 .cse2 .cse13 .cse5 .cse12) (and .cse8 .cse10 .cse1 .cse2 .cse13 .cse4 .cse5) (and .cse7 .cse9 .cse8 .cse2 .cse13 .cse6 .cse12) (and .cse7 .cse9 .cse8 .cse10 .cse13 .cse12 .cse11) (and .cse7 .cse10 .cse1 .cse2 .cse13 .cse3 .cse12) (and .cse7 .cse10 .cse1 .cse13 .cse3 .cse4 .cse11) (and .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse9 .cse8 .cse10 .cse2 .cse13 .cse4) (and .cse8 .cse0 .cse1 .cse2 .cse5 .cse6 .cse12) (and .cse9 .cse13 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse6 .cse12) (and .cse10 .cse1 .cse13 .cse3 .cse5 .cse12 .cse11) (and .cse7 .cse1 .cse13 .cse3 .cse6 .cse12 .cse11) (and .cse9 .cse10 .cse2 .cse13 .cse3 .cse4 .cse5) (and .cse9 .cse8 .cse0 .cse2 .cse4 .cse5 .cse6) (and .cse9 .cse8 .cse13 .cse4 .cse5 .cse6 .cse11) (and .cse9 .cse10 .cse13 .cse3 .cse4 .cse5 .cse11) (and .cse9 .cse8 .cse0 .cse10 .cse2 .cse4 .cse5) (and .cse9 .cse8 .cse0 .cse5 .cse6 .cse12 .cse11) (and .cse7 .cse9 .cse8 .cse10 .cse2 .cse13 .cse12) (and .cse8 .cse10 .cse1 .cse13 .cse5 .cse12 .cse11) (and .cse7 .cse9 .cse0 .cse2 .cse3 .cse4 .cse6) (and .cse9 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse2 .cse13 .cse3 .cse5 .cse6 .cse12) (and .cse9 .cse0 .cse10 .cse3 .cse5 .cse12 .cse11) (and .cse7 .cse8 .cse0 .cse10 .cse1 .cse2 .cse12) (and .cse7 .cse9 .cse2 .cse13 .cse3 .cse6 .cse12) (and .cse9 .cse8 .cse10 .cse2 .cse13 .cse4 .cse5) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse8 .cse1 .cse13 .cse4 .cse5 .cse6 .cse11))) [2020-07-08 22:21:44,582 INFO L271 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-07-08 22:21:44,582 INFO L271 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: true [2020-07-08 22:21:44,583 INFO L271 CegarLoopResult]: At program point L24-2(line 24) the Hoare annotation is: true [2020-07-08 22:21:44,583 INFO L264 CegarLoopResult]: At program point L115-1(lines 33 130) the Hoare annotation is: (let ((.cse1 (= 0 main_~p8~0)) (.cse2 (= 1 main_~lk7~0)) (.cse0 (= 0 main_~p7~0)) (.cse3 (= 1 main_~lk8~0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse3 .cse2) (and .cse0 .cse3))) [2020-07-08 22:21:44,583 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-08 22:21:44,583 INFO L264 CegarLoopResult]: At program point L107(line 107) the Hoare annotation is: (let ((.cse2 (= 1 main_~lk7~0)) (.cse6 (= 0 main_~p6~0)) (.cse7 (= 0 main_~p8~0)) (.cse8 (= 1 main_~lk5~0)) (.cse0 (= 1 main_~lk6~0)) (.cse5 (= 0 main_~p7~0)) (.cse1 (= 1 main_~lk8~0)) (.cse3 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse3 .cse6 .cse7 .cse4) (and .cse0 .cse1 .cse2 .cse8 .cse4) (and .cse5 .cse1 .cse3 .cse6 .cse4) (and .cse1 .cse2 .cse6 .cse8 .cse4) (and .cse2 .cse3 .cse6 .cse7 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse4) (and .cse1 .cse2 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse7 .cse8 .cse4) (and .cse5 .cse1 .cse6 .cse8 .cse4) (and .cse0 .cse2 .cse3 .cse7 .cse4) (and .cse0 .cse5 .cse3 .cse7 .cse4) (and .cse2 .cse6 .cse7 .cse8 .cse4) (and .cse0 .cse5 .cse1 .cse8 .cse4) (and .cse0 .cse5 .cse7 .cse8 .cse4) (and .cse0 .cse5 .cse1 .cse3 .cse4))) [2020-07-08 22:21:44,585 INFO L264 CegarLoopResult]: At program point L91(line 91) the Hoare annotation is: (let ((.cse4 (= 1 main_~lk8~0)) (.cse0 (= 1 main_~lk6~0)) (.cse12 (= 0 main_~p7~0)) (.cse8 (= 0 main_~p4~0)) (.cse1 (= 0 main_~p3~0)) (.cse13 (= 1 main_~lk5~0)) (.cse2 (= 1 main_~lk2~0)) (.cse3 (= main_~lk7~0 1)) (.cse9 (= 0 main_~p2~0)) (.cse10 (= 1 main_~lk3~0)) (.cse5 (= 0 main_~p5~0)) (.cse11 (= 0 main_~p6~0)) (.cse14 (= 0 main_~p8~0)) (.cse6 (= 1 main_~lk1~0)) (.cse7 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 .cse4 .cse8 .cse9 .cse10 .cse5 .cse11 .cse6) (and .cse12 .cse2 .cse4 .cse10 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse4 .cse10 .cse5 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse10 .cse13 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse10 .cse5 .cse6 .cse7) (and .cse0 .cse12 .cse4 .cse9 .cse10 .cse5 .cse6 .cse7) (and .cse12 .cse4 .cse9 .cse10 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse8 .cse10 .cse13 .cse6) (and .cse3 .cse4 .cse9 .cse10 .cse5 .cse11 .cse6 .cse7) (and .cse12 .cse2 .cse4 .cse8 .cse10 .cse11 .cse13 .cse6) (and .cse0 .cse12 .cse1 .cse2 .cse4 .cse8 .cse13 .cse6) (and .cse0 .cse12 .cse2 .cse4 .cse10 .cse13 .cse6 .cse7) (and .cse0 .cse3 .cse4 .cse8 .cse9 .cse10 .cse13 .cse6) (and .cse12 .cse1 .cse8 .cse9 .cse5 .cse11 .cse14 .cse6) (and .cse0 .cse12 .cse4 .cse8 .cse9 .cse10 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse3 .cse4 .cse8 .cse9 .cse10 .cse5 .cse6) (and .cse12 .cse1 .cse2 .cse4 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse12 .cse4 .cse9 .cse10 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse13 .cse6) (and .cse0 .cse12 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7) (and .cse12 .cse1 .cse2 .cse8 .cse11 .cse14 .cse13 .cse6) (and .cse12 .cse8 .cse9 .cse10 .cse11 .cse14 .cse13 .cse6) (and .cse12 .cse1 .cse2 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse8 .cse5 .cse14 .cse6) (and .cse12 .cse1 .cse2 .cse4 .cse8 .cse11 .cse13 .cse6) (and .cse0 .cse3 .cse4 .cse9 .cse10 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse14 .cse6 .cse7) (and .cse1 .cse3 .cse4 .cse9 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse3 .cse8 .cse9 .cse10 .cse5 .cse14 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse5 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse8 .cse9 .cse5 .cse14 .cse6) (and .cse0 .cse12 .cse1 .cse2 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5 .cse14 .cse6) (and .cse0 .cse12 .cse1 .cse4 .cse9 .cse13 .cse6 .cse7) (and .cse12 .cse2 .cse10 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse8 .cse9 .cse10 .cse14 .cse13 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse10 .cse14 .cse13 .cse6) (and .cse0 .cse1 .cse3 .cse9 .cse5 .cse14 .cse6 .cse7) (and .cse12 .cse2 .cse8 .cse10 .cse11 .cse14 .cse13 .cse6) (and .cse12 .cse1 .cse2 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse1 .cse3 .cse4 .cse8 .cse9 .cse5 .cse11 .cse6) (and .cse3 .cse4 .cse8 .cse9 .cse10 .cse11 .cse13 .cse6) (and .cse1 .cse3 .cse4 .cse9 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse8 .cse9 .cse14 .cse13 .cse6) (and .cse1 .cse2 .cse3 .cse8 .cse11 .cse14 .cse13 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse8 .cse11 .cse13 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7) (and .cse3 .cse9 .cse10 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse4 .cse8 .cse9 .cse10 .cse13 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse14 .cse13 .cse6) (and .cse12 .cse1 .cse2 .cse8 .cse5 .cse11 .cse14 .cse6) (and .cse0 .cse1 .cse3 .cse8 .cse9 .cse14 .cse13 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse10 .cse5 .cse14 .cse6) (and .cse0 .cse1 .cse3 .cse8 .cse9 .cse5 .cse14 .cse6) (and .cse0 .cse3 .cse9 .cse10 .cse14 .cse13 .cse6 .cse7) (and .cse2 .cse3 .cse4 .cse10 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse9 .cse10 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse4 .cse8 .cse5 .cse6) (and .cse12 .cse1 .cse4 .cse9 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse10 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse4 .cse8 .cse10 .cse5 .cse6) (and .cse12 .cse9 .cse10 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse8 .cse5 .cse11 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse13 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse3 .cse8 .cse9 .cse10 .cse14 .cse13 .cse6) (and .cse1 .cse3 .cse4 .cse8 .cse9 .cse11 .cse13 .cse6) (and .cse2 .cse3 .cse4 .cse8 .cse10 .cse11 .cse13 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse10 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse4 .cse8 .cse9 .cse5 .cse6) (and .cse12 .cse1 .cse4 .cse9 .cse5 .cse11 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse8 .cse5 .cse11 .cse14 .cse6) (and .cse0 .cse12 .cse1 .cse9 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse4 .cse13 .cse6 .cse7) (and .cse12 .cse1 .cse8 .cse9 .cse11 .cse14 .cse13 .cse6) (and .cse12 .cse4 .cse8 .cse9 .cse10 .cse11 .cse13 .cse6) (and .cse1 .cse3 .cse9 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse12 .cse2 .cse4 .cse10 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse8 .cse14 .cse13 .cse6) (and .cse12 .cse1 .cse2 .cse4 .cse8 .cse5 .cse11 .cse6) (and .cse12 .cse4 .cse9 .cse10 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse8 .cse10 .cse14 .cse13 .cse6) (and .cse3 .cse8 .cse9 .cse10 .cse11 .cse14 .cse13 .cse6) (and .cse0 .cse3 .cse4 .cse9 .cse10 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse9 .cse5 .cse14 .cse6 .cse7) (and .cse1 .cse3 .cse8 .cse9 .cse5 .cse11 .cse14 .cse6) (and .cse3 .cse8 .cse9 .cse10 .cse5 .cse11 .cse14 .cse6) (and .cse2 .cse3 .cse10 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse8 .cse9 .cse13 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse8 .cse10 .cse5 .cse6) (and .cse12 .cse1 .cse9 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse2 .cse3 .cse8 .cse10 .cse5 .cse11 .cse14 .cse6) (and .cse12 .cse1 .cse4 .cse8 .cse9 .cse11 .cse13 .cse6) (and .cse12 .cse1 .cse2 .cse4 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse8 .cse9 .cse10 .cse5 .cse14 .cse6) (and .cse12 .cse2 .cse10 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse12 .cse1 .cse9 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse3 .cse9 .cse10 .cse5 .cse14 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse13 .cse6 .cse7) (and .cse12 .cse2 .cse4 .cse8 .cse10 .cse5 .cse11 .cse6) (and .cse12 .cse8 .cse9 .cse10 .cse5 .cse11 .cse14 .cse6) (and .cse0 .cse12 .cse1 .cse4 .cse8 .cse9 .cse13 .cse6) (and .cse0 .cse12 .cse2 .cse8 .cse10 .cse5 .cse14 .cse6) (and .cse12 .cse4 .cse8 .cse9 .cse10 .cse5 .cse11 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse8 .cse9 .cse5 .cse6) (and .cse3 .cse4 .cse9 .cse10 .cse11 .cse13 .cse6 .cse7) (and .cse2 .cse3 .cse4 .cse8 .cse10 .cse5 .cse11 .cse6) (and .cse12 .cse9 .cse10 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse10 .cse14 .cse13 .cse6 .cse7) (and .cse12 .cse1 .cse4 .cse8 .cse9 .cse5 .cse11 .cse6) (and .cse1 .cse3 .cse9 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse4 .cse9 .cse5 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse4 .cse8 .cse10 .cse13 .cse6) (and .cse2 .cse3 .cse4 .cse10 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse12 .cse9 .cse10 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse9 .cse14 .cse13 .cse6 .cse7) (and .cse1 .cse3 .cse8 .cse9 .cse11 .cse14 .cse13 .cse6) (and .cse12 .cse2 .cse8 .cse10 .cse5 .cse11 .cse14 .cse6) (and .cse2 .cse3 .cse8 .cse10 .cse11 .cse14 .cse13 .cse6) (and .cse1 .cse2 .cse3 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse2 .cse3 .cse10 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse3 .cse9 .cse10 .cse5 .cse11 .cse14 .cse6 .cse7))) [2020-07-08 22:21:44,585 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-07-08 22:21:44,585 INFO L264 CegarLoopResult]: At program point L116(line 116) the Hoare annotation is: (let ((.cse4 (= 1 main_~lk7~0)) (.cse2 (= 0 main_~p8~0)) (.cse0 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p7~0)) (.cse3 (= 1 main_~lk8~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse0 .cse4 .cse2) (and .cse0 .cse1 .cse3))) [2020-07-08 22:21:44,585 INFO L271 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: true [2020-07-08 22:21:44,585 INFO L271 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-07-08 22:21:44,586 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-07-08 22:21:44,586 INFO L271 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: true [2020-07-08 22:21:44,586 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-07-08 22:21:44,586 INFO L264 CegarLoopResult]: At program point L100-1(lines 33 130) the Hoare annotation is: (let ((.cse2 (= 0 main_~p5~0)) (.cse1 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk7~0)) (.cse3 (= 0 main_~p6~0)) (.cse6 (= 1 main_~lk8~0)) (.cse5 (= 1 main_~lk6~0)) (.cse8 (= 0 main_~p7~0)) (.cse4 (= 0 main_~p8~0)) (.cse9 (= 1 main_~lk5~0)) (.cse7 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse0 .cse2 .cse7) (and .cse8 .cse2 .cse3 .cse4 .cse7) (and .cse5 .cse6 .cse0 .cse9 .cse7) (and .cse8 .cse6 .cse2 .cse3 .cse7) (and .cse5 .cse8 .cse6 .cse1 .cse2) (and .cse0 .cse2 .cse3 .cse4 .cse7) (and .cse5 .cse0 .cse1 .cse2 .cse4) (and .cse5 .cse8 .cse1 .cse2 .cse4) (and .cse8 .cse6 .cse1 .cse2 .cse3) (and .cse6 .cse0 .cse2 .cse3 .cse7) (and .cse5 .cse8 .cse1 .cse4 .cse9) (and .cse5 .cse6 .cse0 .cse1 .cse2) (and .cse8 .cse1 .cse2 .cse3 .cse4) (and .cse8 .cse6 .cse3 .cse9 .cse7) (and .cse5 .cse0 .cse2 .cse4 .cse7) (and .cse6 .cse0 .cse1 .cse3 .cse9) (and .cse5 .cse8 .cse6 .cse2 .cse7) (and .cse6 .cse0 .cse3 .cse9 .cse7) (and .cse8 .cse3 .cse4 .cse9 .cse7) (and .cse5 .cse0 .cse1 .cse4 .cse9) (and .cse5 .cse0 .cse4 .cse9 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse9) (and .cse8 .cse1 .cse3 .cse4 .cse9) (and .cse6 .cse0 .cse1 .cse2 .cse3) (and .cse5 .cse8 .cse6 .cse1 .cse9) (and .cse5 .cse6 .cse0 .cse1 .cse9) (and .cse5 .cse8 .cse2 .cse4 .cse7) (and .cse8 .cse6 .cse1 .cse3 .cse9) (and .cse0 .cse3 .cse4 .cse9 .cse7) (and .cse5 .cse8 .cse6 .cse9 .cse7) (and .cse5 .cse8 .cse4 .cse9 .cse7))) [2020-07-08 22:21:44,586 INFO L271 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: true [2020-07-08 22:21:44,586 INFO L271 CegarLoopResult]: At program point L34-1(line 34) the Hoare annotation is: true [2020-07-08 22:21:44,587 INFO L271 CegarLoopResult]: At program point L34-2(line 34) the Hoare annotation is: true [2020-07-08 22:21:44,588 INFO L264 CegarLoopResult]: At program point L92(line 92) the Hoare annotation is: (let ((.cse4 (= 1 main_~lk8~0)) (.cse0 (= 1 main_~lk6~0)) (.cse12 (= 0 main_~p7~0)) (.cse8 (= 0 main_~p4~0)) (.cse1 (= 0 main_~p3~0)) (.cse13 (= 1 main_~lk5~0)) (.cse2 (= 1 main_~lk2~0)) (.cse3 (= main_~lk7~0 1)) (.cse9 (= 0 main_~p2~0)) (.cse10 (= 1 main_~lk3~0)) (.cse5 (= 0 main_~p5~0)) (.cse11 (= 0 main_~p6~0)) (.cse14 (= 0 main_~p8~0)) (.cse6 (= 1 main_~lk1~0)) (.cse7 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 .cse4 .cse8 .cse9 .cse10 .cse5 .cse11 .cse6) (and .cse0 .cse12 .cse2 .cse4 .cse10 .cse5 .cse6 .cse7) (and .cse12 .cse2 .cse4 .cse10 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse10 .cse13 .cse6 .cse7) (and .cse12 .cse4 .cse9 .cse10 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse10 .cse5 .cse6 .cse7) (and .cse0 .cse12 .cse4 .cse9 .cse10 .cse5 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse8 .cse10 .cse13 .cse6) (and .cse3 .cse4 .cse9 .cse10 .cse5 .cse11 .cse6 .cse7) (and .cse12 .cse2 .cse4 .cse8 .cse10 .cse11 .cse13 .cse6) (and .cse0 .cse12 .cse1 .cse2 .cse4 .cse8 .cse13 .cse6) (and .cse0 .cse12 .cse2 .cse4 .cse10 .cse13 .cse6 .cse7) (and .cse0 .cse3 .cse4 .cse8 .cse9 .cse10 .cse13 .cse6) (and .cse12 .cse1 .cse8 .cse9 .cse5 .cse11 .cse14 .cse6) (and .cse0 .cse12 .cse4 .cse8 .cse9 .cse10 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse3 .cse4 .cse8 .cse9 .cse10 .cse5 .cse6) (and .cse12 .cse1 .cse2 .cse4 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse12 .cse4 .cse9 .cse10 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse13 .cse6) (and .cse12 .cse1 .cse2 .cse8 .cse11 .cse14 .cse13 .cse6) (and .cse12 .cse8 .cse9 .cse10 .cse11 .cse14 .cse13 .cse6) (and .cse0 .cse12 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7) (and .cse12 .cse1 .cse2 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse8 .cse5 .cse14 .cse6) (and .cse12 .cse1 .cse2 .cse4 .cse8 .cse11 .cse13 .cse6) (and .cse0 .cse3 .cse4 .cse9 .cse10 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse14 .cse6 .cse7) (and .cse1 .cse3 .cse4 .cse9 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse3 .cse8 .cse9 .cse10 .cse5 .cse14 .cse6) (and .cse0 .cse12 .cse1 .cse8 .cse9 .cse5 .cse14 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse5 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5 .cse14 .cse6) (and .cse0 .cse12 .cse1 .cse4 .cse9 .cse13 .cse6 .cse7) (and .cse12 .cse2 .cse10 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse8 .cse9 .cse10 .cse14 .cse13 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse10 .cse14 .cse13 .cse6) (and .cse0 .cse1 .cse3 .cse9 .cse5 .cse14 .cse6 .cse7) (and .cse12 .cse2 .cse8 .cse10 .cse11 .cse14 .cse13 .cse6) (and .cse12 .cse1 .cse2 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse1 .cse3 .cse4 .cse8 .cse9 .cse5 .cse11 .cse6) (and .cse3 .cse4 .cse8 .cse9 .cse10 .cse11 .cse13 .cse6) (and .cse1 .cse3 .cse4 .cse9 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse8 .cse9 .cse14 .cse13 .cse6) (and .cse1 .cse2 .cse3 .cse8 .cse11 .cse14 .cse13 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse8 .cse11 .cse13 .cse6) (and .cse3 .cse9 .cse10 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse12 .cse4 .cse8 .cse9 .cse10 .cse13 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse14 .cse13 .cse6) (and .cse12 .cse1 .cse2 .cse8 .cse5 .cse11 .cse14 .cse6) (and .cse0 .cse1 .cse3 .cse8 .cse9 .cse14 .cse13 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse10 .cse5 .cse14 .cse6) (and .cse0 .cse1 .cse3 .cse8 .cse9 .cse5 .cse14 .cse6) (and .cse0 .cse3 .cse9 .cse10 .cse14 .cse13 .cse6 .cse7) (and .cse2 .cse3 .cse4 .cse10 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse9 .cse10 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse4 .cse8 .cse5 .cse6) (and .cse12 .cse1 .cse4 .cse9 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse10 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse4 .cse8 .cse10 .cse5 .cse6) (and .cse12 .cse9 .cse10 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse8 .cse5 .cse11 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse13 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse3 .cse8 .cse9 .cse10 .cse14 .cse13 .cse6) (and .cse1 .cse3 .cse4 .cse8 .cse9 .cse11 .cse13 .cse6) (and .cse2 .cse3 .cse4 .cse8 .cse10 .cse11 .cse13 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse10 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse4 .cse8 .cse9 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse8 .cse5 .cse11 .cse14 .cse6) (and .cse12 .cse1 .cse4 .cse9 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse9 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse4 .cse13 .cse6 .cse7) (and .cse12 .cse1 .cse8 .cse9 .cse11 .cse14 .cse13 .cse6) (and .cse12 .cse4 .cse8 .cse9 .cse10 .cse11 .cse13 .cse6) (and .cse1 .cse3 .cse9 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse12 .cse2 .cse4 .cse10 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse1 .cse2 .cse8 .cse14 .cse13 .cse6) (and .cse12 .cse1 .cse2 .cse4 .cse8 .cse5 .cse11 .cse6) (and .cse12 .cse4 .cse9 .cse10 .cse11 .cse13 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse8 .cse10 .cse14 .cse13 .cse6) (and .cse0 .cse3 .cse4 .cse9 .cse10 .cse5 .cse6 .cse7) (and .cse3 .cse8 .cse9 .cse10 .cse11 .cse14 .cse13 .cse6) (and .cse0 .cse12 .cse1 .cse9 .cse5 .cse14 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7) (and .cse1 .cse3 .cse8 .cse9 .cse5 .cse11 .cse14 .cse6) (and .cse3 .cse8 .cse9 .cse10 .cse5 .cse11 .cse14 .cse6) (and .cse2 .cse3 .cse10 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse8 .cse10 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse8 .cse9 .cse13 .cse6) (and .cse12 .cse1 .cse9 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse2 .cse3 .cse8 .cse10 .cse5 .cse11 .cse14 .cse6) (and .cse12 .cse1 .cse4 .cse8 .cse9 .cse11 .cse13 .cse6) (and .cse0 .cse12 .cse8 .cse9 .cse10 .cse5 .cse14 .cse6) (and .cse12 .cse1 .cse2 .cse4 .cse11 .cse13 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse13 .cse6 .cse7) (and .cse12 .cse2 .cse10 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse12 .cse1 .cse9 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse3 .cse9 .cse10 .cse5 .cse14 .cse6 .cse7) (and .cse12 .cse2 .cse4 .cse8 .cse10 .cse5 .cse11 .cse6) (and .cse12 .cse8 .cse9 .cse10 .cse5 .cse11 .cse14 .cse6) (and .cse0 .cse12 .cse1 .cse4 .cse8 .cse9 .cse13 .cse6) (and .cse0 .cse12 .cse2 .cse8 .cse10 .cse5 .cse14 .cse6) (and .cse12 .cse4 .cse8 .cse9 .cse10 .cse5 .cse11 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse8 .cse9 .cse5 .cse6) (and .cse3 .cse4 .cse9 .cse10 .cse11 .cse13 .cse6 .cse7) (and .cse2 .cse3 .cse4 .cse8 .cse10 .cse5 .cse11 .cse6) (and .cse12 .cse9 .cse10 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse10 .cse14 .cse13 .cse6 .cse7) (and .cse12 .cse1 .cse4 .cse8 .cse9 .cse5 .cse11 .cse6) (and .cse0 .cse12 .cse1 .cse4 .cse9 .cse5 .cse6 .cse7) (and .cse1 .cse3 .cse9 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse4 .cse8 .cse10 .cse13 .cse6) (and .cse2 .cse3 .cse4 .cse10 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse12 .cse9 .cse10 .cse14 .cse13 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse9 .cse14 .cse13 .cse6 .cse7) (and .cse1 .cse3 .cse8 .cse9 .cse11 .cse14 .cse13 .cse6) (and .cse12 .cse2 .cse8 .cse10 .cse5 .cse11 .cse14 .cse6) (and .cse2 .cse3 .cse8 .cse10 .cse11 .cse14 .cse13 .cse6) (and .cse1 .cse2 .cse3 .cse11 .cse14 .cse13 .cse6 .cse7) (and .cse2 .cse3 .cse10 .cse5 .cse11 .cse14 .cse6 .cse7) (and .cse3 .cse9 .cse10 .cse5 .cse11 .cse14 .cse6 .cse7))) [2020-07-08 22:21:44,588 INFO L271 CegarLoopResult]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2020-07-08 22:21:44,588 INFO L264 CegarLoopResult]: At program point L117(line 117) the Hoare annotation is: (let ((.cse4 (= 1 main_~lk7~0)) (.cse2 (= 0 main_~p8~0)) (.cse0 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p7~0)) (.cse3 (= 1 main_~lk8~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse0 .cse4 .cse2) (and .cse0 .cse1 .cse3))) [2020-07-08 22:21:44,591 INFO L264 CegarLoopResult]: At program point L84-1(lines 33 130) the Hoare annotation is: (let ((.cse4 (= 1 main_~lk8~0)) (.cse12 (= 0 main_~p1~0)) (.cse0 (= 1 main_~lk6~0)) (.cse7 (= 1 main_~lk4~0)) (.cse1 (= 0 main_~p3~0)) (.cse9 (= 0 main_~p2~0)) (.cse8 (= 0 main_~p7~0)) (.cse5 (= 0 main_~p5~0)) (.cse2 (= 1 main_~lk2~0)) (.cse3 (= main_~lk7~0 1)) (.cse13 (= 0 main_~p4~0)) (.cse15 (= 1 main_~lk3~0)) (.cse10 (= 0 main_~p6~0)) (.cse11 (= 0 main_~p8~0)) (.cse14 (= 1 main_~lk5~0)) (.cse6 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse1 .cse9 .cse5 .cse10 .cse11 .cse12 .cse7) (and .cse0 .cse8 .cse1 .cse13 .cse9 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse3 .cse9 .cse5 .cse11 .cse12 .cse7) (and .cse3 .cse4 .cse13 .cse9 .cse15 .cse5 .cse10 .cse6) (and .cse8 .cse13 .cse9 .cse15 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse3 .cse9 .cse15 .cse11 .cse12 .cse14 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse5 .cse12 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse13 .cse15 .cse14 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse12 .cse7) (and .cse8 .cse2 .cse4 .cse13 .cse15 .cse10 .cse14 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse13 .cse14 .cse6) (and .cse0 .cse2 .cse3 .cse15 .cse11 .cse12 .cse14 .cse7) (and .cse0 .cse3 .cse4 .cse13 .cse9 .cse15 .cse14 .cse6) (and .cse0 .cse8 .cse2 .cse4 .cse15 .cse12 .cse14 .cse7) (and .cse8 .cse4 .cse9 .cse15 .cse10 .cse12 .cse14 .cse7) (and .cse8 .cse1 .cse13 .cse9 .cse5 .cse10 .cse11 .cse6) (and .cse0 .cse8 .cse2 .cse13 .cse15 .cse5 .cse11 .cse12) (and .cse8 .cse13 .cse9 .cse15 .cse5 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse14 .cse6 .cse7) (and .cse3 .cse13 .cse9 .cse15 .cse5 .cse10 .cse11 .cse12) (and .cse8 .cse1 .cse2 .cse4 .cse5 .cse10 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse15 .cse5 .cse11 .cse12 .cse7) (and .cse0 .cse8 .cse4 .cse9 .cse15 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse2 .cse15 .cse5 .cse11 .cse12 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse14 .cse6) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse5 .cse10 .cse11 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse4 .cse13 .cse10 .cse14 .cse6) (and .cse1 .cse3 .cse4 .cse9 .cse10 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse4 .cse13 .cse9 .cse12 .cse14) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse5 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse13 .cse15 .cse11 .cse14 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse13 .cse10 .cse12 .cse14) (and .cse8 .cse2 .cse13 .cse15 .cse10 .cse11 .cse14 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse12 .cse14 .cse7) (and .cse3 .cse4 .cse13 .cse9 .cse15 .cse10 .cse14 .cse6) (and .cse2 .cse3 .cse4 .cse15 .cse10 .cse12 .cse14 .cse7) (and .cse0 .cse8 .cse1 .cse13 .cse9 .cse11 .cse14 .cse6) (and .cse1 .cse2 .cse3 .cse4 .cse13 .cse10 .cse14 .cse6) (and .cse3 .cse9 .cse15 .cse10 .cse11 .cse14 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse7) (and .cse0 .cse8 .cse4 .cse13 .cse9 .cse15 .cse14 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse11 .cse14 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse13 .cse15 .cse5 .cse12) (and .cse8 .cse1 .cse2 .cse13 .cse5 .cse10 .cse11 .cse6) (and .cse8 .cse2 .cse4 .cse15 .cse10 .cse12 .cse14 .cse7) (and .cse0 .cse1 .cse3 .cse13 .cse9 .cse11 .cse14 .cse6) (and .cse0 .cse2 .cse3 .cse13 .cse15 .cse5 .cse11 .cse6) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse13 .cse12 .cse14) (and .cse0 .cse3 .cse13 .cse9 .cse15 .cse11 .cse12 .cse14) (and .cse0 .cse8 .cse9 .cse15 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse11 .cse12 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse13 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse11 .cse12 .cse14) (and .cse0 .cse8 .cse2 .cse15 .cse11 .cse14 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse13 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse3 .cse4 .cse13 .cse9 .cse15 .cse12 .cse14) (and .cse0 .cse8 .cse1 .cse2 .cse11 .cse12 .cse14 .cse7) (and .cse0 .cse3 .cse13 .cse9 .cse15 .cse11 .cse14 .cse6) (and .cse1 .cse3 .cse4 .cse13 .cse9 .cse10 .cse14 .cse6) (and .cse0 .cse8 .cse2 .cse4 .cse13 .cse15 .cse5 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse13 .cse5 .cse10 .cse11 .cse6) (and .cse8 .cse1 .cse4 .cse9 .cse5 .cse10 .cse6 .cse7) (and .cse2 .cse3 .cse4 .cse13 .cse15 .cse10 .cse12 .cse14) (and .cse8 .cse2 .cse4 .cse15 .cse5 .cse10 .cse12 .cse7) (and .cse1 .cse3 .cse4 .cse13 .cse9 .cse10 .cse12 .cse14) (and .cse0 .cse8 .cse1 .cse4 .cse9 .cse5 .cse12 .cse7) (and .cse1 .cse3 .cse9 .cse10 .cse11 .cse14 .cse6 .cse7) (and .cse8 .cse2 .cse4 .cse15 .cse10 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse13 .cse11 .cse14 .cse6) (and .cse8 .cse4 .cse9 .cse15 .cse5 .cse10 .cse12 .cse7) (and .cse8 .cse4 .cse9 .cse15 .cse10 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse2 .cse13 .cse15 .cse11 .cse14 .cse6) (and .cse8 .cse1 .cse2 .cse10 .cse11 .cse12 .cse14 .cse7) (and .cse2 .cse3 .cse15 .cse10 .cse11 .cse12 .cse14 .cse7) (and .cse1 .cse3 .cse4 .cse13 .cse9 .cse5 .cse10 .cse12) (and .cse3 .cse13 .cse9 .cse15 .cse10 .cse11 .cse14 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse4 .cse5 .cse10 .cse12 .cse7) (and .cse1 .cse3 .cse13 .cse9 .cse5 .cse10 .cse11 .cse6) (and .cse1 .cse2 .cse3 .cse13 .cse5 .cse10 .cse11 .cse12) (and .cse2 .cse3 .cse15 .cse10 .cse11 .cse14 .cse6 .cse7) (and .cse2 .cse3 .cse13 .cse15 .cse10 .cse11 .cse12 .cse14) (and .cse8 .cse1 .cse4 .cse13 .cse9 .cse10 .cse14 .cse6) (and .cse0 .cse1 .cse3 .cse13 .cse9 .cse11 .cse12 .cse14) (and .cse0 .cse2 .cse3 .cse13 .cse15 .cse11 .cse12 .cse14) (and .cse0 .cse8 .cse13 .cse9 .cse15 .cse5 .cse11 .cse6) (and .cse8 .cse2 .cse15 .cse10 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse3 .cse9 .cse15 .cse5 .cse11 .cse6 .cse7) (and .cse8 .cse1 .cse9 .cse10 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse13 .cse5 .cse11 .cse12) (and .cse8 .cse1 .cse2 .cse5 .cse10 .cse11 .cse12 .cse7) (and .cse1 .cse3 .cse13 .cse9 .cse5 .cse10 .cse11 .cse12) (and .cse0 .cse8 .cse9 .cse15 .cse11 .cse12 .cse14 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse15 .cse5 .cse12 .cse7) (and .cse0 .cse8 .cse2 .cse13 .cse15 .cse5 .cse11 .cse6) (and .cse8 .cse1 .cse13 .cse9 .cse5 .cse10 .cse11 .cse12) (and .cse8 .cse4 .cse13 .cse9 .cse15 .cse5 .cse10 .cse6) (and .cse0 .cse8 .cse1 .cse9 .cse5 .cse11 .cse12 .cse7) (and .cse3 .cse4 .cse9 .cse15 .cse10 .cse14 .cse6 .cse7) (and .cse2 .cse3 .cse4 .cse13 .cse15 .cse5 .cse10 .cse6) (and .cse8 .cse2 .cse13 .cse15 .cse10 .cse11 .cse12 .cse14) (and .cse8 .cse1 .cse2 .cse4 .cse13 .cse5 .cse10 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse13 .cse11 .cse12 .cse14) (and .cse0 .cse8 .cse4 .cse9 .cse15 .cse12 .cse14 .cse7) (and .cse8 .cse2 .cse4 .cse13 .cse15 .cse5 .cse10 .cse12) (and .cse3 .cse13 .cse9 .cse15 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse8 .cse1 .cse4 .cse9 .cse12 .cse14 .cse7) (and .cse8 .cse2 .cse15 .cse10 .cse11 .cse12 .cse14 .cse7) (and .cse0 .cse2 .cse3 .cse13 .cse15 .cse5 .cse11 .cse12) (and .cse3 .cse4 .cse13 .cse9 .cse15 .cse5 .cse10 .cse12) (and .cse0 .cse8 .cse2 .cse4 .cse13 .cse15 .cse14 .cse6) (and .cse8 .cse1 .cse2 .cse13 .cse10 .cse11 .cse12 .cse14) (and .cse1 .cse2 .cse3 .cse10 .cse11 .cse14 .cse6 .cse7) (and .cse2 .cse3 .cse15 .cse5 .cse10 .cse11 .cse6 .cse7) (and .cse3 .cse9 .cse15 .cse5 .cse10 .cse11 .cse6 .cse7) (and .cse8 .cse9 .cse15 .cse5 .cse10 .cse11 .cse12 .cse7) (and .cse0 .cse8 .cse4 .cse13 .cse9 .cse15 .cse5 .cse12) (and .cse0 .cse3 .cse9 .cse15 .cse5 .cse11 .cse12 .cse7) (and .cse8 .cse4 .cse13 .cse9 .cse15 .cse5 .cse10 .cse12) (and .cse8 .cse1 .cse9 .cse10 .cse11 .cse12 .cse14 .cse7) (and .cse1 .cse3 .cse9 .cse10 .cse11 .cse12 .cse14 .cse7) (and .cse1 .cse3 .cse9 .cse5 .cse10 .cse11 .cse12 .cse7) (and .cse8 .cse2 .cse4 .cse15 .cse5 .cse10 .cse6 .cse7) (and .cse0 .cse8 .cse2 .cse4 .cse15 .cse5 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse15 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse12 .cse14 .cse7) (and .cse0 .cse1 .cse3 .cse9 .cse11 .cse12 .cse14 .cse7) (and .cse0 .cse8 .cse9 .cse15 .cse5 .cse11 .cse12 .cse7) (and .cse8 .cse4 .cse9 .cse15 .cse5 .cse10 .cse6 .cse7) (and .cse0 .cse8 .cse4 .cse9 .cse15 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse5 .cse11 .cse12 .cse7) (and .cse3 .cse4 .cse9 .cse15 .cse5 .cse10 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse15 .cse12 .cse14 .cse7) (and .cse8 .cse2 .cse4 .cse13 .cse15 .cse10 .cse12 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse12 .cse14 .cse7) (and .cse2 .cse3 .cse13 .cse15 .cse5 .cse10 .cse11 .cse12) (and .cse0 .cse8 .cse2 .cse4 .cse15 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse4 .cse9 .cse15 .cse5 .cse12 .cse7) (and .cse0 .cse8 .cse2 .cse13 .cse15 .cse11 .cse12 .cse14) (and .cse0 .cse8 .cse1 .cse4 .cse13 .cse9 .cse5 .cse12) (and .cse0 .cse8 .cse4 .cse13 .cse9 .cse15 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse12 .cse14) (and .cse0 .cse1 .cse3 .cse4 .cse13 .cse9 .cse5 .cse12) (and .cse0 .cse3 .cse4 .cse13 .cse9 .cse15 .cse5 .cse6) (and .cse8 .cse1 .cse13 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse3 .cse13 .cse9 .cse15 .cse5 .cse11 .cse12) (and .cse8 .cse1 .cse2 .cse13 .cse10 .cse11 .cse14 .cse6) (and .cse8 .cse13 .cse9 .cse15 .cse10 .cse11 .cse14 .cse6) (and .cse0 .cse8 .cse1 .cse2 .cse13 .cse5 .cse11 .cse6) (and .cse0 .cse3 .cse4 .cse9 .cse15 .cse14 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse11 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse13 .cse5 .cse10 .cse12) (and .cse0 .cse3 .cse13 .cse9 .cse15 .cse5 .cse11 .cse6) (and .cse0 .cse8 .cse1 .cse13 .cse9 .cse5 .cse11 .cse6) (and .cse8 .cse2 .cse13 .cse15 .cse5 .cse10 .cse11 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse5 .cse11 .cse6) (and .cse0 .cse8 .cse1 .cse4 .cse9 .cse14 .cse6 .cse7) (and .cse8 .cse2 .cse15 .cse5 .cse10 .cse11 .cse6 .cse7) (and .cse0 .cse8 .cse13 .cse9 .cse15 .cse11 .cse14 .cse6) (and .cse0 .cse8 .cse2 .cse4 .cse13 .cse15 .cse12 .cse14) (and .cse0 .cse1 .cse3 .cse9 .cse5 .cse11 .cse6 .cse7) (and .cse3 .cse4 .cse9 .cse15 .cse5 .cse10 .cse12 .cse7) (and .cse3 .cse9 .cse15 .cse10 .cse11 .cse12 .cse14 .cse7) (and .cse8 .cse1 .cse2 .cse10 .cse11 .cse14 .cse6 .cse7) (and .cse1 .cse3 .cse4 .cse13 .cse9 .cse5 .cse10 .cse6) (and .cse0 .cse8 .cse13 .cse9 .cse15 .cse5 .cse11 .cse12) (and .cse1 .cse3 .cse4 .cse9 .cse5 .cse10 .cse6 .cse7) (and .cse3 .cse4 .cse9 .cse15 .cse10 .cse12 .cse14 .cse7) (and .cse1 .cse2 .cse3 .cse13 .cse10 .cse11 .cse14 .cse6) (and .cse3 .cse9 .cse15 .cse5 .cse10 .cse11 .cse12 .cse7) (and .cse8 .cse1 .cse4 .cse9 .cse5 .cse10 .cse12 .cse7) (and .cse0 .cse3 .cse4 .cse9 .cse15 .cse12 .cse14 .cse7) (and .cse2 .cse3 .cse4 .cse13 .cse15 .cse5 .cse10 .cse12) (and .cse0 .cse1 .cse3 .cse13 .cse9 .cse5 .cse11 .cse6) (and .cse0 .cse3 .cse9 .cse15 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse5 .cse12) (and .cse2 .cse3 .cse4 .cse15 .cse10 .cse14 .cse6 .cse7) (and .cse8 .cse1 .cse4 .cse9 .cse10 .cse14 .cse6 .cse7) (and .cse8 .cse1 .cse4 .cse9 .cse10 .cse12 .cse14 .cse7) (and .cse1 .cse3 .cse4 .cse9 .cse10 .cse12 .cse14 .cse7) (and .cse8 .cse1 .cse2 .cse13 .cse5 .cse10 .cse11 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse2 .cse4 .cse13 .cse15 .cse5 .cse6) (and .cse8 .cse9 .cse15 .cse10 .cse11 .cse14 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse13 .cse5 .cse10 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse14 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse5 .cse10 .cse11 .cse6 .cse7) (and .cse2 .cse3 .cse4 .cse13 .cse15 .cse10 .cse14 .cse6) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse13 .cse5 .cse12) (and .cse2 .cse3 .cse4 .cse15 .cse5 .cse10 .cse12 .cse7) (and .cse0 .cse8 .cse2 .cse15 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse15 .cse5 .cse11 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse4 .cse13 .cse9 .cse5 .cse6) (and .cse0 .cse8 .cse1 .cse9 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse14 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse12 .cse14 .cse7) (and .cse8 .cse4 .cse13 .cse9 .cse15 .cse10 .cse12 .cse14) (and .cse1 .cse3 .cse4 .cse9 .cse5 .cse10 .cse12 .cse7) (and .cse8 .cse2 .cse15 .cse5 .cse10 .cse11 .cse12 .cse7) (and .cse8 .cse1 .cse13 .cse9 .cse10 .cse11 .cse14 .cse6) (and .cse8 .cse4 .cse13 .cse9 .cse15 .cse10 .cse14 .cse6) (and .cse1 .cse3 .cse13 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse14 .cse7) (and .cse0 .cse8 .cse4 .cse13 .cse9 .cse15 .cse12 .cse14) (and .cse1 .cse2 .cse3 .cse5 .cse10 .cse11 .cse12 .cse7) (and .cse8 .cse1 .cse4 .cse13 .cse9 .cse10 .cse12 .cse14) (and .cse8 .cse1 .cse2 .cse4 .cse13 .cse5 .cse10 .cse6) (and .cse0 .cse8 .cse2 .cse4 .cse15 .cse5 .cse12 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse5 .cse12 .cse7) (and .cse0 .cse3 .cse4 .cse9 .cse15 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse9 .cse5 .cse11 .cse6 .cse7) (and .cse3 .cse13 .cse9 .cse15 .cse5 .cse10 .cse11 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse13 .cse9 .cse14 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse13 .cse15 .cse5 .cse6) (and .cse8 .cse1 .cse9 .cse5 .cse10 .cse11 .cse6 .cse7) (and .cse2 .cse3 .cse13 .cse15 .cse5 .cse10 .cse11 .cse6) (and .cse0 .cse8 .cse1 .cse13 .cse9 .cse5 .cse11 .cse12) (and .cse8 .cse1 .cse2 .cse4 .cse10 .cse12 .cse14 .cse7) (and .cse3 .cse4 .cse13 .cse9 .cse15 .cse10 .cse12 .cse14) (and .cse8 .cse1 .cse2 .cse4 .cse10 .cse14 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse14 .cse6 .cse7) (and .cse8 .cse2 .cse4 .cse13 .cse15 .cse5 .cse10 .cse6) (and .cse0 .cse3 .cse4 .cse9 .cse15 .cse5 .cse12 .cse7) (and .cse8 .cse13 .cse9 .cse15 .cse5 .cse10 .cse11 .cse6) (and .cse0 .cse8 .cse1 .cse4 .cse13 .cse9 .cse14 .cse6) (and .cse8 .cse9 .cse15 .cse10 .cse11 .cse12 .cse14 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse13 .cse9 .cse12 .cse14) (and .cse8 .cse1 .cse4 .cse13 .cse9 .cse5 .cse10 .cse12) (and .cse0 .cse1 .cse3 .cse4 .cse13 .cse9 .cse5 .cse6) (and .cse8 .cse9 .cse15 .cse5 .cse10 .cse11 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse9 .cse11 .cse12 .cse14 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse14 .cse7) (and .cse2 .cse3 .cse15 .cse5 .cse10 .cse11 .cse12 .cse7) (and .cse8 .cse1 .cse2 .cse4 .cse13 .cse10 .cse12 .cse14) (and .cse0 .cse2 .cse3 .cse15 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse13 .cse9 .cse5 .cse11 .cse12) (and .cse0 .cse3 .cse4 .cse13 .cse9 .cse15 .cse5 .cse12) (and .cse8 .cse1 .cse4 .cse13 .cse9 .cse5 .cse10 .cse6) (and .cse0 .cse8 .cse1 .cse4 .cse9 .cse5 .cse6 .cse7) (and .cse1 .cse3 .cse9 .cse5 .cse10 .cse11 .cse6 .cse7) (and .cse0 .cse8 .cse2 .cse15 .cse11 .cse12 .cse14 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse5 .cse11 .cse12) (and .cse2 .cse3 .cse4 .cse15 .cse5 .cse10 .cse6 .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse13 .cse15 .cse12 .cse14) (and .cse0 .cse8 .cse13 .cse9 .cse15 .cse11 .cse12 .cse14) (and .cse0 .cse8 .cse9 .cse15 .cse11 .cse14 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse9 .cse11 .cse14 .cse6 .cse7) (and .cse1 .cse3 .cse13 .cse9 .cse10 .cse11 .cse14 .cse6) (and .cse8 .cse2 .cse13 .cse15 .cse5 .cse10 .cse11 .cse6) (and .cse2 .cse3 .cse13 .cse15 .cse10 .cse11 .cse14 .cse6))) [2020-07-08 22:21:44,592 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-08 22:21:44,592 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-07-08 22:21:44,592 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-07-08 22:21:44,593 INFO L264 CegarLoopResult]: At program point L76-1(lines 33 130) the Hoare annotation is: (let ((.cse2 (= 0 main_~p5~0)) (.cse11 (= 1 main_~lk6~0)) (.cse6 (= 0 main_~p2~0)) (.cse10 (= 1 main_~lk3~0)) (.cse9 (= 0 main_~p4~0)) (.cse8 (= 1 main_~lk1~0)) (.cse0 (= 0 main_~p3~0)) (.cse1 (= 1 main_~lk2~0)) (.cse3 (= 0 main_~p6~0)) (.cse4 (= 0 main_~p1~0)) (.cse7 (= 1 main_~lk5~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse3 .cse7 .cse8 .cse5) (and .cse0 .cse9 .cse6 .cse3 .cse4 .cse7) (and .cse9 .cse6 .cse10 .cse2 .cse3 .cse8) (and .cse6 .cse10 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse4 .cse7 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse4 .cse7) (and .cse11 .cse0 .cse9 .cse6 .cse2 .cse4) (and .cse6 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse8 .cse5) (and .cse1 .cse10 .cse3 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse6 .cse2 .cse4 .cse5) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse4) (and .cse1 .cse9 .cse10 .cse2 .cse3 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse2 .cse3 .cse4) (and .cse11 .cse1 .cse10 .cse2 .cse4 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse7 .cse8) (and .cse11 .cse0 .cse6 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse6 .cse7 .cse8 .cse5) (and .cse1 .cse9 .cse10 .cse3 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse6 .cse10 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse7 .cse8 .cse5) (and .cse1 .cse10 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse6 .cse2 .cse8 .cse5) (and .cse6 .cse10 .cse3 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse6 .cse3 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse4) (and .cse11 .cse1 .cse9 .cse10 .cse2 .cse4) (and .cse11 .cse6 .cse10 .cse2 .cse4 .cse5) (and .cse9 .cse6 .cse10 .cse3 .cse4 .cse7) (and .cse11 .cse1 .cse10 .cse4 .cse7 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse11 .cse6 .cse10 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse2 .cse8) (and .cse9 .cse6 .cse10 .cse3 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse7 .cse8) (and .cse11 .cse1 .cse10 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse9 .cse4 .cse7) (and .cse11 .cse1 .cse10 .cse2 .cse8 .cse5) (and .cse11 .cse9 .cse6 .cse10 .cse4 .cse7) (and .cse11 .cse0 .cse9 .cse6 .cse4 .cse7) (and .cse11 .cse9 .cse6 .cse10 .cse7 .cse8) (and .cse11 .cse6 .cse10 .cse2 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse8) (and .cse6 .cse10 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse2 .cse8) (and .cse0 .cse6 .cse3 .cse4 .cse7 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse8) (and .cse0 .cse1 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse9 .cse6 .cse10 .cse2 .cse4) (and .cse11 .cse9 .cse6 .cse10 .cse2 .cse8) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse7) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse8) (and .cse11 .cse0 .cse1 .cse2 .cse8 .cse5) (and .cse1 .cse10 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse11 .cse6 .cse10 .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse9 .cse3 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse7 .cse5))) [2020-07-08 22:21:44,593 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-07-08 22:21:44,593 INFO L264 CegarLoopResult]: At program point L134(line 134) the Hoare annotation is: false [2020-07-08 22:21:44,593 INFO L264 CegarLoopResult]: At program point L101(line 101) the Hoare annotation is: (let ((.cse9 (= 0 main_~p5~0)) (.cse6 (= 1 main_~lk6~0)) (.cse7 (= 0 main_~p7~0)) (.cse8 (= 0 main_~p4~0)) (.cse3 (= 0 main_~p8~0)) (.cse10 (= 1 main_~lk8~0)) (.cse0 (= 1 main_~lk7~0)) (.cse1 (= 1 main_~lk3~0)) (.cse2 (= 0 main_~p6~0)) (.cse4 (= 1 main_~lk5~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse1 .cse3 .cse4) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse7 .cse1 .cse9 .cse2 .cse3 .cse5) (and .cse6 .cse10 .cse0 .cse8 .cse1 .cse9) (and .cse6 .cse7 .cse10 .cse1 .cse4 .cse5) (and .cse6 .cse10 .cse0 .cse8 .cse1 .cse4) (and .cse0 .cse8 .cse1 .cse9 .cse2 .cse3) (and .cse6 .cse7 .cse8 .cse1 .cse9 .cse3) (and .cse6 .cse10 .cse0 .cse1 .cse4 .cse5) (and .cse6 .cse7 .cse10 .cse1 .cse9 .cse5) (and .cse6 .cse7 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5) (and .cse6 .cse7 .cse10 .cse8 .cse1 .cse9) (and .cse10 .cse0 .cse8 .cse1 .cse2 .cse4) (and .cse7 .cse10 .cse8 .cse1 .cse2 .cse4) (and .cse6 .cse10 .cse0 .cse1 .cse9 .cse5) (and .cse10 .cse0 .cse8 .cse1 .cse9 .cse2) (and .cse6 .cse7 .cse1 .cse9 .cse3 .cse5) (and .cse6 .cse0 .cse8 .cse1 .cse9 .cse3) (and .cse6 .cse0 .cse1 .cse9 .cse3 .cse5) (and .cse7 .cse10 .cse8 .cse1 .cse9 .cse2) (and .cse7 .cse10 .cse1 .cse9 .cse2 .cse5) (and .cse10 .cse0 .cse1 .cse9 .cse2 .cse5) (and .cse7 .cse8 .cse1 .cse9 .cse2 .cse3) (and .cse6 .cse7 .cse10 .cse8 .cse1 .cse4) (and .cse6 .cse0 .cse8 .cse1 .cse3 .cse4) (and .cse7 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse7 .cse10 .cse1 .cse2 .cse4 .cse5) (and .cse7 .cse8 .cse1 .cse2 .cse3 .cse4) (and .cse10 .cse0 .cse1 .cse2 .cse4 .cse5))) [2020-07-08 22:21:44,594 INFO L271 CegarLoopResult]: At program point L35(lines 35 37) the Hoare annotation is: true [2020-07-08 22:21:44,594 INFO L264 CegarLoopResult]: At program point L68-1(lines 33 130) the Hoare annotation is: (let ((.cse7 (= 0 main_~p2~0)) (.cse4 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p1~0)) (.cse5 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse6 (= 1 main_~lk1~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6) (and .cse7 .cse1 .cse6 .cse3) (and .cse5 .cse7 .cse1 .cse6) (and .cse4 .cse0 .cse6 .cse3) (and .cse7 .cse1 .cse2 .cse3) (and .cse4 .cse7 .cse6 .cse3) (and .cse4 .cse5 .cse7 .cse6) (and .cse5 .cse7 .cse1 .cse2) (and .cse4 .cse0 .cse5 .cse2) (and .cse4 .cse5 .cse7 .cse2) (and .cse4 .cse7 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2) (and .cse0 .cse5 .cse1 .cse6) (and .cse0 .cse1 .cse6 .cse3))) [2020-07-08 22:21:44,762 INFO L163 areAnnotationChecker]: CFG has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 22:21:44,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 10:21:44 BoogieIcfgContainer [2020-07-08 22:21:44,772 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 22:21:44,775 INFO L168 Benchmark]: Toolchain (without parser) took 335035.09 ms. Allocated memory was 134.2 MB in the beginning and 982.5 MB in the end (delta: 848.3 MB). Free memory was 99.3 MB in the beginning and 372.1 MB in the end (delta: -272.8 MB). Peak memory consumption was 575.5 MB. Max. memory is 7.1 GB. [2020-07-08 22:21:44,775 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 134.2 MB. Free memory was 117.6 MB in the beginning and 117.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 22:21:44,776 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.75 ms. Allocated memory is still 134.2 MB. Free memory was 99.1 MB in the beginning and 88.3 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2020-07-08 22:21:44,776 INFO L168 Benchmark]: Boogie Preprocessor took 127.38 ms. Allocated memory was 134.2 MB in the beginning and 198.7 MB in the end (delta: 64.5 MB). Free memory was 88.3 MB in the beginning and 176.3 MB in the end (delta: -88.1 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2020-07-08 22:21:44,777 INFO L168 Benchmark]: RCFGBuilder took 620.82 ms. Allocated memory is still 198.7 MB. Free memory was 176.3 MB in the beginning and 140.5 MB in the end (delta: 35.8 MB). Peak memory consumption was 35.8 MB. Max. memory is 7.1 GB. [2020-07-08 22:21:44,777 INFO L168 Benchmark]: TraceAbstraction took 334007.56 ms. Allocated memory was 198.7 MB in the beginning and 982.5 MB in the end (delta: 783.8 MB). Free memory was 139.8 MB in the beginning and 372.1 MB in the end (delta: -232.3 MB). Peak memory consumption was 551.5 MB. Max. memory is 7.1 GB. [2020-07-08 22:21:44,779 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 134.2 MB. Free memory was 117.6 MB in the beginning and 117.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 270.75 ms. Allocated memory is still 134.2 MB. Free memory was 99.1 MB in the beginning and 88.3 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 127.38 ms. Allocated memory was 134.2 MB in the beginning and 198.7 MB in the end (delta: 64.5 MB). Free memory was 88.3 MB in the beginning and 176.3 MB in the end (delta: -88.1 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 620.82 ms. Allocated memory is still 198.7 MB. Free memory was 176.3 MB in the beginning and 140.5 MB in the end (delta: 35.8 MB). Peak memory consumption was 35.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 334007.56 ms. Allocated memory was 198.7 MB in the beginning and 982.5 MB in the end (delta: 783.8 MB). Free memory was 139.8 MB in the beginning and 372.1 MB in the end (delta: -232.3 MB). Peak memory consumption was 551.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 4]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 98 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 293.8s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 152.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 39.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2345 SDtfs, 845 SDslu, 1664 SDs, 0 SdLazy, 79 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5479occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 89.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 2257 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 98 LocationsWithAnnotation, 98 PreInvPairs, 10602 NumberOfFragments, 32360 HoareAnnotationTreeSize, 98 FomulaSimplifications, 323126 FormulaSimplificationTreeSizeReduction, 7.8s HoareSimplificationTime, 98 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 31.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1040 NumberOfCodeBlocks, 1040 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1024 ConstructedInterpolants, 0 QuantifiedInterpolants, 83040 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...