/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-267fbe0 [2020-07-18 05:07:12,025 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 05:07:12,028 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 05:07:12,044 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 05:07:12,044 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 05:07:12,045 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 05:07:12,048 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 05:07:12,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 05:07:12,059 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 05:07:12,060 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 05:07:12,064 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 05:07:12,065 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 05:07:12,065 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 05:07:12,069 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 05:07:12,071 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 05:07:12,072 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 05:07:12,075 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 05:07:12,076 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 05:07:12,079 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 05:07:12,085 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 05:07:12,087 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 05:07:12,088 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 05:07:12,091 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 05:07:12,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 05:07:12,094 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 05:07:12,095 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 05:07:12,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 05:07:12,098 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 05:07:12,099 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 05:07:12,101 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 05:07:12,101 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 05:07:12,102 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 05:07:12,103 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 05:07:12,104 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 05:07:12,107 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 05:07:12,107 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 05:07:12,110 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 05:07:12,110 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 05:07:12,110 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 05:07:12,111 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 05:07:12,113 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 05:07:12,113 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 05:07:12,140 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 05:07:12,140 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 05:07:12,146 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 05:07:12,146 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 05:07:12,146 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 05:07:12,146 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 05:07:12,147 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 05:07:12,147 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 05:07:12,147 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 05:07:12,147 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 05:07:12,147 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 05:07:12,147 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 05:07:12,148 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 05:07:12,148 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 05:07:12,148 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 05:07:12,150 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 05:07:12,150 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 05:07:12,150 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 05:07:12,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 05:07:12,150 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 05:07:12,151 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 05:07:12,151 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 05:07:12,151 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-18 05:07:12,423 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 05:07:12,438 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 05:07:12,442 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 05:07:12,443 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 05:07:12,444 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 05:07:12,444 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-18 05:07:12,518 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de7521ddd/c602be2e7a8744548f9a4ab9cdc421ab/FLAGdbe0e75c5 [2020-07-18 05:07:13,037 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 05:07:13,039 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c [2020-07-18 05:07:13,048 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de7521ddd/c602be2e7a8744548f9a4ab9cdc421ab/FLAGdbe0e75c5 [2020-07-18 05:07:13,390 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de7521ddd/c602be2e7a8744548f9a4ab9cdc421ab [2020-07-18 05:07:13,399 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 05:07:13,403 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 05:07:13,406 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 05:07:13,406 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 05:07:13,410 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 05:07:13,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 05:07:13" (1/1) ... [2020-07-18 05:07:13,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f4db0d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:07:13, skipping insertion in model container [2020-07-18 05:07:13,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 05:07:13" (1/1) ... [2020-07-18 05:07:13,424 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 05:07:13,455 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 05:07:13,687 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 05:07:13,692 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 05:07:13,719 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 05:07:13,735 INFO L208 MainTranslator]: Completed translation [2020-07-18 05:07:13,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:07:13 WrapperNode [2020-07-18 05:07:13,736 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 05:07:13,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 05:07:13,737 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 05:07:13,737 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 05:07:13,838 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:07:13" (1/1) ... [2020-07-18 05:07:13,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:07:13" (1/1) ... [2020-07-18 05:07:13,848 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:07:13" (1/1) ... [2020-07-18 05:07:13,848 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:07:13" (1/1) ... [2020-07-18 05:07:13,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:07:13" (1/1) ... [2020-07-18 05:07:13,871 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:07:13" (1/1) ... [2020-07-18 05:07:13,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:07:13" (1/1) ... [2020-07-18 05:07:13,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 05:07:13,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 05:07:13,876 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 05:07:13,876 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 05:07:13,883 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:07:13" (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-18 05:07:13,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 05:07:13,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 05:07:13,952 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 05:07:13,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 05:07:13,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 05:07:13,953 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 05:07:13,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 05:07:13,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 05:07:14,484 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 05:07:14,484 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-18 05:07:14,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 05:07:14 BoogieIcfgContainer [2020-07-18 05:07:14,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 05:07:14,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 05:07:14,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 05:07:14,494 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 05:07:14,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 05:07:13" (1/3) ... [2020-07-18 05:07:14,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1803100a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 05:07:14, skipping insertion in model container [2020-07-18 05:07:14,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:07:13" (2/3) ... [2020-07-18 05:07:14,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1803100a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 05:07:14, skipping insertion in model container [2020-07-18 05:07:14,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 05:07:14" (3/3) ... [2020-07-18 05:07:14,499 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2020-07-18 05:07:14,510 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 05:07:14,518 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 05:07:14,531 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 05:07:14,553 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 05:07:14,553 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 05:07:14,554 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-18 05:07:14,554 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 05:07:14,554 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 05:07:14,554 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 05:07:14,554 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 05:07:14,555 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 05:07:14,569 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2020-07-18 05:07:14,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-18 05:07:14,582 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:07:14,583 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-18 05:07:14,583 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:07:14,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:07:14,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1717644884, now seen corresponding path program 1 times [2020-07-18 05:07:14,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:07:14,597 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [744019159] [2020-07-18 05:07:14,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:07:14,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:14,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:14,843 INFO L280 TraceCheckUtils]: 0: Hoare triple {101#true} assume true; {101#true} is VALID [2020-07-18 05:07:14,843 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {101#true} {101#true} #223#return; {101#true} is VALID [2020-07-18 05:07:14,846 INFO L263 TraceCheckUtils]: 0: Hoare triple {101#true} call ULTIMATE.init(); {101#true} is VALID [2020-07-18 05:07:14,846 INFO L280 TraceCheckUtils]: 1: Hoare triple {101#true} assume true; {101#true} is VALID [2020-07-18 05:07:14,848 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {101#true} {101#true} #223#return; {101#true} is VALID [2020-07-18 05:07:14,849 INFO L263 TraceCheckUtils]: 3: Hoare triple {101#true} call #t~ret9 := main(); {101#true} is VALID [2020-07-18 05:07:14,849 INFO L280 TraceCheckUtils]: 4: Hoare triple {101#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {101#true} is VALID [2020-07-18 05:07:14,850 INFO L280 TraceCheckUtils]: 5: Hoare triple {101#true} ~p1~0 := #t~nondet0; {101#true} is VALID [2020-07-18 05:07:14,850 INFO L280 TraceCheckUtils]: 6: Hoare triple {101#true} havoc #t~nondet0; {101#true} is VALID [2020-07-18 05:07:14,851 INFO L280 TraceCheckUtils]: 7: Hoare triple {101#true} havoc ~lk1~0; {101#true} is VALID [2020-07-18 05:07:14,851 INFO L280 TraceCheckUtils]: 8: Hoare triple {101#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {101#true} is VALID [2020-07-18 05:07:14,852 INFO L280 TraceCheckUtils]: 9: Hoare triple {101#true} ~p2~0 := #t~nondet1; {101#true} is VALID [2020-07-18 05:07:14,852 INFO L280 TraceCheckUtils]: 10: Hoare triple {101#true} havoc #t~nondet1; {101#true} is VALID [2020-07-18 05:07:14,852 INFO L280 TraceCheckUtils]: 11: Hoare triple {101#true} havoc ~lk2~0; {101#true} is VALID [2020-07-18 05:07:14,853 INFO L280 TraceCheckUtils]: 12: Hoare triple {101#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {101#true} is VALID [2020-07-18 05:07:14,853 INFO L280 TraceCheckUtils]: 13: Hoare triple {101#true} ~p3~0 := #t~nondet2; {101#true} is VALID [2020-07-18 05:07:14,854 INFO L280 TraceCheckUtils]: 14: Hoare triple {101#true} havoc #t~nondet2; {101#true} is VALID [2020-07-18 05:07:14,854 INFO L280 TraceCheckUtils]: 15: Hoare triple {101#true} havoc ~lk3~0; {101#true} is VALID [2020-07-18 05:07:14,854 INFO L280 TraceCheckUtils]: 16: Hoare triple {101#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {101#true} is VALID [2020-07-18 05:07:14,855 INFO L280 TraceCheckUtils]: 17: Hoare triple {101#true} ~p4~0 := #t~nondet3; {101#true} is VALID [2020-07-18 05:07:14,855 INFO L280 TraceCheckUtils]: 18: Hoare triple {101#true} havoc #t~nondet3; {101#true} is VALID [2020-07-18 05:07:14,855 INFO L280 TraceCheckUtils]: 19: Hoare triple {101#true} havoc ~lk4~0; {101#true} is VALID [2020-07-18 05:07:14,856 INFO L280 TraceCheckUtils]: 20: Hoare triple {101#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {101#true} is VALID [2020-07-18 05:07:14,857 INFO L280 TraceCheckUtils]: 21: Hoare triple {101#true} ~p5~0 := #t~nondet4; {101#true} is VALID [2020-07-18 05:07:14,857 INFO L280 TraceCheckUtils]: 22: Hoare triple {101#true} havoc #t~nondet4; {101#true} is VALID [2020-07-18 05:07:14,860 INFO L280 TraceCheckUtils]: 23: Hoare triple {101#true} havoc ~lk5~0; {101#true} is VALID [2020-07-18 05:07:14,861 INFO L280 TraceCheckUtils]: 24: Hoare triple {101#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {101#true} is VALID [2020-07-18 05:07:14,861 INFO L280 TraceCheckUtils]: 25: Hoare triple {101#true} ~p6~0 := #t~nondet5; {101#true} is VALID [2020-07-18 05:07:14,862 INFO L280 TraceCheckUtils]: 26: Hoare triple {101#true} havoc #t~nondet5; {101#true} is VALID [2020-07-18 05:07:14,862 INFO L280 TraceCheckUtils]: 27: Hoare triple {101#true} havoc ~lk6~0; {101#true} is VALID [2020-07-18 05:07:14,862 INFO L280 TraceCheckUtils]: 28: Hoare triple {101#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {101#true} is VALID [2020-07-18 05:07:14,863 INFO L280 TraceCheckUtils]: 29: Hoare triple {101#true} ~p7~0 := #t~nondet6; {101#true} is VALID [2020-07-18 05:07:14,863 INFO L280 TraceCheckUtils]: 30: Hoare triple {101#true} havoc #t~nondet6; {101#true} is VALID [2020-07-18 05:07:14,864 INFO L280 TraceCheckUtils]: 31: Hoare triple {101#true} havoc ~lk7~0; {101#true} is VALID [2020-07-18 05:07:14,864 INFO L280 TraceCheckUtils]: 32: Hoare triple {101#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {101#true} is VALID [2020-07-18 05:07:14,864 INFO L280 TraceCheckUtils]: 33: Hoare triple {101#true} ~p8~0 := #t~nondet7; {101#true} is VALID [2020-07-18 05:07:14,866 INFO L280 TraceCheckUtils]: 34: Hoare triple {101#true} havoc #t~nondet7; {101#true} is VALID [2020-07-18 05:07:14,867 INFO L280 TraceCheckUtils]: 35: Hoare triple {101#true} havoc ~lk8~0; {101#true} is VALID [2020-07-18 05:07:14,867 INFO L280 TraceCheckUtils]: 36: Hoare triple {101#true} havoc ~cond~0; {101#true} is VALID [2020-07-18 05:07:14,868 INFO L280 TraceCheckUtils]: 37: Hoare triple {101#true} assume !false; {101#true} is VALID [2020-07-18 05:07:14,869 INFO L280 TraceCheckUtils]: 38: Hoare triple {101#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {101#true} is VALID [2020-07-18 05:07:14,870 INFO L280 TraceCheckUtils]: 39: Hoare triple {101#true} ~cond~0 := #t~nondet8; {101#true} is VALID [2020-07-18 05:07:14,870 INFO L280 TraceCheckUtils]: 40: Hoare triple {101#true} havoc #t~nondet8; {101#true} is VALID [2020-07-18 05:07:14,871 INFO L280 TraceCheckUtils]: 41: Hoare triple {101#true} assume !(0 == ~cond~0); {101#true} is VALID [2020-07-18 05:07:14,871 INFO L280 TraceCheckUtils]: 42: Hoare triple {101#true} ~lk1~0 := 0; {101#true} is VALID [2020-07-18 05:07:14,872 INFO L280 TraceCheckUtils]: 43: Hoare triple {101#true} ~lk2~0 := 0; {101#true} is VALID [2020-07-18 05:07:14,873 INFO L280 TraceCheckUtils]: 44: Hoare triple {101#true} ~lk3~0 := 0; {101#true} is VALID [2020-07-18 05:07:14,873 INFO L280 TraceCheckUtils]: 45: Hoare triple {101#true} ~lk4~0 := 0; {101#true} is VALID [2020-07-18 05:07:14,874 INFO L280 TraceCheckUtils]: 46: Hoare triple {101#true} ~lk5~0 := 0; {101#true} is VALID [2020-07-18 05:07:14,874 INFO L280 TraceCheckUtils]: 47: Hoare triple {101#true} ~lk6~0 := 0; {101#true} is VALID [2020-07-18 05:07:14,878 INFO L280 TraceCheckUtils]: 48: Hoare triple {101#true} ~lk7~0 := 0; {101#true} is VALID [2020-07-18 05:07:14,879 INFO L280 TraceCheckUtils]: 49: Hoare triple {101#true} ~lk8~0 := 0; {101#true} is VALID [2020-07-18 05:07:14,881 INFO L280 TraceCheckUtils]: 50: Hoare triple {101#true} assume !(0 != ~p1~0); {105#(= 0 main_~p1~0)} is VALID [2020-07-18 05:07:14,882 INFO L280 TraceCheckUtils]: 51: Hoare triple {105#(= 0 main_~p1~0)} assume !(0 != ~p2~0); {105#(= 0 main_~p1~0)} is VALID [2020-07-18 05:07:14,883 INFO L280 TraceCheckUtils]: 52: Hoare triple {105#(= 0 main_~p1~0)} assume !(0 != ~p3~0); {105#(= 0 main_~p1~0)} is VALID [2020-07-18 05:07:14,884 INFO L280 TraceCheckUtils]: 53: Hoare triple {105#(= 0 main_~p1~0)} assume !(0 != ~p4~0); {105#(= 0 main_~p1~0)} is VALID [2020-07-18 05:07:14,885 INFO L280 TraceCheckUtils]: 54: Hoare triple {105#(= 0 main_~p1~0)} assume !(0 != ~p5~0); {105#(= 0 main_~p1~0)} is VALID [2020-07-18 05:07:14,886 INFO L280 TraceCheckUtils]: 55: Hoare triple {105#(= 0 main_~p1~0)} assume !(0 != ~p6~0); {105#(= 0 main_~p1~0)} is VALID [2020-07-18 05:07:14,890 INFO L280 TraceCheckUtils]: 56: Hoare triple {105#(= 0 main_~p1~0)} assume !(0 != ~p7~0); {105#(= 0 main_~p1~0)} is VALID [2020-07-18 05:07:14,892 INFO L280 TraceCheckUtils]: 57: Hoare triple {105#(= 0 main_~p1~0)} assume !(0 != ~p8~0); {105#(= 0 main_~p1~0)} is VALID [2020-07-18 05:07:14,893 INFO L280 TraceCheckUtils]: 58: Hoare triple {105#(= 0 main_~p1~0)} assume 0 != ~p1~0; {102#false} is VALID [2020-07-18 05:07:14,893 INFO L280 TraceCheckUtils]: 59: Hoare triple {102#false} assume 1 != ~lk1~0; {102#false} is VALID [2020-07-18 05:07:14,894 INFO L280 TraceCheckUtils]: 60: Hoare triple {102#false} assume !false; {102#false} is VALID [2020-07-18 05:07:14,913 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-18 05:07:14,914 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [744019159] [2020-07-18 05:07:14,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:07:14,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:07:14,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239606249] [2020-07-18 05:07:14,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-07-18 05:07:14,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:07:14,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:07:15,060 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-18 05:07:15,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:07:15,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:07:15,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:07:15,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:15,073 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 3 states. [2020-07-18 05:07:15,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:15,563 INFO L93 Difference]: Finished difference Result 213 states and 291 transitions. [2020-07-18 05:07:15,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:07:15,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-07-18 05:07:15,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:07:15,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:15,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2020-07-18 05:07:15,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:15,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2020-07-18 05:07:15,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 291 transitions. [2020-07-18 05:07:15,963 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-18 05:07:15,982 INFO L225 Difference]: With dead ends: 213 [2020-07-18 05:07:15,983 INFO L226 Difference]: Without dead ends: 144 [2020-07-18 05:07:15,987 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-18 05:07:16,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-07-18 05:07:16,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2020-07-18 05:07:16,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:07:16,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand 142 states. [2020-07-18 05:07:16,138 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 142 states. [2020-07-18 05:07:16,139 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 142 states. [2020-07-18 05:07:16,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:16,151 INFO L93 Difference]: Finished difference Result 144 states and 187 transitions. [2020-07-18 05:07:16,151 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 187 transitions. [2020-07-18 05:07:16,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:16,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:16,154 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 144 states. [2020-07-18 05:07:16,154 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 144 states. [2020-07-18 05:07:16,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:16,166 INFO L93 Difference]: Finished difference Result 144 states and 187 transitions. [2020-07-18 05:07:16,166 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 187 transitions. [2020-07-18 05:07:16,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:16,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:16,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:07:16,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:07:16,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-07-18 05:07:16,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 186 transitions. [2020-07-18 05:07:16,179 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 186 transitions. Word has length 61 [2020-07-18 05:07:16,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:07:16,180 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 186 transitions. [2020-07-18 05:07:16,180 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:07:16,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 142 states and 186 transitions. [2020-07-18 05:07:16,416 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-18 05:07:16,416 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 186 transitions. [2020-07-18 05:07:16,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-07-18 05:07:16,419 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:07:16,420 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-18 05:07:16,420 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 05:07:16,420 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:07:16,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:07:16,421 INFO L82 PathProgramCache]: Analyzing trace with hash 16380224, now seen corresponding path program 1 times [2020-07-18 05:07:16,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:07:16,422 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1545808505] [2020-07-18 05:07:16,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:07:16,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:16,492 INFO L280 TraceCheckUtils]: 0: Hoare triple {1106#true} assume true; {1106#true} is VALID [2020-07-18 05:07:16,493 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1106#true} {1106#true} #223#return; {1106#true} is VALID [2020-07-18 05:07:16,493 INFO L263 TraceCheckUtils]: 0: Hoare triple {1106#true} call ULTIMATE.init(); {1106#true} is VALID [2020-07-18 05:07:16,493 INFO L280 TraceCheckUtils]: 1: Hoare triple {1106#true} assume true; {1106#true} is VALID [2020-07-18 05:07:16,494 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1106#true} {1106#true} #223#return; {1106#true} is VALID [2020-07-18 05:07:16,494 INFO L263 TraceCheckUtils]: 3: Hoare triple {1106#true} call #t~ret9 := main(); {1106#true} is VALID [2020-07-18 05:07:16,494 INFO L280 TraceCheckUtils]: 4: Hoare triple {1106#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1106#true} is VALID [2020-07-18 05:07:16,494 INFO L280 TraceCheckUtils]: 5: Hoare triple {1106#true} ~p1~0 := #t~nondet0; {1106#true} is VALID [2020-07-18 05:07:16,495 INFO L280 TraceCheckUtils]: 6: Hoare triple {1106#true} havoc #t~nondet0; {1106#true} is VALID [2020-07-18 05:07:16,495 INFO L280 TraceCheckUtils]: 7: Hoare triple {1106#true} havoc ~lk1~0; {1106#true} is VALID [2020-07-18 05:07:16,495 INFO L280 TraceCheckUtils]: 8: Hoare triple {1106#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1106#true} is VALID [2020-07-18 05:07:16,496 INFO L280 TraceCheckUtils]: 9: Hoare triple {1106#true} ~p2~0 := #t~nondet1; {1106#true} is VALID [2020-07-18 05:07:16,496 INFO L280 TraceCheckUtils]: 10: Hoare triple {1106#true} havoc #t~nondet1; {1106#true} is VALID [2020-07-18 05:07:16,496 INFO L280 TraceCheckUtils]: 11: Hoare triple {1106#true} havoc ~lk2~0; {1106#true} is VALID [2020-07-18 05:07:16,496 INFO L280 TraceCheckUtils]: 12: Hoare triple {1106#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1106#true} is VALID [2020-07-18 05:07:16,497 INFO L280 TraceCheckUtils]: 13: Hoare triple {1106#true} ~p3~0 := #t~nondet2; {1106#true} is VALID [2020-07-18 05:07:16,497 INFO L280 TraceCheckUtils]: 14: Hoare triple {1106#true} havoc #t~nondet2; {1106#true} is VALID [2020-07-18 05:07:16,497 INFO L280 TraceCheckUtils]: 15: Hoare triple {1106#true} havoc ~lk3~0; {1106#true} is VALID [2020-07-18 05:07:16,498 INFO L280 TraceCheckUtils]: 16: Hoare triple {1106#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1106#true} is VALID [2020-07-18 05:07:16,498 INFO L280 TraceCheckUtils]: 17: Hoare triple {1106#true} ~p4~0 := #t~nondet3; {1106#true} is VALID [2020-07-18 05:07:16,498 INFO L280 TraceCheckUtils]: 18: Hoare triple {1106#true} havoc #t~nondet3; {1106#true} is VALID [2020-07-18 05:07:16,498 INFO L280 TraceCheckUtils]: 19: Hoare triple {1106#true} havoc ~lk4~0; {1106#true} is VALID [2020-07-18 05:07:16,499 INFO L280 TraceCheckUtils]: 20: Hoare triple {1106#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1106#true} is VALID [2020-07-18 05:07:16,499 INFO L280 TraceCheckUtils]: 21: Hoare triple {1106#true} ~p5~0 := #t~nondet4; {1106#true} is VALID [2020-07-18 05:07:16,499 INFO L280 TraceCheckUtils]: 22: Hoare triple {1106#true} havoc #t~nondet4; {1106#true} is VALID [2020-07-18 05:07:16,499 INFO L280 TraceCheckUtils]: 23: Hoare triple {1106#true} havoc ~lk5~0; {1106#true} is VALID [2020-07-18 05:07:16,500 INFO L280 TraceCheckUtils]: 24: Hoare triple {1106#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1106#true} is VALID [2020-07-18 05:07:16,500 INFO L280 TraceCheckUtils]: 25: Hoare triple {1106#true} ~p6~0 := #t~nondet5; {1106#true} is VALID [2020-07-18 05:07:16,500 INFO L280 TraceCheckUtils]: 26: Hoare triple {1106#true} havoc #t~nondet5; {1106#true} is VALID [2020-07-18 05:07:16,501 INFO L280 TraceCheckUtils]: 27: Hoare triple {1106#true} havoc ~lk6~0; {1106#true} is VALID [2020-07-18 05:07:16,501 INFO L280 TraceCheckUtils]: 28: Hoare triple {1106#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {1106#true} is VALID [2020-07-18 05:07:16,501 INFO L280 TraceCheckUtils]: 29: Hoare triple {1106#true} ~p7~0 := #t~nondet6; {1106#true} is VALID [2020-07-18 05:07:16,501 INFO L280 TraceCheckUtils]: 30: Hoare triple {1106#true} havoc #t~nondet6; {1106#true} is VALID [2020-07-18 05:07:16,502 INFO L280 TraceCheckUtils]: 31: Hoare triple {1106#true} havoc ~lk7~0; {1106#true} is VALID [2020-07-18 05:07:16,502 INFO L280 TraceCheckUtils]: 32: Hoare triple {1106#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {1106#true} is VALID [2020-07-18 05:07:16,502 INFO L280 TraceCheckUtils]: 33: Hoare triple {1106#true} ~p8~0 := #t~nondet7; {1106#true} is VALID [2020-07-18 05:07:16,503 INFO L280 TraceCheckUtils]: 34: Hoare triple {1106#true} havoc #t~nondet7; {1106#true} is VALID [2020-07-18 05:07:16,503 INFO L280 TraceCheckUtils]: 35: Hoare triple {1106#true} havoc ~lk8~0; {1106#true} is VALID [2020-07-18 05:07:16,503 INFO L280 TraceCheckUtils]: 36: Hoare triple {1106#true} havoc ~cond~0; {1106#true} is VALID [2020-07-18 05:07:16,503 INFO L280 TraceCheckUtils]: 37: Hoare triple {1106#true} assume !false; {1106#true} is VALID [2020-07-18 05:07:16,504 INFO L280 TraceCheckUtils]: 38: Hoare triple {1106#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {1106#true} is VALID [2020-07-18 05:07:16,504 INFO L280 TraceCheckUtils]: 39: Hoare triple {1106#true} ~cond~0 := #t~nondet8; {1106#true} is VALID [2020-07-18 05:07:16,504 INFO L280 TraceCheckUtils]: 40: Hoare triple {1106#true} havoc #t~nondet8; {1106#true} is VALID [2020-07-18 05:07:16,505 INFO L280 TraceCheckUtils]: 41: Hoare triple {1106#true} assume !(0 == ~cond~0); {1106#true} is VALID [2020-07-18 05:07:16,505 INFO L280 TraceCheckUtils]: 42: Hoare triple {1106#true} ~lk1~0 := 0; {1106#true} is VALID [2020-07-18 05:07:16,505 INFO L280 TraceCheckUtils]: 43: Hoare triple {1106#true} ~lk2~0 := 0; {1106#true} is VALID [2020-07-18 05:07:16,506 INFO L280 TraceCheckUtils]: 44: Hoare triple {1106#true} ~lk3~0 := 0; {1106#true} is VALID [2020-07-18 05:07:16,506 INFO L280 TraceCheckUtils]: 45: Hoare triple {1106#true} ~lk4~0 := 0; {1106#true} is VALID [2020-07-18 05:07:16,506 INFO L280 TraceCheckUtils]: 46: Hoare triple {1106#true} ~lk5~0 := 0; {1106#true} is VALID [2020-07-18 05:07:16,506 INFO L280 TraceCheckUtils]: 47: Hoare triple {1106#true} ~lk6~0 := 0; {1106#true} is VALID [2020-07-18 05:07:16,507 INFO L280 TraceCheckUtils]: 48: Hoare triple {1106#true} ~lk7~0 := 0; {1106#true} is VALID [2020-07-18 05:07:16,507 INFO L280 TraceCheckUtils]: 49: Hoare triple {1106#true} ~lk8~0 := 0; {1106#true} is VALID [2020-07-18 05:07:16,507 INFO L280 TraceCheckUtils]: 50: Hoare triple {1106#true} assume 0 != ~p1~0; {1106#true} is VALID [2020-07-18 05:07:16,508 INFO L280 TraceCheckUtils]: 51: Hoare triple {1106#true} ~lk1~0 := 1; {1110#(= 1 main_~lk1~0)} is VALID [2020-07-18 05:07:16,509 INFO L280 TraceCheckUtils]: 52: Hoare triple {1110#(= 1 main_~lk1~0)} assume !(0 != ~p2~0); {1110#(= 1 main_~lk1~0)} is VALID [2020-07-18 05:07:16,510 INFO L280 TraceCheckUtils]: 53: Hoare triple {1110#(= 1 main_~lk1~0)} assume !(0 != ~p3~0); {1110#(= 1 main_~lk1~0)} is VALID [2020-07-18 05:07:16,510 INFO L280 TraceCheckUtils]: 54: Hoare triple {1110#(= 1 main_~lk1~0)} assume !(0 != ~p4~0); {1110#(= 1 main_~lk1~0)} is VALID [2020-07-18 05:07:16,511 INFO L280 TraceCheckUtils]: 55: Hoare triple {1110#(= 1 main_~lk1~0)} assume !(0 != ~p5~0); {1110#(= 1 main_~lk1~0)} is VALID [2020-07-18 05:07:16,512 INFO L280 TraceCheckUtils]: 56: Hoare triple {1110#(= 1 main_~lk1~0)} assume !(0 != ~p6~0); {1110#(= 1 main_~lk1~0)} is VALID [2020-07-18 05:07:16,512 INFO L280 TraceCheckUtils]: 57: Hoare triple {1110#(= 1 main_~lk1~0)} assume !(0 != ~p7~0); {1110#(= 1 main_~lk1~0)} is VALID [2020-07-18 05:07:16,513 INFO L280 TraceCheckUtils]: 58: Hoare triple {1110#(= 1 main_~lk1~0)} assume !(0 != ~p8~0); {1110#(= 1 main_~lk1~0)} is VALID [2020-07-18 05:07:16,514 INFO L280 TraceCheckUtils]: 59: Hoare triple {1110#(= 1 main_~lk1~0)} assume 0 != ~p1~0; {1110#(= 1 main_~lk1~0)} is VALID [2020-07-18 05:07:16,514 INFO L280 TraceCheckUtils]: 60: Hoare triple {1110#(= 1 main_~lk1~0)} assume 1 != ~lk1~0; {1107#false} is VALID [2020-07-18 05:07:16,515 INFO L280 TraceCheckUtils]: 61: Hoare triple {1107#false} assume !false; {1107#false} is VALID [2020-07-18 05:07:16,519 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-18 05:07:16,519 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1545808505] [2020-07-18 05:07:16,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:07:16,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:07:16,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082056618] [2020-07-18 05:07:16,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-07-18 05:07:16,522 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:07:16,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:07:16,576 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-18 05:07:16,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:07:16,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:07:16,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:07:16,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:16,577 INFO L87 Difference]: Start difference. First operand 142 states and 186 transitions. Second operand 3 states. [2020-07-18 05:07:16,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:16,915 INFO L93 Difference]: Finished difference Result 173 states and 229 transitions. [2020-07-18 05:07:16,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:07:16,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-07-18 05:07:16,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:07:16,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:16,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2020-07-18 05:07:16,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:16,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2020-07-18 05:07:16,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 180 transitions. [2020-07-18 05:07:17,096 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-18 05:07:17,104 INFO L225 Difference]: With dead ends: 173 [2020-07-18 05:07:17,104 INFO L226 Difference]: Without dead ends: 171 [2020-07-18 05:07:17,105 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-18 05:07:17,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-07-18 05:07:17,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 142. [2020-07-18 05:07:17,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:07:17,257 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand 142 states. [2020-07-18 05:07:17,257 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand 142 states. [2020-07-18 05:07:17,257 INFO L87 Difference]: Start difference. First operand 171 states. Second operand 142 states. [2020-07-18 05:07:17,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:17,267 INFO L93 Difference]: Finished difference Result 171 states and 227 transitions. [2020-07-18 05:07:17,267 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 227 transitions. [2020-07-18 05:07:17,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:17,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:17,268 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 171 states. [2020-07-18 05:07:17,269 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 171 states. [2020-07-18 05:07:17,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:17,278 INFO L93 Difference]: Finished difference Result 171 states and 227 transitions. [2020-07-18 05:07:17,279 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 227 transitions. [2020-07-18 05:07:17,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:17,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:17,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:07:17,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:07:17,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-07-18 05:07:17,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 185 transitions. [2020-07-18 05:07:17,287 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 185 transitions. Word has length 62 [2020-07-18 05:07:17,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:07:17,288 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 185 transitions. [2020-07-18 05:07:17,288 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:07:17,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 142 states and 185 transitions. [2020-07-18 05:07:17,479 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-18 05:07:17,479 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 185 transitions. [2020-07-18 05:07:17,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-07-18 05:07:17,481 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:07:17,482 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-18 05:07:17,482 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 05:07:17,482 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:07:17,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:07:17,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1707628474, now seen corresponding path program 1 times [2020-07-18 05:07:17,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:07:17,483 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1277597313] [2020-07-18 05:07:17,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:07:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:17,545 INFO L280 TraceCheckUtils]: 0: Hoare triple {2085#true} assume true; {2085#true} is VALID [2020-07-18 05:07:17,546 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2085#true} {2085#true} #223#return; {2085#true} is VALID [2020-07-18 05:07:17,546 INFO L263 TraceCheckUtils]: 0: Hoare triple {2085#true} call ULTIMATE.init(); {2085#true} is VALID [2020-07-18 05:07:17,546 INFO L280 TraceCheckUtils]: 1: Hoare triple {2085#true} assume true; {2085#true} is VALID [2020-07-18 05:07:17,546 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2085#true} {2085#true} #223#return; {2085#true} is VALID [2020-07-18 05:07:17,547 INFO L263 TraceCheckUtils]: 3: Hoare triple {2085#true} call #t~ret9 := main(); {2085#true} is VALID [2020-07-18 05:07:17,547 INFO L280 TraceCheckUtils]: 4: Hoare triple {2085#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2085#true} is VALID [2020-07-18 05:07:17,547 INFO L280 TraceCheckUtils]: 5: Hoare triple {2085#true} ~p1~0 := #t~nondet0; {2085#true} is VALID [2020-07-18 05:07:17,547 INFO L280 TraceCheckUtils]: 6: Hoare triple {2085#true} havoc #t~nondet0; {2085#true} is VALID [2020-07-18 05:07:17,548 INFO L280 TraceCheckUtils]: 7: Hoare triple {2085#true} havoc ~lk1~0; {2085#true} is VALID [2020-07-18 05:07:17,548 INFO L280 TraceCheckUtils]: 8: Hoare triple {2085#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2085#true} is VALID [2020-07-18 05:07:17,548 INFO L280 TraceCheckUtils]: 9: Hoare triple {2085#true} ~p2~0 := #t~nondet1; {2085#true} is VALID [2020-07-18 05:07:17,548 INFO L280 TraceCheckUtils]: 10: Hoare triple {2085#true} havoc #t~nondet1; {2085#true} is VALID [2020-07-18 05:07:17,549 INFO L280 TraceCheckUtils]: 11: Hoare triple {2085#true} havoc ~lk2~0; {2085#true} is VALID [2020-07-18 05:07:17,549 INFO L280 TraceCheckUtils]: 12: Hoare triple {2085#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2085#true} is VALID [2020-07-18 05:07:17,549 INFO L280 TraceCheckUtils]: 13: Hoare triple {2085#true} ~p3~0 := #t~nondet2; {2085#true} is VALID [2020-07-18 05:07:17,549 INFO L280 TraceCheckUtils]: 14: Hoare triple {2085#true} havoc #t~nondet2; {2085#true} is VALID [2020-07-18 05:07:17,550 INFO L280 TraceCheckUtils]: 15: Hoare triple {2085#true} havoc ~lk3~0; {2085#true} is VALID [2020-07-18 05:07:17,550 INFO L280 TraceCheckUtils]: 16: Hoare triple {2085#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2085#true} is VALID [2020-07-18 05:07:17,550 INFO L280 TraceCheckUtils]: 17: Hoare triple {2085#true} ~p4~0 := #t~nondet3; {2085#true} is VALID [2020-07-18 05:07:17,550 INFO L280 TraceCheckUtils]: 18: Hoare triple {2085#true} havoc #t~nondet3; {2085#true} is VALID [2020-07-18 05:07:17,551 INFO L280 TraceCheckUtils]: 19: Hoare triple {2085#true} havoc ~lk4~0; {2085#true} is VALID [2020-07-18 05:07:17,551 INFO L280 TraceCheckUtils]: 20: Hoare triple {2085#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2085#true} is VALID [2020-07-18 05:07:17,551 INFO L280 TraceCheckUtils]: 21: Hoare triple {2085#true} ~p5~0 := #t~nondet4; {2085#true} is VALID [2020-07-18 05:07:17,551 INFO L280 TraceCheckUtils]: 22: Hoare triple {2085#true} havoc #t~nondet4; {2085#true} is VALID [2020-07-18 05:07:17,552 INFO L280 TraceCheckUtils]: 23: Hoare triple {2085#true} havoc ~lk5~0; {2085#true} is VALID [2020-07-18 05:07:17,552 INFO L280 TraceCheckUtils]: 24: Hoare triple {2085#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2085#true} is VALID [2020-07-18 05:07:17,552 INFO L280 TraceCheckUtils]: 25: Hoare triple {2085#true} ~p6~0 := #t~nondet5; {2085#true} is VALID [2020-07-18 05:07:17,552 INFO L280 TraceCheckUtils]: 26: Hoare triple {2085#true} havoc #t~nondet5; {2085#true} is VALID [2020-07-18 05:07:17,552 INFO L280 TraceCheckUtils]: 27: Hoare triple {2085#true} havoc ~lk6~0; {2085#true} is VALID [2020-07-18 05:07:17,553 INFO L280 TraceCheckUtils]: 28: Hoare triple {2085#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {2085#true} is VALID [2020-07-18 05:07:17,553 INFO L280 TraceCheckUtils]: 29: Hoare triple {2085#true} ~p7~0 := #t~nondet6; {2085#true} is VALID [2020-07-18 05:07:17,553 INFO L280 TraceCheckUtils]: 30: Hoare triple {2085#true} havoc #t~nondet6; {2085#true} is VALID [2020-07-18 05:07:17,553 INFO L280 TraceCheckUtils]: 31: Hoare triple {2085#true} havoc ~lk7~0; {2085#true} is VALID [2020-07-18 05:07:17,553 INFO L280 TraceCheckUtils]: 32: Hoare triple {2085#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {2085#true} is VALID [2020-07-18 05:07:17,554 INFO L280 TraceCheckUtils]: 33: Hoare triple {2085#true} ~p8~0 := #t~nondet7; {2085#true} is VALID [2020-07-18 05:07:17,554 INFO L280 TraceCheckUtils]: 34: Hoare triple {2085#true} havoc #t~nondet7; {2085#true} is VALID [2020-07-18 05:07:17,554 INFO L280 TraceCheckUtils]: 35: Hoare triple {2085#true} havoc ~lk8~0; {2085#true} is VALID [2020-07-18 05:07:17,554 INFO L280 TraceCheckUtils]: 36: Hoare triple {2085#true} havoc ~cond~0; {2085#true} is VALID [2020-07-18 05:07:17,555 INFO L280 TraceCheckUtils]: 37: Hoare triple {2085#true} assume !false; {2085#true} is VALID [2020-07-18 05:07:17,555 INFO L280 TraceCheckUtils]: 38: Hoare triple {2085#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {2085#true} is VALID [2020-07-18 05:07:17,555 INFO L280 TraceCheckUtils]: 39: Hoare triple {2085#true} ~cond~0 := #t~nondet8; {2085#true} is VALID [2020-07-18 05:07:17,555 INFO L280 TraceCheckUtils]: 40: Hoare triple {2085#true} havoc #t~nondet8; {2085#true} is VALID [2020-07-18 05:07:17,556 INFO L280 TraceCheckUtils]: 41: Hoare triple {2085#true} assume !(0 == ~cond~0); {2085#true} is VALID [2020-07-18 05:07:17,556 INFO L280 TraceCheckUtils]: 42: Hoare triple {2085#true} ~lk1~0 := 0; {2085#true} is VALID [2020-07-18 05:07:17,556 INFO L280 TraceCheckUtils]: 43: Hoare triple {2085#true} ~lk2~0 := 0; {2085#true} is VALID [2020-07-18 05:07:17,556 INFO L280 TraceCheckUtils]: 44: Hoare triple {2085#true} ~lk3~0 := 0; {2085#true} is VALID [2020-07-18 05:07:17,557 INFO L280 TraceCheckUtils]: 45: Hoare triple {2085#true} ~lk4~0 := 0; {2085#true} is VALID [2020-07-18 05:07:17,557 INFO L280 TraceCheckUtils]: 46: Hoare triple {2085#true} ~lk5~0 := 0; {2085#true} is VALID [2020-07-18 05:07:17,557 INFO L280 TraceCheckUtils]: 47: Hoare triple {2085#true} ~lk6~0 := 0; {2085#true} is VALID [2020-07-18 05:07:17,557 INFO L280 TraceCheckUtils]: 48: Hoare triple {2085#true} ~lk7~0 := 0; {2085#true} is VALID [2020-07-18 05:07:17,557 INFO L280 TraceCheckUtils]: 49: Hoare triple {2085#true} ~lk8~0 := 0; {2085#true} is VALID [2020-07-18 05:07:17,558 INFO L280 TraceCheckUtils]: 50: Hoare triple {2085#true} assume !(0 != ~p1~0); {2085#true} is VALID [2020-07-18 05:07:17,558 INFO L280 TraceCheckUtils]: 51: Hoare triple {2085#true} assume !(0 != ~p2~0); {2089#(= 0 main_~p2~0)} is VALID [2020-07-18 05:07:17,559 INFO L280 TraceCheckUtils]: 52: Hoare triple {2089#(= 0 main_~p2~0)} assume !(0 != ~p3~0); {2089#(= 0 main_~p2~0)} is VALID [2020-07-18 05:07:17,560 INFO L280 TraceCheckUtils]: 53: Hoare triple {2089#(= 0 main_~p2~0)} assume !(0 != ~p4~0); {2089#(= 0 main_~p2~0)} is VALID [2020-07-18 05:07:17,560 INFO L280 TraceCheckUtils]: 54: Hoare triple {2089#(= 0 main_~p2~0)} assume !(0 != ~p5~0); {2089#(= 0 main_~p2~0)} is VALID [2020-07-18 05:07:17,561 INFO L280 TraceCheckUtils]: 55: Hoare triple {2089#(= 0 main_~p2~0)} assume !(0 != ~p6~0); {2089#(= 0 main_~p2~0)} is VALID [2020-07-18 05:07:17,561 INFO L280 TraceCheckUtils]: 56: Hoare triple {2089#(= 0 main_~p2~0)} assume !(0 != ~p7~0); {2089#(= 0 main_~p2~0)} is VALID [2020-07-18 05:07:17,562 INFO L280 TraceCheckUtils]: 57: Hoare triple {2089#(= 0 main_~p2~0)} assume !(0 != ~p8~0); {2089#(= 0 main_~p2~0)} is VALID [2020-07-18 05:07:17,563 INFO L280 TraceCheckUtils]: 58: Hoare triple {2089#(= 0 main_~p2~0)} assume !(0 != ~p1~0); {2089#(= 0 main_~p2~0)} is VALID [2020-07-18 05:07:17,564 INFO L280 TraceCheckUtils]: 59: Hoare triple {2089#(= 0 main_~p2~0)} assume 0 != ~p2~0; {2086#false} is VALID [2020-07-18 05:07:17,564 INFO L280 TraceCheckUtils]: 60: Hoare triple {2086#false} assume 1 != ~lk2~0; {2086#false} is VALID [2020-07-18 05:07:17,564 INFO L280 TraceCheckUtils]: 61: Hoare triple {2086#false} assume !false; {2086#false} is VALID [2020-07-18 05:07:17,567 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-18 05:07:17,568 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1277597313] [2020-07-18 05:07:17,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:07:17,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:07:17,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119612866] [2020-07-18 05:07:17,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-07-18 05:07:17,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:07:17,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:07:17,633 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-18 05:07:17,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:07:17,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:07:17,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:07:17,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:17,635 INFO L87 Difference]: Start difference. First operand 142 states and 185 transitions. Second operand 3 states. [2020-07-18 05:07:18,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:18,121 INFO L93 Difference]: Finished difference Result 346 states and 473 transitions. [2020-07-18 05:07:18,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:07:18,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-07-18 05:07:18,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:07:18,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:18,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 264 transitions. [2020-07-18 05:07:18,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:18,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 264 transitions. [2020-07-18 05:07:18,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 264 transitions. [2020-07-18 05:07:18,384 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-18 05:07:18,391 INFO L225 Difference]: With dead ends: 346 [2020-07-18 05:07:18,392 INFO L226 Difference]: Without dead ends: 241 [2020-07-18 05:07:18,395 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-18 05:07:18,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2020-07-18 05:07:18,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 239. [2020-07-18 05:07:18,677 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:07:18,677 INFO L82 GeneralOperation]: Start isEquivalent. First operand 241 states. Second operand 239 states. [2020-07-18 05:07:18,678 INFO L74 IsIncluded]: Start isIncluded. First operand 241 states. Second operand 239 states. [2020-07-18 05:07:18,678 INFO L87 Difference]: Start difference. First operand 241 states. Second operand 239 states. [2020-07-18 05:07:18,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:18,688 INFO L93 Difference]: Finished difference Result 241 states and 321 transitions. [2020-07-18 05:07:18,689 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 321 transitions. [2020-07-18 05:07:18,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:18,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:18,690 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand 241 states. [2020-07-18 05:07:18,690 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 241 states. [2020-07-18 05:07:18,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:18,700 INFO L93 Difference]: Finished difference Result 241 states and 321 transitions. [2020-07-18 05:07:18,700 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 321 transitions. [2020-07-18 05:07:18,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:18,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:18,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:07:18,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:07:18,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2020-07-18 05:07:18,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 320 transitions. [2020-07-18 05:07:18,710 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 320 transitions. Word has length 62 [2020-07-18 05:07:18,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:07:18,711 INFO L479 AbstractCegarLoop]: Abstraction has 239 states and 320 transitions. [2020-07-18 05:07:18,711 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:07:18,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 239 states and 320 transitions. [2020-07-18 05:07:19,051 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-18 05:07:19,052 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 320 transitions. [2020-07-18 05:07:19,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-07-18 05:07:19,053 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:07:19,053 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-18 05:07:19,054 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 05:07:19,054 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:07:19,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:07:19,054 INFO L82 PathProgramCache]: Analyzing trace with hash -298745719, now seen corresponding path program 1 times [2020-07-18 05:07:19,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:07:19,055 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1911102881] [2020-07-18 05:07:19,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:07:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:19,132 INFO L280 TraceCheckUtils]: 0: Hoare triple {3744#true} assume true; {3744#true} is VALID [2020-07-18 05:07:19,132 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3744#true} {3744#true} #223#return; {3744#true} is VALID [2020-07-18 05:07:19,133 INFO L263 TraceCheckUtils]: 0: Hoare triple {3744#true} call ULTIMATE.init(); {3744#true} is VALID [2020-07-18 05:07:19,133 INFO L280 TraceCheckUtils]: 1: Hoare triple {3744#true} assume true; {3744#true} is VALID [2020-07-18 05:07:19,133 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3744#true} {3744#true} #223#return; {3744#true} is VALID [2020-07-18 05:07:19,133 INFO L263 TraceCheckUtils]: 3: Hoare triple {3744#true} call #t~ret9 := main(); {3744#true} is VALID [2020-07-18 05:07:19,134 INFO L280 TraceCheckUtils]: 4: Hoare triple {3744#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3744#true} is VALID [2020-07-18 05:07:19,134 INFO L280 TraceCheckUtils]: 5: Hoare triple {3744#true} ~p1~0 := #t~nondet0; {3744#true} is VALID [2020-07-18 05:07:19,134 INFO L280 TraceCheckUtils]: 6: Hoare triple {3744#true} havoc #t~nondet0; {3744#true} is VALID [2020-07-18 05:07:19,134 INFO L280 TraceCheckUtils]: 7: Hoare triple {3744#true} havoc ~lk1~0; {3744#true} is VALID [2020-07-18 05:07:19,135 INFO L280 TraceCheckUtils]: 8: Hoare triple {3744#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3744#true} is VALID [2020-07-18 05:07:19,135 INFO L280 TraceCheckUtils]: 9: Hoare triple {3744#true} ~p2~0 := #t~nondet1; {3744#true} is VALID [2020-07-18 05:07:19,135 INFO L280 TraceCheckUtils]: 10: Hoare triple {3744#true} havoc #t~nondet1; {3744#true} is VALID [2020-07-18 05:07:19,135 INFO L280 TraceCheckUtils]: 11: Hoare triple {3744#true} havoc ~lk2~0; {3744#true} is VALID [2020-07-18 05:07:19,136 INFO L280 TraceCheckUtils]: 12: Hoare triple {3744#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3744#true} is VALID [2020-07-18 05:07:19,136 INFO L280 TraceCheckUtils]: 13: Hoare triple {3744#true} ~p3~0 := #t~nondet2; {3744#true} is VALID [2020-07-18 05:07:19,136 INFO L280 TraceCheckUtils]: 14: Hoare triple {3744#true} havoc #t~nondet2; {3744#true} is VALID [2020-07-18 05:07:19,136 INFO L280 TraceCheckUtils]: 15: Hoare triple {3744#true} havoc ~lk3~0; {3744#true} is VALID [2020-07-18 05:07:19,137 INFO L280 TraceCheckUtils]: 16: Hoare triple {3744#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3744#true} is VALID [2020-07-18 05:07:19,137 INFO L280 TraceCheckUtils]: 17: Hoare triple {3744#true} ~p4~0 := #t~nondet3; {3744#true} is VALID [2020-07-18 05:07:19,137 INFO L280 TraceCheckUtils]: 18: Hoare triple {3744#true} havoc #t~nondet3; {3744#true} is VALID [2020-07-18 05:07:19,137 INFO L280 TraceCheckUtils]: 19: Hoare triple {3744#true} havoc ~lk4~0; {3744#true} is VALID [2020-07-18 05:07:19,137 INFO L280 TraceCheckUtils]: 20: Hoare triple {3744#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {3744#true} is VALID [2020-07-18 05:07:19,138 INFO L280 TraceCheckUtils]: 21: Hoare triple {3744#true} ~p5~0 := #t~nondet4; {3744#true} is VALID [2020-07-18 05:07:19,138 INFO L280 TraceCheckUtils]: 22: Hoare triple {3744#true} havoc #t~nondet4; {3744#true} is VALID [2020-07-18 05:07:19,138 INFO L280 TraceCheckUtils]: 23: Hoare triple {3744#true} havoc ~lk5~0; {3744#true} is VALID [2020-07-18 05:07:19,138 INFO L280 TraceCheckUtils]: 24: Hoare triple {3744#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3744#true} is VALID [2020-07-18 05:07:19,139 INFO L280 TraceCheckUtils]: 25: Hoare triple {3744#true} ~p6~0 := #t~nondet5; {3744#true} is VALID [2020-07-18 05:07:19,139 INFO L280 TraceCheckUtils]: 26: Hoare triple {3744#true} havoc #t~nondet5; {3744#true} is VALID [2020-07-18 05:07:19,139 INFO L280 TraceCheckUtils]: 27: Hoare triple {3744#true} havoc ~lk6~0; {3744#true} is VALID [2020-07-18 05:07:19,139 INFO L280 TraceCheckUtils]: 28: Hoare triple {3744#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {3744#true} is VALID [2020-07-18 05:07:19,139 INFO L280 TraceCheckUtils]: 29: Hoare triple {3744#true} ~p7~0 := #t~nondet6; {3744#true} is VALID [2020-07-18 05:07:19,140 INFO L280 TraceCheckUtils]: 30: Hoare triple {3744#true} havoc #t~nondet6; {3744#true} is VALID [2020-07-18 05:07:19,140 INFO L280 TraceCheckUtils]: 31: Hoare triple {3744#true} havoc ~lk7~0; {3744#true} is VALID [2020-07-18 05:07:19,140 INFO L280 TraceCheckUtils]: 32: Hoare triple {3744#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {3744#true} is VALID [2020-07-18 05:07:19,140 INFO L280 TraceCheckUtils]: 33: Hoare triple {3744#true} ~p8~0 := #t~nondet7; {3744#true} is VALID [2020-07-18 05:07:19,141 INFO L280 TraceCheckUtils]: 34: Hoare triple {3744#true} havoc #t~nondet7; {3744#true} is VALID [2020-07-18 05:07:19,141 INFO L280 TraceCheckUtils]: 35: Hoare triple {3744#true} havoc ~lk8~0; {3744#true} is VALID [2020-07-18 05:07:19,141 INFO L280 TraceCheckUtils]: 36: Hoare triple {3744#true} havoc ~cond~0; {3744#true} is VALID [2020-07-18 05:07:19,141 INFO L280 TraceCheckUtils]: 37: Hoare triple {3744#true} assume !false; {3744#true} is VALID [2020-07-18 05:07:19,142 INFO L280 TraceCheckUtils]: 38: Hoare triple {3744#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {3744#true} is VALID [2020-07-18 05:07:19,142 INFO L280 TraceCheckUtils]: 39: Hoare triple {3744#true} ~cond~0 := #t~nondet8; {3744#true} is VALID [2020-07-18 05:07:19,142 INFO L280 TraceCheckUtils]: 40: Hoare triple {3744#true} havoc #t~nondet8; {3744#true} is VALID [2020-07-18 05:07:19,142 INFO L280 TraceCheckUtils]: 41: Hoare triple {3744#true} assume !(0 == ~cond~0); {3744#true} is VALID [2020-07-18 05:07:19,143 INFO L280 TraceCheckUtils]: 42: Hoare triple {3744#true} ~lk1~0 := 0; {3744#true} is VALID [2020-07-18 05:07:19,143 INFO L280 TraceCheckUtils]: 43: Hoare triple {3744#true} ~lk2~0 := 0; {3744#true} is VALID [2020-07-18 05:07:19,143 INFO L280 TraceCheckUtils]: 44: Hoare triple {3744#true} ~lk3~0 := 0; {3744#true} is VALID [2020-07-18 05:07:19,143 INFO L280 TraceCheckUtils]: 45: Hoare triple {3744#true} ~lk4~0 := 0; {3744#true} is VALID [2020-07-18 05:07:19,143 INFO L280 TraceCheckUtils]: 46: Hoare triple {3744#true} ~lk5~0 := 0; {3744#true} is VALID [2020-07-18 05:07:19,143 INFO L280 TraceCheckUtils]: 47: Hoare triple {3744#true} ~lk6~0 := 0; {3744#true} is VALID [2020-07-18 05:07:19,144 INFO L280 TraceCheckUtils]: 48: Hoare triple {3744#true} ~lk7~0 := 0; {3744#true} is VALID [2020-07-18 05:07:19,144 INFO L280 TraceCheckUtils]: 49: Hoare triple {3744#true} ~lk8~0 := 0; {3744#true} is VALID [2020-07-18 05:07:19,144 INFO L280 TraceCheckUtils]: 50: Hoare triple {3744#true} assume !(0 != ~p1~0); {3744#true} is VALID [2020-07-18 05:07:19,144 INFO L280 TraceCheckUtils]: 51: Hoare triple {3744#true} assume 0 != ~p2~0; {3744#true} is VALID [2020-07-18 05:07:19,145 INFO L280 TraceCheckUtils]: 52: Hoare triple {3744#true} ~lk2~0 := 1; {3748#(= 1 main_~lk2~0)} is VALID [2020-07-18 05:07:19,145 INFO L280 TraceCheckUtils]: 53: Hoare triple {3748#(= 1 main_~lk2~0)} assume !(0 != ~p3~0); {3748#(= 1 main_~lk2~0)} is VALID [2020-07-18 05:07:19,146 INFO L280 TraceCheckUtils]: 54: Hoare triple {3748#(= 1 main_~lk2~0)} assume !(0 != ~p4~0); {3748#(= 1 main_~lk2~0)} is VALID [2020-07-18 05:07:19,146 INFO L280 TraceCheckUtils]: 55: Hoare triple {3748#(= 1 main_~lk2~0)} assume !(0 != ~p5~0); {3748#(= 1 main_~lk2~0)} is VALID [2020-07-18 05:07:19,146 INFO L280 TraceCheckUtils]: 56: Hoare triple {3748#(= 1 main_~lk2~0)} assume !(0 != ~p6~0); {3748#(= 1 main_~lk2~0)} is VALID [2020-07-18 05:07:19,147 INFO L280 TraceCheckUtils]: 57: Hoare triple {3748#(= 1 main_~lk2~0)} assume !(0 != ~p7~0); {3748#(= 1 main_~lk2~0)} is VALID [2020-07-18 05:07:19,147 INFO L280 TraceCheckUtils]: 58: Hoare triple {3748#(= 1 main_~lk2~0)} assume !(0 != ~p8~0); {3748#(= 1 main_~lk2~0)} is VALID [2020-07-18 05:07:19,148 INFO L280 TraceCheckUtils]: 59: Hoare triple {3748#(= 1 main_~lk2~0)} assume !(0 != ~p1~0); {3748#(= 1 main_~lk2~0)} is VALID [2020-07-18 05:07:19,149 INFO L280 TraceCheckUtils]: 60: Hoare triple {3748#(= 1 main_~lk2~0)} assume 0 != ~p2~0; {3748#(= 1 main_~lk2~0)} is VALID [2020-07-18 05:07:19,151 INFO L280 TraceCheckUtils]: 61: Hoare triple {3748#(= 1 main_~lk2~0)} assume 1 != ~lk2~0; {3745#false} is VALID [2020-07-18 05:07:19,151 INFO L280 TraceCheckUtils]: 62: Hoare triple {3745#false} assume !false; {3745#false} is VALID [2020-07-18 05:07:19,154 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-18 05:07:19,155 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1911102881] [2020-07-18 05:07:19,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:07:19,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:07:19,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160736725] [2020-07-18 05:07:19,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-07-18 05:07:19,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:07:19,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:07:19,222 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-18 05:07:19,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:07:19,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:07:19,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:07:19,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:19,223 INFO L87 Difference]: Start difference. First operand 239 states and 320 transitions. Second operand 3 states. [2020-07-18 05:07:19,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:19,732 INFO L93 Difference]: Finished difference Result 293 states and 396 transitions. [2020-07-18 05:07:19,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:07:19,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-07-18 05:07:19,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:07:19,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:19,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2020-07-18 05:07:19,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:19,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2020-07-18 05:07:19,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 176 transitions. [2020-07-18 05:07:19,901 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-18 05:07:19,907 INFO L225 Difference]: With dead ends: 293 [2020-07-18 05:07:19,907 INFO L226 Difference]: Without dead ends: 291 [2020-07-18 05:07:19,909 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-18 05:07:19,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-07-18 05:07:20,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 239. [2020-07-18 05:07:20,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:07:20,178 INFO L82 GeneralOperation]: Start isEquivalent. First operand 291 states. Second operand 239 states. [2020-07-18 05:07:20,178 INFO L74 IsIncluded]: Start isIncluded. First operand 291 states. Second operand 239 states. [2020-07-18 05:07:20,179 INFO L87 Difference]: Start difference. First operand 291 states. Second operand 239 states. [2020-07-18 05:07:20,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:20,196 INFO L93 Difference]: Finished difference Result 291 states and 393 transitions. [2020-07-18 05:07:20,196 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 393 transitions. [2020-07-18 05:07:20,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:20,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:20,197 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand 291 states. [2020-07-18 05:07:20,197 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 291 states. [2020-07-18 05:07:20,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:20,213 INFO L93 Difference]: Finished difference Result 291 states and 393 transitions. [2020-07-18 05:07:20,213 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 393 transitions. [2020-07-18 05:07:20,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:20,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:20,215 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:07:20,215 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:07:20,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2020-07-18 05:07:20,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 318 transitions. [2020-07-18 05:07:20,224 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 318 transitions. Word has length 63 [2020-07-18 05:07:20,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:07:20,224 INFO L479 AbstractCegarLoop]: Abstraction has 239 states and 318 transitions. [2020-07-18 05:07:20,224 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:07:20,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 239 states and 318 transitions. [2020-07-18 05:07:20,588 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-18 05:07:20,588 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 318 transitions. [2020-07-18 05:07:20,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-07-18 05:07:20,589 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:07:20,590 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-18 05:07:20,590 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 05:07:20,590 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:07:20,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:07:20,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1397120136, now seen corresponding path program 1 times [2020-07-18 05:07:20,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:07:20,591 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1156025904] [2020-07-18 05:07:20,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:07:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:20,646 INFO L280 TraceCheckUtils]: 0: Hoare triple {5397#true} assume true; {5397#true} is VALID [2020-07-18 05:07:20,647 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5397#true} {5397#true} #223#return; {5397#true} is VALID [2020-07-18 05:07:20,647 INFO L263 TraceCheckUtils]: 0: Hoare triple {5397#true} call ULTIMATE.init(); {5397#true} is VALID [2020-07-18 05:07:20,647 INFO L280 TraceCheckUtils]: 1: Hoare triple {5397#true} assume true; {5397#true} is VALID [2020-07-18 05:07:20,647 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5397#true} {5397#true} #223#return; {5397#true} is VALID [2020-07-18 05:07:20,647 INFO L263 TraceCheckUtils]: 3: Hoare triple {5397#true} call #t~ret9 := main(); {5397#true} is VALID [2020-07-18 05:07:20,648 INFO L280 TraceCheckUtils]: 4: Hoare triple {5397#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {5397#true} is VALID [2020-07-18 05:07:20,648 INFO L280 TraceCheckUtils]: 5: Hoare triple {5397#true} ~p1~0 := #t~nondet0; {5397#true} is VALID [2020-07-18 05:07:20,648 INFO L280 TraceCheckUtils]: 6: Hoare triple {5397#true} havoc #t~nondet0; {5397#true} is VALID [2020-07-18 05:07:20,648 INFO L280 TraceCheckUtils]: 7: Hoare triple {5397#true} havoc ~lk1~0; {5397#true} is VALID [2020-07-18 05:07:20,648 INFO L280 TraceCheckUtils]: 8: Hoare triple {5397#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {5397#true} is VALID [2020-07-18 05:07:20,649 INFO L280 TraceCheckUtils]: 9: Hoare triple {5397#true} ~p2~0 := #t~nondet1; {5397#true} is VALID [2020-07-18 05:07:20,649 INFO L280 TraceCheckUtils]: 10: Hoare triple {5397#true} havoc #t~nondet1; {5397#true} is VALID [2020-07-18 05:07:20,649 INFO L280 TraceCheckUtils]: 11: Hoare triple {5397#true} havoc ~lk2~0; {5397#true} is VALID [2020-07-18 05:07:20,649 INFO L280 TraceCheckUtils]: 12: Hoare triple {5397#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {5397#true} is VALID [2020-07-18 05:07:20,650 INFO L280 TraceCheckUtils]: 13: Hoare triple {5397#true} ~p3~0 := #t~nondet2; {5397#true} is VALID [2020-07-18 05:07:20,650 INFO L280 TraceCheckUtils]: 14: Hoare triple {5397#true} havoc #t~nondet2; {5397#true} is VALID [2020-07-18 05:07:20,650 INFO L280 TraceCheckUtils]: 15: Hoare triple {5397#true} havoc ~lk3~0; {5397#true} is VALID [2020-07-18 05:07:20,650 INFO L280 TraceCheckUtils]: 16: Hoare triple {5397#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {5397#true} is VALID [2020-07-18 05:07:20,650 INFO L280 TraceCheckUtils]: 17: Hoare triple {5397#true} ~p4~0 := #t~nondet3; {5397#true} is VALID [2020-07-18 05:07:20,651 INFO L280 TraceCheckUtils]: 18: Hoare triple {5397#true} havoc #t~nondet3; {5397#true} is VALID [2020-07-18 05:07:20,651 INFO L280 TraceCheckUtils]: 19: Hoare triple {5397#true} havoc ~lk4~0; {5397#true} is VALID [2020-07-18 05:07:20,651 INFO L280 TraceCheckUtils]: 20: Hoare triple {5397#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {5397#true} is VALID [2020-07-18 05:07:20,651 INFO L280 TraceCheckUtils]: 21: Hoare triple {5397#true} ~p5~0 := #t~nondet4; {5397#true} is VALID [2020-07-18 05:07:20,652 INFO L280 TraceCheckUtils]: 22: Hoare triple {5397#true} havoc #t~nondet4; {5397#true} is VALID [2020-07-18 05:07:20,652 INFO L280 TraceCheckUtils]: 23: Hoare triple {5397#true} havoc ~lk5~0; {5397#true} is VALID [2020-07-18 05:07:20,652 INFO L280 TraceCheckUtils]: 24: Hoare triple {5397#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {5397#true} is VALID [2020-07-18 05:07:20,652 INFO L280 TraceCheckUtils]: 25: Hoare triple {5397#true} ~p6~0 := #t~nondet5; {5397#true} is VALID [2020-07-18 05:07:20,652 INFO L280 TraceCheckUtils]: 26: Hoare triple {5397#true} havoc #t~nondet5; {5397#true} is VALID [2020-07-18 05:07:20,653 INFO L280 TraceCheckUtils]: 27: Hoare triple {5397#true} havoc ~lk6~0; {5397#true} is VALID [2020-07-18 05:07:20,653 INFO L280 TraceCheckUtils]: 28: Hoare triple {5397#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {5397#true} is VALID [2020-07-18 05:07:20,653 INFO L280 TraceCheckUtils]: 29: Hoare triple {5397#true} ~p7~0 := #t~nondet6; {5397#true} is VALID [2020-07-18 05:07:20,653 INFO L280 TraceCheckUtils]: 30: Hoare triple {5397#true} havoc #t~nondet6; {5397#true} is VALID [2020-07-18 05:07:20,653 INFO L280 TraceCheckUtils]: 31: Hoare triple {5397#true} havoc ~lk7~0; {5397#true} is VALID [2020-07-18 05:07:20,654 INFO L280 TraceCheckUtils]: 32: Hoare triple {5397#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {5397#true} is VALID [2020-07-18 05:07:20,654 INFO L280 TraceCheckUtils]: 33: Hoare triple {5397#true} ~p8~0 := #t~nondet7; {5397#true} is VALID [2020-07-18 05:07:20,654 INFO L280 TraceCheckUtils]: 34: Hoare triple {5397#true} havoc #t~nondet7; {5397#true} is VALID [2020-07-18 05:07:20,654 INFO L280 TraceCheckUtils]: 35: Hoare triple {5397#true} havoc ~lk8~0; {5397#true} is VALID [2020-07-18 05:07:20,655 INFO L280 TraceCheckUtils]: 36: Hoare triple {5397#true} havoc ~cond~0; {5397#true} is VALID [2020-07-18 05:07:20,655 INFO L280 TraceCheckUtils]: 37: Hoare triple {5397#true} assume !false; {5397#true} is VALID [2020-07-18 05:07:20,655 INFO L280 TraceCheckUtils]: 38: Hoare triple {5397#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {5397#true} is VALID [2020-07-18 05:07:20,655 INFO L280 TraceCheckUtils]: 39: Hoare triple {5397#true} ~cond~0 := #t~nondet8; {5397#true} is VALID [2020-07-18 05:07:20,655 INFO L280 TraceCheckUtils]: 40: Hoare triple {5397#true} havoc #t~nondet8; {5397#true} is VALID [2020-07-18 05:07:20,656 INFO L280 TraceCheckUtils]: 41: Hoare triple {5397#true} assume !(0 == ~cond~0); {5397#true} is VALID [2020-07-18 05:07:20,656 INFO L280 TraceCheckUtils]: 42: Hoare triple {5397#true} ~lk1~0 := 0; {5397#true} is VALID [2020-07-18 05:07:20,656 INFO L280 TraceCheckUtils]: 43: Hoare triple {5397#true} ~lk2~0 := 0; {5397#true} is VALID [2020-07-18 05:07:20,656 INFO L280 TraceCheckUtils]: 44: Hoare triple {5397#true} ~lk3~0 := 0; {5397#true} is VALID [2020-07-18 05:07:20,656 INFO L280 TraceCheckUtils]: 45: Hoare triple {5397#true} ~lk4~0 := 0; {5397#true} is VALID [2020-07-18 05:07:20,657 INFO L280 TraceCheckUtils]: 46: Hoare triple {5397#true} ~lk5~0 := 0; {5397#true} is VALID [2020-07-18 05:07:20,657 INFO L280 TraceCheckUtils]: 47: Hoare triple {5397#true} ~lk6~0 := 0; {5397#true} is VALID [2020-07-18 05:07:20,657 INFO L280 TraceCheckUtils]: 48: Hoare triple {5397#true} ~lk7~0 := 0; {5397#true} is VALID [2020-07-18 05:07:20,657 INFO L280 TraceCheckUtils]: 49: Hoare triple {5397#true} ~lk8~0 := 0; {5397#true} is VALID [2020-07-18 05:07:20,658 INFO L280 TraceCheckUtils]: 50: Hoare triple {5397#true} assume !(0 != ~p1~0); {5397#true} is VALID [2020-07-18 05:07:20,658 INFO L280 TraceCheckUtils]: 51: Hoare triple {5397#true} assume !(0 != ~p2~0); {5397#true} is VALID [2020-07-18 05:07:20,659 INFO L280 TraceCheckUtils]: 52: Hoare triple {5397#true} assume !(0 != ~p3~0); {5401#(= 0 main_~p3~0)} is VALID [2020-07-18 05:07:20,659 INFO L280 TraceCheckUtils]: 53: Hoare triple {5401#(= 0 main_~p3~0)} assume !(0 != ~p4~0); {5401#(= 0 main_~p3~0)} is VALID [2020-07-18 05:07:20,660 INFO L280 TraceCheckUtils]: 54: Hoare triple {5401#(= 0 main_~p3~0)} assume !(0 != ~p5~0); {5401#(= 0 main_~p3~0)} is VALID [2020-07-18 05:07:20,660 INFO L280 TraceCheckUtils]: 55: Hoare triple {5401#(= 0 main_~p3~0)} assume !(0 != ~p6~0); {5401#(= 0 main_~p3~0)} is VALID [2020-07-18 05:07:20,661 INFO L280 TraceCheckUtils]: 56: Hoare triple {5401#(= 0 main_~p3~0)} assume !(0 != ~p7~0); {5401#(= 0 main_~p3~0)} is VALID [2020-07-18 05:07:20,661 INFO L280 TraceCheckUtils]: 57: Hoare triple {5401#(= 0 main_~p3~0)} assume !(0 != ~p8~0); {5401#(= 0 main_~p3~0)} is VALID [2020-07-18 05:07:20,662 INFO L280 TraceCheckUtils]: 58: Hoare triple {5401#(= 0 main_~p3~0)} assume !(0 != ~p1~0); {5401#(= 0 main_~p3~0)} is VALID [2020-07-18 05:07:20,662 INFO L280 TraceCheckUtils]: 59: Hoare triple {5401#(= 0 main_~p3~0)} assume !(0 != ~p2~0); {5401#(= 0 main_~p3~0)} is VALID [2020-07-18 05:07:20,663 INFO L280 TraceCheckUtils]: 60: Hoare triple {5401#(= 0 main_~p3~0)} assume 0 != ~p3~0; {5398#false} is VALID [2020-07-18 05:07:20,663 INFO L280 TraceCheckUtils]: 61: Hoare triple {5398#false} assume 1 != ~lk3~0; {5398#false} is VALID [2020-07-18 05:07:20,663 INFO L280 TraceCheckUtils]: 62: Hoare triple {5398#false} assume !false; {5398#false} is VALID [2020-07-18 05:07:20,666 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-18 05:07:20,666 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1156025904] [2020-07-18 05:07:20,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:07:20,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:07:20,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407259148] [2020-07-18 05:07:20,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-07-18 05:07:20,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:07:20,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:07:20,722 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-18 05:07:20,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:07:20,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:07:20,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:07:20,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:20,723 INFO L87 Difference]: Start difference. First operand 239 states and 318 transitions. Second operand 3 states. [2020-07-18 05:07:21,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:21,587 INFO L93 Difference]: Finished difference Result 631 states and 864 transitions. [2020-07-18 05:07:21,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:07:21,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-07-18 05:07:21,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:07:21,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:21,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions. [2020-07-18 05:07:21,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:21,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions. [2020-07-18 05:07:21,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 261 transitions. [2020-07-18 05:07:21,820 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-18 05:07:21,833 INFO L225 Difference]: With dead ends: 631 [2020-07-18 05:07:21,833 INFO L226 Difference]: Without dead ends: 429 [2020-07-18 05:07:21,835 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-18 05:07:21,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2020-07-18 05:07:22,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 427. [2020-07-18 05:07:22,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:07:22,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 429 states. Second operand 427 states. [2020-07-18 05:07:22,414 INFO L74 IsIncluded]: Start isIncluded. First operand 429 states. Second operand 427 states. [2020-07-18 05:07:22,414 INFO L87 Difference]: Start difference. First operand 429 states. Second operand 427 states. [2020-07-18 05:07:22,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:22,434 INFO L93 Difference]: Finished difference Result 429 states and 575 transitions. [2020-07-18 05:07:22,434 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 575 transitions. [2020-07-18 05:07:22,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:22,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:22,436 INFO L74 IsIncluded]: Start isIncluded. First operand 427 states. Second operand 429 states. [2020-07-18 05:07:22,436 INFO L87 Difference]: Start difference. First operand 427 states. Second operand 429 states. [2020-07-18 05:07:22,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:22,484 INFO L93 Difference]: Finished difference Result 429 states and 575 transitions. [2020-07-18 05:07:22,485 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 575 transitions. [2020-07-18 05:07:22,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:22,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:22,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:07:22,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:07:22,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2020-07-18 05:07:22,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 574 transitions. [2020-07-18 05:07:22,505 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 574 transitions. Word has length 63 [2020-07-18 05:07:22,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:07:22,505 INFO L479 AbstractCegarLoop]: Abstraction has 427 states and 574 transitions. [2020-07-18 05:07:22,505 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:07:22,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 427 states and 574 transitions. [2020-07-18 05:07:23,086 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-18 05:07:23,086 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 574 transitions. [2020-07-18 05:07:23,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-07-18 05:07:23,087 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:07:23,088 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-18 05:07:23,088 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 05:07:23,088 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:07:23,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:07:23,089 INFO L82 PathProgramCache]: Analyzing trace with hash 361296622, now seen corresponding path program 1 times [2020-07-18 05:07:23,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:07:23,089 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1464326390] [2020-07-18 05:07:23,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:07:23,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:23,187 INFO L280 TraceCheckUtils]: 0: Hoare triple {8378#true} assume true; {8378#true} is VALID [2020-07-18 05:07:23,187 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {8378#true} {8378#true} #223#return; {8378#true} is VALID [2020-07-18 05:07:23,188 INFO L263 TraceCheckUtils]: 0: Hoare triple {8378#true} call ULTIMATE.init(); {8378#true} is VALID [2020-07-18 05:07:23,188 INFO L280 TraceCheckUtils]: 1: Hoare triple {8378#true} assume true; {8378#true} is VALID [2020-07-18 05:07:23,188 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8378#true} {8378#true} #223#return; {8378#true} is VALID [2020-07-18 05:07:23,188 INFO L263 TraceCheckUtils]: 3: Hoare triple {8378#true} call #t~ret9 := main(); {8378#true} is VALID [2020-07-18 05:07:23,188 INFO L280 TraceCheckUtils]: 4: Hoare triple {8378#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {8378#true} is VALID [2020-07-18 05:07:23,189 INFO L280 TraceCheckUtils]: 5: Hoare triple {8378#true} ~p1~0 := #t~nondet0; {8378#true} is VALID [2020-07-18 05:07:23,189 INFO L280 TraceCheckUtils]: 6: Hoare triple {8378#true} havoc #t~nondet0; {8378#true} is VALID [2020-07-18 05:07:23,189 INFO L280 TraceCheckUtils]: 7: Hoare triple {8378#true} havoc ~lk1~0; {8378#true} is VALID [2020-07-18 05:07:23,189 INFO L280 TraceCheckUtils]: 8: Hoare triple {8378#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {8378#true} is VALID [2020-07-18 05:07:23,189 INFO L280 TraceCheckUtils]: 9: Hoare triple {8378#true} ~p2~0 := #t~nondet1; {8378#true} is VALID [2020-07-18 05:07:23,190 INFO L280 TraceCheckUtils]: 10: Hoare triple {8378#true} havoc #t~nondet1; {8378#true} is VALID [2020-07-18 05:07:23,190 INFO L280 TraceCheckUtils]: 11: Hoare triple {8378#true} havoc ~lk2~0; {8378#true} is VALID [2020-07-18 05:07:23,190 INFO L280 TraceCheckUtils]: 12: Hoare triple {8378#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {8378#true} is VALID [2020-07-18 05:07:23,190 INFO L280 TraceCheckUtils]: 13: Hoare triple {8378#true} ~p3~0 := #t~nondet2; {8378#true} is VALID [2020-07-18 05:07:23,191 INFO L280 TraceCheckUtils]: 14: Hoare triple {8378#true} havoc #t~nondet2; {8378#true} is VALID [2020-07-18 05:07:23,191 INFO L280 TraceCheckUtils]: 15: Hoare triple {8378#true} havoc ~lk3~0; {8378#true} is VALID [2020-07-18 05:07:23,191 INFO L280 TraceCheckUtils]: 16: Hoare triple {8378#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {8378#true} is VALID [2020-07-18 05:07:23,191 INFO L280 TraceCheckUtils]: 17: Hoare triple {8378#true} ~p4~0 := #t~nondet3; {8378#true} is VALID [2020-07-18 05:07:23,191 INFO L280 TraceCheckUtils]: 18: Hoare triple {8378#true} havoc #t~nondet3; {8378#true} is VALID [2020-07-18 05:07:23,192 INFO L280 TraceCheckUtils]: 19: Hoare triple {8378#true} havoc ~lk4~0; {8378#true} is VALID [2020-07-18 05:07:23,192 INFO L280 TraceCheckUtils]: 20: Hoare triple {8378#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {8378#true} is VALID [2020-07-18 05:07:23,192 INFO L280 TraceCheckUtils]: 21: Hoare triple {8378#true} ~p5~0 := #t~nondet4; {8378#true} is VALID [2020-07-18 05:07:23,192 INFO L280 TraceCheckUtils]: 22: Hoare triple {8378#true} havoc #t~nondet4; {8378#true} is VALID [2020-07-18 05:07:23,193 INFO L280 TraceCheckUtils]: 23: Hoare triple {8378#true} havoc ~lk5~0; {8378#true} is VALID [2020-07-18 05:07:23,193 INFO L280 TraceCheckUtils]: 24: Hoare triple {8378#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {8378#true} is VALID [2020-07-18 05:07:23,193 INFO L280 TraceCheckUtils]: 25: Hoare triple {8378#true} ~p6~0 := #t~nondet5; {8378#true} is VALID [2020-07-18 05:07:23,193 INFO L280 TraceCheckUtils]: 26: Hoare triple {8378#true} havoc #t~nondet5; {8378#true} is VALID [2020-07-18 05:07:23,193 INFO L280 TraceCheckUtils]: 27: Hoare triple {8378#true} havoc ~lk6~0; {8378#true} is VALID [2020-07-18 05:07:23,194 INFO L280 TraceCheckUtils]: 28: Hoare triple {8378#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {8378#true} is VALID [2020-07-18 05:07:23,194 INFO L280 TraceCheckUtils]: 29: Hoare triple {8378#true} ~p7~0 := #t~nondet6; {8378#true} is VALID [2020-07-18 05:07:23,194 INFO L280 TraceCheckUtils]: 30: Hoare triple {8378#true} havoc #t~nondet6; {8378#true} is VALID [2020-07-18 05:07:23,194 INFO L280 TraceCheckUtils]: 31: Hoare triple {8378#true} havoc ~lk7~0; {8378#true} is VALID [2020-07-18 05:07:23,194 INFO L280 TraceCheckUtils]: 32: Hoare triple {8378#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {8378#true} is VALID [2020-07-18 05:07:23,195 INFO L280 TraceCheckUtils]: 33: Hoare triple {8378#true} ~p8~0 := #t~nondet7; {8378#true} is VALID [2020-07-18 05:07:23,195 INFO L280 TraceCheckUtils]: 34: Hoare triple {8378#true} havoc #t~nondet7; {8378#true} is VALID [2020-07-18 05:07:23,195 INFO L280 TraceCheckUtils]: 35: Hoare triple {8378#true} havoc ~lk8~0; {8378#true} is VALID [2020-07-18 05:07:23,195 INFO L280 TraceCheckUtils]: 36: Hoare triple {8378#true} havoc ~cond~0; {8378#true} is VALID [2020-07-18 05:07:23,195 INFO L280 TraceCheckUtils]: 37: Hoare triple {8378#true} assume !false; {8378#true} is VALID [2020-07-18 05:07:23,196 INFO L280 TraceCheckUtils]: 38: Hoare triple {8378#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {8378#true} is VALID [2020-07-18 05:07:23,196 INFO L280 TraceCheckUtils]: 39: Hoare triple {8378#true} ~cond~0 := #t~nondet8; {8378#true} is VALID [2020-07-18 05:07:23,196 INFO L280 TraceCheckUtils]: 40: Hoare triple {8378#true} havoc #t~nondet8; {8378#true} is VALID [2020-07-18 05:07:23,196 INFO L280 TraceCheckUtils]: 41: Hoare triple {8378#true} assume !(0 == ~cond~0); {8378#true} is VALID [2020-07-18 05:07:23,196 INFO L280 TraceCheckUtils]: 42: Hoare triple {8378#true} ~lk1~0 := 0; {8378#true} is VALID [2020-07-18 05:07:23,197 INFO L280 TraceCheckUtils]: 43: Hoare triple {8378#true} ~lk2~0 := 0; {8378#true} is VALID [2020-07-18 05:07:23,197 INFO L280 TraceCheckUtils]: 44: Hoare triple {8378#true} ~lk3~0 := 0; {8378#true} is VALID [2020-07-18 05:07:23,197 INFO L280 TraceCheckUtils]: 45: Hoare triple {8378#true} ~lk4~0 := 0; {8378#true} is VALID [2020-07-18 05:07:23,197 INFO L280 TraceCheckUtils]: 46: Hoare triple {8378#true} ~lk5~0 := 0; {8378#true} is VALID [2020-07-18 05:07:23,197 INFO L280 TraceCheckUtils]: 47: Hoare triple {8378#true} ~lk6~0 := 0; {8378#true} is VALID [2020-07-18 05:07:23,198 INFO L280 TraceCheckUtils]: 48: Hoare triple {8378#true} ~lk7~0 := 0; {8378#true} is VALID [2020-07-18 05:07:23,198 INFO L280 TraceCheckUtils]: 49: Hoare triple {8378#true} ~lk8~0 := 0; {8378#true} is VALID [2020-07-18 05:07:23,198 INFO L280 TraceCheckUtils]: 50: Hoare triple {8378#true} assume !(0 != ~p1~0); {8378#true} is VALID [2020-07-18 05:07:23,198 INFO L280 TraceCheckUtils]: 51: Hoare triple {8378#true} assume !(0 != ~p2~0); {8378#true} is VALID [2020-07-18 05:07:23,198 INFO L280 TraceCheckUtils]: 52: Hoare triple {8378#true} assume !(0 != ~p3~0); {8378#true} is VALID [2020-07-18 05:07:23,201 INFO L280 TraceCheckUtils]: 53: Hoare triple {8378#true} assume !(0 != ~p4~0); {8382#(= 0 main_~p4~0)} is VALID [2020-07-18 05:07:23,201 INFO L280 TraceCheckUtils]: 54: Hoare triple {8382#(= 0 main_~p4~0)} assume !(0 != ~p5~0); {8382#(= 0 main_~p4~0)} is VALID [2020-07-18 05:07:23,202 INFO L280 TraceCheckUtils]: 55: Hoare triple {8382#(= 0 main_~p4~0)} assume !(0 != ~p6~0); {8382#(= 0 main_~p4~0)} is VALID [2020-07-18 05:07:23,202 INFO L280 TraceCheckUtils]: 56: Hoare triple {8382#(= 0 main_~p4~0)} assume !(0 != ~p7~0); {8382#(= 0 main_~p4~0)} is VALID [2020-07-18 05:07:23,203 INFO L280 TraceCheckUtils]: 57: Hoare triple {8382#(= 0 main_~p4~0)} assume !(0 != ~p8~0); {8382#(= 0 main_~p4~0)} is VALID [2020-07-18 05:07:23,203 INFO L280 TraceCheckUtils]: 58: Hoare triple {8382#(= 0 main_~p4~0)} assume !(0 != ~p1~0); {8382#(= 0 main_~p4~0)} is VALID [2020-07-18 05:07:23,205 INFO L280 TraceCheckUtils]: 59: Hoare triple {8382#(= 0 main_~p4~0)} assume !(0 != ~p2~0); {8382#(= 0 main_~p4~0)} is VALID [2020-07-18 05:07:23,208 INFO L280 TraceCheckUtils]: 60: Hoare triple {8382#(= 0 main_~p4~0)} assume !(0 != ~p3~0); {8382#(= 0 main_~p4~0)} is VALID [2020-07-18 05:07:23,208 INFO L280 TraceCheckUtils]: 61: Hoare triple {8382#(= 0 main_~p4~0)} assume 0 != ~p4~0; {8379#false} is VALID [2020-07-18 05:07:23,209 INFO L280 TraceCheckUtils]: 62: Hoare triple {8379#false} assume 1 != ~lk4~0; {8379#false} is VALID [2020-07-18 05:07:23,209 INFO L280 TraceCheckUtils]: 63: Hoare triple {8379#false} assume !false; {8379#false} is VALID [2020-07-18 05:07:23,211 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-18 05:07:23,211 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1464326390] [2020-07-18 05:07:23,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:07:23,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:07:23,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007657572] [2020-07-18 05:07:23,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-07-18 05:07:23,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:07:23,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:07:23,272 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-18 05:07:23,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:07:23,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:07:23,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:07:23,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:23,273 INFO L87 Difference]: Start difference. First operand 427 states and 574 transitions. Second operand 3 states. [2020-07-18 05:07:24,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:24,915 INFO L93 Difference]: Finished difference Result 1183 states and 1616 transitions. [2020-07-18 05:07:24,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:07:24,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-07-18 05:07:24,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:07:24,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:24,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions. [2020-07-18 05:07:24,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:24,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions. [2020-07-18 05:07:24,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 261 transitions. [2020-07-18 05:07:25,145 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-18 05:07:25,188 INFO L225 Difference]: With dead ends: 1183 [2020-07-18 05:07:25,188 INFO L226 Difference]: Without dead ends: 793 [2020-07-18 05:07:25,193 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-18 05:07:25,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2020-07-18 05:07:26,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 791. [2020-07-18 05:07:26,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:07:26,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 793 states. Second operand 791 states. [2020-07-18 05:07:26,443 INFO L74 IsIncluded]: Start isIncluded. First operand 793 states. Second operand 791 states. [2020-07-18 05:07:26,443 INFO L87 Difference]: Start difference. First operand 793 states. Second operand 791 states. [2020-07-18 05:07:26,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:26,484 INFO L93 Difference]: Finished difference Result 793 states and 1063 transitions. [2020-07-18 05:07:26,484 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1063 transitions. [2020-07-18 05:07:26,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:26,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:26,490 INFO L74 IsIncluded]: Start isIncluded. First operand 791 states. Second operand 793 states. [2020-07-18 05:07:26,490 INFO L87 Difference]: Start difference. First operand 791 states. Second operand 793 states. [2020-07-18 05:07:26,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:26,532 INFO L93 Difference]: Finished difference Result 793 states and 1063 transitions. [2020-07-18 05:07:26,532 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1063 transitions. [2020-07-18 05:07:26,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:26,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:26,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:07:26,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:07:26,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-07-18 05:07:26,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1062 transitions. [2020-07-18 05:07:26,575 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1062 transitions. Word has length 64 [2020-07-18 05:07:26,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:07:26,576 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 1062 transitions. [2020-07-18 05:07:26,576 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:07:26,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 791 states and 1062 transitions. [2020-07-18 05:07:27,744 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-18 05:07:27,744 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1062 transitions. [2020-07-18 05:07:27,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-07-18 05:07:27,746 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:07:27,746 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-18 05:07:27,746 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 05:07:27,747 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:07:27,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:07:27,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1477714988, now seen corresponding path program 1 times [2020-07-18 05:07:27,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:07:27,748 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [812420486] [2020-07-18 05:07:27,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:07:27,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:27,810 INFO L280 TraceCheckUtils]: 0: Hoare triple {13919#true} assume true; {13919#true} is VALID [2020-07-18 05:07:27,810 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {13919#true} {13919#true} #223#return; {13919#true} is VALID [2020-07-18 05:07:27,811 INFO L263 TraceCheckUtils]: 0: Hoare triple {13919#true} call ULTIMATE.init(); {13919#true} is VALID [2020-07-18 05:07:27,811 INFO L280 TraceCheckUtils]: 1: Hoare triple {13919#true} assume true; {13919#true} is VALID [2020-07-18 05:07:27,811 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {13919#true} {13919#true} #223#return; {13919#true} is VALID [2020-07-18 05:07:27,812 INFO L263 TraceCheckUtils]: 3: Hoare triple {13919#true} call #t~ret9 := main(); {13919#true} is VALID [2020-07-18 05:07:27,812 INFO L280 TraceCheckUtils]: 4: Hoare triple {13919#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {13919#true} is VALID [2020-07-18 05:07:27,812 INFO L280 TraceCheckUtils]: 5: Hoare triple {13919#true} ~p1~0 := #t~nondet0; {13919#true} is VALID [2020-07-18 05:07:27,812 INFO L280 TraceCheckUtils]: 6: Hoare triple {13919#true} havoc #t~nondet0; {13919#true} is VALID [2020-07-18 05:07:27,813 INFO L280 TraceCheckUtils]: 7: Hoare triple {13919#true} havoc ~lk1~0; {13919#true} is VALID [2020-07-18 05:07:27,813 INFO L280 TraceCheckUtils]: 8: Hoare triple {13919#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {13919#true} is VALID [2020-07-18 05:07:27,813 INFO L280 TraceCheckUtils]: 9: Hoare triple {13919#true} ~p2~0 := #t~nondet1; {13919#true} is VALID [2020-07-18 05:07:27,814 INFO L280 TraceCheckUtils]: 10: Hoare triple {13919#true} havoc #t~nondet1; {13919#true} is VALID [2020-07-18 05:07:27,814 INFO L280 TraceCheckUtils]: 11: Hoare triple {13919#true} havoc ~lk2~0; {13919#true} is VALID [2020-07-18 05:07:27,814 INFO L280 TraceCheckUtils]: 12: Hoare triple {13919#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {13919#true} is VALID [2020-07-18 05:07:27,814 INFO L280 TraceCheckUtils]: 13: Hoare triple {13919#true} ~p3~0 := #t~nondet2; {13919#true} is VALID [2020-07-18 05:07:27,814 INFO L280 TraceCheckUtils]: 14: Hoare triple {13919#true} havoc #t~nondet2; {13919#true} is VALID [2020-07-18 05:07:27,815 INFO L280 TraceCheckUtils]: 15: Hoare triple {13919#true} havoc ~lk3~0; {13919#true} is VALID [2020-07-18 05:07:27,815 INFO L280 TraceCheckUtils]: 16: Hoare triple {13919#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {13919#true} is VALID [2020-07-18 05:07:27,815 INFO L280 TraceCheckUtils]: 17: Hoare triple {13919#true} ~p4~0 := #t~nondet3; {13919#true} is VALID [2020-07-18 05:07:27,815 INFO L280 TraceCheckUtils]: 18: Hoare triple {13919#true} havoc #t~nondet3; {13919#true} is VALID [2020-07-18 05:07:27,815 INFO L280 TraceCheckUtils]: 19: Hoare triple {13919#true} havoc ~lk4~0; {13919#true} is VALID [2020-07-18 05:07:27,816 INFO L280 TraceCheckUtils]: 20: Hoare triple {13919#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {13919#true} is VALID [2020-07-18 05:07:27,816 INFO L280 TraceCheckUtils]: 21: Hoare triple {13919#true} ~p5~0 := #t~nondet4; {13919#true} is VALID [2020-07-18 05:07:27,816 INFO L280 TraceCheckUtils]: 22: Hoare triple {13919#true} havoc #t~nondet4; {13919#true} is VALID [2020-07-18 05:07:27,816 INFO L280 TraceCheckUtils]: 23: Hoare triple {13919#true} havoc ~lk5~0; {13919#true} is VALID [2020-07-18 05:07:27,817 INFO L280 TraceCheckUtils]: 24: Hoare triple {13919#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {13919#true} is VALID [2020-07-18 05:07:27,817 INFO L280 TraceCheckUtils]: 25: Hoare triple {13919#true} ~p6~0 := #t~nondet5; {13919#true} is VALID [2020-07-18 05:07:27,817 INFO L280 TraceCheckUtils]: 26: Hoare triple {13919#true} havoc #t~nondet5; {13919#true} is VALID [2020-07-18 05:07:27,817 INFO L280 TraceCheckUtils]: 27: Hoare triple {13919#true} havoc ~lk6~0; {13919#true} is VALID [2020-07-18 05:07:27,818 INFO L280 TraceCheckUtils]: 28: Hoare triple {13919#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {13919#true} is VALID [2020-07-18 05:07:27,818 INFO L280 TraceCheckUtils]: 29: Hoare triple {13919#true} ~p7~0 := #t~nondet6; {13919#true} is VALID [2020-07-18 05:07:27,818 INFO L280 TraceCheckUtils]: 30: Hoare triple {13919#true} havoc #t~nondet6; {13919#true} is VALID [2020-07-18 05:07:27,818 INFO L280 TraceCheckUtils]: 31: Hoare triple {13919#true} havoc ~lk7~0; {13919#true} is VALID [2020-07-18 05:07:27,819 INFO L280 TraceCheckUtils]: 32: Hoare triple {13919#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {13919#true} is VALID [2020-07-18 05:07:27,819 INFO L280 TraceCheckUtils]: 33: Hoare triple {13919#true} ~p8~0 := #t~nondet7; {13919#true} is VALID [2020-07-18 05:07:27,819 INFO L280 TraceCheckUtils]: 34: Hoare triple {13919#true} havoc #t~nondet7; {13919#true} is VALID [2020-07-18 05:07:27,819 INFO L280 TraceCheckUtils]: 35: Hoare triple {13919#true} havoc ~lk8~0; {13919#true} is VALID [2020-07-18 05:07:27,820 INFO L280 TraceCheckUtils]: 36: Hoare triple {13919#true} havoc ~cond~0; {13919#true} is VALID [2020-07-18 05:07:27,820 INFO L280 TraceCheckUtils]: 37: Hoare triple {13919#true} assume !false; {13919#true} is VALID [2020-07-18 05:07:27,820 INFO L280 TraceCheckUtils]: 38: Hoare triple {13919#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {13919#true} is VALID [2020-07-18 05:07:27,820 INFO L280 TraceCheckUtils]: 39: Hoare triple {13919#true} ~cond~0 := #t~nondet8; {13919#true} is VALID [2020-07-18 05:07:27,821 INFO L280 TraceCheckUtils]: 40: Hoare triple {13919#true} havoc #t~nondet8; {13919#true} is VALID [2020-07-18 05:07:27,821 INFO L280 TraceCheckUtils]: 41: Hoare triple {13919#true} assume !(0 == ~cond~0); {13919#true} is VALID [2020-07-18 05:07:27,821 INFO L280 TraceCheckUtils]: 42: Hoare triple {13919#true} ~lk1~0 := 0; {13919#true} is VALID [2020-07-18 05:07:27,823 INFO L280 TraceCheckUtils]: 43: Hoare triple {13919#true} ~lk2~0 := 0; {13919#true} is VALID [2020-07-18 05:07:27,823 INFO L280 TraceCheckUtils]: 44: Hoare triple {13919#true} ~lk3~0 := 0; {13919#true} is VALID [2020-07-18 05:07:27,823 INFO L280 TraceCheckUtils]: 45: Hoare triple {13919#true} ~lk4~0 := 0; {13919#true} is VALID [2020-07-18 05:07:27,823 INFO L280 TraceCheckUtils]: 46: Hoare triple {13919#true} ~lk5~0 := 0; {13919#true} is VALID [2020-07-18 05:07:27,824 INFO L280 TraceCheckUtils]: 47: Hoare triple {13919#true} ~lk6~0 := 0; {13919#true} is VALID [2020-07-18 05:07:27,824 INFO L280 TraceCheckUtils]: 48: Hoare triple {13919#true} ~lk7~0 := 0; {13919#true} is VALID [2020-07-18 05:07:27,824 INFO L280 TraceCheckUtils]: 49: Hoare triple {13919#true} ~lk8~0 := 0; {13919#true} is VALID [2020-07-18 05:07:27,824 INFO L280 TraceCheckUtils]: 50: Hoare triple {13919#true} assume !(0 != ~p1~0); {13919#true} is VALID [2020-07-18 05:07:27,824 INFO L280 TraceCheckUtils]: 51: Hoare triple {13919#true} assume !(0 != ~p2~0); {13919#true} is VALID [2020-07-18 05:07:27,825 INFO L280 TraceCheckUtils]: 52: Hoare triple {13919#true} assume 0 != ~p3~0; {13919#true} is VALID [2020-07-18 05:07:27,832 INFO L280 TraceCheckUtils]: 53: Hoare triple {13919#true} ~lk3~0 := 1; {13923#(= 1 main_~lk3~0)} is VALID [2020-07-18 05:07:27,833 INFO L280 TraceCheckUtils]: 54: Hoare triple {13923#(= 1 main_~lk3~0)} assume !(0 != ~p4~0); {13923#(= 1 main_~lk3~0)} is VALID [2020-07-18 05:07:27,834 INFO L280 TraceCheckUtils]: 55: Hoare triple {13923#(= 1 main_~lk3~0)} assume !(0 != ~p5~0); {13923#(= 1 main_~lk3~0)} is VALID [2020-07-18 05:07:27,834 INFO L280 TraceCheckUtils]: 56: Hoare triple {13923#(= 1 main_~lk3~0)} assume !(0 != ~p6~0); {13923#(= 1 main_~lk3~0)} is VALID [2020-07-18 05:07:27,835 INFO L280 TraceCheckUtils]: 57: Hoare triple {13923#(= 1 main_~lk3~0)} assume !(0 != ~p7~0); {13923#(= 1 main_~lk3~0)} is VALID [2020-07-18 05:07:27,836 INFO L280 TraceCheckUtils]: 58: Hoare triple {13923#(= 1 main_~lk3~0)} assume !(0 != ~p8~0); {13923#(= 1 main_~lk3~0)} is VALID [2020-07-18 05:07:27,836 INFO L280 TraceCheckUtils]: 59: Hoare triple {13923#(= 1 main_~lk3~0)} assume !(0 != ~p1~0); {13923#(= 1 main_~lk3~0)} is VALID [2020-07-18 05:07:27,837 INFO L280 TraceCheckUtils]: 60: Hoare triple {13923#(= 1 main_~lk3~0)} assume !(0 != ~p2~0); {13923#(= 1 main_~lk3~0)} is VALID [2020-07-18 05:07:27,837 INFO L280 TraceCheckUtils]: 61: Hoare triple {13923#(= 1 main_~lk3~0)} assume 0 != ~p3~0; {13923#(= 1 main_~lk3~0)} is VALID [2020-07-18 05:07:27,838 INFO L280 TraceCheckUtils]: 62: Hoare triple {13923#(= 1 main_~lk3~0)} assume 1 != ~lk3~0; {13920#false} is VALID [2020-07-18 05:07:27,838 INFO L280 TraceCheckUtils]: 63: Hoare triple {13920#false} assume !false; {13920#false} is VALID [2020-07-18 05:07:27,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 05:07:27,842 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [812420486] [2020-07-18 05:07:27,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:07:27,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:07:27,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969397906] [2020-07-18 05:07:27,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-07-18 05:07:27,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:07:27,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:07:27,896 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-18 05:07:27,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:07:27,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:07:27,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:07:27,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:27,897 INFO L87 Difference]: Start difference. First operand 791 states and 1062 transitions. Second operand 3 states. [2020-07-18 05:07:29,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:29,796 INFO L93 Difference]: Finished difference Result 971 states and 1312 transitions. [2020-07-18 05:07:29,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:07:29,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-07-18 05:07:29,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:07:29,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:29,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2020-07-18 05:07:29,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:29,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2020-07-18 05:07:29,802 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 172 transitions. [2020-07-18 05:07:30,005 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-18 05:07:30,068 INFO L225 Difference]: With dead ends: 971 [2020-07-18 05:07:30,068 INFO L226 Difference]: Without dead ends: 969 [2020-07-18 05:07:30,069 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-18 05:07:30,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2020-07-18 05:07:31,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 791. [2020-07-18 05:07:31,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:07:31,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 969 states. Second operand 791 states. [2020-07-18 05:07:31,436 INFO L74 IsIncluded]: Start isIncluded. First operand 969 states. Second operand 791 states. [2020-07-18 05:07:31,437 INFO L87 Difference]: Start difference. First operand 969 states. Second operand 791 states. [2020-07-18 05:07:31,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:31,488 INFO L93 Difference]: Finished difference Result 969 states and 1303 transitions. [2020-07-18 05:07:31,488 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1303 transitions. [2020-07-18 05:07:31,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:31,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:31,491 INFO L74 IsIncluded]: Start isIncluded. First operand 791 states. Second operand 969 states. [2020-07-18 05:07:31,491 INFO L87 Difference]: Start difference. First operand 791 states. Second operand 969 states. [2020-07-18 05:07:31,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:31,551 INFO L93 Difference]: Finished difference Result 969 states and 1303 transitions. [2020-07-18 05:07:31,551 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1303 transitions. [2020-07-18 05:07:31,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:31,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:31,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:07:31,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:07:31,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-07-18 05:07:31,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1054 transitions. [2020-07-18 05:07:31,595 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1054 transitions. Word has length 64 [2020-07-18 05:07:31,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:07:31,595 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 1054 transitions. [2020-07-18 05:07:31,595 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:07:31,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 791 states and 1054 transitions. [2020-07-18 05:07:32,905 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-18 05:07:32,905 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1054 transitions. [2020-07-18 05:07:32,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-18 05:07:32,907 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:07:32,908 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-18 05:07:32,908 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-18 05:07:32,908 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:07:32,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:07:32,909 INFO L82 PathProgramCache]: Analyzing trace with hash 628943709, now seen corresponding path program 1 times [2020-07-18 05:07:32,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:07:32,910 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [808131918] [2020-07-18 05:07:32,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:07:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:32,988 INFO L280 TraceCheckUtils]: 0: Hoare triple {19388#true} assume true; {19388#true} is VALID [2020-07-18 05:07:32,989 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {19388#true} {19388#true} #223#return; {19388#true} is VALID [2020-07-18 05:07:32,989 INFO L263 TraceCheckUtils]: 0: Hoare triple {19388#true} call ULTIMATE.init(); {19388#true} is VALID [2020-07-18 05:07:32,989 INFO L280 TraceCheckUtils]: 1: Hoare triple {19388#true} assume true; {19388#true} is VALID [2020-07-18 05:07:32,990 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {19388#true} {19388#true} #223#return; {19388#true} is VALID [2020-07-18 05:07:32,990 INFO L263 TraceCheckUtils]: 3: Hoare triple {19388#true} call #t~ret9 := main(); {19388#true} is VALID [2020-07-18 05:07:32,990 INFO L280 TraceCheckUtils]: 4: Hoare triple {19388#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {19388#true} is VALID [2020-07-18 05:07:32,991 INFO L280 TraceCheckUtils]: 5: Hoare triple {19388#true} ~p1~0 := #t~nondet0; {19388#true} is VALID [2020-07-18 05:07:32,991 INFO L280 TraceCheckUtils]: 6: Hoare triple {19388#true} havoc #t~nondet0; {19388#true} is VALID [2020-07-18 05:07:32,991 INFO L280 TraceCheckUtils]: 7: Hoare triple {19388#true} havoc ~lk1~0; {19388#true} is VALID [2020-07-18 05:07:32,992 INFO L280 TraceCheckUtils]: 8: Hoare triple {19388#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {19388#true} is VALID [2020-07-18 05:07:32,992 INFO L280 TraceCheckUtils]: 9: Hoare triple {19388#true} ~p2~0 := #t~nondet1; {19388#true} is VALID [2020-07-18 05:07:32,992 INFO L280 TraceCheckUtils]: 10: Hoare triple {19388#true} havoc #t~nondet1; {19388#true} is VALID [2020-07-18 05:07:32,992 INFO L280 TraceCheckUtils]: 11: Hoare triple {19388#true} havoc ~lk2~0; {19388#true} is VALID [2020-07-18 05:07:32,993 INFO L280 TraceCheckUtils]: 12: Hoare triple {19388#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {19388#true} is VALID [2020-07-18 05:07:32,993 INFO L280 TraceCheckUtils]: 13: Hoare triple {19388#true} ~p3~0 := #t~nondet2; {19388#true} is VALID [2020-07-18 05:07:32,993 INFO L280 TraceCheckUtils]: 14: Hoare triple {19388#true} havoc #t~nondet2; {19388#true} is VALID [2020-07-18 05:07:32,994 INFO L280 TraceCheckUtils]: 15: Hoare triple {19388#true} havoc ~lk3~0; {19388#true} is VALID [2020-07-18 05:07:32,994 INFO L280 TraceCheckUtils]: 16: Hoare triple {19388#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {19388#true} is VALID [2020-07-18 05:07:32,994 INFO L280 TraceCheckUtils]: 17: Hoare triple {19388#true} ~p4~0 := #t~nondet3; {19388#true} is VALID [2020-07-18 05:07:32,995 INFO L280 TraceCheckUtils]: 18: Hoare triple {19388#true} havoc #t~nondet3; {19388#true} is VALID [2020-07-18 05:07:32,995 INFO L280 TraceCheckUtils]: 19: Hoare triple {19388#true} havoc ~lk4~0; {19388#true} is VALID [2020-07-18 05:07:32,995 INFO L280 TraceCheckUtils]: 20: Hoare triple {19388#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {19388#true} is VALID [2020-07-18 05:07:32,995 INFO L280 TraceCheckUtils]: 21: Hoare triple {19388#true} ~p5~0 := #t~nondet4; {19388#true} is VALID [2020-07-18 05:07:32,996 INFO L280 TraceCheckUtils]: 22: Hoare triple {19388#true} havoc #t~nondet4; {19388#true} is VALID [2020-07-18 05:07:32,996 INFO L280 TraceCheckUtils]: 23: Hoare triple {19388#true} havoc ~lk5~0; {19388#true} is VALID [2020-07-18 05:07:32,996 INFO L280 TraceCheckUtils]: 24: Hoare triple {19388#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {19388#true} is VALID [2020-07-18 05:07:32,997 INFO L280 TraceCheckUtils]: 25: Hoare triple {19388#true} ~p6~0 := #t~nondet5; {19388#true} is VALID [2020-07-18 05:07:32,997 INFO L280 TraceCheckUtils]: 26: Hoare triple {19388#true} havoc #t~nondet5; {19388#true} is VALID [2020-07-18 05:07:32,997 INFO L280 TraceCheckUtils]: 27: Hoare triple {19388#true} havoc ~lk6~0; {19388#true} is VALID [2020-07-18 05:07:32,998 INFO L280 TraceCheckUtils]: 28: Hoare triple {19388#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {19388#true} is VALID [2020-07-18 05:07:32,998 INFO L280 TraceCheckUtils]: 29: Hoare triple {19388#true} ~p7~0 := #t~nondet6; {19388#true} is VALID [2020-07-18 05:07:32,998 INFO L280 TraceCheckUtils]: 30: Hoare triple {19388#true} havoc #t~nondet6; {19388#true} is VALID [2020-07-18 05:07:32,998 INFO L280 TraceCheckUtils]: 31: Hoare triple {19388#true} havoc ~lk7~0; {19388#true} is VALID [2020-07-18 05:07:32,999 INFO L280 TraceCheckUtils]: 32: Hoare triple {19388#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {19388#true} is VALID [2020-07-18 05:07:32,999 INFO L280 TraceCheckUtils]: 33: Hoare triple {19388#true} ~p8~0 := #t~nondet7; {19388#true} is VALID [2020-07-18 05:07:32,999 INFO L280 TraceCheckUtils]: 34: Hoare triple {19388#true} havoc #t~nondet7; {19388#true} is VALID [2020-07-18 05:07:33,000 INFO L280 TraceCheckUtils]: 35: Hoare triple {19388#true} havoc ~lk8~0; {19388#true} is VALID [2020-07-18 05:07:33,001 INFO L280 TraceCheckUtils]: 36: Hoare triple {19388#true} havoc ~cond~0; {19388#true} is VALID [2020-07-18 05:07:33,001 INFO L280 TraceCheckUtils]: 37: Hoare triple {19388#true} assume !false; {19388#true} is VALID [2020-07-18 05:07:33,001 INFO L280 TraceCheckUtils]: 38: Hoare triple {19388#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {19388#true} is VALID [2020-07-18 05:07:33,001 INFO L280 TraceCheckUtils]: 39: Hoare triple {19388#true} ~cond~0 := #t~nondet8; {19388#true} is VALID [2020-07-18 05:07:33,002 INFO L280 TraceCheckUtils]: 40: Hoare triple {19388#true} havoc #t~nondet8; {19388#true} is VALID [2020-07-18 05:07:33,002 INFO L280 TraceCheckUtils]: 41: Hoare triple {19388#true} assume !(0 == ~cond~0); {19388#true} is VALID [2020-07-18 05:07:33,002 INFO L280 TraceCheckUtils]: 42: Hoare triple {19388#true} ~lk1~0 := 0; {19388#true} is VALID [2020-07-18 05:07:33,003 INFO L280 TraceCheckUtils]: 43: Hoare triple {19388#true} ~lk2~0 := 0; {19388#true} is VALID [2020-07-18 05:07:33,003 INFO L280 TraceCheckUtils]: 44: Hoare triple {19388#true} ~lk3~0 := 0; {19388#true} is VALID [2020-07-18 05:07:33,003 INFO L280 TraceCheckUtils]: 45: Hoare triple {19388#true} ~lk4~0 := 0; {19388#true} is VALID [2020-07-18 05:07:33,004 INFO L280 TraceCheckUtils]: 46: Hoare triple {19388#true} ~lk5~0 := 0; {19388#true} is VALID [2020-07-18 05:07:33,004 INFO L280 TraceCheckUtils]: 47: Hoare triple {19388#true} ~lk6~0 := 0; {19388#true} is VALID [2020-07-18 05:07:33,004 INFO L280 TraceCheckUtils]: 48: Hoare triple {19388#true} ~lk7~0 := 0; {19388#true} is VALID [2020-07-18 05:07:33,005 INFO L280 TraceCheckUtils]: 49: Hoare triple {19388#true} ~lk8~0 := 0; {19388#true} is VALID [2020-07-18 05:07:33,005 INFO L280 TraceCheckUtils]: 50: Hoare triple {19388#true} assume !(0 != ~p1~0); {19388#true} is VALID [2020-07-18 05:07:33,005 INFO L280 TraceCheckUtils]: 51: Hoare triple {19388#true} assume !(0 != ~p2~0); {19388#true} is VALID [2020-07-18 05:07:33,005 INFO L280 TraceCheckUtils]: 52: Hoare triple {19388#true} assume !(0 != ~p3~0); {19388#true} is VALID [2020-07-18 05:07:33,006 INFO L280 TraceCheckUtils]: 53: Hoare triple {19388#true} assume 0 != ~p4~0; {19388#true} is VALID [2020-07-18 05:07:33,007 INFO L280 TraceCheckUtils]: 54: Hoare triple {19388#true} ~lk4~0 := 1; {19392#(= 1 main_~lk4~0)} is VALID [2020-07-18 05:07:33,007 INFO L280 TraceCheckUtils]: 55: Hoare triple {19392#(= 1 main_~lk4~0)} assume !(0 != ~p5~0); {19392#(= 1 main_~lk4~0)} is VALID [2020-07-18 05:07:33,008 INFO L280 TraceCheckUtils]: 56: Hoare triple {19392#(= 1 main_~lk4~0)} assume !(0 != ~p6~0); {19392#(= 1 main_~lk4~0)} is VALID [2020-07-18 05:07:33,030 INFO L280 TraceCheckUtils]: 57: Hoare triple {19392#(= 1 main_~lk4~0)} assume !(0 != ~p7~0); {19392#(= 1 main_~lk4~0)} is VALID [2020-07-18 05:07:33,035 INFO L280 TraceCheckUtils]: 58: Hoare triple {19392#(= 1 main_~lk4~0)} assume !(0 != ~p8~0); {19392#(= 1 main_~lk4~0)} is VALID [2020-07-18 05:07:33,037 INFO L280 TraceCheckUtils]: 59: Hoare triple {19392#(= 1 main_~lk4~0)} assume !(0 != ~p1~0); {19392#(= 1 main_~lk4~0)} is VALID [2020-07-18 05:07:33,040 INFO L280 TraceCheckUtils]: 60: Hoare triple {19392#(= 1 main_~lk4~0)} assume !(0 != ~p2~0); {19392#(= 1 main_~lk4~0)} is VALID [2020-07-18 05:07:33,044 INFO L280 TraceCheckUtils]: 61: Hoare triple {19392#(= 1 main_~lk4~0)} assume !(0 != ~p3~0); {19392#(= 1 main_~lk4~0)} is VALID [2020-07-18 05:07:33,045 INFO L280 TraceCheckUtils]: 62: Hoare triple {19392#(= 1 main_~lk4~0)} assume 0 != ~p4~0; {19392#(= 1 main_~lk4~0)} is VALID [2020-07-18 05:07:33,046 INFO L280 TraceCheckUtils]: 63: Hoare triple {19392#(= 1 main_~lk4~0)} assume 1 != ~lk4~0; {19389#false} is VALID [2020-07-18 05:07:33,047 INFO L280 TraceCheckUtils]: 64: Hoare triple {19389#false} assume !false; {19389#false} is VALID [2020-07-18 05:07:33,052 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-18 05:07:33,052 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [808131918] [2020-07-18 05:07:33,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:07:33,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:07:33,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095401619] [2020-07-18 05:07:33,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-07-18 05:07:33,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:07:33,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:07:33,120 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-18 05:07:33,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:07:33,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:07:33,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:07:33,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:33,122 INFO L87 Difference]: Start difference. First operand 791 states and 1054 transitions. Second operand 3 states. [2020-07-18 05:07:35,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:35,204 INFO L93 Difference]: Finished difference Result 963 states and 1288 transitions. [2020-07-18 05:07:35,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:07:35,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-07-18 05:07:35,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:07:35,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:35,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-18 05:07:35,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:35,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-18 05:07:35,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 168 transitions. [2020-07-18 05:07:35,348 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-18 05:07:35,408 INFO L225 Difference]: With dead ends: 963 [2020-07-18 05:07:35,408 INFO L226 Difference]: Without dead ends: 961 [2020-07-18 05:07:35,409 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-18 05:07:35,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2020-07-18 05:07:36,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 791. [2020-07-18 05:07:36,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:07:36,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 961 states. Second operand 791 states. [2020-07-18 05:07:36,814 INFO L74 IsIncluded]: Start isIncluded. First operand 961 states. Second operand 791 states. [2020-07-18 05:07:36,814 INFO L87 Difference]: Start difference. First operand 961 states. Second operand 791 states. [2020-07-18 05:07:36,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:36,848 INFO L93 Difference]: Finished difference Result 961 states and 1279 transitions. [2020-07-18 05:07:36,848 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1279 transitions. [2020-07-18 05:07:36,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:36,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:36,850 INFO L74 IsIncluded]: Start isIncluded. First operand 791 states. Second operand 961 states. [2020-07-18 05:07:36,850 INFO L87 Difference]: Start difference. First operand 791 states. Second operand 961 states. [2020-07-18 05:07:36,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:36,903 INFO L93 Difference]: Finished difference Result 961 states and 1279 transitions. [2020-07-18 05:07:36,903 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1279 transitions. [2020-07-18 05:07:36,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:36,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:36,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:07:36,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:07:36,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-07-18 05:07:36,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1046 transitions. [2020-07-18 05:07:36,940 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1046 transitions. Word has length 65 [2020-07-18 05:07:36,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:07:36,940 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 1046 transitions. [2020-07-18 05:07:36,940 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:07:36,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 791 states and 1046 transitions. [2020-07-18 05:07:38,201 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-18 05:07:38,201 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1046 transitions. [2020-07-18 05:07:38,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-18 05:07:38,203 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:07:38,203 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-18 05:07:38,203 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-18 05:07:38,204 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:07:38,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:07:38,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1684460868, now seen corresponding path program 1 times [2020-07-18 05:07:38,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:07:38,205 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1971429306] [2020-07-18 05:07:38,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:07:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:38,251 INFO L280 TraceCheckUtils]: 0: Hoare triple {24825#true} assume true; {24825#true} is VALID [2020-07-18 05:07:38,251 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {24825#true} {24825#true} #223#return; {24825#true} is VALID [2020-07-18 05:07:38,251 INFO L263 TraceCheckUtils]: 0: Hoare triple {24825#true} call ULTIMATE.init(); {24825#true} is VALID [2020-07-18 05:07:38,251 INFO L280 TraceCheckUtils]: 1: Hoare triple {24825#true} assume true; {24825#true} is VALID [2020-07-18 05:07:38,252 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {24825#true} {24825#true} #223#return; {24825#true} is VALID [2020-07-18 05:07:38,252 INFO L263 TraceCheckUtils]: 3: Hoare triple {24825#true} call #t~ret9 := main(); {24825#true} is VALID [2020-07-18 05:07:38,252 INFO L280 TraceCheckUtils]: 4: Hoare triple {24825#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {24825#true} is VALID [2020-07-18 05:07:38,252 INFO L280 TraceCheckUtils]: 5: Hoare triple {24825#true} ~p1~0 := #t~nondet0; {24825#true} is VALID [2020-07-18 05:07:38,252 INFO L280 TraceCheckUtils]: 6: Hoare triple {24825#true} havoc #t~nondet0; {24825#true} is VALID [2020-07-18 05:07:38,252 INFO L280 TraceCheckUtils]: 7: Hoare triple {24825#true} havoc ~lk1~0; {24825#true} is VALID [2020-07-18 05:07:38,252 INFO L280 TraceCheckUtils]: 8: Hoare triple {24825#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {24825#true} is VALID [2020-07-18 05:07:38,252 INFO L280 TraceCheckUtils]: 9: Hoare triple {24825#true} ~p2~0 := #t~nondet1; {24825#true} is VALID [2020-07-18 05:07:38,253 INFO L280 TraceCheckUtils]: 10: Hoare triple {24825#true} havoc #t~nondet1; {24825#true} is VALID [2020-07-18 05:07:38,253 INFO L280 TraceCheckUtils]: 11: Hoare triple {24825#true} havoc ~lk2~0; {24825#true} is VALID [2020-07-18 05:07:38,253 INFO L280 TraceCheckUtils]: 12: Hoare triple {24825#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {24825#true} is VALID [2020-07-18 05:07:38,253 INFO L280 TraceCheckUtils]: 13: Hoare triple {24825#true} ~p3~0 := #t~nondet2; {24825#true} is VALID [2020-07-18 05:07:38,253 INFO L280 TraceCheckUtils]: 14: Hoare triple {24825#true} havoc #t~nondet2; {24825#true} is VALID [2020-07-18 05:07:38,253 INFO L280 TraceCheckUtils]: 15: Hoare triple {24825#true} havoc ~lk3~0; {24825#true} is VALID [2020-07-18 05:07:38,253 INFO L280 TraceCheckUtils]: 16: Hoare triple {24825#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {24825#true} is VALID [2020-07-18 05:07:38,253 INFO L280 TraceCheckUtils]: 17: Hoare triple {24825#true} ~p4~0 := #t~nondet3; {24825#true} is VALID [2020-07-18 05:07:38,254 INFO L280 TraceCheckUtils]: 18: Hoare triple {24825#true} havoc #t~nondet3; {24825#true} is VALID [2020-07-18 05:07:38,254 INFO L280 TraceCheckUtils]: 19: Hoare triple {24825#true} havoc ~lk4~0; {24825#true} is VALID [2020-07-18 05:07:38,254 INFO L280 TraceCheckUtils]: 20: Hoare triple {24825#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {24825#true} is VALID [2020-07-18 05:07:38,254 INFO L280 TraceCheckUtils]: 21: Hoare triple {24825#true} ~p5~0 := #t~nondet4; {24825#true} is VALID [2020-07-18 05:07:38,254 INFO L280 TraceCheckUtils]: 22: Hoare triple {24825#true} havoc #t~nondet4; {24825#true} is VALID [2020-07-18 05:07:38,254 INFO L280 TraceCheckUtils]: 23: Hoare triple {24825#true} havoc ~lk5~0; {24825#true} is VALID [2020-07-18 05:07:38,254 INFO L280 TraceCheckUtils]: 24: Hoare triple {24825#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {24825#true} is VALID [2020-07-18 05:07:38,254 INFO L280 TraceCheckUtils]: 25: Hoare triple {24825#true} ~p6~0 := #t~nondet5; {24825#true} is VALID [2020-07-18 05:07:38,255 INFO L280 TraceCheckUtils]: 26: Hoare triple {24825#true} havoc #t~nondet5; {24825#true} is VALID [2020-07-18 05:07:38,255 INFO L280 TraceCheckUtils]: 27: Hoare triple {24825#true} havoc ~lk6~0; {24825#true} is VALID [2020-07-18 05:07:38,255 INFO L280 TraceCheckUtils]: 28: Hoare triple {24825#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {24825#true} is VALID [2020-07-18 05:07:38,255 INFO L280 TraceCheckUtils]: 29: Hoare triple {24825#true} ~p7~0 := #t~nondet6; {24825#true} is VALID [2020-07-18 05:07:38,255 INFO L280 TraceCheckUtils]: 30: Hoare triple {24825#true} havoc #t~nondet6; {24825#true} is VALID [2020-07-18 05:07:38,256 INFO L280 TraceCheckUtils]: 31: Hoare triple {24825#true} havoc ~lk7~0; {24825#true} is VALID [2020-07-18 05:07:38,256 INFO L280 TraceCheckUtils]: 32: Hoare triple {24825#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {24825#true} is VALID [2020-07-18 05:07:38,256 INFO L280 TraceCheckUtils]: 33: Hoare triple {24825#true} ~p8~0 := #t~nondet7; {24825#true} is VALID [2020-07-18 05:07:38,256 INFO L280 TraceCheckUtils]: 34: Hoare triple {24825#true} havoc #t~nondet7; {24825#true} is VALID [2020-07-18 05:07:38,256 INFO L280 TraceCheckUtils]: 35: Hoare triple {24825#true} havoc ~lk8~0; {24825#true} is VALID [2020-07-18 05:07:38,257 INFO L280 TraceCheckUtils]: 36: Hoare triple {24825#true} havoc ~cond~0; {24825#true} is VALID [2020-07-18 05:07:38,257 INFO L280 TraceCheckUtils]: 37: Hoare triple {24825#true} assume !false; {24825#true} is VALID [2020-07-18 05:07:38,257 INFO L280 TraceCheckUtils]: 38: Hoare triple {24825#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {24825#true} is VALID [2020-07-18 05:07:38,257 INFO L280 TraceCheckUtils]: 39: Hoare triple {24825#true} ~cond~0 := #t~nondet8; {24825#true} is VALID [2020-07-18 05:07:38,257 INFO L280 TraceCheckUtils]: 40: Hoare triple {24825#true} havoc #t~nondet8; {24825#true} is VALID [2020-07-18 05:07:38,258 INFO L280 TraceCheckUtils]: 41: Hoare triple {24825#true} assume !(0 == ~cond~0); {24825#true} is VALID [2020-07-18 05:07:38,258 INFO L280 TraceCheckUtils]: 42: Hoare triple {24825#true} ~lk1~0 := 0; {24825#true} is VALID [2020-07-18 05:07:38,258 INFO L280 TraceCheckUtils]: 43: Hoare triple {24825#true} ~lk2~0 := 0; {24825#true} is VALID [2020-07-18 05:07:38,258 INFO L280 TraceCheckUtils]: 44: Hoare triple {24825#true} ~lk3~0 := 0; {24825#true} is VALID [2020-07-18 05:07:38,258 INFO L280 TraceCheckUtils]: 45: Hoare triple {24825#true} ~lk4~0 := 0; {24825#true} is VALID [2020-07-18 05:07:38,259 INFO L280 TraceCheckUtils]: 46: Hoare triple {24825#true} ~lk5~0 := 0; {24825#true} is VALID [2020-07-18 05:07:38,259 INFO L280 TraceCheckUtils]: 47: Hoare triple {24825#true} ~lk6~0 := 0; {24825#true} is VALID [2020-07-18 05:07:38,259 INFO L280 TraceCheckUtils]: 48: Hoare triple {24825#true} ~lk7~0 := 0; {24825#true} is VALID [2020-07-18 05:07:38,259 INFO L280 TraceCheckUtils]: 49: Hoare triple {24825#true} ~lk8~0 := 0; {24825#true} is VALID [2020-07-18 05:07:38,259 INFO L280 TraceCheckUtils]: 50: Hoare triple {24825#true} assume !(0 != ~p1~0); {24825#true} is VALID [2020-07-18 05:07:38,260 INFO L280 TraceCheckUtils]: 51: Hoare triple {24825#true} assume !(0 != ~p2~0); {24825#true} is VALID [2020-07-18 05:07:38,260 INFO L280 TraceCheckUtils]: 52: Hoare triple {24825#true} assume !(0 != ~p3~0); {24825#true} is VALID [2020-07-18 05:07:38,260 INFO L280 TraceCheckUtils]: 53: Hoare triple {24825#true} assume !(0 != ~p4~0); {24825#true} is VALID [2020-07-18 05:07:38,260 INFO L280 TraceCheckUtils]: 54: Hoare triple {24825#true} assume !(0 != ~p5~0); {24829#(= 0 main_~p5~0)} is VALID [2020-07-18 05:07:38,261 INFO L280 TraceCheckUtils]: 55: Hoare triple {24829#(= 0 main_~p5~0)} assume !(0 != ~p6~0); {24829#(= 0 main_~p5~0)} is VALID [2020-07-18 05:07:38,261 INFO L280 TraceCheckUtils]: 56: Hoare triple {24829#(= 0 main_~p5~0)} assume !(0 != ~p7~0); {24829#(= 0 main_~p5~0)} is VALID [2020-07-18 05:07:38,262 INFO L280 TraceCheckUtils]: 57: Hoare triple {24829#(= 0 main_~p5~0)} assume !(0 != ~p8~0); {24829#(= 0 main_~p5~0)} is VALID [2020-07-18 05:07:38,262 INFO L280 TraceCheckUtils]: 58: Hoare triple {24829#(= 0 main_~p5~0)} assume !(0 != ~p1~0); {24829#(= 0 main_~p5~0)} is VALID [2020-07-18 05:07:38,263 INFO L280 TraceCheckUtils]: 59: Hoare triple {24829#(= 0 main_~p5~0)} assume !(0 != ~p2~0); {24829#(= 0 main_~p5~0)} is VALID [2020-07-18 05:07:38,263 INFO L280 TraceCheckUtils]: 60: Hoare triple {24829#(= 0 main_~p5~0)} assume !(0 != ~p3~0); {24829#(= 0 main_~p5~0)} is VALID [2020-07-18 05:07:38,264 INFO L280 TraceCheckUtils]: 61: Hoare triple {24829#(= 0 main_~p5~0)} assume !(0 != ~p4~0); {24829#(= 0 main_~p5~0)} is VALID [2020-07-18 05:07:38,264 INFO L280 TraceCheckUtils]: 62: Hoare triple {24829#(= 0 main_~p5~0)} assume 0 != ~p5~0; {24826#false} is VALID [2020-07-18 05:07:38,265 INFO L280 TraceCheckUtils]: 63: Hoare triple {24826#false} assume 1 != ~lk5~0; {24826#false} is VALID [2020-07-18 05:07:38,265 INFO L280 TraceCheckUtils]: 64: Hoare triple {24826#false} assume !false; {24826#false} is VALID [2020-07-18 05:07:38,267 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-18 05:07:38,268 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1971429306] [2020-07-18 05:07:38,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:07:38,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:07:38,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123548202] [2020-07-18 05:07:38,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-07-18 05:07:38,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:07:38,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:07:38,325 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-18 05:07:38,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:07:38,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:07:38,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:07:38,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:38,326 INFO L87 Difference]: Start difference. First operand 791 states and 1046 transitions. Second operand 3 states. [2020-07-18 05:07:41,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:41,890 INFO L93 Difference]: Finished difference Result 2251 states and 3000 transitions. [2020-07-18 05:07:41,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:07:41,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-07-18 05:07:41,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:07:41,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:41,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 255 transitions. [2020-07-18 05:07:41,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:41,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 255 transitions. [2020-07-18 05:07:41,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 255 transitions. [2020-07-18 05:07:42,112 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-18 05:07:42,213 INFO L225 Difference]: With dead ends: 2251 [2020-07-18 05:07:42,213 INFO L226 Difference]: Without dead ends: 1497 [2020-07-18 05:07:42,215 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-18 05:07:42,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2020-07-18 05:07:45,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1495. [2020-07-18 05:07:45,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:07:45,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1497 states. Second operand 1495 states. [2020-07-18 05:07:45,310 INFO L74 IsIncluded]: Start isIncluded. First operand 1497 states. Second operand 1495 states. [2020-07-18 05:07:45,310 INFO L87 Difference]: Start difference. First operand 1497 states. Second operand 1495 states. [2020-07-18 05:07:45,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:45,376 INFO L93 Difference]: Finished difference Result 1497 states and 1959 transitions. [2020-07-18 05:07:45,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 1959 transitions. [2020-07-18 05:07:45,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:45,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:45,381 INFO L74 IsIncluded]: Start isIncluded. First operand 1495 states. Second operand 1497 states. [2020-07-18 05:07:45,381 INFO L87 Difference]: Start difference. First operand 1495 states. Second operand 1497 states. [2020-07-18 05:07:45,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:45,460 INFO L93 Difference]: Finished difference Result 1497 states and 1959 transitions. [2020-07-18 05:07:45,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 1959 transitions. [2020-07-18 05:07:45,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:45,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:45,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:07:45,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:07:45,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1495 states. [2020-07-18 05:07:45,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 1958 transitions. [2020-07-18 05:07:45,558 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 1958 transitions. Word has length 65 [2020-07-18 05:07:45,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:07:45,559 INFO L479 AbstractCegarLoop]: Abstraction has 1495 states and 1958 transitions. [2020-07-18 05:07:45,559 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:07:45,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 1495 states and 1958 transitions. [2020-07-18 05:07:48,054 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-18 05:07:48,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1958 transitions. [2020-07-18 05:07:48,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-18 05:07:48,056 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:07:48,057 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-18 05:07:48,057 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-18 05:07:48,057 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:07:48,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:07:48,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1510854248, now seen corresponding path program 1 times [2020-07-18 05:07:48,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:07:48,058 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1147899276] [2020-07-18 05:07:48,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:07:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:48,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:48,107 INFO L280 TraceCheckUtils]: 0: Hoare triple {35318#true} assume true; {35318#true} is VALID [2020-07-18 05:07:48,107 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {35318#true} {35318#true} #223#return; {35318#true} is VALID [2020-07-18 05:07:48,107 INFO L263 TraceCheckUtils]: 0: Hoare triple {35318#true} call ULTIMATE.init(); {35318#true} is VALID [2020-07-18 05:07:48,107 INFO L280 TraceCheckUtils]: 1: Hoare triple {35318#true} assume true; {35318#true} is VALID [2020-07-18 05:07:48,108 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {35318#true} {35318#true} #223#return; {35318#true} is VALID [2020-07-18 05:07:48,108 INFO L263 TraceCheckUtils]: 3: Hoare triple {35318#true} call #t~ret9 := main(); {35318#true} is VALID [2020-07-18 05:07:48,108 INFO L280 TraceCheckUtils]: 4: Hoare triple {35318#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {35318#true} is VALID [2020-07-18 05:07:48,108 INFO L280 TraceCheckUtils]: 5: Hoare triple {35318#true} ~p1~0 := #t~nondet0; {35318#true} is VALID [2020-07-18 05:07:48,108 INFO L280 TraceCheckUtils]: 6: Hoare triple {35318#true} havoc #t~nondet0; {35318#true} is VALID [2020-07-18 05:07:48,109 INFO L280 TraceCheckUtils]: 7: Hoare triple {35318#true} havoc ~lk1~0; {35318#true} is VALID [2020-07-18 05:07:48,109 INFO L280 TraceCheckUtils]: 8: Hoare triple {35318#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {35318#true} is VALID [2020-07-18 05:07:48,109 INFO L280 TraceCheckUtils]: 9: Hoare triple {35318#true} ~p2~0 := #t~nondet1; {35318#true} is VALID [2020-07-18 05:07:48,109 INFO L280 TraceCheckUtils]: 10: Hoare triple {35318#true} havoc #t~nondet1; {35318#true} is VALID [2020-07-18 05:07:48,109 INFO L280 TraceCheckUtils]: 11: Hoare triple {35318#true} havoc ~lk2~0; {35318#true} is VALID [2020-07-18 05:07:48,110 INFO L280 TraceCheckUtils]: 12: Hoare triple {35318#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {35318#true} is VALID [2020-07-18 05:07:48,110 INFO L280 TraceCheckUtils]: 13: Hoare triple {35318#true} ~p3~0 := #t~nondet2; {35318#true} is VALID [2020-07-18 05:07:48,110 INFO L280 TraceCheckUtils]: 14: Hoare triple {35318#true} havoc #t~nondet2; {35318#true} is VALID [2020-07-18 05:07:48,110 INFO L280 TraceCheckUtils]: 15: Hoare triple {35318#true} havoc ~lk3~0; {35318#true} is VALID [2020-07-18 05:07:48,110 INFO L280 TraceCheckUtils]: 16: Hoare triple {35318#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {35318#true} is VALID [2020-07-18 05:07:48,110 INFO L280 TraceCheckUtils]: 17: Hoare triple {35318#true} ~p4~0 := #t~nondet3; {35318#true} is VALID [2020-07-18 05:07:48,111 INFO L280 TraceCheckUtils]: 18: Hoare triple {35318#true} havoc #t~nondet3; {35318#true} is VALID [2020-07-18 05:07:48,111 INFO L280 TraceCheckUtils]: 19: Hoare triple {35318#true} havoc ~lk4~0; {35318#true} is VALID [2020-07-18 05:07:48,111 INFO L280 TraceCheckUtils]: 20: Hoare triple {35318#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {35318#true} is VALID [2020-07-18 05:07:48,111 INFO L280 TraceCheckUtils]: 21: Hoare triple {35318#true} ~p5~0 := #t~nondet4; {35318#true} is VALID [2020-07-18 05:07:48,111 INFO L280 TraceCheckUtils]: 22: Hoare triple {35318#true} havoc #t~nondet4; {35318#true} is VALID [2020-07-18 05:07:48,112 INFO L280 TraceCheckUtils]: 23: Hoare triple {35318#true} havoc ~lk5~0; {35318#true} is VALID [2020-07-18 05:07:48,112 INFO L280 TraceCheckUtils]: 24: Hoare triple {35318#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {35318#true} is VALID [2020-07-18 05:07:48,112 INFO L280 TraceCheckUtils]: 25: Hoare triple {35318#true} ~p6~0 := #t~nondet5; {35318#true} is VALID [2020-07-18 05:07:48,112 INFO L280 TraceCheckUtils]: 26: Hoare triple {35318#true} havoc #t~nondet5; {35318#true} is VALID [2020-07-18 05:07:48,112 INFO L280 TraceCheckUtils]: 27: Hoare triple {35318#true} havoc ~lk6~0; {35318#true} is VALID [2020-07-18 05:07:48,112 INFO L280 TraceCheckUtils]: 28: Hoare triple {35318#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {35318#true} is VALID [2020-07-18 05:07:48,113 INFO L280 TraceCheckUtils]: 29: Hoare triple {35318#true} ~p7~0 := #t~nondet6; {35318#true} is VALID [2020-07-18 05:07:48,113 INFO L280 TraceCheckUtils]: 30: Hoare triple {35318#true} havoc #t~nondet6; {35318#true} is VALID [2020-07-18 05:07:48,113 INFO L280 TraceCheckUtils]: 31: Hoare triple {35318#true} havoc ~lk7~0; {35318#true} is VALID [2020-07-18 05:07:48,113 INFO L280 TraceCheckUtils]: 32: Hoare triple {35318#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {35318#true} is VALID [2020-07-18 05:07:48,113 INFO L280 TraceCheckUtils]: 33: Hoare triple {35318#true} ~p8~0 := #t~nondet7; {35318#true} is VALID [2020-07-18 05:07:48,114 INFO L280 TraceCheckUtils]: 34: Hoare triple {35318#true} havoc #t~nondet7; {35318#true} is VALID [2020-07-18 05:07:48,114 INFO L280 TraceCheckUtils]: 35: Hoare triple {35318#true} havoc ~lk8~0; {35318#true} is VALID [2020-07-18 05:07:48,114 INFO L280 TraceCheckUtils]: 36: Hoare triple {35318#true} havoc ~cond~0; {35318#true} is VALID [2020-07-18 05:07:48,114 INFO L280 TraceCheckUtils]: 37: Hoare triple {35318#true} assume !false; {35318#true} is VALID [2020-07-18 05:07:48,115 INFO L280 TraceCheckUtils]: 38: Hoare triple {35318#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {35318#true} is VALID [2020-07-18 05:07:48,115 INFO L280 TraceCheckUtils]: 39: Hoare triple {35318#true} ~cond~0 := #t~nondet8; {35318#true} is VALID [2020-07-18 05:07:48,115 INFO L280 TraceCheckUtils]: 40: Hoare triple {35318#true} havoc #t~nondet8; {35318#true} is VALID [2020-07-18 05:07:48,116 INFO L280 TraceCheckUtils]: 41: Hoare triple {35318#true} assume !(0 == ~cond~0); {35318#true} is VALID [2020-07-18 05:07:48,116 INFO L280 TraceCheckUtils]: 42: Hoare triple {35318#true} ~lk1~0 := 0; {35318#true} is VALID [2020-07-18 05:07:48,116 INFO L280 TraceCheckUtils]: 43: Hoare triple {35318#true} ~lk2~0 := 0; {35318#true} is VALID [2020-07-18 05:07:48,116 INFO L280 TraceCheckUtils]: 44: Hoare triple {35318#true} ~lk3~0 := 0; {35318#true} is VALID [2020-07-18 05:07:48,116 INFO L280 TraceCheckUtils]: 45: Hoare triple {35318#true} ~lk4~0 := 0; {35318#true} is VALID [2020-07-18 05:07:48,117 INFO L280 TraceCheckUtils]: 46: Hoare triple {35318#true} ~lk5~0 := 0; {35318#true} is VALID [2020-07-18 05:07:48,117 INFO L280 TraceCheckUtils]: 47: Hoare triple {35318#true} ~lk6~0 := 0; {35318#true} is VALID [2020-07-18 05:07:48,117 INFO L280 TraceCheckUtils]: 48: Hoare triple {35318#true} ~lk7~0 := 0; {35318#true} is VALID [2020-07-18 05:07:48,117 INFO L280 TraceCheckUtils]: 49: Hoare triple {35318#true} ~lk8~0 := 0; {35318#true} is VALID [2020-07-18 05:07:48,117 INFO L280 TraceCheckUtils]: 50: Hoare triple {35318#true} assume !(0 != ~p1~0); {35318#true} is VALID [2020-07-18 05:07:48,117 INFO L280 TraceCheckUtils]: 51: Hoare triple {35318#true} assume !(0 != ~p2~0); {35318#true} is VALID [2020-07-18 05:07:48,118 INFO L280 TraceCheckUtils]: 52: Hoare triple {35318#true} assume !(0 != ~p3~0); {35318#true} is VALID [2020-07-18 05:07:48,118 INFO L280 TraceCheckUtils]: 53: Hoare triple {35318#true} assume !(0 != ~p4~0); {35318#true} is VALID [2020-07-18 05:07:48,118 INFO L280 TraceCheckUtils]: 54: Hoare triple {35318#true} assume 0 != ~p5~0; {35318#true} is VALID [2020-07-18 05:07:48,119 INFO L280 TraceCheckUtils]: 55: Hoare triple {35318#true} ~lk5~0 := 1; {35322#(= 1 main_~lk5~0)} is VALID [2020-07-18 05:07:48,119 INFO L280 TraceCheckUtils]: 56: Hoare triple {35322#(= 1 main_~lk5~0)} assume !(0 != ~p6~0); {35322#(= 1 main_~lk5~0)} is VALID [2020-07-18 05:07:48,120 INFO L280 TraceCheckUtils]: 57: Hoare triple {35322#(= 1 main_~lk5~0)} assume !(0 != ~p7~0); {35322#(= 1 main_~lk5~0)} is VALID [2020-07-18 05:07:48,120 INFO L280 TraceCheckUtils]: 58: Hoare triple {35322#(= 1 main_~lk5~0)} assume !(0 != ~p8~0); {35322#(= 1 main_~lk5~0)} is VALID [2020-07-18 05:07:48,121 INFO L280 TraceCheckUtils]: 59: Hoare triple {35322#(= 1 main_~lk5~0)} assume !(0 != ~p1~0); {35322#(= 1 main_~lk5~0)} is VALID [2020-07-18 05:07:48,121 INFO L280 TraceCheckUtils]: 60: Hoare triple {35322#(= 1 main_~lk5~0)} assume !(0 != ~p2~0); {35322#(= 1 main_~lk5~0)} is VALID [2020-07-18 05:07:48,122 INFO L280 TraceCheckUtils]: 61: Hoare triple {35322#(= 1 main_~lk5~0)} assume !(0 != ~p3~0); {35322#(= 1 main_~lk5~0)} is VALID [2020-07-18 05:07:48,122 INFO L280 TraceCheckUtils]: 62: Hoare triple {35322#(= 1 main_~lk5~0)} assume !(0 != ~p4~0); {35322#(= 1 main_~lk5~0)} is VALID [2020-07-18 05:07:48,123 INFO L280 TraceCheckUtils]: 63: Hoare triple {35322#(= 1 main_~lk5~0)} assume 0 != ~p5~0; {35322#(= 1 main_~lk5~0)} is VALID [2020-07-18 05:07:48,124 INFO L280 TraceCheckUtils]: 64: Hoare triple {35322#(= 1 main_~lk5~0)} assume 1 != ~lk5~0; {35319#false} is VALID [2020-07-18 05:07:48,124 INFO L280 TraceCheckUtils]: 65: Hoare triple {35319#false} assume !false; {35319#false} is VALID [2020-07-18 05:07:48,127 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-18 05:07:48,127 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1147899276] [2020-07-18 05:07:48,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:07:48,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:07:48,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609054777] [2020-07-18 05:07:48,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-18 05:07:48,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:07:48,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:07:48,185 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-18 05:07:48,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:07:48,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:07:48,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:07:48,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:48,186 INFO L87 Difference]: Start difference. First operand 1495 states and 1958 transitions. Second operand 3 states. [2020-07-18 05:07:52,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:52,388 INFO L93 Difference]: Finished difference Result 1803 states and 2360 transitions. [2020-07-18 05:07:52,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:07:52,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-18 05:07:52,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:07:52,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:52,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2020-07-18 05:07:52,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:52,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2020-07-18 05:07:52,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 164 transitions. [2020-07-18 05:07:52,544 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-18 05:07:52,655 INFO L225 Difference]: With dead ends: 1803 [2020-07-18 05:07:52,655 INFO L226 Difference]: Without dead ends: 1801 [2020-07-18 05:07:52,656 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-18 05:07:52,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states. [2020-07-18 05:07:56,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1495. [2020-07-18 05:07:56,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:07:56,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1801 states. Second operand 1495 states. [2020-07-18 05:07:56,091 INFO L74 IsIncluded]: Start isIncluded. First operand 1801 states. Second operand 1495 states. [2020-07-18 05:07:56,091 INFO L87 Difference]: Start difference. First operand 1801 states. Second operand 1495 states. [2020-07-18 05:07:56,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:56,195 INFO L93 Difference]: Finished difference Result 1801 states and 2343 transitions. [2020-07-18 05:07:56,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2343 transitions. [2020-07-18 05:07:56,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:56,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:56,197 INFO L74 IsIncluded]: Start isIncluded. First operand 1495 states. Second operand 1801 states. [2020-07-18 05:07:56,197 INFO L87 Difference]: Start difference. First operand 1495 states. Second operand 1801 states. [2020-07-18 05:07:56,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:56,325 INFO L93 Difference]: Finished difference Result 1801 states and 2343 transitions. [2020-07-18 05:07:56,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2343 transitions. [2020-07-18 05:07:56,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:56,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:56,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:07:56,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:07:56,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1495 states. [2020-07-18 05:07:56,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 1942 transitions. [2020-07-18 05:07:56,395 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 1942 transitions. Word has length 66 [2020-07-18 05:07:56,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:07:56,395 INFO L479 AbstractCegarLoop]: Abstraction has 1495 states and 1942 transitions. [2020-07-18 05:07:56,395 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:07:56,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 1495 states and 1942 transitions. [2020-07-18 05:07:58,846 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-18 05:07:58,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1942 transitions. [2020-07-18 05:07:58,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-18 05:07:58,848 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:07:58,848 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-18 05:07:58,848 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-18 05:07:58,848 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:07:58,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:07:58,849 INFO L82 PathProgramCache]: Analyzing trace with hash -678433246, now seen corresponding path program 1 times [2020-07-18 05:07:58,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:07:58,849 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [584841612] [2020-07-18 05:07:58,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:07:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:58,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:58,898 INFO L280 TraceCheckUtils]: 0: Hoare triple {45523#true} assume true; {45523#true} is VALID [2020-07-18 05:07:58,898 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {45523#true} {45523#true} #223#return; {45523#true} is VALID [2020-07-18 05:07:58,898 INFO L263 TraceCheckUtils]: 0: Hoare triple {45523#true} call ULTIMATE.init(); {45523#true} is VALID [2020-07-18 05:07:58,898 INFO L280 TraceCheckUtils]: 1: Hoare triple {45523#true} assume true; {45523#true} is VALID [2020-07-18 05:07:58,898 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {45523#true} {45523#true} #223#return; {45523#true} is VALID [2020-07-18 05:07:58,899 INFO L263 TraceCheckUtils]: 3: Hoare triple {45523#true} call #t~ret9 := main(); {45523#true} is VALID [2020-07-18 05:07:58,899 INFO L280 TraceCheckUtils]: 4: Hoare triple {45523#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {45523#true} is VALID [2020-07-18 05:07:58,899 INFO L280 TraceCheckUtils]: 5: Hoare triple {45523#true} ~p1~0 := #t~nondet0; {45523#true} is VALID [2020-07-18 05:07:58,899 INFO L280 TraceCheckUtils]: 6: Hoare triple {45523#true} havoc #t~nondet0; {45523#true} is VALID [2020-07-18 05:07:58,900 INFO L280 TraceCheckUtils]: 7: Hoare triple {45523#true} havoc ~lk1~0; {45523#true} is VALID [2020-07-18 05:07:58,900 INFO L280 TraceCheckUtils]: 8: Hoare triple {45523#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {45523#true} is VALID [2020-07-18 05:07:58,900 INFO L280 TraceCheckUtils]: 9: Hoare triple {45523#true} ~p2~0 := #t~nondet1; {45523#true} is VALID [2020-07-18 05:07:58,901 INFO L280 TraceCheckUtils]: 10: Hoare triple {45523#true} havoc #t~nondet1; {45523#true} is VALID [2020-07-18 05:07:58,901 INFO L280 TraceCheckUtils]: 11: Hoare triple {45523#true} havoc ~lk2~0; {45523#true} is VALID [2020-07-18 05:07:58,901 INFO L280 TraceCheckUtils]: 12: Hoare triple {45523#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {45523#true} is VALID [2020-07-18 05:07:58,902 INFO L280 TraceCheckUtils]: 13: Hoare triple {45523#true} ~p3~0 := #t~nondet2; {45523#true} is VALID [2020-07-18 05:07:58,902 INFO L280 TraceCheckUtils]: 14: Hoare triple {45523#true} havoc #t~nondet2; {45523#true} is VALID [2020-07-18 05:07:58,902 INFO L280 TraceCheckUtils]: 15: Hoare triple {45523#true} havoc ~lk3~0; {45523#true} is VALID [2020-07-18 05:07:58,902 INFO L280 TraceCheckUtils]: 16: Hoare triple {45523#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {45523#true} is VALID [2020-07-18 05:07:58,902 INFO L280 TraceCheckUtils]: 17: Hoare triple {45523#true} ~p4~0 := #t~nondet3; {45523#true} is VALID [2020-07-18 05:07:58,903 INFO L280 TraceCheckUtils]: 18: Hoare triple {45523#true} havoc #t~nondet3; {45523#true} is VALID [2020-07-18 05:07:58,903 INFO L280 TraceCheckUtils]: 19: Hoare triple {45523#true} havoc ~lk4~0; {45523#true} is VALID [2020-07-18 05:07:58,903 INFO L280 TraceCheckUtils]: 20: Hoare triple {45523#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {45523#true} is VALID [2020-07-18 05:07:58,903 INFO L280 TraceCheckUtils]: 21: Hoare triple {45523#true} ~p5~0 := #t~nondet4; {45523#true} is VALID [2020-07-18 05:07:58,903 INFO L280 TraceCheckUtils]: 22: Hoare triple {45523#true} havoc #t~nondet4; {45523#true} is VALID [2020-07-18 05:07:58,903 INFO L280 TraceCheckUtils]: 23: Hoare triple {45523#true} havoc ~lk5~0; {45523#true} is VALID [2020-07-18 05:07:58,904 INFO L280 TraceCheckUtils]: 24: Hoare triple {45523#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {45523#true} is VALID [2020-07-18 05:07:58,904 INFO L280 TraceCheckUtils]: 25: Hoare triple {45523#true} ~p6~0 := #t~nondet5; {45523#true} is VALID [2020-07-18 05:07:58,904 INFO L280 TraceCheckUtils]: 26: Hoare triple {45523#true} havoc #t~nondet5; {45523#true} is VALID [2020-07-18 05:07:58,904 INFO L280 TraceCheckUtils]: 27: Hoare triple {45523#true} havoc ~lk6~0; {45523#true} is VALID [2020-07-18 05:07:58,904 INFO L280 TraceCheckUtils]: 28: Hoare triple {45523#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {45523#true} is VALID [2020-07-18 05:07:58,904 INFO L280 TraceCheckUtils]: 29: Hoare triple {45523#true} ~p7~0 := #t~nondet6; {45523#true} is VALID [2020-07-18 05:07:58,905 INFO L280 TraceCheckUtils]: 30: Hoare triple {45523#true} havoc #t~nondet6; {45523#true} is VALID [2020-07-18 05:07:58,905 INFO L280 TraceCheckUtils]: 31: Hoare triple {45523#true} havoc ~lk7~0; {45523#true} is VALID [2020-07-18 05:07:58,905 INFO L280 TraceCheckUtils]: 32: Hoare triple {45523#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {45523#true} is VALID [2020-07-18 05:07:58,905 INFO L280 TraceCheckUtils]: 33: Hoare triple {45523#true} ~p8~0 := #t~nondet7; {45523#true} is VALID [2020-07-18 05:07:58,905 INFO L280 TraceCheckUtils]: 34: Hoare triple {45523#true} havoc #t~nondet7; {45523#true} is VALID [2020-07-18 05:07:58,906 INFO L280 TraceCheckUtils]: 35: Hoare triple {45523#true} havoc ~lk8~0; {45523#true} is VALID [2020-07-18 05:07:58,906 INFO L280 TraceCheckUtils]: 36: Hoare triple {45523#true} havoc ~cond~0; {45523#true} is VALID [2020-07-18 05:07:58,906 INFO L280 TraceCheckUtils]: 37: Hoare triple {45523#true} assume !false; {45523#true} is VALID [2020-07-18 05:07:58,906 INFO L280 TraceCheckUtils]: 38: Hoare triple {45523#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {45523#true} is VALID [2020-07-18 05:07:58,906 INFO L280 TraceCheckUtils]: 39: Hoare triple {45523#true} ~cond~0 := #t~nondet8; {45523#true} is VALID [2020-07-18 05:07:58,906 INFO L280 TraceCheckUtils]: 40: Hoare triple {45523#true} havoc #t~nondet8; {45523#true} is VALID [2020-07-18 05:07:58,907 INFO L280 TraceCheckUtils]: 41: Hoare triple {45523#true} assume !(0 == ~cond~0); {45523#true} is VALID [2020-07-18 05:07:58,907 INFO L280 TraceCheckUtils]: 42: Hoare triple {45523#true} ~lk1~0 := 0; {45523#true} is VALID [2020-07-18 05:07:58,907 INFO L280 TraceCheckUtils]: 43: Hoare triple {45523#true} ~lk2~0 := 0; {45523#true} is VALID [2020-07-18 05:07:58,907 INFO L280 TraceCheckUtils]: 44: Hoare triple {45523#true} ~lk3~0 := 0; {45523#true} is VALID [2020-07-18 05:07:58,907 INFO L280 TraceCheckUtils]: 45: Hoare triple {45523#true} ~lk4~0 := 0; {45523#true} is VALID [2020-07-18 05:07:58,907 INFO L280 TraceCheckUtils]: 46: Hoare triple {45523#true} ~lk5~0 := 0; {45523#true} is VALID [2020-07-18 05:07:58,908 INFO L280 TraceCheckUtils]: 47: Hoare triple {45523#true} ~lk6~0 := 0; {45523#true} is VALID [2020-07-18 05:07:58,908 INFO L280 TraceCheckUtils]: 48: Hoare triple {45523#true} ~lk7~0 := 0; {45523#true} is VALID [2020-07-18 05:07:58,908 INFO L280 TraceCheckUtils]: 49: Hoare triple {45523#true} ~lk8~0 := 0; {45523#true} is VALID [2020-07-18 05:07:58,908 INFO L280 TraceCheckUtils]: 50: Hoare triple {45523#true} assume !(0 != ~p1~0); {45523#true} is VALID [2020-07-18 05:07:58,908 INFO L280 TraceCheckUtils]: 51: Hoare triple {45523#true} assume !(0 != ~p2~0); {45523#true} is VALID [2020-07-18 05:07:58,909 INFO L280 TraceCheckUtils]: 52: Hoare triple {45523#true} assume !(0 != ~p3~0); {45523#true} is VALID [2020-07-18 05:07:58,909 INFO L280 TraceCheckUtils]: 53: Hoare triple {45523#true} assume !(0 != ~p4~0); {45523#true} is VALID [2020-07-18 05:07:58,909 INFO L280 TraceCheckUtils]: 54: Hoare triple {45523#true} assume !(0 != ~p5~0); {45523#true} is VALID [2020-07-18 05:07:58,909 INFO L280 TraceCheckUtils]: 55: Hoare triple {45523#true} assume !(0 != ~p6~0); {45527#(= 0 main_~p6~0)} is VALID [2020-07-18 05:07:58,910 INFO L280 TraceCheckUtils]: 56: Hoare triple {45527#(= 0 main_~p6~0)} assume !(0 != ~p7~0); {45527#(= 0 main_~p6~0)} is VALID [2020-07-18 05:07:58,910 INFO L280 TraceCheckUtils]: 57: Hoare triple {45527#(= 0 main_~p6~0)} assume !(0 != ~p8~0); {45527#(= 0 main_~p6~0)} is VALID [2020-07-18 05:07:58,911 INFO L280 TraceCheckUtils]: 58: Hoare triple {45527#(= 0 main_~p6~0)} assume !(0 != ~p1~0); {45527#(= 0 main_~p6~0)} is VALID [2020-07-18 05:07:58,911 INFO L280 TraceCheckUtils]: 59: Hoare triple {45527#(= 0 main_~p6~0)} assume !(0 != ~p2~0); {45527#(= 0 main_~p6~0)} is VALID [2020-07-18 05:07:58,912 INFO L280 TraceCheckUtils]: 60: Hoare triple {45527#(= 0 main_~p6~0)} assume !(0 != ~p3~0); {45527#(= 0 main_~p6~0)} is VALID [2020-07-18 05:07:58,912 INFO L280 TraceCheckUtils]: 61: Hoare triple {45527#(= 0 main_~p6~0)} assume !(0 != ~p4~0); {45527#(= 0 main_~p6~0)} is VALID [2020-07-18 05:07:58,913 INFO L280 TraceCheckUtils]: 62: Hoare triple {45527#(= 0 main_~p6~0)} assume !(0 != ~p5~0); {45527#(= 0 main_~p6~0)} is VALID [2020-07-18 05:07:58,913 INFO L280 TraceCheckUtils]: 63: Hoare triple {45527#(= 0 main_~p6~0)} assume 0 != ~p6~0; {45524#false} is VALID [2020-07-18 05:07:58,913 INFO L280 TraceCheckUtils]: 64: Hoare triple {45524#false} assume 1 != ~lk6~0; {45524#false} is VALID [2020-07-18 05:07:58,914 INFO L280 TraceCheckUtils]: 65: Hoare triple {45524#false} assume !false; {45524#false} is VALID [2020-07-18 05:07:58,916 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-18 05:07:58,916 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [584841612] [2020-07-18 05:07:58,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:07:58,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:07:58,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647221837] [2020-07-18 05:07:58,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-18 05:07:58,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:07:58,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:07:58,973 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-18 05:07:58,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:07:58,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:07:58,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:07:58,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:58,974 INFO L87 Difference]: Start difference. First operand 1495 states and 1942 transitions. Second operand 3 states. [2020-07-18 05:08:07,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:08:07,300 INFO L93 Difference]: Finished difference Result 4315 states and 5624 transitions. [2020-07-18 05:08:07,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:08:07,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-18 05:08:07,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:08:07,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:08:07,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2020-07-18 05:08:07,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:08:07,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2020-07-18 05:08:07,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 252 transitions. [2020-07-18 05:08:07,540 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-18 05:08:07,808 INFO L225 Difference]: With dead ends: 4315 [2020-07-18 05:08:07,808 INFO L226 Difference]: Without dead ends: 2857 [2020-07-18 05:08:07,812 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-18 05:08:07,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2857 states. [2020-07-18 05:08:15,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2857 to 2855. [2020-07-18 05:08:15,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:08:15,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2857 states. Second operand 2855 states. [2020-07-18 05:08:15,120 INFO L74 IsIncluded]: Start isIncluded. First operand 2857 states. Second operand 2855 states. [2020-07-18 05:08:15,120 INFO L87 Difference]: Start difference. First operand 2857 states. Second operand 2855 states. [2020-07-18 05:08:15,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:08:15,353 INFO L93 Difference]: Finished difference Result 2857 states and 3655 transitions. [2020-07-18 05:08:15,353 INFO L276 IsEmpty]: Start isEmpty. Operand 2857 states and 3655 transitions. [2020-07-18 05:08:15,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:08:15,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:08:15,356 INFO L74 IsIncluded]: Start isIncluded. First operand 2855 states. Second operand 2857 states. [2020-07-18 05:08:15,356 INFO L87 Difference]: Start difference. First operand 2855 states. Second operand 2857 states. [2020-07-18 05:08:15,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:08:15,603 INFO L93 Difference]: Finished difference Result 2857 states and 3655 transitions. [2020-07-18 05:08:15,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2857 states and 3655 transitions. [2020-07-18 05:08:15,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:08:15,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:08:15,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:08:15,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:08:15,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2855 states. [2020-07-18 05:08:15,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2855 states to 2855 states and 3654 transitions. [2020-07-18 05:08:15,869 INFO L78 Accepts]: Start accepts. Automaton has 2855 states and 3654 transitions. Word has length 66 [2020-07-18 05:08:15,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:08:15,869 INFO L479 AbstractCegarLoop]: Abstraction has 2855 states and 3654 transitions. [2020-07-18 05:08:15,869 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:08:15,869 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2855 states and 3654 transitions. [2020-07-18 05:08:20,691 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-18 05:08:20,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2855 states and 3654 transitions. [2020-07-18 05:08:20,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-18 05:08:20,694 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:08:20,694 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-18 05:08:20,694 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-18 05:08:20,694 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:08:20,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:08:20,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1214689743, now seen corresponding path program 1 times [2020-07-18 05:08:20,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:08:20,695 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [521095785] [2020-07-18 05:08:20,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:08:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:08:20,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:08:20,747 INFO L280 TraceCheckUtils]: 0: Hoare triple {65584#true} assume true; {65584#true} is VALID [2020-07-18 05:08:20,748 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {65584#true} {65584#true} #223#return; {65584#true} is VALID [2020-07-18 05:08:20,748 INFO L263 TraceCheckUtils]: 0: Hoare triple {65584#true} call ULTIMATE.init(); {65584#true} is VALID [2020-07-18 05:08:20,748 INFO L280 TraceCheckUtils]: 1: Hoare triple {65584#true} assume true; {65584#true} is VALID [2020-07-18 05:08:20,748 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {65584#true} {65584#true} #223#return; {65584#true} is VALID [2020-07-18 05:08:20,749 INFO L263 TraceCheckUtils]: 3: Hoare triple {65584#true} call #t~ret9 := main(); {65584#true} is VALID [2020-07-18 05:08:20,749 INFO L280 TraceCheckUtils]: 4: Hoare triple {65584#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {65584#true} is VALID [2020-07-18 05:08:20,749 INFO L280 TraceCheckUtils]: 5: Hoare triple {65584#true} ~p1~0 := #t~nondet0; {65584#true} is VALID [2020-07-18 05:08:20,749 INFO L280 TraceCheckUtils]: 6: Hoare triple {65584#true} havoc #t~nondet0; {65584#true} is VALID [2020-07-18 05:08:20,750 INFO L280 TraceCheckUtils]: 7: Hoare triple {65584#true} havoc ~lk1~0; {65584#true} is VALID [2020-07-18 05:08:20,750 INFO L280 TraceCheckUtils]: 8: Hoare triple {65584#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {65584#true} is VALID [2020-07-18 05:08:20,750 INFO L280 TraceCheckUtils]: 9: Hoare triple {65584#true} ~p2~0 := #t~nondet1; {65584#true} is VALID [2020-07-18 05:08:20,750 INFO L280 TraceCheckUtils]: 10: Hoare triple {65584#true} havoc #t~nondet1; {65584#true} is VALID [2020-07-18 05:08:20,750 INFO L280 TraceCheckUtils]: 11: Hoare triple {65584#true} havoc ~lk2~0; {65584#true} is VALID [2020-07-18 05:08:20,750 INFO L280 TraceCheckUtils]: 12: Hoare triple {65584#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {65584#true} is VALID [2020-07-18 05:08:20,751 INFO L280 TraceCheckUtils]: 13: Hoare triple {65584#true} ~p3~0 := #t~nondet2; {65584#true} is VALID [2020-07-18 05:08:20,751 INFO L280 TraceCheckUtils]: 14: Hoare triple {65584#true} havoc #t~nondet2; {65584#true} is VALID [2020-07-18 05:08:20,751 INFO L280 TraceCheckUtils]: 15: Hoare triple {65584#true} havoc ~lk3~0; {65584#true} is VALID [2020-07-18 05:08:20,751 INFO L280 TraceCheckUtils]: 16: Hoare triple {65584#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {65584#true} is VALID [2020-07-18 05:08:20,751 INFO L280 TraceCheckUtils]: 17: Hoare triple {65584#true} ~p4~0 := #t~nondet3; {65584#true} is VALID [2020-07-18 05:08:20,752 INFO L280 TraceCheckUtils]: 18: Hoare triple {65584#true} havoc #t~nondet3; {65584#true} is VALID [2020-07-18 05:08:20,752 INFO L280 TraceCheckUtils]: 19: Hoare triple {65584#true} havoc ~lk4~0; {65584#true} is VALID [2020-07-18 05:08:20,752 INFO L280 TraceCheckUtils]: 20: Hoare triple {65584#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {65584#true} is VALID [2020-07-18 05:08:20,752 INFO L280 TraceCheckUtils]: 21: Hoare triple {65584#true} ~p5~0 := #t~nondet4; {65584#true} is VALID [2020-07-18 05:08:20,752 INFO L280 TraceCheckUtils]: 22: Hoare triple {65584#true} havoc #t~nondet4; {65584#true} is VALID [2020-07-18 05:08:20,753 INFO L280 TraceCheckUtils]: 23: Hoare triple {65584#true} havoc ~lk5~0; {65584#true} is VALID [2020-07-18 05:08:20,753 INFO L280 TraceCheckUtils]: 24: Hoare triple {65584#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {65584#true} is VALID [2020-07-18 05:08:20,753 INFO L280 TraceCheckUtils]: 25: Hoare triple {65584#true} ~p6~0 := #t~nondet5; {65584#true} is VALID [2020-07-18 05:08:20,753 INFO L280 TraceCheckUtils]: 26: Hoare triple {65584#true} havoc #t~nondet5; {65584#true} is VALID [2020-07-18 05:08:20,753 INFO L280 TraceCheckUtils]: 27: Hoare triple {65584#true} havoc ~lk6~0; {65584#true} is VALID [2020-07-18 05:08:20,753 INFO L280 TraceCheckUtils]: 28: Hoare triple {65584#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {65584#true} is VALID [2020-07-18 05:08:20,754 INFO L280 TraceCheckUtils]: 29: Hoare triple {65584#true} ~p7~0 := #t~nondet6; {65584#true} is VALID [2020-07-18 05:08:20,754 INFO L280 TraceCheckUtils]: 30: Hoare triple {65584#true} havoc #t~nondet6; {65584#true} is VALID [2020-07-18 05:08:20,754 INFO L280 TraceCheckUtils]: 31: Hoare triple {65584#true} havoc ~lk7~0; {65584#true} is VALID [2020-07-18 05:08:20,754 INFO L280 TraceCheckUtils]: 32: Hoare triple {65584#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {65584#true} is VALID [2020-07-18 05:08:20,754 INFO L280 TraceCheckUtils]: 33: Hoare triple {65584#true} ~p8~0 := #t~nondet7; {65584#true} is VALID [2020-07-18 05:08:20,754 INFO L280 TraceCheckUtils]: 34: Hoare triple {65584#true} havoc #t~nondet7; {65584#true} is VALID [2020-07-18 05:08:20,755 INFO L280 TraceCheckUtils]: 35: Hoare triple {65584#true} havoc ~lk8~0; {65584#true} is VALID [2020-07-18 05:08:20,755 INFO L280 TraceCheckUtils]: 36: Hoare triple {65584#true} havoc ~cond~0; {65584#true} is VALID [2020-07-18 05:08:20,755 INFO L280 TraceCheckUtils]: 37: Hoare triple {65584#true} assume !false; {65584#true} is VALID [2020-07-18 05:08:20,755 INFO L280 TraceCheckUtils]: 38: Hoare triple {65584#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {65584#true} is VALID [2020-07-18 05:08:20,755 INFO L280 TraceCheckUtils]: 39: Hoare triple {65584#true} ~cond~0 := #t~nondet8; {65584#true} is VALID [2020-07-18 05:08:20,755 INFO L280 TraceCheckUtils]: 40: Hoare triple {65584#true} havoc #t~nondet8; {65584#true} is VALID [2020-07-18 05:08:20,756 INFO L280 TraceCheckUtils]: 41: Hoare triple {65584#true} assume !(0 == ~cond~0); {65584#true} is VALID [2020-07-18 05:08:20,756 INFO L280 TraceCheckUtils]: 42: Hoare triple {65584#true} ~lk1~0 := 0; {65584#true} is VALID [2020-07-18 05:08:20,756 INFO L280 TraceCheckUtils]: 43: Hoare triple {65584#true} ~lk2~0 := 0; {65584#true} is VALID [2020-07-18 05:08:20,756 INFO L280 TraceCheckUtils]: 44: Hoare triple {65584#true} ~lk3~0 := 0; {65584#true} is VALID [2020-07-18 05:08:20,756 INFO L280 TraceCheckUtils]: 45: Hoare triple {65584#true} ~lk4~0 := 0; {65584#true} is VALID [2020-07-18 05:08:20,757 INFO L280 TraceCheckUtils]: 46: Hoare triple {65584#true} ~lk5~0 := 0; {65584#true} is VALID [2020-07-18 05:08:20,757 INFO L280 TraceCheckUtils]: 47: Hoare triple {65584#true} ~lk6~0 := 0; {65584#true} is VALID [2020-07-18 05:08:20,757 INFO L280 TraceCheckUtils]: 48: Hoare triple {65584#true} ~lk7~0 := 0; {65584#true} is VALID [2020-07-18 05:08:20,757 INFO L280 TraceCheckUtils]: 49: Hoare triple {65584#true} ~lk8~0 := 0; {65584#true} is VALID [2020-07-18 05:08:20,757 INFO L280 TraceCheckUtils]: 50: Hoare triple {65584#true} assume !(0 != ~p1~0); {65584#true} is VALID [2020-07-18 05:08:20,757 INFO L280 TraceCheckUtils]: 51: Hoare triple {65584#true} assume !(0 != ~p2~0); {65584#true} is VALID [2020-07-18 05:08:20,758 INFO L280 TraceCheckUtils]: 52: Hoare triple {65584#true} assume !(0 != ~p3~0); {65584#true} is VALID [2020-07-18 05:08:20,758 INFO L280 TraceCheckUtils]: 53: Hoare triple {65584#true} assume !(0 != ~p4~0); {65584#true} is VALID [2020-07-18 05:08:20,758 INFO L280 TraceCheckUtils]: 54: Hoare triple {65584#true} assume !(0 != ~p5~0); {65584#true} is VALID [2020-07-18 05:08:20,758 INFO L280 TraceCheckUtils]: 55: Hoare triple {65584#true} assume 0 != ~p6~0; {65584#true} is VALID [2020-07-18 05:08:20,759 INFO L280 TraceCheckUtils]: 56: Hoare triple {65584#true} ~lk6~0 := 1; {65588#(= 1 main_~lk6~0)} is VALID [2020-07-18 05:08:20,759 INFO L280 TraceCheckUtils]: 57: Hoare triple {65588#(= 1 main_~lk6~0)} assume !(0 != ~p7~0); {65588#(= 1 main_~lk6~0)} is VALID [2020-07-18 05:08:20,760 INFO L280 TraceCheckUtils]: 58: Hoare triple {65588#(= 1 main_~lk6~0)} assume !(0 != ~p8~0); {65588#(= 1 main_~lk6~0)} is VALID [2020-07-18 05:08:20,760 INFO L280 TraceCheckUtils]: 59: Hoare triple {65588#(= 1 main_~lk6~0)} assume !(0 != ~p1~0); {65588#(= 1 main_~lk6~0)} is VALID [2020-07-18 05:08:20,761 INFO L280 TraceCheckUtils]: 60: Hoare triple {65588#(= 1 main_~lk6~0)} assume !(0 != ~p2~0); {65588#(= 1 main_~lk6~0)} is VALID [2020-07-18 05:08:20,761 INFO L280 TraceCheckUtils]: 61: Hoare triple {65588#(= 1 main_~lk6~0)} assume !(0 != ~p3~0); {65588#(= 1 main_~lk6~0)} is VALID [2020-07-18 05:08:20,762 INFO L280 TraceCheckUtils]: 62: Hoare triple {65588#(= 1 main_~lk6~0)} assume !(0 != ~p4~0); {65588#(= 1 main_~lk6~0)} is VALID [2020-07-18 05:08:20,762 INFO L280 TraceCheckUtils]: 63: Hoare triple {65588#(= 1 main_~lk6~0)} assume !(0 != ~p5~0); {65588#(= 1 main_~lk6~0)} is VALID [2020-07-18 05:08:20,763 INFO L280 TraceCheckUtils]: 64: Hoare triple {65588#(= 1 main_~lk6~0)} assume 0 != ~p6~0; {65588#(= 1 main_~lk6~0)} is VALID [2020-07-18 05:08:20,763 INFO L280 TraceCheckUtils]: 65: Hoare triple {65588#(= 1 main_~lk6~0)} assume 1 != ~lk6~0; {65585#false} is VALID [2020-07-18 05:08:20,763 INFO L280 TraceCheckUtils]: 66: Hoare triple {65585#false} assume !false; {65585#false} is VALID [2020-07-18 05:08:20,766 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-18 05:08:20,767 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [521095785] [2020-07-18 05:08:20,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:08:20,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:08:20,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17859004] [2020-07-18 05:08:20,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2020-07-18 05:08:20,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:08:20,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:08:20,821 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-18 05:08:20,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:08:20,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:08:20,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:08:20,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:08:20,822 INFO L87 Difference]: Start difference. First operand 2855 states and 3654 transitions. Second operand 3 states. [2020-07-18 05:08:30,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:08:30,608 INFO L93 Difference]: Finished difference Result 3403 states and 4328 transitions. [2020-07-18 05:08:30,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:08:30,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2020-07-18 05:08:30,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:08:30,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:08:30,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2020-07-18 05:08:30,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:08:30,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2020-07-18 05:08:30,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 160 transitions. [2020-07-18 05:08:30,763 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-18 05:08:31,161 INFO L225 Difference]: With dead ends: 3403 [2020-07-18 05:08:31,162 INFO L226 Difference]: Without dead ends: 3401 [2020-07-18 05:08:31,163 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-18 05:08:31,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3401 states. [2020-07-18 05:08:38,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3401 to 2855. [2020-07-18 05:08:38,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:08:38,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3401 states. Second operand 2855 states. [2020-07-18 05:08:38,857 INFO L74 IsIncluded]: Start isIncluded. First operand 3401 states. Second operand 2855 states. [2020-07-18 05:08:38,858 INFO L87 Difference]: Start difference. First operand 3401 states. Second operand 2855 states. [2020-07-18 05:08:39,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:08:39,218 INFO L93 Difference]: Finished difference Result 3401 states and 4295 transitions. [2020-07-18 05:08:39,218 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 4295 transitions. [2020-07-18 05:08:39,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:08:39,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:08:39,221 INFO L74 IsIncluded]: Start isIncluded. First operand 2855 states. Second operand 3401 states. [2020-07-18 05:08:39,222 INFO L87 Difference]: Start difference. First operand 2855 states. Second operand 3401 states. [2020-07-18 05:08:39,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:08:39,585 INFO L93 Difference]: Finished difference Result 3401 states and 4295 transitions. [2020-07-18 05:08:39,585 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 4295 transitions. [2020-07-18 05:08:39,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:08:39,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:08:39,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:08:39,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:08:39,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2855 states. [2020-07-18 05:08:39,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2855 states to 2855 states and 3622 transitions. [2020-07-18 05:08:39,851 INFO L78 Accepts]: Start accepts. Automaton has 2855 states and 3622 transitions. Word has length 67 [2020-07-18 05:08:39,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:08:39,851 INFO L479 AbstractCegarLoop]: Abstraction has 2855 states and 3622 transitions. [2020-07-18 05:08:39,851 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:08:39,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2855 states and 3622 transitions. [2020-07-18 05:08:44,678 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-18 05:08:44,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2855 states and 3622 transitions. [2020-07-18 05:08:44,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-18 05:08:44,681 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:08:44,681 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-18 05:08:44,681 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-18 05:08:44,681 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:08:44,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:08:44,681 INFO L82 PathProgramCache]: Analyzing trace with hash 443652336, now seen corresponding path program 1 times [2020-07-18 05:08:44,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:08:44,682 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [232781420] [2020-07-18 05:08:44,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:08:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:08:44,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:08:44,717 INFO L280 TraceCheckUtils]: 0: Hoare triple {84909#true} assume true; {84909#true} is VALID [2020-07-18 05:08:44,717 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {84909#true} {84909#true} #223#return; {84909#true} is VALID [2020-07-18 05:08:44,717 INFO L263 TraceCheckUtils]: 0: Hoare triple {84909#true} call ULTIMATE.init(); {84909#true} is VALID [2020-07-18 05:08:44,717 INFO L280 TraceCheckUtils]: 1: Hoare triple {84909#true} assume true; {84909#true} is VALID [2020-07-18 05:08:44,717 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {84909#true} {84909#true} #223#return; {84909#true} is VALID [2020-07-18 05:08:44,717 INFO L263 TraceCheckUtils]: 3: Hoare triple {84909#true} call #t~ret9 := main(); {84909#true} is VALID [2020-07-18 05:08:44,718 INFO L280 TraceCheckUtils]: 4: Hoare triple {84909#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {84909#true} is VALID [2020-07-18 05:08:44,718 INFO L280 TraceCheckUtils]: 5: Hoare triple {84909#true} ~p1~0 := #t~nondet0; {84909#true} is VALID [2020-07-18 05:08:44,718 INFO L280 TraceCheckUtils]: 6: Hoare triple {84909#true} havoc #t~nondet0; {84909#true} is VALID [2020-07-18 05:08:44,718 INFO L280 TraceCheckUtils]: 7: Hoare triple {84909#true} havoc ~lk1~0; {84909#true} is VALID [2020-07-18 05:08:44,718 INFO L280 TraceCheckUtils]: 8: Hoare triple {84909#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {84909#true} is VALID [2020-07-18 05:08:44,718 INFO L280 TraceCheckUtils]: 9: Hoare triple {84909#true} ~p2~0 := #t~nondet1; {84909#true} is VALID [2020-07-18 05:08:44,718 INFO L280 TraceCheckUtils]: 10: Hoare triple {84909#true} havoc #t~nondet1; {84909#true} is VALID [2020-07-18 05:08:44,718 INFO L280 TraceCheckUtils]: 11: Hoare triple {84909#true} havoc ~lk2~0; {84909#true} is VALID [2020-07-18 05:08:44,719 INFO L280 TraceCheckUtils]: 12: Hoare triple {84909#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {84909#true} is VALID [2020-07-18 05:08:44,719 INFO L280 TraceCheckUtils]: 13: Hoare triple {84909#true} ~p3~0 := #t~nondet2; {84909#true} is VALID [2020-07-18 05:08:44,719 INFO L280 TraceCheckUtils]: 14: Hoare triple {84909#true} havoc #t~nondet2; {84909#true} is VALID [2020-07-18 05:08:44,719 INFO L280 TraceCheckUtils]: 15: Hoare triple {84909#true} havoc ~lk3~0; {84909#true} is VALID [2020-07-18 05:08:44,719 INFO L280 TraceCheckUtils]: 16: Hoare triple {84909#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {84909#true} is VALID [2020-07-18 05:08:44,720 INFO L280 TraceCheckUtils]: 17: Hoare triple {84909#true} ~p4~0 := #t~nondet3; {84909#true} is VALID [2020-07-18 05:08:44,720 INFO L280 TraceCheckUtils]: 18: Hoare triple {84909#true} havoc #t~nondet3; {84909#true} is VALID [2020-07-18 05:08:44,720 INFO L280 TraceCheckUtils]: 19: Hoare triple {84909#true} havoc ~lk4~0; {84909#true} is VALID [2020-07-18 05:08:44,720 INFO L280 TraceCheckUtils]: 20: Hoare triple {84909#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {84909#true} is VALID [2020-07-18 05:08:44,720 INFO L280 TraceCheckUtils]: 21: Hoare triple {84909#true} ~p5~0 := #t~nondet4; {84909#true} is VALID [2020-07-18 05:08:44,721 INFO L280 TraceCheckUtils]: 22: Hoare triple {84909#true} havoc #t~nondet4; {84909#true} is VALID [2020-07-18 05:08:44,721 INFO L280 TraceCheckUtils]: 23: Hoare triple {84909#true} havoc ~lk5~0; {84909#true} is VALID [2020-07-18 05:08:44,721 INFO L280 TraceCheckUtils]: 24: Hoare triple {84909#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {84909#true} is VALID [2020-07-18 05:08:44,721 INFO L280 TraceCheckUtils]: 25: Hoare triple {84909#true} ~p6~0 := #t~nondet5; {84909#true} is VALID [2020-07-18 05:08:44,721 INFO L280 TraceCheckUtils]: 26: Hoare triple {84909#true} havoc #t~nondet5; {84909#true} is VALID [2020-07-18 05:08:44,721 INFO L280 TraceCheckUtils]: 27: Hoare triple {84909#true} havoc ~lk6~0; {84909#true} is VALID [2020-07-18 05:08:44,722 INFO L280 TraceCheckUtils]: 28: Hoare triple {84909#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {84909#true} is VALID [2020-07-18 05:08:44,722 INFO L280 TraceCheckUtils]: 29: Hoare triple {84909#true} ~p7~0 := #t~nondet6; {84909#true} is VALID [2020-07-18 05:08:44,722 INFO L280 TraceCheckUtils]: 30: Hoare triple {84909#true} havoc #t~nondet6; {84909#true} is VALID [2020-07-18 05:08:44,722 INFO L280 TraceCheckUtils]: 31: Hoare triple {84909#true} havoc ~lk7~0; {84909#true} is VALID [2020-07-18 05:08:44,722 INFO L280 TraceCheckUtils]: 32: Hoare triple {84909#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {84909#true} is VALID [2020-07-18 05:08:44,722 INFO L280 TraceCheckUtils]: 33: Hoare triple {84909#true} ~p8~0 := #t~nondet7; {84909#true} is VALID [2020-07-18 05:08:44,723 INFO L280 TraceCheckUtils]: 34: Hoare triple {84909#true} havoc #t~nondet7; {84909#true} is VALID [2020-07-18 05:08:44,723 INFO L280 TraceCheckUtils]: 35: Hoare triple {84909#true} havoc ~lk8~0; {84909#true} is VALID [2020-07-18 05:08:44,723 INFO L280 TraceCheckUtils]: 36: Hoare triple {84909#true} havoc ~cond~0; {84909#true} is VALID [2020-07-18 05:08:44,723 INFO L280 TraceCheckUtils]: 37: Hoare triple {84909#true} assume !false; {84909#true} is VALID [2020-07-18 05:08:44,723 INFO L280 TraceCheckUtils]: 38: Hoare triple {84909#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {84909#true} is VALID [2020-07-18 05:08:44,723 INFO L280 TraceCheckUtils]: 39: Hoare triple {84909#true} ~cond~0 := #t~nondet8; {84909#true} is VALID [2020-07-18 05:08:44,724 INFO L280 TraceCheckUtils]: 40: Hoare triple {84909#true} havoc #t~nondet8; {84909#true} is VALID [2020-07-18 05:08:44,724 INFO L280 TraceCheckUtils]: 41: Hoare triple {84909#true} assume !(0 == ~cond~0); {84909#true} is VALID [2020-07-18 05:08:44,724 INFO L280 TraceCheckUtils]: 42: Hoare triple {84909#true} ~lk1~0 := 0; {84909#true} is VALID [2020-07-18 05:08:44,724 INFO L280 TraceCheckUtils]: 43: Hoare triple {84909#true} ~lk2~0 := 0; {84909#true} is VALID [2020-07-18 05:08:44,724 INFO L280 TraceCheckUtils]: 44: Hoare triple {84909#true} ~lk3~0 := 0; {84909#true} is VALID [2020-07-18 05:08:44,724 INFO L280 TraceCheckUtils]: 45: Hoare triple {84909#true} ~lk4~0 := 0; {84909#true} is VALID [2020-07-18 05:08:44,725 INFO L280 TraceCheckUtils]: 46: Hoare triple {84909#true} ~lk5~0 := 0; {84909#true} is VALID [2020-07-18 05:08:44,725 INFO L280 TraceCheckUtils]: 47: Hoare triple {84909#true} ~lk6~0 := 0; {84909#true} is VALID [2020-07-18 05:08:44,725 INFO L280 TraceCheckUtils]: 48: Hoare triple {84909#true} ~lk7~0 := 0; {84909#true} is VALID [2020-07-18 05:08:44,725 INFO L280 TraceCheckUtils]: 49: Hoare triple {84909#true} ~lk8~0 := 0; {84909#true} is VALID [2020-07-18 05:08:44,725 INFO L280 TraceCheckUtils]: 50: Hoare triple {84909#true} assume !(0 != ~p1~0); {84909#true} is VALID [2020-07-18 05:08:44,726 INFO L280 TraceCheckUtils]: 51: Hoare triple {84909#true} assume !(0 != ~p2~0); {84909#true} is VALID [2020-07-18 05:08:44,726 INFO L280 TraceCheckUtils]: 52: Hoare triple {84909#true} assume !(0 != ~p3~0); {84909#true} is VALID [2020-07-18 05:08:44,726 INFO L280 TraceCheckUtils]: 53: Hoare triple {84909#true} assume !(0 != ~p4~0); {84909#true} is VALID [2020-07-18 05:08:44,726 INFO L280 TraceCheckUtils]: 54: Hoare triple {84909#true} assume !(0 != ~p5~0); {84909#true} is VALID [2020-07-18 05:08:44,726 INFO L280 TraceCheckUtils]: 55: Hoare triple {84909#true} assume !(0 != ~p6~0); {84909#true} is VALID [2020-07-18 05:08:44,732 INFO L280 TraceCheckUtils]: 56: Hoare triple {84909#true} assume !(0 != ~p7~0); {84913#(= 0 main_~p7~0)} is VALID [2020-07-18 05:08:44,732 INFO L280 TraceCheckUtils]: 57: Hoare triple {84913#(= 0 main_~p7~0)} assume !(0 != ~p8~0); {84913#(= 0 main_~p7~0)} is VALID [2020-07-18 05:08:44,733 INFO L280 TraceCheckUtils]: 58: Hoare triple {84913#(= 0 main_~p7~0)} assume !(0 != ~p1~0); {84913#(= 0 main_~p7~0)} is VALID [2020-07-18 05:08:44,733 INFO L280 TraceCheckUtils]: 59: Hoare triple {84913#(= 0 main_~p7~0)} assume !(0 != ~p2~0); {84913#(= 0 main_~p7~0)} is VALID [2020-07-18 05:08:44,734 INFO L280 TraceCheckUtils]: 60: Hoare triple {84913#(= 0 main_~p7~0)} assume !(0 != ~p3~0); {84913#(= 0 main_~p7~0)} is VALID [2020-07-18 05:08:44,734 INFO L280 TraceCheckUtils]: 61: Hoare triple {84913#(= 0 main_~p7~0)} assume !(0 != ~p4~0); {84913#(= 0 main_~p7~0)} is VALID [2020-07-18 05:08:44,734 INFO L280 TraceCheckUtils]: 62: Hoare triple {84913#(= 0 main_~p7~0)} assume !(0 != ~p5~0); {84913#(= 0 main_~p7~0)} is VALID [2020-07-18 05:08:44,735 INFO L280 TraceCheckUtils]: 63: Hoare triple {84913#(= 0 main_~p7~0)} assume !(0 != ~p6~0); {84913#(= 0 main_~p7~0)} is VALID [2020-07-18 05:08:44,735 INFO L280 TraceCheckUtils]: 64: Hoare triple {84913#(= 0 main_~p7~0)} assume 0 != ~p7~0; {84910#false} is VALID [2020-07-18 05:08:44,736 INFO L280 TraceCheckUtils]: 65: Hoare triple {84910#false} assume 1 != ~lk7~0; {84910#false} is VALID [2020-07-18 05:08:44,736 INFO L280 TraceCheckUtils]: 66: Hoare triple {84910#false} assume !false; {84910#false} is VALID [2020-07-18 05:08:44,738 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-18 05:08:44,739 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [232781420] [2020-07-18 05:08:44,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:08:44,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:08:44,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144840909] [2020-07-18 05:08:44,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2020-07-18 05:08:44,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:08:44,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:08:44,790 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-18 05:08:44,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:08:44,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:08:44,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:08:44,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:08:44,791 INFO L87 Difference]: Start difference. First operand 2855 states and 3622 transitions. Second operand 3 states. [2020-07-18 05:09:04,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:09:04,118 INFO L93 Difference]: Finished difference Result 8299 states and 10536 transitions. [2020-07-18 05:09:04,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:09:04,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2020-07-18 05:09:04,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:09:04,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:09:04,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2020-07-18 05:09:04,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:09:04,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2020-07-18 05:09:04,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 249 transitions. [2020-07-18 05:09:04,356 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-18 05:09:05,341 INFO L225 Difference]: With dead ends: 8299 [2020-07-18 05:09:05,341 INFO L226 Difference]: Without dead ends: 5481 [2020-07-18 05:09:05,345 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-18 05:09:05,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5481 states. [2020-07-18 05:09:21,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5481 to 5479. [2020-07-18 05:09:21,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:09:21,831 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5481 states. Second operand 5479 states. [2020-07-18 05:09:21,831 INFO L74 IsIncluded]: Start isIncluded. First operand 5481 states. Second operand 5479 states. [2020-07-18 05:09:21,831 INFO L87 Difference]: Start difference. First operand 5481 states. Second operand 5479 states. [2020-07-18 05:09:22,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:09:22,713 INFO L93 Difference]: Finished difference Result 5481 states and 6823 transitions. [2020-07-18 05:09:22,713 INFO L276 IsEmpty]: Start isEmpty. Operand 5481 states and 6823 transitions. [2020-07-18 05:09:22,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:09:22,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:09:22,719 INFO L74 IsIncluded]: Start isIncluded. First operand 5479 states. Second operand 5481 states. [2020-07-18 05:09:22,719 INFO L87 Difference]: Start difference. First operand 5479 states. Second operand 5481 states. [2020-07-18 05:09:23,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:09:23,621 INFO L93 Difference]: Finished difference Result 5481 states and 6823 transitions. [2020-07-18 05:09:23,621 INFO L276 IsEmpty]: Start isEmpty. Operand 5481 states and 6823 transitions. [2020-07-18 05:09:23,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:09:23,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:09:23,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:09:23,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:09:23,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5479 states. [2020-07-18 05:09:24,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5479 states to 5479 states and 6822 transitions. [2020-07-18 05:09:24,606 INFO L78 Accepts]: Start accepts. Automaton has 5479 states and 6822 transitions. Word has length 67 [2020-07-18 05:09:24,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:09:24,607 INFO L479 AbstractCegarLoop]: Abstraction has 5479 states and 6822 transitions. [2020-07-18 05:09:24,607 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:09:24,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5479 states and 6822 transitions. [2020-07-18 05:09:34,159 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-18 05:09:34,159 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 6822 transitions. [2020-07-18 05:09:34,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-07-18 05:09:34,163 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:09:34,163 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-18 05:09:34,163 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-18 05:09:34,164 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:09:34,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:09:34,164 INFO L82 PathProgramCache]: Analyzing trace with hash 192792828, now seen corresponding path program 1 times [2020-07-18 05:09:34,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:09:34,164 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [739108831] [2020-07-18 05:09:34,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:09:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:09:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:09:34,211 INFO L280 TraceCheckUtils]: 0: Hoare triple {123434#true} assume true; {123434#true} is VALID [2020-07-18 05:09:34,211 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {123434#true} {123434#true} #223#return; {123434#true} is VALID [2020-07-18 05:09:34,211 INFO L263 TraceCheckUtils]: 0: Hoare triple {123434#true} call ULTIMATE.init(); {123434#true} is VALID [2020-07-18 05:09:34,212 INFO L280 TraceCheckUtils]: 1: Hoare triple {123434#true} assume true; {123434#true} is VALID [2020-07-18 05:09:34,212 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {123434#true} {123434#true} #223#return; {123434#true} is VALID [2020-07-18 05:09:34,212 INFO L263 TraceCheckUtils]: 3: Hoare triple {123434#true} call #t~ret9 := main(); {123434#true} is VALID [2020-07-18 05:09:34,212 INFO L280 TraceCheckUtils]: 4: Hoare triple {123434#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {123434#true} is VALID [2020-07-18 05:09:34,212 INFO L280 TraceCheckUtils]: 5: Hoare triple {123434#true} ~p1~0 := #t~nondet0; {123434#true} is VALID [2020-07-18 05:09:34,213 INFO L280 TraceCheckUtils]: 6: Hoare triple {123434#true} havoc #t~nondet0; {123434#true} is VALID [2020-07-18 05:09:34,213 INFO L280 TraceCheckUtils]: 7: Hoare triple {123434#true} havoc ~lk1~0; {123434#true} is VALID [2020-07-18 05:09:34,213 INFO L280 TraceCheckUtils]: 8: Hoare triple {123434#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {123434#true} is VALID [2020-07-18 05:09:34,213 INFO L280 TraceCheckUtils]: 9: Hoare triple {123434#true} ~p2~0 := #t~nondet1; {123434#true} is VALID [2020-07-18 05:09:34,213 INFO L280 TraceCheckUtils]: 10: Hoare triple {123434#true} havoc #t~nondet1; {123434#true} is VALID [2020-07-18 05:09:34,213 INFO L280 TraceCheckUtils]: 11: Hoare triple {123434#true} havoc ~lk2~0; {123434#true} is VALID [2020-07-18 05:09:34,214 INFO L280 TraceCheckUtils]: 12: Hoare triple {123434#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {123434#true} is VALID [2020-07-18 05:09:34,214 INFO L280 TraceCheckUtils]: 13: Hoare triple {123434#true} ~p3~0 := #t~nondet2; {123434#true} is VALID [2020-07-18 05:09:34,214 INFO L280 TraceCheckUtils]: 14: Hoare triple {123434#true} havoc #t~nondet2; {123434#true} is VALID [2020-07-18 05:09:34,214 INFO L280 TraceCheckUtils]: 15: Hoare triple {123434#true} havoc ~lk3~0; {123434#true} is VALID [2020-07-18 05:09:34,214 INFO L280 TraceCheckUtils]: 16: Hoare triple {123434#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {123434#true} is VALID [2020-07-18 05:09:34,214 INFO L280 TraceCheckUtils]: 17: Hoare triple {123434#true} ~p4~0 := #t~nondet3; {123434#true} is VALID [2020-07-18 05:09:34,215 INFO L280 TraceCheckUtils]: 18: Hoare triple {123434#true} havoc #t~nondet3; {123434#true} is VALID [2020-07-18 05:09:34,215 INFO L280 TraceCheckUtils]: 19: Hoare triple {123434#true} havoc ~lk4~0; {123434#true} is VALID [2020-07-18 05:09:34,215 INFO L280 TraceCheckUtils]: 20: Hoare triple {123434#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {123434#true} is VALID [2020-07-18 05:09:34,215 INFO L280 TraceCheckUtils]: 21: Hoare triple {123434#true} ~p5~0 := #t~nondet4; {123434#true} is VALID [2020-07-18 05:09:34,215 INFO L280 TraceCheckUtils]: 22: Hoare triple {123434#true} havoc #t~nondet4; {123434#true} is VALID [2020-07-18 05:09:34,215 INFO L280 TraceCheckUtils]: 23: Hoare triple {123434#true} havoc ~lk5~0; {123434#true} is VALID [2020-07-18 05:09:34,216 INFO L280 TraceCheckUtils]: 24: Hoare triple {123434#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {123434#true} is VALID [2020-07-18 05:09:34,216 INFO L280 TraceCheckUtils]: 25: Hoare triple {123434#true} ~p6~0 := #t~nondet5; {123434#true} is VALID [2020-07-18 05:09:34,216 INFO L280 TraceCheckUtils]: 26: Hoare triple {123434#true} havoc #t~nondet5; {123434#true} is VALID [2020-07-18 05:09:34,216 INFO L280 TraceCheckUtils]: 27: Hoare triple {123434#true} havoc ~lk6~0; {123434#true} is VALID [2020-07-18 05:09:34,216 INFO L280 TraceCheckUtils]: 28: Hoare triple {123434#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {123434#true} is VALID [2020-07-18 05:09:34,216 INFO L280 TraceCheckUtils]: 29: Hoare triple {123434#true} ~p7~0 := #t~nondet6; {123434#true} is VALID [2020-07-18 05:09:34,217 INFO L280 TraceCheckUtils]: 30: Hoare triple {123434#true} havoc #t~nondet6; {123434#true} is VALID [2020-07-18 05:09:34,217 INFO L280 TraceCheckUtils]: 31: Hoare triple {123434#true} havoc ~lk7~0; {123434#true} is VALID [2020-07-18 05:09:34,217 INFO L280 TraceCheckUtils]: 32: Hoare triple {123434#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {123434#true} is VALID [2020-07-18 05:09:34,217 INFO L280 TraceCheckUtils]: 33: Hoare triple {123434#true} ~p8~0 := #t~nondet7; {123434#true} is VALID [2020-07-18 05:09:34,217 INFO L280 TraceCheckUtils]: 34: Hoare triple {123434#true} havoc #t~nondet7; {123434#true} is VALID [2020-07-18 05:09:34,217 INFO L280 TraceCheckUtils]: 35: Hoare triple {123434#true} havoc ~lk8~0; {123434#true} is VALID [2020-07-18 05:09:34,218 INFO L280 TraceCheckUtils]: 36: Hoare triple {123434#true} havoc ~cond~0; {123434#true} is VALID [2020-07-18 05:09:34,218 INFO L280 TraceCheckUtils]: 37: Hoare triple {123434#true} assume !false; {123434#true} is VALID [2020-07-18 05:09:34,218 INFO L280 TraceCheckUtils]: 38: Hoare triple {123434#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {123434#true} is VALID [2020-07-18 05:09:34,218 INFO L280 TraceCheckUtils]: 39: Hoare triple {123434#true} ~cond~0 := #t~nondet8; {123434#true} is VALID [2020-07-18 05:09:34,218 INFO L280 TraceCheckUtils]: 40: Hoare triple {123434#true} havoc #t~nondet8; {123434#true} is VALID [2020-07-18 05:09:34,218 INFO L280 TraceCheckUtils]: 41: Hoare triple {123434#true} assume !(0 == ~cond~0); {123434#true} is VALID [2020-07-18 05:09:34,219 INFO L280 TraceCheckUtils]: 42: Hoare triple {123434#true} ~lk1~0 := 0; {123434#true} is VALID [2020-07-18 05:09:34,219 INFO L280 TraceCheckUtils]: 43: Hoare triple {123434#true} ~lk2~0 := 0; {123434#true} is VALID [2020-07-18 05:09:34,219 INFO L280 TraceCheckUtils]: 44: Hoare triple {123434#true} ~lk3~0 := 0; {123434#true} is VALID [2020-07-18 05:09:34,219 INFO L280 TraceCheckUtils]: 45: Hoare triple {123434#true} ~lk4~0 := 0; {123434#true} is VALID [2020-07-18 05:09:34,219 INFO L280 TraceCheckUtils]: 46: Hoare triple {123434#true} ~lk5~0 := 0; {123434#true} is VALID [2020-07-18 05:09:34,220 INFO L280 TraceCheckUtils]: 47: Hoare triple {123434#true} ~lk6~0 := 0; {123434#true} is VALID [2020-07-18 05:09:34,220 INFO L280 TraceCheckUtils]: 48: Hoare triple {123434#true} ~lk7~0 := 0; {123434#true} is VALID [2020-07-18 05:09:34,220 INFO L280 TraceCheckUtils]: 49: Hoare triple {123434#true} ~lk8~0 := 0; {123434#true} is VALID [2020-07-18 05:09:34,220 INFO L280 TraceCheckUtils]: 50: Hoare triple {123434#true} assume !(0 != ~p1~0); {123434#true} is VALID [2020-07-18 05:09:34,220 INFO L280 TraceCheckUtils]: 51: Hoare triple {123434#true} assume !(0 != ~p2~0); {123434#true} is VALID [2020-07-18 05:09:34,220 INFO L280 TraceCheckUtils]: 52: Hoare triple {123434#true} assume !(0 != ~p3~0); {123434#true} is VALID [2020-07-18 05:09:34,221 INFO L280 TraceCheckUtils]: 53: Hoare triple {123434#true} assume !(0 != ~p4~0); {123434#true} is VALID [2020-07-18 05:09:34,221 INFO L280 TraceCheckUtils]: 54: Hoare triple {123434#true} assume !(0 != ~p5~0); {123434#true} is VALID [2020-07-18 05:09:34,221 INFO L280 TraceCheckUtils]: 55: Hoare triple {123434#true} assume !(0 != ~p6~0); {123434#true} is VALID [2020-07-18 05:09:34,221 INFO L280 TraceCheckUtils]: 56: Hoare triple {123434#true} assume 0 != ~p7~0; {123434#true} is VALID [2020-07-18 05:09:34,222 INFO L280 TraceCheckUtils]: 57: Hoare triple {123434#true} ~lk7~0 := 1; {123438#(= main_~lk7~0 1)} is VALID [2020-07-18 05:09:34,222 INFO L280 TraceCheckUtils]: 58: Hoare triple {123438#(= main_~lk7~0 1)} assume !(0 != ~p8~0); {123438#(= main_~lk7~0 1)} is VALID [2020-07-18 05:09:34,223 INFO L280 TraceCheckUtils]: 59: Hoare triple {123438#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {123438#(= main_~lk7~0 1)} is VALID [2020-07-18 05:09:34,223 INFO L280 TraceCheckUtils]: 60: Hoare triple {123438#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {123438#(= main_~lk7~0 1)} is VALID [2020-07-18 05:09:34,224 INFO L280 TraceCheckUtils]: 61: Hoare triple {123438#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {123438#(= main_~lk7~0 1)} is VALID [2020-07-18 05:09:34,224 INFO L280 TraceCheckUtils]: 62: Hoare triple {123438#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {123438#(= main_~lk7~0 1)} is VALID [2020-07-18 05:09:34,225 INFO L280 TraceCheckUtils]: 63: Hoare triple {123438#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {123438#(= main_~lk7~0 1)} is VALID [2020-07-18 05:09:34,225 INFO L280 TraceCheckUtils]: 64: Hoare triple {123438#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {123438#(= main_~lk7~0 1)} is VALID [2020-07-18 05:09:34,226 INFO L280 TraceCheckUtils]: 65: Hoare triple {123438#(= main_~lk7~0 1)} assume 0 != ~p7~0; {123438#(= main_~lk7~0 1)} is VALID [2020-07-18 05:09:34,226 INFO L280 TraceCheckUtils]: 66: Hoare triple {123438#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {123435#false} is VALID [2020-07-18 05:09:34,226 INFO L280 TraceCheckUtils]: 67: Hoare triple {123435#false} assume !false; {123435#false} is VALID [2020-07-18 05:09:34,229 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-18 05:09:34,229 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [739108831] [2020-07-18 05:09:34,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:09:34,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:09:34,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191764147] [2020-07-18 05:09:34,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2020-07-18 05:09:34,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:09:34,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:09:34,285 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-18 05:09:34,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:09:34,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:09:34,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:09:34,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:09:34,286 INFO L87 Difference]: Start difference. First operand 5479 states and 6822 transitions. Second operand 3 states. [2020-07-18 05:09:56,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:09:56,378 INFO L93 Difference]: Finished difference Result 6443 states and 7912 transitions. [2020-07-18 05:09:56,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:09:56,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2020-07-18 05:09:56,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:09:56,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:09:56,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2020-07-18 05:09:56,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:09:56,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2020-07-18 05:09:56,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 156 transitions. [2020-07-18 05:09:56,527 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-18 05:09:58,068 INFO L225 Difference]: With dead ends: 6443 [2020-07-18 05:09:58,068 INFO L226 Difference]: Without dead ends: 6441 [2020-07-18 05:09:58,070 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-18 05:09:58,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6441 states. [2020-07-18 05:10:15,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6441 to 5479. [2020-07-18 05:10:15,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:10:15,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6441 states. Second operand 5479 states. [2020-07-18 05:10:15,560 INFO L74 IsIncluded]: Start isIncluded. First operand 6441 states. Second operand 5479 states. [2020-07-18 05:10:15,560 INFO L87 Difference]: Start difference. First operand 6441 states. Second operand 5479 states. [2020-07-18 05:10:16,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:10:16,898 INFO L93 Difference]: Finished difference Result 6441 states and 7847 transitions. [2020-07-18 05:10:16,898 INFO L276 IsEmpty]: Start isEmpty. Operand 6441 states and 7847 transitions. [2020-07-18 05:10:16,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:10:16,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:10:16,905 INFO L74 IsIncluded]: Start isIncluded. First operand 5479 states. Second operand 6441 states. [2020-07-18 05:10:16,905 INFO L87 Difference]: Start difference. First operand 5479 states. Second operand 6441 states. [2020-07-18 05:10:18,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:10:18,217 INFO L93 Difference]: Finished difference Result 6441 states and 7847 transitions. [2020-07-18 05:10:18,217 INFO L276 IsEmpty]: Start isEmpty. Operand 6441 states and 7847 transitions. [2020-07-18 05:10:18,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:10:18,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:10:18,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:10:18,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:10:18,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5479 states. [2020-07-18 05:10:19,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5479 states to 5479 states and 6758 transitions. [2020-07-18 05:10:19,167 INFO L78 Accepts]: Start accepts. Automaton has 5479 states and 6758 transitions. Word has length 68 [2020-07-18 05:10:19,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:10:19,167 INFO L479 AbstractCegarLoop]: Abstraction has 5479 states and 6758 transitions. [2020-07-18 05:10:19,167 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:10:19,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5479 states and 6758 transitions. [2020-07-18 05:10:28,628 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-18 05:10:28,628 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 6758 transitions. [2020-07-18 05:10:28,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-07-18 05:10:28,632 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:10:28,632 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-18 05:10:28,632 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-18 05:10:28,632 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:10:28,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:10:28,633 INFO L82 PathProgramCache]: Analyzing trace with hash 868567382, now seen corresponding path program 1 times [2020-07-18 05:10:28,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:10:28,633 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1087809369] [2020-07-18 05:10:28,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:10:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:10:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:10:28,671 INFO L280 TraceCheckUtils]: 0: Hoare triple {160167#true} assume true; {160167#true} is VALID [2020-07-18 05:10:28,671 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {160167#true} {160167#true} #223#return; {160167#true} is VALID [2020-07-18 05:10:28,672 INFO L263 TraceCheckUtils]: 0: Hoare triple {160167#true} call ULTIMATE.init(); {160167#true} is VALID [2020-07-18 05:10:28,672 INFO L280 TraceCheckUtils]: 1: Hoare triple {160167#true} assume true; {160167#true} is VALID [2020-07-18 05:10:28,672 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {160167#true} {160167#true} #223#return; {160167#true} is VALID [2020-07-18 05:10:28,672 INFO L263 TraceCheckUtils]: 3: Hoare triple {160167#true} call #t~ret9 := main(); {160167#true} is VALID [2020-07-18 05:10:28,672 INFO L280 TraceCheckUtils]: 4: Hoare triple {160167#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {160167#true} is VALID [2020-07-18 05:10:28,673 INFO L280 TraceCheckUtils]: 5: Hoare triple {160167#true} ~p1~0 := #t~nondet0; {160167#true} is VALID [2020-07-18 05:10:28,673 INFO L280 TraceCheckUtils]: 6: Hoare triple {160167#true} havoc #t~nondet0; {160167#true} is VALID [2020-07-18 05:10:28,673 INFO L280 TraceCheckUtils]: 7: Hoare triple {160167#true} havoc ~lk1~0; {160167#true} is VALID [2020-07-18 05:10:28,673 INFO L280 TraceCheckUtils]: 8: Hoare triple {160167#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {160167#true} is VALID [2020-07-18 05:10:28,673 INFO L280 TraceCheckUtils]: 9: Hoare triple {160167#true} ~p2~0 := #t~nondet1; {160167#true} is VALID [2020-07-18 05:10:28,673 INFO L280 TraceCheckUtils]: 10: Hoare triple {160167#true} havoc #t~nondet1; {160167#true} is VALID [2020-07-18 05:10:28,674 INFO L280 TraceCheckUtils]: 11: Hoare triple {160167#true} havoc ~lk2~0; {160167#true} is VALID [2020-07-18 05:10:28,674 INFO L280 TraceCheckUtils]: 12: Hoare triple {160167#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {160167#true} is VALID [2020-07-18 05:10:28,674 INFO L280 TraceCheckUtils]: 13: Hoare triple {160167#true} ~p3~0 := #t~nondet2; {160167#true} is VALID [2020-07-18 05:10:28,674 INFO L280 TraceCheckUtils]: 14: Hoare triple {160167#true} havoc #t~nondet2; {160167#true} is VALID [2020-07-18 05:10:28,674 INFO L280 TraceCheckUtils]: 15: Hoare triple {160167#true} havoc ~lk3~0; {160167#true} is VALID [2020-07-18 05:10:28,674 INFO L280 TraceCheckUtils]: 16: Hoare triple {160167#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {160167#true} is VALID [2020-07-18 05:10:28,675 INFO L280 TraceCheckUtils]: 17: Hoare triple {160167#true} ~p4~0 := #t~nondet3; {160167#true} is VALID [2020-07-18 05:10:28,675 INFO L280 TraceCheckUtils]: 18: Hoare triple {160167#true} havoc #t~nondet3; {160167#true} is VALID [2020-07-18 05:10:28,675 INFO L280 TraceCheckUtils]: 19: Hoare triple {160167#true} havoc ~lk4~0; {160167#true} is VALID [2020-07-18 05:10:28,675 INFO L280 TraceCheckUtils]: 20: Hoare triple {160167#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {160167#true} is VALID [2020-07-18 05:10:28,675 INFO L280 TraceCheckUtils]: 21: Hoare triple {160167#true} ~p5~0 := #t~nondet4; {160167#true} is VALID [2020-07-18 05:10:28,675 INFO L280 TraceCheckUtils]: 22: Hoare triple {160167#true} havoc #t~nondet4; {160167#true} is VALID [2020-07-18 05:10:28,676 INFO L280 TraceCheckUtils]: 23: Hoare triple {160167#true} havoc ~lk5~0; {160167#true} is VALID [2020-07-18 05:10:28,676 INFO L280 TraceCheckUtils]: 24: Hoare triple {160167#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {160167#true} is VALID [2020-07-18 05:10:28,676 INFO L280 TraceCheckUtils]: 25: Hoare triple {160167#true} ~p6~0 := #t~nondet5; {160167#true} is VALID [2020-07-18 05:10:28,676 INFO L280 TraceCheckUtils]: 26: Hoare triple {160167#true} havoc #t~nondet5; {160167#true} is VALID [2020-07-18 05:10:28,676 INFO L280 TraceCheckUtils]: 27: Hoare triple {160167#true} havoc ~lk6~0; {160167#true} is VALID [2020-07-18 05:10:28,676 INFO L280 TraceCheckUtils]: 28: Hoare triple {160167#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {160167#true} is VALID [2020-07-18 05:10:28,677 INFO L280 TraceCheckUtils]: 29: Hoare triple {160167#true} ~p7~0 := #t~nondet6; {160167#true} is VALID [2020-07-18 05:10:28,677 INFO L280 TraceCheckUtils]: 30: Hoare triple {160167#true} havoc #t~nondet6; {160167#true} is VALID [2020-07-18 05:10:28,677 INFO L280 TraceCheckUtils]: 31: Hoare triple {160167#true} havoc ~lk7~0; {160167#true} is VALID [2020-07-18 05:10:28,677 INFO L280 TraceCheckUtils]: 32: Hoare triple {160167#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {160167#true} is VALID [2020-07-18 05:10:28,677 INFO L280 TraceCheckUtils]: 33: Hoare triple {160167#true} ~p8~0 := #t~nondet7; {160167#true} is VALID [2020-07-18 05:10:28,677 INFO L280 TraceCheckUtils]: 34: Hoare triple {160167#true} havoc #t~nondet7; {160167#true} is VALID [2020-07-18 05:10:28,678 INFO L280 TraceCheckUtils]: 35: Hoare triple {160167#true} havoc ~lk8~0; {160167#true} is VALID [2020-07-18 05:10:28,678 INFO L280 TraceCheckUtils]: 36: Hoare triple {160167#true} havoc ~cond~0; {160167#true} is VALID [2020-07-18 05:10:28,678 INFO L280 TraceCheckUtils]: 37: Hoare triple {160167#true} assume !false; {160167#true} is VALID [2020-07-18 05:10:28,678 INFO L280 TraceCheckUtils]: 38: Hoare triple {160167#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {160167#true} is VALID [2020-07-18 05:10:28,678 INFO L280 TraceCheckUtils]: 39: Hoare triple {160167#true} ~cond~0 := #t~nondet8; {160167#true} is VALID [2020-07-18 05:10:28,678 INFO L280 TraceCheckUtils]: 40: Hoare triple {160167#true} havoc #t~nondet8; {160167#true} is VALID [2020-07-18 05:10:28,679 INFO L280 TraceCheckUtils]: 41: Hoare triple {160167#true} assume !(0 == ~cond~0); {160167#true} is VALID [2020-07-18 05:10:28,679 INFO L280 TraceCheckUtils]: 42: Hoare triple {160167#true} ~lk1~0 := 0; {160167#true} is VALID [2020-07-18 05:10:28,679 INFO L280 TraceCheckUtils]: 43: Hoare triple {160167#true} ~lk2~0 := 0; {160167#true} is VALID [2020-07-18 05:10:28,679 INFO L280 TraceCheckUtils]: 44: Hoare triple {160167#true} ~lk3~0 := 0; {160167#true} is VALID [2020-07-18 05:10:28,679 INFO L280 TraceCheckUtils]: 45: Hoare triple {160167#true} ~lk4~0 := 0; {160167#true} is VALID [2020-07-18 05:10:28,679 INFO L280 TraceCheckUtils]: 46: Hoare triple {160167#true} ~lk5~0 := 0; {160167#true} is VALID [2020-07-18 05:10:28,680 INFO L280 TraceCheckUtils]: 47: Hoare triple {160167#true} ~lk6~0 := 0; {160167#true} is VALID [2020-07-18 05:10:28,680 INFO L280 TraceCheckUtils]: 48: Hoare triple {160167#true} ~lk7~0 := 0; {160167#true} is VALID [2020-07-18 05:10:28,680 INFO L280 TraceCheckUtils]: 49: Hoare triple {160167#true} ~lk8~0 := 0; {160167#true} is VALID [2020-07-18 05:10:28,680 INFO L280 TraceCheckUtils]: 50: Hoare triple {160167#true} assume !(0 != ~p1~0); {160167#true} is VALID [2020-07-18 05:10:28,680 INFO L280 TraceCheckUtils]: 51: Hoare triple {160167#true} assume !(0 != ~p2~0); {160167#true} is VALID [2020-07-18 05:10:28,680 INFO L280 TraceCheckUtils]: 52: Hoare triple {160167#true} assume !(0 != ~p3~0); {160167#true} is VALID [2020-07-18 05:10:28,681 INFO L280 TraceCheckUtils]: 53: Hoare triple {160167#true} assume !(0 != ~p4~0); {160167#true} is VALID [2020-07-18 05:10:28,681 INFO L280 TraceCheckUtils]: 54: Hoare triple {160167#true} assume !(0 != ~p5~0); {160167#true} is VALID [2020-07-18 05:10:28,681 INFO L280 TraceCheckUtils]: 55: Hoare triple {160167#true} assume !(0 != ~p6~0); {160167#true} is VALID [2020-07-18 05:10:28,681 INFO L280 TraceCheckUtils]: 56: Hoare triple {160167#true} assume !(0 != ~p7~0); {160167#true} is VALID [2020-07-18 05:10:28,682 INFO L280 TraceCheckUtils]: 57: Hoare triple {160167#true} assume !(0 != ~p8~0); {160171#(= 0 main_~p8~0)} is VALID [2020-07-18 05:10:28,682 INFO L280 TraceCheckUtils]: 58: Hoare triple {160171#(= 0 main_~p8~0)} assume !(0 != ~p1~0); {160171#(= 0 main_~p8~0)} is VALID [2020-07-18 05:10:28,683 INFO L280 TraceCheckUtils]: 59: Hoare triple {160171#(= 0 main_~p8~0)} assume !(0 != ~p2~0); {160171#(= 0 main_~p8~0)} is VALID [2020-07-18 05:10:28,683 INFO L280 TraceCheckUtils]: 60: Hoare triple {160171#(= 0 main_~p8~0)} assume !(0 != ~p3~0); {160171#(= 0 main_~p8~0)} is VALID [2020-07-18 05:10:28,684 INFO L280 TraceCheckUtils]: 61: Hoare triple {160171#(= 0 main_~p8~0)} assume !(0 != ~p4~0); {160171#(= 0 main_~p8~0)} is VALID [2020-07-18 05:10:28,684 INFO L280 TraceCheckUtils]: 62: Hoare triple {160171#(= 0 main_~p8~0)} assume !(0 != ~p5~0); {160171#(= 0 main_~p8~0)} is VALID [2020-07-18 05:10:28,685 INFO L280 TraceCheckUtils]: 63: Hoare triple {160171#(= 0 main_~p8~0)} assume !(0 != ~p6~0); {160171#(= 0 main_~p8~0)} is VALID [2020-07-18 05:10:28,685 INFO L280 TraceCheckUtils]: 64: Hoare triple {160171#(= 0 main_~p8~0)} assume !(0 != ~p7~0); {160171#(= 0 main_~p8~0)} is VALID [2020-07-18 05:10:28,686 INFO L280 TraceCheckUtils]: 65: Hoare triple {160171#(= 0 main_~p8~0)} assume 0 != ~p8~0; {160168#false} is VALID [2020-07-18 05:10:28,686 INFO L280 TraceCheckUtils]: 66: Hoare triple {160168#false} assume 1 != ~lk8~0; {160168#false} is VALID [2020-07-18 05:10:28,686 INFO L280 TraceCheckUtils]: 67: Hoare triple {160168#false} assume !false; {160168#false} is VALID [2020-07-18 05:10:28,688 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-18 05:10:28,689 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1087809369] [2020-07-18 05:10:28,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:10:28,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:10:28,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406860617] [2020-07-18 05:10:28,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2020-07-18 05:10:28,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:10:28,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:10:28,741 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-18 05:10:28,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:10:28,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:10:28,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:10:28,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:10:28,742 INFO L87 Difference]: Start difference. First operand 5479 states and 6758 transitions. Second operand 3 states. [2020-07-18 05:11:19,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:11:19,055 INFO L93 Difference]: Finished difference Result 15977 states and 19687 transitions. [2020-07-18 05:11:19,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:11:19,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2020-07-18 05:11:19,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:11:19,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:11:19,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2020-07-18 05:11:19,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:11:19,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2020-07-18 05:11:19,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 245 transitions. [2020-07-18 05:11:19,293 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-18 05:11:20,377 INFO L225 Difference]: With dead ends: 15977 [2020-07-18 05:11:20,377 INFO L226 Difference]: Without dead ends: 5479 [2020-07-18 05:11:20,393 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-18 05:11:20,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2020-07-18 05:11:39,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 5479. [2020-07-18 05:11:39,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:11:39,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5479 states. Second operand 5479 states. [2020-07-18 05:11:39,248 INFO L74 IsIncluded]: Start isIncluded. First operand 5479 states. Second operand 5479 states. [2020-07-18 05:11:39,248 INFO L87 Difference]: Start difference. First operand 5479 states. Second operand 5479 states. [2020-07-18 05:11:40,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:11:40,136 INFO L93 Difference]: Finished difference Result 5479 states and 6502 transitions. [2020-07-18 05:11:40,136 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 6502 transitions. [2020-07-18 05:11:40,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:11:40,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:11:40,143 INFO L74 IsIncluded]: Start isIncluded. First operand 5479 states. Second operand 5479 states. [2020-07-18 05:11:40,143 INFO L87 Difference]: Start difference. First operand 5479 states. Second operand 5479 states. [2020-07-18 05:11:41,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:11:41,035 INFO L93 Difference]: Finished difference Result 5479 states and 6502 transitions. [2020-07-18 05:11:41,035 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 6502 transitions. [2020-07-18 05:11:41,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:11:41,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:11:41,039 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:11:41,039 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:11:41,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5479 states. [2020-07-18 05:11:42,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5479 states to 5479 states and 6502 transitions. [2020-07-18 05:11:42,107 INFO L78 Accepts]: Start accepts. Automaton has 5479 states and 6502 transitions. Word has length 68 [2020-07-18 05:11:42,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:11:42,107 INFO L479 AbstractCegarLoop]: Abstraction has 5479 states and 6502 transitions. [2020-07-18 05:11:42,107 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:11:42,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5479 states and 6502 transitions. [2020-07-18 05:11:51,464 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-18 05:11:51,464 INFO L276 IsEmpty]: Start isEmpty. Operand 5479 states and 6502 transitions. [2020-07-18 05:11:51,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-07-18 05:11:51,467 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:11:51,467 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-18 05:11:51,467 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-18 05:11:51,468 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:11:51,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:11:51,468 INFO L82 PathProgramCache]: Analyzing trace with hash 875079941, now seen corresponding path program 1 times [2020-07-18 05:11:51,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:11:51,468 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1563926101] [2020-07-18 05:11:51,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:11:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:11:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:11:51,498 INFO L280 TraceCheckUtils]: 0: Hoare triple {214044#true} assume true; {214044#true} is VALID [2020-07-18 05:11:51,499 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {214044#true} {214044#true} #223#return; {214044#true} is VALID [2020-07-18 05:11:51,499 INFO L263 TraceCheckUtils]: 0: Hoare triple {214044#true} call ULTIMATE.init(); {214044#true} is VALID [2020-07-18 05:11:51,499 INFO L280 TraceCheckUtils]: 1: Hoare triple {214044#true} assume true; {214044#true} is VALID [2020-07-18 05:11:51,499 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {214044#true} {214044#true} #223#return; {214044#true} is VALID [2020-07-18 05:11:51,500 INFO L263 TraceCheckUtils]: 3: Hoare triple {214044#true} call #t~ret9 := main(); {214044#true} is VALID [2020-07-18 05:11:51,500 INFO L280 TraceCheckUtils]: 4: Hoare triple {214044#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {214044#true} is VALID [2020-07-18 05:11:51,500 INFO L280 TraceCheckUtils]: 5: Hoare triple {214044#true} ~p1~0 := #t~nondet0; {214044#true} is VALID [2020-07-18 05:11:51,500 INFO L280 TraceCheckUtils]: 6: Hoare triple {214044#true} havoc #t~nondet0; {214044#true} is VALID [2020-07-18 05:11:51,500 INFO L280 TraceCheckUtils]: 7: Hoare triple {214044#true} havoc ~lk1~0; {214044#true} is VALID [2020-07-18 05:11:51,500 INFO L280 TraceCheckUtils]: 8: Hoare triple {214044#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {214044#true} is VALID [2020-07-18 05:11:51,500 INFO L280 TraceCheckUtils]: 9: Hoare triple {214044#true} ~p2~0 := #t~nondet1; {214044#true} is VALID [2020-07-18 05:11:51,500 INFO L280 TraceCheckUtils]: 10: Hoare triple {214044#true} havoc #t~nondet1; {214044#true} is VALID [2020-07-18 05:11:51,501 INFO L280 TraceCheckUtils]: 11: Hoare triple {214044#true} havoc ~lk2~0; {214044#true} is VALID [2020-07-18 05:11:51,501 INFO L280 TraceCheckUtils]: 12: Hoare triple {214044#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {214044#true} is VALID [2020-07-18 05:11:51,501 INFO L280 TraceCheckUtils]: 13: Hoare triple {214044#true} ~p3~0 := #t~nondet2; {214044#true} is VALID [2020-07-18 05:11:51,501 INFO L280 TraceCheckUtils]: 14: Hoare triple {214044#true} havoc #t~nondet2; {214044#true} is VALID [2020-07-18 05:11:51,501 INFO L280 TraceCheckUtils]: 15: Hoare triple {214044#true} havoc ~lk3~0; {214044#true} is VALID [2020-07-18 05:11:51,501 INFO L280 TraceCheckUtils]: 16: Hoare triple {214044#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {214044#true} is VALID [2020-07-18 05:11:51,502 INFO L280 TraceCheckUtils]: 17: Hoare triple {214044#true} ~p4~0 := #t~nondet3; {214044#true} is VALID [2020-07-18 05:11:51,502 INFO L280 TraceCheckUtils]: 18: Hoare triple {214044#true} havoc #t~nondet3; {214044#true} is VALID [2020-07-18 05:11:51,502 INFO L280 TraceCheckUtils]: 19: Hoare triple {214044#true} havoc ~lk4~0; {214044#true} is VALID [2020-07-18 05:11:51,502 INFO L280 TraceCheckUtils]: 20: Hoare triple {214044#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {214044#true} is VALID [2020-07-18 05:11:51,502 INFO L280 TraceCheckUtils]: 21: Hoare triple {214044#true} ~p5~0 := #t~nondet4; {214044#true} is VALID [2020-07-18 05:11:51,502 INFO L280 TraceCheckUtils]: 22: Hoare triple {214044#true} havoc #t~nondet4; {214044#true} is VALID [2020-07-18 05:11:51,503 INFO L280 TraceCheckUtils]: 23: Hoare triple {214044#true} havoc ~lk5~0; {214044#true} is VALID [2020-07-18 05:11:51,503 INFO L280 TraceCheckUtils]: 24: Hoare triple {214044#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {214044#true} is VALID [2020-07-18 05:11:51,503 INFO L280 TraceCheckUtils]: 25: Hoare triple {214044#true} ~p6~0 := #t~nondet5; {214044#true} is VALID [2020-07-18 05:11:51,503 INFO L280 TraceCheckUtils]: 26: Hoare triple {214044#true} havoc #t~nondet5; {214044#true} is VALID [2020-07-18 05:11:51,503 INFO L280 TraceCheckUtils]: 27: Hoare triple {214044#true} havoc ~lk6~0; {214044#true} is VALID [2020-07-18 05:11:51,503 INFO L280 TraceCheckUtils]: 28: Hoare triple {214044#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {214044#true} is VALID [2020-07-18 05:11:51,504 INFO L280 TraceCheckUtils]: 29: Hoare triple {214044#true} ~p7~0 := #t~nondet6; {214044#true} is VALID [2020-07-18 05:11:51,504 INFO L280 TraceCheckUtils]: 30: Hoare triple {214044#true} havoc #t~nondet6; {214044#true} is VALID [2020-07-18 05:11:51,504 INFO L280 TraceCheckUtils]: 31: Hoare triple {214044#true} havoc ~lk7~0; {214044#true} is VALID [2020-07-18 05:11:51,504 INFO L280 TraceCheckUtils]: 32: Hoare triple {214044#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {214044#true} is VALID [2020-07-18 05:11:51,504 INFO L280 TraceCheckUtils]: 33: Hoare triple {214044#true} ~p8~0 := #t~nondet7; {214044#true} is VALID [2020-07-18 05:11:51,504 INFO L280 TraceCheckUtils]: 34: Hoare triple {214044#true} havoc #t~nondet7; {214044#true} is VALID [2020-07-18 05:11:51,505 INFO L280 TraceCheckUtils]: 35: Hoare triple {214044#true} havoc ~lk8~0; {214044#true} is VALID [2020-07-18 05:11:51,505 INFO L280 TraceCheckUtils]: 36: Hoare triple {214044#true} havoc ~cond~0; {214044#true} is VALID [2020-07-18 05:11:51,505 INFO L280 TraceCheckUtils]: 37: Hoare triple {214044#true} assume !false; {214044#true} is VALID [2020-07-18 05:11:51,505 INFO L280 TraceCheckUtils]: 38: Hoare triple {214044#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {214044#true} is VALID [2020-07-18 05:11:51,505 INFO L280 TraceCheckUtils]: 39: Hoare triple {214044#true} ~cond~0 := #t~nondet8; {214044#true} is VALID [2020-07-18 05:11:51,505 INFO L280 TraceCheckUtils]: 40: Hoare triple {214044#true} havoc #t~nondet8; {214044#true} is VALID [2020-07-18 05:11:51,506 INFO L280 TraceCheckUtils]: 41: Hoare triple {214044#true} assume !(0 == ~cond~0); {214044#true} is VALID [2020-07-18 05:11:51,506 INFO L280 TraceCheckUtils]: 42: Hoare triple {214044#true} ~lk1~0 := 0; {214044#true} is VALID [2020-07-18 05:11:51,506 INFO L280 TraceCheckUtils]: 43: Hoare triple {214044#true} ~lk2~0 := 0; {214044#true} is VALID [2020-07-18 05:11:51,506 INFO L280 TraceCheckUtils]: 44: Hoare triple {214044#true} ~lk3~0 := 0; {214044#true} is VALID [2020-07-18 05:11:51,506 INFO L280 TraceCheckUtils]: 45: Hoare triple {214044#true} ~lk4~0 := 0; {214044#true} is VALID [2020-07-18 05:11:51,507 INFO L280 TraceCheckUtils]: 46: Hoare triple {214044#true} ~lk5~0 := 0; {214044#true} is VALID [2020-07-18 05:11:51,507 INFO L280 TraceCheckUtils]: 47: Hoare triple {214044#true} ~lk6~0 := 0; {214044#true} is VALID [2020-07-18 05:11:51,507 INFO L280 TraceCheckUtils]: 48: Hoare triple {214044#true} ~lk7~0 := 0; {214044#true} is VALID [2020-07-18 05:11:51,507 INFO L280 TraceCheckUtils]: 49: Hoare triple {214044#true} ~lk8~0 := 0; {214044#true} is VALID [2020-07-18 05:11:51,507 INFO L280 TraceCheckUtils]: 50: Hoare triple {214044#true} assume !(0 != ~p1~0); {214044#true} is VALID [2020-07-18 05:11:51,507 INFO L280 TraceCheckUtils]: 51: Hoare triple {214044#true} assume !(0 != ~p2~0); {214044#true} is VALID [2020-07-18 05:11:51,508 INFO L280 TraceCheckUtils]: 52: Hoare triple {214044#true} assume !(0 != ~p3~0); {214044#true} is VALID [2020-07-18 05:11:51,508 INFO L280 TraceCheckUtils]: 53: Hoare triple {214044#true} assume !(0 != ~p4~0); {214044#true} is VALID [2020-07-18 05:11:51,508 INFO L280 TraceCheckUtils]: 54: Hoare triple {214044#true} assume !(0 != ~p5~0); {214044#true} is VALID [2020-07-18 05:11:51,508 INFO L280 TraceCheckUtils]: 55: Hoare triple {214044#true} assume !(0 != ~p6~0); {214044#true} is VALID [2020-07-18 05:11:51,508 INFO L280 TraceCheckUtils]: 56: Hoare triple {214044#true} assume !(0 != ~p7~0); {214044#true} is VALID [2020-07-18 05:11:51,508 INFO L280 TraceCheckUtils]: 57: Hoare triple {214044#true} assume 0 != ~p8~0; {214044#true} is VALID [2020-07-18 05:11:51,514 INFO L280 TraceCheckUtils]: 58: Hoare triple {214044#true} ~lk8~0 := 1; {214048#(= 1 main_~lk8~0)} is VALID [2020-07-18 05:11:51,514 INFO L280 TraceCheckUtils]: 59: Hoare triple {214048#(= 1 main_~lk8~0)} assume !(0 != ~p1~0); {214048#(= 1 main_~lk8~0)} is VALID [2020-07-18 05:11:51,515 INFO L280 TraceCheckUtils]: 60: Hoare triple {214048#(= 1 main_~lk8~0)} assume !(0 != ~p2~0); {214048#(= 1 main_~lk8~0)} is VALID [2020-07-18 05:11:51,515 INFO L280 TraceCheckUtils]: 61: Hoare triple {214048#(= 1 main_~lk8~0)} assume !(0 != ~p3~0); {214048#(= 1 main_~lk8~0)} is VALID [2020-07-18 05:11:51,516 INFO L280 TraceCheckUtils]: 62: Hoare triple {214048#(= 1 main_~lk8~0)} assume !(0 != ~p4~0); {214048#(= 1 main_~lk8~0)} is VALID [2020-07-18 05:11:51,516 INFO L280 TraceCheckUtils]: 63: Hoare triple {214048#(= 1 main_~lk8~0)} assume !(0 != ~p5~0); {214048#(= 1 main_~lk8~0)} is VALID [2020-07-18 05:11:51,517 INFO L280 TraceCheckUtils]: 64: Hoare triple {214048#(= 1 main_~lk8~0)} assume !(0 != ~p6~0); {214048#(= 1 main_~lk8~0)} is VALID [2020-07-18 05:11:51,517 INFO L280 TraceCheckUtils]: 65: Hoare triple {214048#(= 1 main_~lk8~0)} assume !(0 != ~p7~0); {214048#(= 1 main_~lk8~0)} is VALID [2020-07-18 05:11:51,518 INFO L280 TraceCheckUtils]: 66: Hoare triple {214048#(= 1 main_~lk8~0)} assume 0 != ~p8~0; {214048#(= 1 main_~lk8~0)} is VALID [2020-07-18 05:11:51,518 INFO L280 TraceCheckUtils]: 67: Hoare triple {214048#(= 1 main_~lk8~0)} assume 1 != ~lk8~0; {214045#false} is VALID [2020-07-18 05:11:51,519 INFO L280 TraceCheckUtils]: 68: Hoare triple {214045#false} assume !false; {214045#false} is VALID [2020-07-18 05:11:51,521 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-18 05:11:51,522 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1563926101] [2020-07-18 05:11:51,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:11:51,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:11:51,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626315572] [2020-07-18 05:11:51,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2020-07-18 05:11:51,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:11:51,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:11:51,581 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-18 05:11:51,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:11:51,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:11:51,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:11:51,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:11:51,582 INFO L87 Difference]: Start difference. First operand 5479 states and 6502 transitions. Second operand 3 states. [2020-07-18 05:12:12,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:12:12,222 INFO L93 Difference]: Finished difference Result 5479 states and 6502 transitions. [2020-07-18 05:12:12,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:12:12,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2020-07-18 05:12:12,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:12:12,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:12:12,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2020-07-18 05:12:12,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:12:12,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2020-07-18 05:12:12,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 106 transitions. [2020-07-18 05:12:12,323 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-18 05:12:12,323 INFO L225 Difference]: With dead ends: 5479 [2020-07-18 05:12:12,323 INFO L226 Difference]: Without dead ends: 0 [2020-07-18 05:12:12,333 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:12:12,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-18 05:12:12,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-18 05:12:12,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:12:12,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-18 05:12:12,334 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 05:12:12,334 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 05:12:12,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:12:12,335 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 05:12:12,335 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 05:12:12,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:12:12,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:12:12,335 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 05:12:12,335 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 05:12:12,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:12:12,336 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 05:12:12,336 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 05:12:12,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:12:12,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:12:12,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:12:12,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:12:12,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-18 05:12:12,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-18 05:12:12,337 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2020-07-18 05:12:12,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:12:12,337 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-18 05:12:12,337 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:12:12,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-18 05:12:12,337 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-18 05:12:12,338 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 05:12:12,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:12:12,338 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-18 05:12:12,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-18 05:12:13,180 WARN L193 SmtUtils]: Spent 819.00 ms on a formula simplification. DAG size of input: 289 DAG size of output: 159 [2020-07-18 05:12:13,621 WARN L193 SmtUtils]: Spent 355.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2020-07-18 05:12:13,743 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 57 [2020-07-18 05:12:13,852 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 55 [2020-07-18 05:12:14,162 WARN L193 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 387 DAG size of output: 23 [2020-07-18 05:12:14,400 WARN L193 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 352 DAG size of output: 11 [2020-07-18 05:12:14,658 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2020-07-18 05:12:14,894 WARN L193 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 93 [2020-07-18 05:12:15,097 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 279 DAG size of output: 15 [2020-07-18 05:12:15,431 WARN L193 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 482 DAG size of output: 15 [2020-07-18 05:12:15,637 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 542 DAG size of output: 3 [2020-07-18 05:12:15,811 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 283 DAG size of output: 35 [2020-07-18 05:12:16,218 WARN L193 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 293 DAG size of output: 159 [2020-07-18 05:12:16,559 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 91 [2020-07-18 05:12:17,148 WARN L193 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 671 DAG size of output: 7 [2020-07-18 05:12:17,652 WARN L193 SmtUtils]: Spent 496.00 ms on a formula simplification that was a NOOP. DAG size: 291 [2020-07-18 05:12:17,898 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 298 DAG size of output: 91 [2020-07-18 05:12:18,213 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2020-07-18 05:12:18,373 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 321 DAG size of output: 55 [2020-07-18 05:12:18,677 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 93 [2020-07-18 05:12:19,031 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 542 DAG size of output: 3 [2020-07-18 05:12:21,750 WARN L193 SmtUtils]: Spent 2.71 s on a formula simplification that was a NOOP. DAG size: 159 [2020-07-18 05:12:24,789 WARN L193 SmtUtils]: Spent 2.97 s on a formula simplification that was a NOOP. DAG size: 161 [2020-07-18 05:12:25,217 WARN L193 SmtUtils]: Spent 420.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-18 05:12:25,556 WARN L193 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-18 05:12:28,281 WARN L193 SmtUtils]: Spent 2.65 s on a formula simplification that was a NOOP. DAG size: 159 [2020-07-18 05:12:29,364 WARN L193 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 93 [2020-07-18 05:12:29,535 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-18 05:12:29,737 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-18 05:12:32,378 WARN L193 SmtUtils]: Spent 2.63 s on a formula simplification that was a NOOP. DAG size: 159 [2020-07-18 05:12:32,779 WARN L193 SmtUtils]: Spent 391.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-18 05:12:33,767 WARN L193 SmtUtils]: Spent 899.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-18 05:12:42,193 WARN L193 SmtUtils]: Spent 8.37 s on a formula simplification that was a NOOP. DAG size: 291 [2020-07-18 05:12:43,109 WARN L193 SmtUtils]: Spent 904.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-18 05:12:43,250 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-18 05:12:43,409 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-18 05:12:44,344 WARN L193 SmtUtils]: Spent 891.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-18 05:12:47,261 WARN L193 SmtUtils]: Spent 2.91 s on a formula simplification that was a NOOP. DAG size: 161 [2020-07-18 05:12:47,636 WARN L193 SmtUtils]: Spent 347.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-18 05:12:48,849 WARN L193 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 93 [2020-07-18 05:12:49,203 WARN L193 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-18 05:12:49,341 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-18 05:12:49,381 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-18 05:12:49,381 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-18 05:12:49,381 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-18 05:12:49,381 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 05:12:49,381 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-18 05:12:49,381 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-18 05:12:49,382 INFO L264 CegarLoopResult]: At program point L126(line 126) the Hoare annotation is: (= 1 main_~lk8~0) [2020-07-18 05:12:49,382 INFO L264 CegarLoopResult]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2020-07-18 05:12:49,382 INFO L271 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-07-18 05:12:49,382 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-18 05:12:49,382 INFO L271 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: true [2020-07-18 05:12:49,382 INFO L271 CegarLoopResult]: At program point L27-2(line 27) the Hoare annotation is: true [2020-07-18 05:12:49,383 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 4 135) the Hoare annotation is: true [2020-07-18 05:12:49,385 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-18 05:12:49,385 INFO L271 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: true [2020-07-18 05:12:49,385 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-18 05:12:49,386 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-18 05:12:49,386 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-18 05:12:49,386 INFO L271 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: true [2020-07-18 05:12:49,387 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-18 05:12:49,387 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-18 05:12:49,387 INFO L264 CegarLoopResult]: At program point L127(line 127) the Hoare annotation is: (= 1 main_~lk8~0) [2020-07-18 05:12:49,388 INFO L264 CegarLoopResult]: At program point L61(line 61) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-18 05:12:49,388 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-07-18 05:12:49,388 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-18 05:12:49,388 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-07-18 05:12:49,388 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-07-18 05:12:49,389 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-07-18 05:12:49,389 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-18 05:12:49,390 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-18 05:12:49,390 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-07-18 05:12:49,390 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-07-18 05:12:49,390 INFO L271 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: true [2020-07-18 05:12:49,390 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-18 05:12:49,390 INFO L271 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: true [2020-07-18 05:12:49,390 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-07-18 05:12:49,390 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 4 135) the Hoare annotation is: true [2020-07-18 05:12:49,391 INFO L271 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: true [2020-07-18 05:12:49,391 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-18 05:12:49,392 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) the Hoare annotation is: false [2020-07-18 05:12:49,392 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 135) the Hoare annotation is: true [2020-07-18 05:12:49,392 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-18 05:12:49,392 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-07-18 05:12:49,393 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-18 05:12:49,394 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-18 05:12:49,394 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-18 05:12:49,394 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-18 05:12:49,394 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-07-18 05:12:49,395 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-18 05:12:49,395 INFO L271 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-07-18 05:12:49,396 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-18 05:12:49,396 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-18 05:12:49,396 INFO L271 CegarLoopResult]: At program point L56(lines 56 58) the Hoare annotation is: true [2020-07-18 05:12:49,396 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-18 05:12:49,397 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-18 05:12:49,397 INFO L271 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: true [2020-07-18 05:12:49,397 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-18 05:12:49,397 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-07-18 05:12:49,397 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-07-18 05:12:49,398 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-18 05:12:49,398 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-18 05:12:49,398 INFO L271 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: true [2020-07-18 05:12:49,398 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-07-18 05:12:49,398 INFO L271 CegarLoopResult]: At program point L131(lines 5 135) the Hoare annotation is: true [2020-07-18 05:12:49,398 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-18 05:12:49,399 INFO L271 CegarLoopResult]: At program point L57(line 57) the Hoare annotation is: true [2020-07-18 05:12:49,400 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-18 05:12:49,400 INFO L271 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-07-18 05:12:49,400 INFO L271 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: true [2020-07-18 05:12:49,400 INFO L271 CegarLoopResult]: At program point L24-2(line 24) the Hoare annotation is: true [2020-07-18 05:12:49,401 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-18 05:12:49,401 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-18 05:12:49,401 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-18 05:12:49,403 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-18 05:12:49,403 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-07-18 05:12:49,403 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-18 05:12:49,403 INFO L271 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: true [2020-07-18 05:12:49,404 INFO L271 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-07-18 05:12:49,404 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-07-18 05:12:49,404 INFO L271 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: true [2020-07-18 05:12:49,404 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-07-18 05:12:49,404 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-18 05:12:49,404 INFO L271 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: true [2020-07-18 05:12:49,405 INFO L271 CegarLoopResult]: At program point L34-1(line 34) the Hoare annotation is: true [2020-07-18 05:12:49,405 INFO L271 CegarLoopResult]: At program point L34-2(line 34) the Hoare annotation is: true [2020-07-18 05:12:49,406 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-18 05:12:49,406 INFO L271 CegarLoopResult]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2020-07-18 05:12:49,407 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-18 05:12:49,409 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-18 05:12:49,409 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-18 05:12:49,409 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-07-18 05:12:49,410 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-07-18 05:12:49,410 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-18 05:12:49,410 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-07-18 05:12:49,411 INFO L264 CegarLoopResult]: At program point L134(line 134) the Hoare annotation is: false [2020-07-18 05:12:49,411 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-18 05:12:49,411 INFO L271 CegarLoopResult]: At program point L35(lines 35 37) the Hoare annotation is: true [2020-07-18 05:12:49,411 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-18 05:12:49,567 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-18 05:12:49,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 05:12:49 BoogieIcfgContainer [2020-07-18 05:12:49,578 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 05:12:49,580 INFO L168 Benchmark]: Toolchain (without parser) took 336179.52 ms. Allocated memory was 138.9 MB in the beginning and 745.5 MB in the end (delta: 606.6 MB). Free memory was 103.7 MB in the beginning and 561.1 MB in the end (delta: -457.4 MB). Peak memory consumption was 149.2 MB. Max. memory is 7.1 GB. [2020-07-18 05:12:49,581 INFO L168 Benchmark]: CDTParser took 0.89 ms. Allocated memory is still 138.9 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-18 05:12:49,581 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.60 ms. Allocated memory is still 138.9 MB. Free memory was 103.3 MB in the beginning and 92.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2020-07-18 05:12:49,582 INFO L168 Benchmark]: Boogie Preprocessor took 138.21 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 92.6 MB in the beginning and 180.6 MB in the end (delta: -88.0 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2020-07-18 05:12:49,582 INFO L168 Benchmark]: RCFGBuilder took 613.99 ms. Allocated memory is still 202.9 MB. Free memory was 180.6 MB in the beginning and 144.6 MB in the end (delta: 36.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 7.1 GB. [2020-07-18 05:12:49,583 INFO L168 Benchmark]: TraceAbstraction took 335087.31 ms. Allocated memory was 202.9 MB in the beginning and 745.5 MB in the end (delta: 542.6 MB). Free memory was 144.6 MB in the beginning and 561.1 MB in the end (delta: -416.4 MB). Peak memory consumption was 126.2 MB. Max. memory is 7.1 GB. [2020-07-18 05:12:49,584 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.89 ms. Allocated memory is still 138.9 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 330.60 ms. Allocated memory is still 138.9 MB. Free memory was 103.3 MB in the beginning and 92.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 138.21 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 92.6 MB in the beginning and 180.6 MB in the end (delta: -88.0 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 613.99 ms. Allocated memory is still 202.9 MB. Free memory was 180.6 MB in the beginning and 144.6 MB in the end (delta: 36.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 335087.31 ms. Allocated memory was 202.9 MB in the beginning and 745.5 MB in the end (delta: 542.6 MB). Free memory was 144.6 MB in the beginning and 561.1 MB in the end (delta: -416.4 MB). Peak memory consumption was 126.2 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: 297.7s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 154.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 37.0s, 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: 91.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 2257 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 98 LocationsWithAnnotation, 98 PreInvPairs, 10602 NumberOfFragments, 32360 HoareAnnotationTreeSize, 98 FomulaSimplifications, 323126 FormulaSimplificationTreeSizeReduction, 6.6s HoareSimplificationTime, 98 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 30.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s 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...