/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_7.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 05:07:06,464 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 05:07:06,466 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 05:07:06,478 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 05:07:06,478 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 05:07:06,479 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 05:07:06,481 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 05:07:06,482 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 05:07:06,487 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 05:07:06,488 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 05:07:06,489 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 05:07:06,493 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 05:07:06,494 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 05:07:06,495 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 05:07:06,496 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 05:07:06,498 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 05:07:06,499 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 05:07:06,501 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 05:07:06,503 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 05:07:06,507 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 05:07:06,509 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 05:07:06,510 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 05:07:06,512 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 05:07:06,513 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 05:07:06,517 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 05:07:06,517 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 05:07:06,517 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 05:07:06,520 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 05:07:06,521 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 05:07:06,522 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 05:07:06,522 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 05:07:06,523 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 05:07:06,524 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 05:07:06,525 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 05:07:06,529 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 05:07:06,529 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 05:07:06,531 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 05:07:06,531 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 05:07:06,532 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 05:07:06,532 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 05:07:06,533 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 05:07:06,534 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:06,545 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 05:07:06,546 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 05:07:06,547 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 05:07:06,548 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 05:07:06,548 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 05:07:06,548 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 05:07:06,548 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 05:07:06,548 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 05:07:06,549 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 05:07:06,549 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 05:07:06,550 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 05:07:06,550 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 05:07:06,550 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 05:07:06,550 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 05:07:06,551 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 05:07:06,551 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 05:07:06,551 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 05:07:06,551 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 05:07:06,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 05:07:06,552 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 05:07:06,552 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 05:07:06,552 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 05:07:06,552 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:06,836 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 05:07:06,848 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 05:07:06,852 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 05:07:06,853 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 05:07:06,853 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 05:07:06,854 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_7.c [2020-07-18 05:07:06,934 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cdb92e0d/ca762528b84e42518a0a959ded836390/FLAG0d18309ef [2020-07-18 05:07:07,377 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 05:07:07,378 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2020-07-18 05:07:07,387 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cdb92e0d/ca762528b84e42518a0a959ded836390/FLAG0d18309ef [2020-07-18 05:07:07,774 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cdb92e0d/ca762528b84e42518a0a959ded836390 [2020-07-18 05:07:07,784 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 05:07:07,788 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 05:07:07,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 05:07:07,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 05:07:07,793 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 05:07:07,794 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 05:07:07" (1/1) ... [2020-07-18 05:07:07,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@91b316b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:07:07, skipping insertion in model container [2020-07-18 05:07:07,797 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 05:07:07" (1/1) ... [2020-07-18 05:07:07,805 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 05:07:07,824 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 05:07:08,001 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 05:07:08,005 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 05:07:08,028 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 05:07:08,042 INFO L208 MainTranslator]: Completed translation [2020-07-18 05:07:08,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:07:08 WrapperNode [2020-07-18 05:07:08,043 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 05:07:08,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 05:07:08,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 05:07:08,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 05:07:08,140 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:08" (1/1) ... [2020-07-18 05:07:08,140 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:08" (1/1) ... [2020-07-18 05:07:08,146 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:08" (1/1) ... [2020-07-18 05:07:08,146 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:08" (1/1) ... [2020-07-18 05:07:08,152 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:08" (1/1) ... [2020-07-18 05:07:08,162 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:08" (1/1) ... [2020-07-18 05:07:08,163 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:08" (1/1) ... [2020-07-18 05:07:08,165 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 05:07:08,166 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 05:07:08,166 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 05:07:08,166 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 05:07:08,167 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:07:08" (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:08,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 05:07:08,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 05:07:08,226 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 05:07:08,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 05:07:08,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 05:07:08,226 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 05:07:08,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 05:07:08,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 05:07:08,703 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 05:07:08,703 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-18 05:07:08,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 05:07:08 BoogieIcfgContainer [2020-07-18 05:07:08,707 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 05:07:08,709 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 05:07:08,709 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 05:07:08,712 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 05:07:08,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 05:07:07" (1/3) ... [2020-07-18 05:07:08,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4df157dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 05:07:08, skipping insertion in model container [2020-07-18 05:07:08,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:07:08" (2/3) ... [2020-07-18 05:07:08,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4df157dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 05:07:08, skipping insertion in model container [2020-07-18 05:07:08,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 05:07:08" (3/3) ... [2020-07-18 05:07:08,716 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2020-07-18 05:07:08,726 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 05:07:08,734 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 05:07:08,748 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 05:07:08,770 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 05:07:08,771 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 05:07:08,771 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-18 05:07:08,771 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 05:07:08,771 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 05:07:08,771 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 05:07:08,771 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 05:07:08,772 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 05:07:08,789 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2020-07-18 05:07:08,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-18 05:07:08,802 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:07:08,803 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] [2020-07-18 05:07:08,803 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:07:08,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:07:08,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1826051656, now seen corresponding path program 1 times [2020-07-18 05:07:08,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:07:08,820 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [786678284] [2020-07-18 05:07:08,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:07:08,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:09,054 INFO L280 TraceCheckUtils]: 0: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-18 05:07:09,055 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {91#true} {91#true} #199#return; {91#true} is VALID [2020-07-18 05:07:09,057 INFO L263 TraceCheckUtils]: 0: Hoare triple {91#true} call ULTIMATE.init(); {91#true} is VALID [2020-07-18 05:07:09,057 INFO L280 TraceCheckUtils]: 1: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-18 05:07:09,058 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {91#true} {91#true} #199#return; {91#true} is VALID [2020-07-18 05:07:09,058 INFO L263 TraceCheckUtils]: 3: Hoare triple {91#true} call #t~ret8 := main(); {91#true} is VALID [2020-07-18 05:07:09,058 INFO L280 TraceCheckUtils]: 4: Hoare triple {91#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {91#true} is VALID [2020-07-18 05:07:09,059 INFO L280 TraceCheckUtils]: 5: Hoare triple {91#true} ~p1~0 := #t~nondet0; {91#true} is VALID [2020-07-18 05:07:09,059 INFO L280 TraceCheckUtils]: 6: Hoare triple {91#true} havoc #t~nondet0; {91#true} is VALID [2020-07-18 05:07:09,060 INFO L280 TraceCheckUtils]: 7: Hoare triple {91#true} havoc ~lk1~0; {91#true} is VALID [2020-07-18 05:07:09,060 INFO L280 TraceCheckUtils]: 8: Hoare triple {91#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {91#true} is VALID [2020-07-18 05:07:09,061 INFO L280 TraceCheckUtils]: 9: Hoare triple {91#true} ~p2~0 := #t~nondet1; {91#true} is VALID [2020-07-18 05:07:09,061 INFO L280 TraceCheckUtils]: 10: Hoare triple {91#true} havoc #t~nondet1; {91#true} is VALID [2020-07-18 05:07:09,061 INFO L280 TraceCheckUtils]: 11: Hoare triple {91#true} havoc ~lk2~0; {91#true} is VALID [2020-07-18 05:07:09,062 INFO L280 TraceCheckUtils]: 12: Hoare triple {91#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {91#true} is VALID [2020-07-18 05:07:09,062 INFO L280 TraceCheckUtils]: 13: Hoare triple {91#true} ~p3~0 := #t~nondet2; {91#true} is VALID [2020-07-18 05:07:09,063 INFO L280 TraceCheckUtils]: 14: Hoare triple {91#true} havoc #t~nondet2; {91#true} is VALID [2020-07-18 05:07:09,063 INFO L280 TraceCheckUtils]: 15: Hoare triple {91#true} havoc ~lk3~0; {91#true} is VALID [2020-07-18 05:07:09,063 INFO L280 TraceCheckUtils]: 16: Hoare triple {91#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {91#true} is VALID [2020-07-18 05:07:09,064 INFO L280 TraceCheckUtils]: 17: Hoare triple {91#true} ~p4~0 := #t~nondet3; {91#true} is VALID [2020-07-18 05:07:09,064 INFO L280 TraceCheckUtils]: 18: Hoare triple {91#true} havoc #t~nondet3; {91#true} is VALID [2020-07-18 05:07:09,065 INFO L280 TraceCheckUtils]: 19: Hoare triple {91#true} havoc ~lk4~0; {91#true} is VALID [2020-07-18 05:07:09,065 INFO L280 TraceCheckUtils]: 20: Hoare triple {91#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {91#true} is VALID [2020-07-18 05:07:09,066 INFO L280 TraceCheckUtils]: 21: Hoare triple {91#true} ~p5~0 := #t~nondet4; {91#true} is VALID [2020-07-18 05:07:09,066 INFO L280 TraceCheckUtils]: 22: Hoare triple {91#true} havoc #t~nondet4; {91#true} is VALID [2020-07-18 05:07:09,066 INFO L280 TraceCheckUtils]: 23: Hoare triple {91#true} havoc ~lk5~0; {91#true} is VALID [2020-07-18 05:07:09,067 INFO L280 TraceCheckUtils]: 24: Hoare triple {91#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {91#true} is VALID [2020-07-18 05:07:09,067 INFO L280 TraceCheckUtils]: 25: Hoare triple {91#true} ~p6~0 := #t~nondet5; {91#true} is VALID [2020-07-18 05:07:09,068 INFO L280 TraceCheckUtils]: 26: Hoare triple {91#true} havoc #t~nondet5; {91#true} is VALID [2020-07-18 05:07:09,068 INFO L280 TraceCheckUtils]: 27: Hoare triple {91#true} havoc ~lk6~0; {91#true} is VALID [2020-07-18 05:07:09,068 INFO L280 TraceCheckUtils]: 28: Hoare triple {91#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {91#true} is VALID [2020-07-18 05:07:09,069 INFO L280 TraceCheckUtils]: 29: Hoare triple {91#true} ~p7~0 := #t~nondet6; {91#true} is VALID [2020-07-18 05:07:09,069 INFO L280 TraceCheckUtils]: 30: Hoare triple {91#true} havoc #t~nondet6; {91#true} is VALID [2020-07-18 05:07:09,070 INFO L280 TraceCheckUtils]: 31: Hoare triple {91#true} havoc ~lk7~0; {91#true} is VALID [2020-07-18 05:07:09,070 INFO L280 TraceCheckUtils]: 32: Hoare triple {91#true} havoc ~cond~0; {91#true} is VALID [2020-07-18 05:07:09,070 INFO L280 TraceCheckUtils]: 33: Hoare triple {91#true} assume !false; {91#true} is VALID [2020-07-18 05:07:09,071 INFO L280 TraceCheckUtils]: 34: Hoare triple {91#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {91#true} is VALID [2020-07-18 05:07:09,071 INFO L280 TraceCheckUtils]: 35: Hoare triple {91#true} ~cond~0 := #t~nondet7; {91#true} is VALID [2020-07-18 05:07:09,072 INFO L280 TraceCheckUtils]: 36: Hoare triple {91#true} havoc #t~nondet7; {91#true} is VALID [2020-07-18 05:07:09,072 INFO L280 TraceCheckUtils]: 37: Hoare triple {91#true} assume !(0 == ~cond~0); {91#true} is VALID [2020-07-18 05:07:09,073 INFO L280 TraceCheckUtils]: 38: Hoare triple {91#true} ~lk1~0 := 0; {91#true} is VALID [2020-07-18 05:07:09,073 INFO L280 TraceCheckUtils]: 39: Hoare triple {91#true} ~lk2~0 := 0; {91#true} is VALID [2020-07-18 05:07:09,073 INFO L280 TraceCheckUtils]: 40: Hoare triple {91#true} ~lk3~0 := 0; {91#true} is VALID [2020-07-18 05:07:09,074 INFO L280 TraceCheckUtils]: 41: Hoare triple {91#true} ~lk4~0 := 0; {91#true} is VALID [2020-07-18 05:07:09,074 INFO L280 TraceCheckUtils]: 42: Hoare triple {91#true} ~lk5~0 := 0; {91#true} is VALID [2020-07-18 05:07:09,074 INFO L280 TraceCheckUtils]: 43: Hoare triple {91#true} ~lk6~0 := 0; {91#true} is VALID [2020-07-18 05:07:09,075 INFO L280 TraceCheckUtils]: 44: Hoare triple {91#true} ~lk7~0 := 0; {91#true} is VALID [2020-07-18 05:07:09,076 INFO L280 TraceCheckUtils]: 45: Hoare triple {91#true} assume !(0 != ~p1~0); {95#(= 0 main_~p1~0)} is VALID [2020-07-18 05:07:09,078 INFO L280 TraceCheckUtils]: 46: Hoare triple {95#(= 0 main_~p1~0)} assume !(0 != ~p2~0); {95#(= 0 main_~p1~0)} is VALID [2020-07-18 05:07:09,080 INFO L280 TraceCheckUtils]: 47: Hoare triple {95#(= 0 main_~p1~0)} assume !(0 != ~p3~0); {95#(= 0 main_~p1~0)} is VALID [2020-07-18 05:07:09,081 INFO L280 TraceCheckUtils]: 48: Hoare triple {95#(= 0 main_~p1~0)} assume !(0 != ~p4~0); {95#(= 0 main_~p1~0)} is VALID [2020-07-18 05:07:09,082 INFO L280 TraceCheckUtils]: 49: Hoare triple {95#(= 0 main_~p1~0)} assume !(0 != ~p5~0); {95#(= 0 main_~p1~0)} is VALID [2020-07-18 05:07:09,083 INFO L280 TraceCheckUtils]: 50: Hoare triple {95#(= 0 main_~p1~0)} assume !(0 != ~p6~0); {95#(= 0 main_~p1~0)} is VALID [2020-07-18 05:07:09,084 INFO L280 TraceCheckUtils]: 51: Hoare triple {95#(= 0 main_~p1~0)} assume !(0 != ~p7~0); {95#(= 0 main_~p1~0)} is VALID [2020-07-18 05:07:09,085 INFO L280 TraceCheckUtils]: 52: Hoare triple {95#(= 0 main_~p1~0)} assume 0 != ~p1~0; {92#false} is VALID [2020-07-18 05:07:09,086 INFO L280 TraceCheckUtils]: 53: Hoare triple {92#false} assume 1 != ~lk1~0; {92#false} is VALID [2020-07-18 05:07:09,086 INFO L280 TraceCheckUtils]: 54: Hoare triple {92#false} assume !false; {92#false} is VALID [2020-07-18 05:07:09,097 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:09,098 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [786678284] [2020-07-18 05:07:09,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:07:09,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:07:09,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557896651] [2020-07-18 05:07:09,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-07-18 05:07:09,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:07:09,113 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:07:09,190 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:09,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:07:09,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:07:09,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:07:09,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:09,203 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 3 states. [2020-07-18 05:07:09,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:09,617 INFO L93 Difference]: Finished difference Result 191 states and 260 transitions. [2020-07-18 05:07:09,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:07:09,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-07-18 05:07:09,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:07:09,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:09,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2020-07-18 05:07:09,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:09,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2020-07-18 05:07:09,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 260 transitions. [2020-07-18 05:07:09,943 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 260 edges. 260 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:09,961 INFO L225 Difference]: With dead ends: 191 [2020-07-18 05:07:09,962 INFO L226 Difference]: Without dead ends: 128 [2020-07-18 05:07:09,966 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:09,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-07-18 05:07:10,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2020-07-18 05:07:10,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:07:10,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 126 states. [2020-07-18 05:07:10,091 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 126 states. [2020-07-18 05:07:10,091 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 126 states. [2020-07-18 05:07:10,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:10,103 INFO L93 Difference]: Finished difference Result 128 states and 165 transitions. [2020-07-18 05:07:10,103 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 165 transitions. [2020-07-18 05:07:10,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:10,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:10,105 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 128 states. [2020-07-18 05:07:10,105 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 128 states. [2020-07-18 05:07:10,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:10,116 INFO L93 Difference]: Finished difference Result 128 states and 165 transitions. [2020-07-18 05:07:10,116 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 165 transitions. [2020-07-18 05:07:10,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:10,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:10,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:07:10,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:07:10,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-07-18 05:07:10,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 164 transitions. [2020-07-18 05:07:10,128 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 164 transitions. Word has length 55 [2020-07-18 05:07:10,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:07:10,128 INFO L479 AbstractCegarLoop]: Abstraction has 126 states and 164 transitions. [2020-07-18 05:07:10,128 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:07:10,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 126 states and 164 transitions. [2020-07-18 05:07:10,342 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:10,342 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 164 transitions. [2020-07-18 05:07:10,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-18 05:07:10,344 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:07:10,344 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] [2020-07-18 05:07:10,345 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 05:07:10,345 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:07:10,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:07:10,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1965492109, now seen corresponding path program 1 times [2020-07-18 05:07:10,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:07:10,346 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [142727353] [2020-07-18 05:07:10,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:07:10,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:10,409 INFO L280 TraceCheckUtils]: 0: Hoare triple {988#true} assume true; {988#true} is VALID [2020-07-18 05:07:10,409 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {988#true} {988#true} #199#return; {988#true} is VALID [2020-07-18 05:07:10,410 INFO L263 TraceCheckUtils]: 0: Hoare triple {988#true} call ULTIMATE.init(); {988#true} is VALID [2020-07-18 05:07:10,410 INFO L280 TraceCheckUtils]: 1: Hoare triple {988#true} assume true; {988#true} is VALID [2020-07-18 05:07:10,410 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {988#true} {988#true} #199#return; {988#true} is VALID [2020-07-18 05:07:10,411 INFO L263 TraceCheckUtils]: 3: Hoare triple {988#true} call #t~ret8 := main(); {988#true} is VALID [2020-07-18 05:07:10,411 INFO L280 TraceCheckUtils]: 4: Hoare triple {988#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {988#true} is VALID [2020-07-18 05:07:10,411 INFO L280 TraceCheckUtils]: 5: Hoare triple {988#true} ~p1~0 := #t~nondet0; {988#true} is VALID [2020-07-18 05:07:10,412 INFO L280 TraceCheckUtils]: 6: Hoare triple {988#true} havoc #t~nondet0; {988#true} is VALID [2020-07-18 05:07:10,412 INFO L280 TraceCheckUtils]: 7: Hoare triple {988#true} havoc ~lk1~0; {988#true} is VALID [2020-07-18 05:07:10,412 INFO L280 TraceCheckUtils]: 8: Hoare triple {988#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {988#true} is VALID [2020-07-18 05:07:10,412 INFO L280 TraceCheckUtils]: 9: Hoare triple {988#true} ~p2~0 := #t~nondet1; {988#true} is VALID [2020-07-18 05:07:10,413 INFO L280 TraceCheckUtils]: 10: Hoare triple {988#true} havoc #t~nondet1; {988#true} is VALID [2020-07-18 05:07:10,413 INFO L280 TraceCheckUtils]: 11: Hoare triple {988#true} havoc ~lk2~0; {988#true} is VALID [2020-07-18 05:07:10,413 INFO L280 TraceCheckUtils]: 12: Hoare triple {988#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {988#true} is VALID [2020-07-18 05:07:10,414 INFO L280 TraceCheckUtils]: 13: Hoare triple {988#true} ~p3~0 := #t~nondet2; {988#true} is VALID [2020-07-18 05:07:10,414 INFO L280 TraceCheckUtils]: 14: Hoare triple {988#true} havoc #t~nondet2; {988#true} is VALID [2020-07-18 05:07:10,414 INFO L280 TraceCheckUtils]: 15: Hoare triple {988#true} havoc ~lk3~0; {988#true} is VALID [2020-07-18 05:07:10,414 INFO L280 TraceCheckUtils]: 16: Hoare triple {988#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {988#true} is VALID [2020-07-18 05:07:10,415 INFO L280 TraceCheckUtils]: 17: Hoare triple {988#true} ~p4~0 := #t~nondet3; {988#true} is VALID [2020-07-18 05:07:10,415 INFO L280 TraceCheckUtils]: 18: Hoare triple {988#true} havoc #t~nondet3; {988#true} is VALID [2020-07-18 05:07:10,415 INFO L280 TraceCheckUtils]: 19: Hoare triple {988#true} havoc ~lk4~0; {988#true} is VALID [2020-07-18 05:07:10,416 INFO L280 TraceCheckUtils]: 20: Hoare triple {988#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {988#true} is VALID [2020-07-18 05:07:10,416 INFO L280 TraceCheckUtils]: 21: Hoare triple {988#true} ~p5~0 := #t~nondet4; {988#true} is VALID [2020-07-18 05:07:10,416 INFO L280 TraceCheckUtils]: 22: Hoare triple {988#true} havoc #t~nondet4; {988#true} is VALID [2020-07-18 05:07:10,416 INFO L280 TraceCheckUtils]: 23: Hoare triple {988#true} havoc ~lk5~0; {988#true} is VALID [2020-07-18 05:07:10,417 INFO L280 TraceCheckUtils]: 24: Hoare triple {988#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {988#true} is VALID [2020-07-18 05:07:10,417 INFO L280 TraceCheckUtils]: 25: Hoare triple {988#true} ~p6~0 := #t~nondet5; {988#true} is VALID [2020-07-18 05:07:10,417 INFO L280 TraceCheckUtils]: 26: Hoare triple {988#true} havoc #t~nondet5; {988#true} is VALID [2020-07-18 05:07:10,418 INFO L280 TraceCheckUtils]: 27: Hoare triple {988#true} havoc ~lk6~0; {988#true} is VALID [2020-07-18 05:07:10,418 INFO L280 TraceCheckUtils]: 28: Hoare triple {988#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {988#true} is VALID [2020-07-18 05:07:10,418 INFO L280 TraceCheckUtils]: 29: Hoare triple {988#true} ~p7~0 := #t~nondet6; {988#true} is VALID [2020-07-18 05:07:10,419 INFO L280 TraceCheckUtils]: 30: Hoare triple {988#true} havoc #t~nondet6; {988#true} is VALID [2020-07-18 05:07:10,419 INFO L280 TraceCheckUtils]: 31: Hoare triple {988#true} havoc ~lk7~0; {988#true} is VALID [2020-07-18 05:07:10,419 INFO L280 TraceCheckUtils]: 32: Hoare triple {988#true} havoc ~cond~0; {988#true} is VALID [2020-07-18 05:07:10,419 INFO L280 TraceCheckUtils]: 33: Hoare triple {988#true} assume !false; {988#true} is VALID [2020-07-18 05:07:10,420 INFO L280 TraceCheckUtils]: 34: Hoare triple {988#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {988#true} is VALID [2020-07-18 05:07:10,420 INFO L280 TraceCheckUtils]: 35: Hoare triple {988#true} ~cond~0 := #t~nondet7; {988#true} is VALID [2020-07-18 05:07:10,420 INFO L280 TraceCheckUtils]: 36: Hoare triple {988#true} havoc #t~nondet7; {988#true} is VALID [2020-07-18 05:07:10,421 INFO L280 TraceCheckUtils]: 37: Hoare triple {988#true} assume !(0 == ~cond~0); {988#true} is VALID [2020-07-18 05:07:10,421 INFO L280 TraceCheckUtils]: 38: Hoare triple {988#true} ~lk1~0 := 0; {988#true} is VALID [2020-07-18 05:07:10,421 INFO L280 TraceCheckUtils]: 39: Hoare triple {988#true} ~lk2~0 := 0; {988#true} is VALID [2020-07-18 05:07:10,421 INFO L280 TraceCheckUtils]: 40: Hoare triple {988#true} ~lk3~0 := 0; {988#true} is VALID [2020-07-18 05:07:10,422 INFO L280 TraceCheckUtils]: 41: Hoare triple {988#true} ~lk4~0 := 0; {988#true} is VALID [2020-07-18 05:07:10,422 INFO L280 TraceCheckUtils]: 42: Hoare triple {988#true} ~lk5~0 := 0; {988#true} is VALID [2020-07-18 05:07:10,422 INFO L280 TraceCheckUtils]: 43: Hoare triple {988#true} ~lk6~0 := 0; {988#true} is VALID [2020-07-18 05:07:10,423 INFO L280 TraceCheckUtils]: 44: Hoare triple {988#true} ~lk7~0 := 0; {988#true} is VALID [2020-07-18 05:07:10,423 INFO L280 TraceCheckUtils]: 45: Hoare triple {988#true} assume 0 != ~p1~0; {988#true} is VALID [2020-07-18 05:07:10,424 INFO L280 TraceCheckUtils]: 46: Hoare triple {988#true} ~lk1~0 := 1; {992#(= 1 main_~lk1~0)} is VALID [2020-07-18 05:07:10,425 INFO L280 TraceCheckUtils]: 47: Hoare triple {992#(= 1 main_~lk1~0)} assume !(0 != ~p2~0); {992#(= 1 main_~lk1~0)} is VALID [2020-07-18 05:07:10,425 INFO L280 TraceCheckUtils]: 48: Hoare triple {992#(= 1 main_~lk1~0)} assume !(0 != ~p3~0); {992#(= 1 main_~lk1~0)} is VALID [2020-07-18 05:07:10,426 INFO L280 TraceCheckUtils]: 49: Hoare triple {992#(= 1 main_~lk1~0)} assume !(0 != ~p4~0); {992#(= 1 main_~lk1~0)} is VALID [2020-07-18 05:07:10,427 INFO L280 TraceCheckUtils]: 50: Hoare triple {992#(= 1 main_~lk1~0)} assume !(0 != ~p5~0); {992#(= 1 main_~lk1~0)} is VALID [2020-07-18 05:07:10,427 INFO L280 TraceCheckUtils]: 51: Hoare triple {992#(= 1 main_~lk1~0)} assume !(0 != ~p6~0); {992#(= 1 main_~lk1~0)} is VALID [2020-07-18 05:07:10,428 INFO L280 TraceCheckUtils]: 52: Hoare triple {992#(= 1 main_~lk1~0)} assume !(0 != ~p7~0); {992#(= 1 main_~lk1~0)} is VALID [2020-07-18 05:07:10,428 INFO L280 TraceCheckUtils]: 53: Hoare triple {992#(= 1 main_~lk1~0)} assume 0 != ~p1~0; {992#(= 1 main_~lk1~0)} is VALID [2020-07-18 05:07:10,429 INFO L280 TraceCheckUtils]: 54: Hoare triple {992#(= 1 main_~lk1~0)} assume 1 != ~lk1~0; {989#false} is VALID [2020-07-18 05:07:10,430 INFO L280 TraceCheckUtils]: 55: Hoare triple {989#false} assume !false; {989#false} is VALID [2020-07-18 05:07:10,433 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:10,433 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [142727353] [2020-07-18 05:07:10,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:07:10,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:07:10,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722059075] [2020-07-18 05:07:10,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-07-18 05:07:10,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:07:10,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:07:10,489 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:10,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:07:10,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:07:10,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:07:10,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:10,490 INFO L87 Difference]: Start difference. First operand 126 states and 164 transitions. Second operand 3 states. [2020-07-18 05:07:10,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:10,767 INFO L93 Difference]: Finished difference Result 154 states and 202 transitions. [2020-07-18 05:07:10,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:07:10,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-07-18 05:07:10,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:07:10,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:10,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2020-07-18 05:07:10,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:10,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2020-07-18 05:07:10,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 159 transitions. [2020-07-18 05:07:10,926 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:10,934 INFO L225 Difference]: With dead ends: 154 [2020-07-18 05:07:10,934 INFO L226 Difference]: Without dead ends: 152 [2020-07-18 05:07:10,937 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:10,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-07-18 05:07:11,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 126. [2020-07-18 05:07:11,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:07:11,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand 126 states. [2020-07-18 05:07:11,032 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 126 states. [2020-07-18 05:07:11,032 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 126 states. [2020-07-18 05:07:11,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:11,039 INFO L93 Difference]: Finished difference Result 152 states and 200 transitions. [2020-07-18 05:07:11,040 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 200 transitions. [2020-07-18 05:07:11,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:11,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:11,041 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 152 states. [2020-07-18 05:07:11,041 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 152 states. [2020-07-18 05:07:11,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:11,058 INFO L93 Difference]: Finished difference Result 152 states and 200 transitions. [2020-07-18 05:07:11,058 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 200 transitions. [2020-07-18 05:07:11,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:11,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:11,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:07:11,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:07:11,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-07-18 05:07:11,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 163 transitions. [2020-07-18 05:07:11,074 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 163 transitions. Word has length 56 [2020-07-18 05:07:11,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:07:11,074 INFO L479 AbstractCegarLoop]: Abstraction has 126 states and 163 transitions. [2020-07-18 05:07:11,074 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:07:11,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 126 states and 163 transitions. [2020-07-18 05:07:11,241 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:11,241 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 163 transitions. [2020-07-18 05:07:11,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-18 05:07:11,243 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:07:11,243 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] [2020-07-18 05:07:11,244 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 05:07:11,245 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:07:11,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:07:11,245 INFO L82 PathProgramCache]: Analyzing trace with hash 773271458, now seen corresponding path program 1 times [2020-07-18 05:07:11,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:07:11,245 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2023543497] [2020-07-18 05:07:11,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:07:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:11,341 INFO L280 TraceCheckUtils]: 0: Hoare triple {1859#true} assume true; {1859#true} is VALID [2020-07-18 05:07:11,341 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1859#true} {1859#true} #199#return; {1859#true} is VALID [2020-07-18 05:07:11,342 INFO L263 TraceCheckUtils]: 0: Hoare triple {1859#true} call ULTIMATE.init(); {1859#true} is VALID [2020-07-18 05:07:11,342 INFO L280 TraceCheckUtils]: 1: Hoare triple {1859#true} assume true; {1859#true} is VALID [2020-07-18 05:07:11,342 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1859#true} {1859#true} #199#return; {1859#true} is VALID [2020-07-18 05:07:11,343 INFO L263 TraceCheckUtils]: 3: Hoare triple {1859#true} call #t~ret8 := main(); {1859#true} is VALID [2020-07-18 05:07:11,343 INFO L280 TraceCheckUtils]: 4: Hoare triple {1859#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1859#true} is VALID [2020-07-18 05:07:11,343 INFO L280 TraceCheckUtils]: 5: Hoare triple {1859#true} ~p1~0 := #t~nondet0; {1859#true} is VALID [2020-07-18 05:07:11,343 INFO L280 TraceCheckUtils]: 6: Hoare triple {1859#true} havoc #t~nondet0; {1859#true} is VALID [2020-07-18 05:07:11,344 INFO L280 TraceCheckUtils]: 7: Hoare triple {1859#true} havoc ~lk1~0; {1859#true} is VALID [2020-07-18 05:07:11,344 INFO L280 TraceCheckUtils]: 8: Hoare triple {1859#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1859#true} is VALID [2020-07-18 05:07:11,344 INFO L280 TraceCheckUtils]: 9: Hoare triple {1859#true} ~p2~0 := #t~nondet1; {1859#true} is VALID [2020-07-18 05:07:11,345 INFO L280 TraceCheckUtils]: 10: Hoare triple {1859#true} havoc #t~nondet1; {1859#true} is VALID [2020-07-18 05:07:11,345 INFO L280 TraceCheckUtils]: 11: Hoare triple {1859#true} havoc ~lk2~0; {1859#true} is VALID [2020-07-18 05:07:11,345 INFO L280 TraceCheckUtils]: 12: Hoare triple {1859#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1859#true} is VALID [2020-07-18 05:07:11,345 INFO L280 TraceCheckUtils]: 13: Hoare triple {1859#true} ~p3~0 := #t~nondet2; {1859#true} is VALID [2020-07-18 05:07:11,346 INFO L280 TraceCheckUtils]: 14: Hoare triple {1859#true} havoc #t~nondet2; {1859#true} is VALID [2020-07-18 05:07:11,346 INFO L280 TraceCheckUtils]: 15: Hoare triple {1859#true} havoc ~lk3~0; {1859#true} is VALID [2020-07-18 05:07:11,346 INFO L280 TraceCheckUtils]: 16: Hoare triple {1859#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1859#true} is VALID [2020-07-18 05:07:11,346 INFO L280 TraceCheckUtils]: 17: Hoare triple {1859#true} ~p4~0 := #t~nondet3; {1859#true} is VALID [2020-07-18 05:07:11,347 INFO L280 TraceCheckUtils]: 18: Hoare triple {1859#true} havoc #t~nondet3; {1859#true} is VALID [2020-07-18 05:07:11,347 INFO L280 TraceCheckUtils]: 19: Hoare triple {1859#true} havoc ~lk4~0; {1859#true} is VALID [2020-07-18 05:07:11,347 INFO L280 TraceCheckUtils]: 20: Hoare triple {1859#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1859#true} is VALID [2020-07-18 05:07:11,347 INFO L280 TraceCheckUtils]: 21: Hoare triple {1859#true} ~p5~0 := #t~nondet4; {1859#true} is VALID [2020-07-18 05:07:11,348 INFO L280 TraceCheckUtils]: 22: Hoare triple {1859#true} havoc #t~nondet4; {1859#true} is VALID [2020-07-18 05:07:11,348 INFO L280 TraceCheckUtils]: 23: Hoare triple {1859#true} havoc ~lk5~0; {1859#true} is VALID [2020-07-18 05:07:11,348 INFO L280 TraceCheckUtils]: 24: Hoare triple {1859#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1859#true} is VALID [2020-07-18 05:07:11,348 INFO L280 TraceCheckUtils]: 25: Hoare triple {1859#true} ~p6~0 := #t~nondet5; {1859#true} is VALID [2020-07-18 05:07:11,349 INFO L280 TraceCheckUtils]: 26: Hoare triple {1859#true} havoc #t~nondet5; {1859#true} is VALID [2020-07-18 05:07:11,349 INFO L280 TraceCheckUtils]: 27: Hoare triple {1859#true} havoc ~lk6~0; {1859#true} is VALID [2020-07-18 05:07:11,349 INFO L280 TraceCheckUtils]: 28: Hoare triple {1859#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {1859#true} is VALID [2020-07-18 05:07:11,349 INFO L280 TraceCheckUtils]: 29: Hoare triple {1859#true} ~p7~0 := #t~nondet6; {1859#true} is VALID [2020-07-18 05:07:11,350 INFO L280 TraceCheckUtils]: 30: Hoare triple {1859#true} havoc #t~nondet6; {1859#true} is VALID [2020-07-18 05:07:11,350 INFO L280 TraceCheckUtils]: 31: Hoare triple {1859#true} havoc ~lk7~0; {1859#true} is VALID [2020-07-18 05:07:11,350 INFO L280 TraceCheckUtils]: 32: Hoare triple {1859#true} havoc ~cond~0; {1859#true} is VALID [2020-07-18 05:07:11,350 INFO L280 TraceCheckUtils]: 33: Hoare triple {1859#true} assume !false; {1859#true} is VALID [2020-07-18 05:07:11,351 INFO L280 TraceCheckUtils]: 34: Hoare triple {1859#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {1859#true} is VALID [2020-07-18 05:07:11,351 INFO L280 TraceCheckUtils]: 35: Hoare triple {1859#true} ~cond~0 := #t~nondet7; {1859#true} is VALID [2020-07-18 05:07:11,351 INFO L280 TraceCheckUtils]: 36: Hoare triple {1859#true} havoc #t~nondet7; {1859#true} is VALID [2020-07-18 05:07:11,351 INFO L280 TraceCheckUtils]: 37: Hoare triple {1859#true} assume !(0 == ~cond~0); {1859#true} is VALID [2020-07-18 05:07:11,352 INFO L280 TraceCheckUtils]: 38: Hoare triple {1859#true} ~lk1~0 := 0; {1859#true} is VALID [2020-07-18 05:07:11,352 INFO L280 TraceCheckUtils]: 39: Hoare triple {1859#true} ~lk2~0 := 0; {1859#true} is VALID [2020-07-18 05:07:11,352 INFO L280 TraceCheckUtils]: 40: Hoare triple {1859#true} ~lk3~0 := 0; {1859#true} is VALID [2020-07-18 05:07:11,352 INFO L280 TraceCheckUtils]: 41: Hoare triple {1859#true} ~lk4~0 := 0; {1859#true} is VALID [2020-07-18 05:07:11,353 INFO L280 TraceCheckUtils]: 42: Hoare triple {1859#true} ~lk5~0 := 0; {1859#true} is VALID [2020-07-18 05:07:11,353 INFO L280 TraceCheckUtils]: 43: Hoare triple {1859#true} ~lk6~0 := 0; {1859#true} is VALID [2020-07-18 05:07:11,353 INFO L280 TraceCheckUtils]: 44: Hoare triple {1859#true} ~lk7~0 := 0; {1859#true} is VALID [2020-07-18 05:07:11,353 INFO L280 TraceCheckUtils]: 45: Hoare triple {1859#true} assume !(0 != ~p1~0); {1859#true} is VALID [2020-07-18 05:07:11,354 INFO L280 TraceCheckUtils]: 46: Hoare triple {1859#true} assume !(0 != ~p2~0); {1863#(= 0 main_~p2~0)} is VALID [2020-07-18 05:07:11,355 INFO L280 TraceCheckUtils]: 47: Hoare triple {1863#(= 0 main_~p2~0)} assume !(0 != ~p3~0); {1863#(= 0 main_~p2~0)} is VALID [2020-07-18 05:07:11,355 INFO L280 TraceCheckUtils]: 48: Hoare triple {1863#(= 0 main_~p2~0)} assume !(0 != ~p4~0); {1863#(= 0 main_~p2~0)} is VALID [2020-07-18 05:07:11,356 INFO L280 TraceCheckUtils]: 49: Hoare triple {1863#(= 0 main_~p2~0)} assume !(0 != ~p5~0); {1863#(= 0 main_~p2~0)} is VALID [2020-07-18 05:07:11,357 INFO L280 TraceCheckUtils]: 50: Hoare triple {1863#(= 0 main_~p2~0)} assume !(0 != ~p6~0); {1863#(= 0 main_~p2~0)} is VALID [2020-07-18 05:07:11,357 INFO L280 TraceCheckUtils]: 51: Hoare triple {1863#(= 0 main_~p2~0)} assume !(0 != ~p7~0); {1863#(= 0 main_~p2~0)} is VALID [2020-07-18 05:07:11,358 INFO L280 TraceCheckUtils]: 52: Hoare triple {1863#(= 0 main_~p2~0)} assume !(0 != ~p1~0); {1863#(= 0 main_~p2~0)} is VALID [2020-07-18 05:07:11,358 INFO L280 TraceCheckUtils]: 53: Hoare triple {1863#(= 0 main_~p2~0)} assume 0 != ~p2~0; {1860#false} is VALID [2020-07-18 05:07:11,359 INFO L280 TraceCheckUtils]: 54: Hoare triple {1860#false} assume 1 != ~lk2~0; {1860#false} is VALID [2020-07-18 05:07:11,359 INFO L280 TraceCheckUtils]: 55: Hoare triple {1860#false} assume !false; {1860#false} is VALID [2020-07-18 05:07:11,362 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:11,362 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2023543497] [2020-07-18 05:07:11,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:07:11,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:07:11,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873021710] [2020-07-18 05:07:11,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-07-18 05:07:11,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:07:11,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:07:11,408 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:11,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:07:11,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:07:11,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:07:11,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:11,409 INFO L87 Difference]: Start difference. First operand 126 states and 163 transitions. Second operand 3 states. [2020-07-18 05:07:11,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:11,830 INFO L93 Difference]: Finished difference Result 306 states and 415 transitions. [2020-07-18 05:07:11,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:07:11,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-07-18 05:07:11,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:07:11,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:11,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 233 transitions. [2020-07-18 05:07:11,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:11,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 233 transitions. [2020-07-18 05:07:11,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 233 transitions. [2020-07-18 05:07:12,069 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 233 edges. 233 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:12,075 INFO L225 Difference]: With dead ends: 306 [2020-07-18 05:07:12,075 INFO L226 Difference]: Without dead ends: 213 [2020-07-18 05:07:12,077 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:12,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2020-07-18 05:07:12,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2020-07-18 05:07:12,321 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:07:12,322 INFO L82 GeneralOperation]: Start isEquivalent. First operand 213 states. Second operand 211 states. [2020-07-18 05:07:12,322 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand 211 states. [2020-07-18 05:07:12,322 INFO L87 Difference]: Start difference. First operand 213 states. Second operand 211 states. [2020-07-18 05:07:12,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:12,332 INFO L93 Difference]: Finished difference Result 213 states and 281 transitions. [2020-07-18 05:07:12,332 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 281 transitions. [2020-07-18 05:07:12,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:12,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:12,333 INFO L74 IsIncluded]: Start isIncluded. First operand 211 states. Second operand 213 states. [2020-07-18 05:07:12,333 INFO L87 Difference]: Start difference. First operand 211 states. Second operand 213 states. [2020-07-18 05:07:12,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:12,342 INFO L93 Difference]: Finished difference Result 213 states and 281 transitions. [2020-07-18 05:07:12,342 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 281 transitions. [2020-07-18 05:07:12,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:12,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:12,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:07:12,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:07:12,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-07-18 05:07:12,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 280 transitions. [2020-07-18 05:07:12,353 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 280 transitions. Word has length 56 [2020-07-18 05:07:12,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:07:12,356 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 280 transitions. [2020-07-18 05:07:12,356 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:07:12,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 211 states and 280 transitions. [2020-07-18 05:07:12,674 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 280 edges. 280 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:12,675 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 280 transitions. [2020-07-18 05:07:12,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-18 05:07:12,676 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:07:12,677 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] [2020-07-18 05:07:12,677 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 05:07:12,677 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:07:12,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:07:12,678 INFO L82 PathProgramCache]: Analyzing trace with hash -610540190, now seen corresponding path program 1 times [2020-07-18 05:07:12,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:07:12,678 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [899374889] [2020-07-18 05:07:12,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:07:12,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:12,723 INFO L280 TraceCheckUtils]: 0: Hoare triple {3326#true} assume true; {3326#true} is VALID [2020-07-18 05:07:12,724 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3326#true} {3326#true} #199#return; {3326#true} is VALID [2020-07-18 05:07:12,724 INFO L263 TraceCheckUtils]: 0: Hoare triple {3326#true} call ULTIMATE.init(); {3326#true} is VALID [2020-07-18 05:07:12,724 INFO L280 TraceCheckUtils]: 1: Hoare triple {3326#true} assume true; {3326#true} is VALID [2020-07-18 05:07:12,724 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3326#true} {3326#true} #199#return; {3326#true} is VALID [2020-07-18 05:07:12,725 INFO L263 TraceCheckUtils]: 3: Hoare triple {3326#true} call #t~ret8 := main(); {3326#true} is VALID [2020-07-18 05:07:12,725 INFO L280 TraceCheckUtils]: 4: Hoare triple {3326#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3326#true} is VALID [2020-07-18 05:07:12,725 INFO L280 TraceCheckUtils]: 5: Hoare triple {3326#true} ~p1~0 := #t~nondet0; {3326#true} is VALID [2020-07-18 05:07:12,725 INFO L280 TraceCheckUtils]: 6: Hoare triple {3326#true} havoc #t~nondet0; {3326#true} is VALID [2020-07-18 05:07:12,726 INFO L280 TraceCheckUtils]: 7: Hoare triple {3326#true} havoc ~lk1~0; {3326#true} is VALID [2020-07-18 05:07:12,726 INFO L280 TraceCheckUtils]: 8: Hoare triple {3326#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3326#true} is VALID [2020-07-18 05:07:12,726 INFO L280 TraceCheckUtils]: 9: Hoare triple {3326#true} ~p2~0 := #t~nondet1; {3326#true} is VALID [2020-07-18 05:07:12,727 INFO L280 TraceCheckUtils]: 10: Hoare triple {3326#true} havoc #t~nondet1; {3326#true} is VALID [2020-07-18 05:07:12,727 INFO L280 TraceCheckUtils]: 11: Hoare triple {3326#true} havoc ~lk2~0; {3326#true} is VALID [2020-07-18 05:07:12,727 INFO L280 TraceCheckUtils]: 12: Hoare triple {3326#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3326#true} is VALID [2020-07-18 05:07:12,728 INFO L280 TraceCheckUtils]: 13: Hoare triple {3326#true} ~p3~0 := #t~nondet2; {3326#true} is VALID [2020-07-18 05:07:12,728 INFO L280 TraceCheckUtils]: 14: Hoare triple {3326#true} havoc #t~nondet2; {3326#true} is VALID [2020-07-18 05:07:12,728 INFO L280 TraceCheckUtils]: 15: Hoare triple {3326#true} havoc ~lk3~0; {3326#true} is VALID [2020-07-18 05:07:12,728 INFO L280 TraceCheckUtils]: 16: Hoare triple {3326#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3326#true} is VALID [2020-07-18 05:07:12,729 INFO L280 TraceCheckUtils]: 17: Hoare triple {3326#true} ~p4~0 := #t~nondet3; {3326#true} is VALID [2020-07-18 05:07:12,729 INFO L280 TraceCheckUtils]: 18: Hoare triple {3326#true} havoc #t~nondet3; {3326#true} is VALID [2020-07-18 05:07:12,729 INFO L280 TraceCheckUtils]: 19: Hoare triple {3326#true} havoc ~lk4~0; {3326#true} is VALID [2020-07-18 05:07:12,730 INFO L280 TraceCheckUtils]: 20: Hoare triple {3326#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {3326#true} is VALID [2020-07-18 05:07:12,730 INFO L280 TraceCheckUtils]: 21: Hoare triple {3326#true} ~p5~0 := #t~nondet4; {3326#true} is VALID [2020-07-18 05:07:12,730 INFO L280 TraceCheckUtils]: 22: Hoare triple {3326#true} havoc #t~nondet4; {3326#true} is VALID [2020-07-18 05:07:12,730 INFO L280 TraceCheckUtils]: 23: Hoare triple {3326#true} havoc ~lk5~0; {3326#true} is VALID [2020-07-18 05:07:12,731 INFO L280 TraceCheckUtils]: 24: Hoare triple {3326#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3326#true} is VALID [2020-07-18 05:07:12,731 INFO L280 TraceCheckUtils]: 25: Hoare triple {3326#true} ~p6~0 := #t~nondet5; {3326#true} is VALID [2020-07-18 05:07:12,731 INFO L280 TraceCheckUtils]: 26: Hoare triple {3326#true} havoc #t~nondet5; {3326#true} is VALID [2020-07-18 05:07:12,732 INFO L280 TraceCheckUtils]: 27: Hoare triple {3326#true} havoc ~lk6~0; {3326#true} is VALID [2020-07-18 05:07:12,732 INFO L280 TraceCheckUtils]: 28: Hoare triple {3326#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {3326#true} is VALID [2020-07-18 05:07:12,732 INFO L280 TraceCheckUtils]: 29: Hoare triple {3326#true} ~p7~0 := #t~nondet6; {3326#true} is VALID [2020-07-18 05:07:12,732 INFO L280 TraceCheckUtils]: 30: Hoare triple {3326#true} havoc #t~nondet6; {3326#true} is VALID [2020-07-18 05:07:12,733 INFO L280 TraceCheckUtils]: 31: Hoare triple {3326#true} havoc ~lk7~0; {3326#true} is VALID [2020-07-18 05:07:12,733 INFO L280 TraceCheckUtils]: 32: Hoare triple {3326#true} havoc ~cond~0; {3326#true} is VALID [2020-07-18 05:07:12,733 INFO L280 TraceCheckUtils]: 33: Hoare triple {3326#true} assume !false; {3326#true} is VALID [2020-07-18 05:07:12,734 INFO L280 TraceCheckUtils]: 34: Hoare triple {3326#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {3326#true} is VALID [2020-07-18 05:07:12,734 INFO L280 TraceCheckUtils]: 35: Hoare triple {3326#true} ~cond~0 := #t~nondet7; {3326#true} is VALID [2020-07-18 05:07:12,734 INFO L280 TraceCheckUtils]: 36: Hoare triple {3326#true} havoc #t~nondet7; {3326#true} is VALID [2020-07-18 05:07:12,734 INFO L280 TraceCheckUtils]: 37: Hoare triple {3326#true} assume !(0 == ~cond~0); {3326#true} is VALID [2020-07-18 05:07:12,735 INFO L280 TraceCheckUtils]: 38: Hoare triple {3326#true} ~lk1~0 := 0; {3326#true} is VALID [2020-07-18 05:07:12,735 INFO L280 TraceCheckUtils]: 39: Hoare triple {3326#true} ~lk2~0 := 0; {3326#true} is VALID [2020-07-18 05:07:12,735 INFO L280 TraceCheckUtils]: 40: Hoare triple {3326#true} ~lk3~0 := 0; {3326#true} is VALID [2020-07-18 05:07:12,736 INFO L280 TraceCheckUtils]: 41: Hoare triple {3326#true} ~lk4~0 := 0; {3326#true} is VALID [2020-07-18 05:07:12,736 INFO L280 TraceCheckUtils]: 42: Hoare triple {3326#true} ~lk5~0 := 0; {3326#true} is VALID [2020-07-18 05:07:12,736 INFO L280 TraceCheckUtils]: 43: Hoare triple {3326#true} ~lk6~0 := 0; {3326#true} is VALID [2020-07-18 05:07:12,736 INFO L280 TraceCheckUtils]: 44: Hoare triple {3326#true} ~lk7~0 := 0; {3326#true} is VALID [2020-07-18 05:07:12,737 INFO L280 TraceCheckUtils]: 45: Hoare triple {3326#true} assume !(0 != ~p1~0); {3326#true} is VALID [2020-07-18 05:07:12,737 INFO L280 TraceCheckUtils]: 46: Hoare triple {3326#true} assume 0 != ~p2~0; {3326#true} is VALID [2020-07-18 05:07:12,738 INFO L280 TraceCheckUtils]: 47: Hoare triple {3326#true} ~lk2~0 := 1; {3330#(= 1 main_~lk2~0)} is VALID [2020-07-18 05:07:12,739 INFO L280 TraceCheckUtils]: 48: Hoare triple {3330#(= 1 main_~lk2~0)} assume !(0 != ~p3~0); {3330#(= 1 main_~lk2~0)} is VALID [2020-07-18 05:07:12,739 INFO L280 TraceCheckUtils]: 49: Hoare triple {3330#(= 1 main_~lk2~0)} assume !(0 != ~p4~0); {3330#(= 1 main_~lk2~0)} is VALID [2020-07-18 05:07:12,740 INFO L280 TraceCheckUtils]: 50: Hoare triple {3330#(= 1 main_~lk2~0)} assume !(0 != ~p5~0); {3330#(= 1 main_~lk2~0)} is VALID [2020-07-18 05:07:12,741 INFO L280 TraceCheckUtils]: 51: Hoare triple {3330#(= 1 main_~lk2~0)} assume !(0 != ~p6~0); {3330#(= 1 main_~lk2~0)} is VALID [2020-07-18 05:07:12,741 INFO L280 TraceCheckUtils]: 52: Hoare triple {3330#(= 1 main_~lk2~0)} assume !(0 != ~p7~0); {3330#(= 1 main_~lk2~0)} is VALID [2020-07-18 05:07:12,742 INFO L280 TraceCheckUtils]: 53: Hoare triple {3330#(= 1 main_~lk2~0)} assume !(0 != ~p1~0); {3330#(= 1 main_~lk2~0)} is VALID [2020-07-18 05:07:12,743 INFO L280 TraceCheckUtils]: 54: Hoare triple {3330#(= 1 main_~lk2~0)} assume 0 != ~p2~0; {3330#(= 1 main_~lk2~0)} is VALID [2020-07-18 05:07:12,743 INFO L280 TraceCheckUtils]: 55: Hoare triple {3330#(= 1 main_~lk2~0)} assume 1 != ~lk2~0; {3327#false} is VALID [2020-07-18 05:07:12,744 INFO L280 TraceCheckUtils]: 56: Hoare triple {3327#false} assume !false; {3327#false} is VALID [2020-07-18 05:07:12,748 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:12,749 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [899374889] [2020-07-18 05:07:12,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:07:12,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:07:12,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332685915] [2020-07-18 05:07:12,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2020-07-18 05:07:12,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:07:12,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:07:12,810 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:12,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:07:12,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:07:12,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:07:12,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:12,811 INFO L87 Difference]: Start difference. First operand 211 states and 280 transitions. Second operand 3 states. [2020-07-18 05:07:13,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:13,232 INFO L93 Difference]: Finished difference Result 259 states and 346 transitions. [2020-07-18 05:07:13,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:07:13,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2020-07-18 05:07:13,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:07:13,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:13,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2020-07-18 05:07:13,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:13,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2020-07-18 05:07:13,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 155 transitions. [2020-07-18 05:07:13,379 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:13,386 INFO L225 Difference]: With dead ends: 259 [2020-07-18 05:07:13,386 INFO L226 Difference]: Without dead ends: 257 [2020-07-18 05:07:13,387 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:13,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2020-07-18 05:07:13,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 211. [2020-07-18 05:07:13,623 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:07:13,623 INFO L82 GeneralOperation]: Start isEquivalent. First operand 257 states. Second operand 211 states. [2020-07-18 05:07:13,623 INFO L74 IsIncluded]: Start isIncluded. First operand 257 states. Second operand 211 states. [2020-07-18 05:07:13,624 INFO L87 Difference]: Start difference. First operand 257 states. Second operand 211 states. [2020-07-18 05:07:13,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:13,633 INFO L93 Difference]: Finished difference Result 257 states and 343 transitions. [2020-07-18 05:07:13,633 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 343 transitions. [2020-07-18 05:07:13,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:13,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:13,634 INFO L74 IsIncluded]: Start isIncluded. First operand 211 states. Second operand 257 states. [2020-07-18 05:07:13,635 INFO L87 Difference]: Start difference. First operand 211 states. Second operand 257 states. [2020-07-18 05:07:13,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:13,645 INFO L93 Difference]: Finished difference Result 257 states and 343 transitions. [2020-07-18 05:07:13,645 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 343 transitions. [2020-07-18 05:07:13,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:13,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:13,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:07:13,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:07:13,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-07-18 05:07:13,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 278 transitions. [2020-07-18 05:07:13,653 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 278 transitions. Word has length 57 [2020-07-18 05:07:13,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:07:13,663 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 278 transitions. [2020-07-18 05:07:13,664 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:07:13,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 211 states and 278 transitions. [2020-07-18 05:07:13,945 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 278 edges. 278 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:13,945 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 278 transitions. [2020-07-18 05:07:13,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-18 05:07:13,946 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:07:13,947 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] [2020-07-18 05:07:13,947 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 05:07:13,950 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:07:13,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:07:13,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1798143236, now seen corresponding path program 1 times [2020-07-18 05:07:13,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:07:13,951 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [539727997] [2020-07-18 05:07:13,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:07:13,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:14,015 INFO L280 TraceCheckUtils]: 0: Hoare triple {4787#true} assume true; {4787#true} is VALID [2020-07-18 05:07:14,015 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4787#true} {4787#true} #199#return; {4787#true} is VALID [2020-07-18 05:07:14,016 INFO L263 TraceCheckUtils]: 0: Hoare triple {4787#true} call ULTIMATE.init(); {4787#true} is VALID [2020-07-18 05:07:14,016 INFO L280 TraceCheckUtils]: 1: Hoare triple {4787#true} assume true; {4787#true} is VALID [2020-07-18 05:07:14,016 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4787#true} {4787#true} #199#return; {4787#true} is VALID [2020-07-18 05:07:14,016 INFO L263 TraceCheckUtils]: 3: Hoare triple {4787#true} call #t~ret8 := main(); {4787#true} is VALID [2020-07-18 05:07:14,017 INFO L280 TraceCheckUtils]: 4: Hoare triple {4787#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {4787#true} is VALID [2020-07-18 05:07:14,017 INFO L280 TraceCheckUtils]: 5: Hoare triple {4787#true} ~p1~0 := #t~nondet0; {4787#true} is VALID [2020-07-18 05:07:14,017 INFO L280 TraceCheckUtils]: 6: Hoare triple {4787#true} havoc #t~nondet0; {4787#true} is VALID [2020-07-18 05:07:14,017 INFO L280 TraceCheckUtils]: 7: Hoare triple {4787#true} havoc ~lk1~0; {4787#true} is VALID [2020-07-18 05:07:14,017 INFO L280 TraceCheckUtils]: 8: Hoare triple {4787#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4787#true} is VALID [2020-07-18 05:07:14,018 INFO L280 TraceCheckUtils]: 9: Hoare triple {4787#true} ~p2~0 := #t~nondet1; {4787#true} is VALID [2020-07-18 05:07:14,018 INFO L280 TraceCheckUtils]: 10: Hoare triple {4787#true} havoc #t~nondet1; {4787#true} is VALID [2020-07-18 05:07:14,018 INFO L280 TraceCheckUtils]: 11: Hoare triple {4787#true} havoc ~lk2~0; {4787#true} is VALID [2020-07-18 05:07:14,018 INFO L280 TraceCheckUtils]: 12: Hoare triple {4787#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {4787#true} is VALID [2020-07-18 05:07:14,019 INFO L280 TraceCheckUtils]: 13: Hoare triple {4787#true} ~p3~0 := #t~nondet2; {4787#true} is VALID [2020-07-18 05:07:14,019 INFO L280 TraceCheckUtils]: 14: Hoare triple {4787#true} havoc #t~nondet2; {4787#true} is VALID [2020-07-18 05:07:14,019 INFO L280 TraceCheckUtils]: 15: Hoare triple {4787#true} havoc ~lk3~0; {4787#true} is VALID [2020-07-18 05:07:14,019 INFO L280 TraceCheckUtils]: 16: Hoare triple {4787#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {4787#true} is VALID [2020-07-18 05:07:14,019 INFO L280 TraceCheckUtils]: 17: Hoare triple {4787#true} ~p4~0 := #t~nondet3; {4787#true} is VALID [2020-07-18 05:07:14,020 INFO L280 TraceCheckUtils]: 18: Hoare triple {4787#true} havoc #t~nondet3; {4787#true} is VALID [2020-07-18 05:07:14,020 INFO L280 TraceCheckUtils]: 19: Hoare triple {4787#true} havoc ~lk4~0; {4787#true} is VALID [2020-07-18 05:07:14,020 INFO L280 TraceCheckUtils]: 20: Hoare triple {4787#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {4787#true} is VALID [2020-07-18 05:07:14,020 INFO L280 TraceCheckUtils]: 21: Hoare triple {4787#true} ~p5~0 := #t~nondet4; {4787#true} is VALID [2020-07-18 05:07:14,021 INFO L280 TraceCheckUtils]: 22: Hoare triple {4787#true} havoc #t~nondet4; {4787#true} is VALID [2020-07-18 05:07:14,021 INFO L280 TraceCheckUtils]: 23: Hoare triple {4787#true} havoc ~lk5~0; {4787#true} is VALID [2020-07-18 05:07:14,021 INFO L280 TraceCheckUtils]: 24: Hoare triple {4787#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {4787#true} is VALID [2020-07-18 05:07:14,021 INFO L280 TraceCheckUtils]: 25: Hoare triple {4787#true} ~p6~0 := #t~nondet5; {4787#true} is VALID [2020-07-18 05:07:14,021 INFO L280 TraceCheckUtils]: 26: Hoare triple {4787#true} havoc #t~nondet5; {4787#true} is VALID [2020-07-18 05:07:14,022 INFO L280 TraceCheckUtils]: 27: Hoare triple {4787#true} havoc ~lk6~0; {4787#true} is VALID [2020-07-18 05:07:14,022 INFO L280 TraceCheckUtils]: 28: Hoare triple {4787#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {4787#true} is VALID [2020-07-18 05:07:14,022 INFO L280 TraceCheckUtils]: 29: Hoare triple {4787#true} ~p7~0 := #t~nondet6; {4787#true} is VALID [2020-07-18 05:07:14,022 INFO L280 TraceCheckUtils]: 30: Hoare triple {4787#true} havoc #t~nondet6; {4787#true} is VALID [2020-07-18 05:07:14,023 INFO L280 TraceCheckUtils]: 31: Hoare triple {4787#true} havoc ~lk7~0; {4787#true} is VALID [2020-07-18 05:07:14,023 INFO L280 TraceCheckUtils]: 32: Hoare triple {4787#true} havoc ~cond~0; {4787#true} is VALID [2020-07-18 05:07:14,023 INFO L280 TraceCheckUtils]: 33: Hoare triple {4787#true} assume !false; {4787#true} is VALID [2020-07-18 05:07:14,023 INFO L280 TraceCheckUtils]: 34: Hoare triple {4787#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {4787#true} is VALID [2020-07-18 05:07:14,023 INFO L280 TraceCheckUtils]: 35: Hoare triple {4787#true} ~cond~0 := #t~nondet7; {4787#true} is VALID [2020-07-18 05:07:14,024 INFO L280 TraceCheckUtils]: 36: Hoare triple {4787#true} havoc #t~nondet7; {4787#true} is VALID [2020-07-18 05:07:14,024 INFO L280 TraceCheckUtils]: 37: Hoare triple {4787#true} assume !(0 == ~cond~0); {4787#true} is VALID [2020-07-18 05:07:14,024 INFO L280 TraceCheckUtils]: 38: Hoare triple {4787#true} ~lk1~0 := 0; {4787#true} is VALID [2020-07-18 05:07:14,024 INFO L280 TraceCheckUtils]: 39: Hoare triple {4787#true} ~lk2~0 := 0; {4787#true} is VALID [2020-07-18 05:07:14,025 INFO L280 TraceCheckUtils]: 40: Hoare triple {4787#true} ~lk3~0 := 0; {4787#true} is VALID [2020-07-18 05:07:14,025 INFO L280 TraceCheckUtils]: 41: Hoare triple {4787#true} ~lk4~0 := 0; {4787#true} is VALID [2020-07-18 05:07:14,025 INFO L280 TraceCheckUtils]: 42: Hoare triple {4787#true} ~lk5~0 := 0; {4787#true} is VALID [2020-07-18 05:07:14,025 INFO L280 TraceCheckUtils]: 43: Hoare triple {4787#true} ~lk6~0 := 0; {4787#true} is VALID [2020-07-18 05:07:14,025 INFO L280 TraceCheckUtils]: 44: Hoare triple {4787#true} ~lk7~0 := 0; {4787#true} is VALID [2020-07-18 05:07:14,026 INFO L280 TraceCheckUtils]: 45: Hoare triple {4787#true} assume !(0 != ~p1~0); {4787#true} is VALID [2020-07-18 05:07:14,026 INFO L280 TraceCheckUtils]: 46: Hoare triple {4787#true} assume !(0 != ~p2~0); {4787#true} is VALID [2020-07-18 05:07:14,027 INFO L280 TraceCheckUtils]: 47: Hoare triple {4787#true} assume !(0 != ~p3~0); {4791#(= 0 main_~p3~0)} is VALID [2020-07-18 05:07:14,028 INFO L280 TraceCheckUtils]: 48: Hoare triple {4791#(= 0 main_~p3~0)} assume !(0 != ~p4~0); {4791#(= 0 main_~p3~0)} is VALID [2020-07-18 05:07:14,029 INFO L280 TraceCheckUtils]: 49: Hoare triple {4791#(= 0 main_~p3~0)} assume !(0 != ~p5~0); {4791#(= 0 main_~p3~0)} is VALID [2020-07-18 05:07:14,030 INFO L280 TraceCheckUtils]: 50: Hoare triple {4791#(= 0 main_~p3~0)} assume !(0 != ~p6~0); {4791#(= 0 main_~p3~0)} is VALID [2020-07-18 05:07:14,031 INFO L280 TraceCheckUtils]: 51: Hoare triple {4791#(= 0 main_~p3~0)} assume !(0 != ~p7~0); {4791#(= 0 main_~p3~0)} is VALID [2020-07-18 05:07:14,032 INFO L280 TraceCheckUtils]: 52: Hoare triple {4791#(= 0 main_~p3~0)} assume !(0 != ~p1~0); {4791#(= 0 main_~p3~0)} is VALID [2020-07-18 05:07:14,033 INFO L280 TraceCheckUtils]: 53: Hoare triple {4791#(= 0 main_~p3~0)} assume !(0 != ~p2~0); {4791#(= 0 main_~p3~0)} is VALID [2020-07-18 05:07:14,034 INFO L280 TraceCheckUtils]: 54: Hoare triple {4791#(= 0 main_~p3~0)} assume 0 != ~p3~0; {4788#false} is VALID [2020-07-18 05:07:14,034 INFO L280 TraceCheckUtils]: 55: Hoare triple {4788#false} assume 1 != ~lk3~0; {4788#false} is VALID [2020-07-18 05:07:14,034 INFO L280 TraceCheckUtils]: 56: Hoare triple {4788#false} assume !false; {4788#false} is VALID [2020-07-18 05:07:14,036 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,037 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [539727997] [2020-07-18 05:07:14,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:07:14,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:07:14,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632710828] [2020-07-18 05:07:14,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2020-07-18 05:07:14,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:07:14,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:07:14,085 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:14,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:07:14,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:07:14,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:07:14,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:14,087 INFO L87 Difference]: Start difference. First operand 211 states and 278 transitions. Second operand 3 states. [2020-07-18 05:07:14,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:14,792 INFO L93 Difference]: Finished difference Result 555 states and 752 transitions. [2020-07-18 05:07:14,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:07:14,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2020-07-18 05:07:14,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:07:14,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:14,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2020-07-18 05:07:14,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:14,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2020-07-18 05:07:14,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 230 transitions. [2020-07-18 05:07:15,026 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 230 edges. 230 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:15,035 INFO L225 Difference]: With dead ends: 555 [2020-07-18 05:07:15,035 INFO L226 Difference]: Without dead ends: 377 [2020-07-18 05:07:15,037 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:15,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2020-07-18 05:07:15,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 375. [2020-07-18 05:07:15,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:07:15,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 377 states. Second operand 375 states. [2020-07-18 05:07:15,492 INFO L74 IsIncluded]: Start isIncluded. First operand 377 states. Second operand 375 states. [2020-07-18 05:07:15,492 INFO L87 Difference]: Start difference. First operand 377 states. Second operand 375 states. [2020-07-18 05:07:15,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:15,512 INFO L93 Difference]: Finished difference Result 377 states and 499 transitions. [2020-07-18 05:07:15,512 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 499 transitions. [2020-07-18 05:07:15,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:15,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:15,516 INFO L74 IsIncluded]: Start isIncluded. First operand 375 states. Second operand 377 states. [2020-07-18 05:07:15,516 INFO L87 Difference]: Start difference. First operand 375 states. Second operand 377 states. [2020-07-18 05:07:15,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:15,542 INFO L93 Difference]: Finished difference Result 377 states and 499 transitions. [2020-07-18 05:07:15,542 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 499 transitions. [2020-07-18 05:07:15,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:15,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:15,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:07:15,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:07:15,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-07-18 05:07:15,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 498 transitions. [2020-07-18 05:07:15,558 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 498 transitions. Word has length 57 [2020-07-18 05:07:15,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:07:15,558 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 498 transitions. [2020-07-18 05:07:15,558 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:07:15,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 375 states and 498 transitions. [2020-07-18 05:07:16,124 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 498 edges. 498 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:16,124 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 498 transitions. [2020-07-18 05:07:16,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-18 05:07:16,125 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:07:16,125 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] [2020-07-18 05:07:16,125 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 05:07:16,126 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:07:16,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:07:16,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1136837537, now seen corresponding path program 1 times [2020-07-18 05:07:16,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:07:16,127 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1517146108] [2020-07-18 05:07:16,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:07:16,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:16,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:16,185 INFO L280 TraceCheckUtils]: 0: Hoare triple {7408#true} assume true; {7408#true} is VALID [2020-07-18 05:07:16,186 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {7408#true} {7408#true} #199#return; {7408#true} is VALID [2020-07-18 05:07:16,186 INFO L263 TraceCheckUtils]: 0: Hoare triple {7408#true} call ULTIMATE.init(); {7408#true} is VALID [2020-07-18 05:07:16,186 INFO L280 TraceCheckUtils]: 1: Hoare triple {7408#true} assume true; {7408#true} is VALID [2020-07-18 05:07:16,186 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {7408#true} {7408#true} #199#return; {7408#true} is VALID [2020-07-18 05:07:16,186 INFO L263 TraceCheckUtils]: 3: Hoare triple {7408#true} call #t~ret8 := main(); {7408#true} is VALID [2020-07-18 05:07:16,187 INFO L280 TraceCheckUtils]: 4: Hoare triple {7408#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {7408#true} is VALID [2020-07-18 05:07:16,187 INFO L280 TraceCheckUtils]: 5: Hoare triple {7408#true} ~p1~0 := #t~nondet0; {7408#true} is VALID [2020-07-18 05:07:16,187 INFO L280 TraceCheckUtils]: 6: Hoare triple {7408#true} havoc #t~nondet0; {7408#true} is VALID [2020-07-18 05:07:16,187 INFO L280 TraceCheckUtils]: 7: Hoare triple {7408#true} havoc ~lk1~0; {7408#true} is VALID [2020-07-18 05:07:16,188 INFO L280 TraceCheckUtils]: 8: Hoare triple {7408#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {7408#true} is VALID [2020-07-18 05:07:16,188 INFO L280 TraceCheckUtils]: 9: Hoare triple {7408#true} ~p2~0 := #t~nondet1; {7408#true} is VALID [2020-07-18 05:07:16,188 INFO L280 TraceCheckUtils]: 10: Hoare triple {7408#true} havoc #t~nondet1; {7408#true} is VALID [2020-07-18 05:07:16,188 INFO L280 TraceCheckUtils]: 11: Hoare triple {7408#true} havoc ~lk2~0; {7408#true} is VALID [2020-07-18 05:07:16,188 INFO L280 TraceCheckUtils]: 12: Hoare triple {7408#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {7408#true} is VALID [2020-07-18 05:07:16,189 INFO L280 TraceCheckUtils]: 13: Hoare triple {7408#true} ~p3~0 := #t~nondet2; {7408#true} is VALID [2020-07-18 05:07:16,189 INFO L280 TraceCheckUtils]: 14: Hoare triple {7408#true} havoc #t~nondet2; {7408#true} is VALID [2020-07-18 05:07:16,189 INFO L280 TraceCheckUtils]: 15: Hoare triple {7408#true} havoc ~lk3~0; {7408#true} is VALID [2020-07-18 05:07:16,191 INFO L280 TraceCheckUtils]: 16: Hoare triple {7408#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {7408#true} is VALID [2020-07-18 05:07:16,191 INFO L280 TraceCheckUtils]: 17: Hoare triple {7408#true} ~p4~0 := #t~nondet3; {7408#true} is VALID [2020-07-18 05:07:16,191 INFO L280 TraceCheckUtils]: 18: Hoare triple {7408#true} havoc #t~nondet3; {7408#true} is VALID [2020-07-18 05:07:16,191 INFO L280 TraceCheckUtils]: 19: Hoare triple {7408#true} havoc ~lk4~0; {7408#true} is VALID [2020-07-18 05:07:16,191 INFO L280 TraceCheckUtils]: 20: Hoare triple {7408#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {7408#true} is VALID [2020-07-18 05:07:16,192 INFO L280 TraceCheckUtils]: 21: Hoare triple {7408#true} ~p5~0 := #t~nondet4; {7408#true} is VALID [2020-07-18 05:07:16,192 INFO L280 TraceCheckUtils]: 22: Hoare triple {7408#true} havoc #t~nondet4; {7408#true} is VALID [2020-07-18 05:07:16,193 INFO L280 TraceCheckUtils]: 23: Hoare triple {7408#true} havoc ~lk5~0; {7408#true} is VALID [2020-07-18 05:07:16,193 INFO L280 TraceCheckUtils]: 24: Hoare triple {7408#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {7408#true} is VALID [2020-07-18 05:07:16,193 INFO L280 TraceCheckUtils]: 25: Hoare triple {7408#true} ~p6~0 := #t~nondet5; {7408#true} is VALID [2020-07-18 05:07:16,193 INFO L280 TraceCheckUtils]: 26: Hoare triple {7408#true} havoc #t~nondet5; {7408#true} is VALID [2020-07-18 05:07:16,193 INFO L280 TraceCheckUtils]: 27: Hoare triple {7408#true} havoc ~lk6~0; {7408#true} is VALID [2020-07-18 05:07:16,194 INFO L280 TraceCheckUtils]: 28: Hoare triple {7408#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {7408#true} is VALID [2020-07-18 05:07:16,194 INFO L280 TraceCheckUtils]: 29: Hoare triple {7408#true} ~p7~0 := #t~nondet6; {7408#true} is VALID [2020-07-18 05:07:16,194 INFO L280 TraceCheckUtils]: 30: Hoare triple {7408#true} havoc #t~nondet6; {7408#true} is VALID [2020-07-18 05:07:16,197 INFO L280 TraceCheckUtils]: 31: Hoare triple {7408#true} havoc ~lk7~0; {7408#true} is VALID [2020-07-18 05:07:16,197 INFO L280 TraceCheckUtils]: 32: Hoare triple {7408#true} havoc ~cond~0; {7408#true} is VALID [2020-07-18 05:07:16,197 INFO L280 TraceCheckUtils]: 33: Hoare triple {7408#true} assume !false; {7408#true} is VALID [2020-07-18 05:07:16,197 INFO L280 TraceCheckUtils]: 34: Hoare triple {7408#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {7408#true} is VALID [2020-07-18 05:07:16,198 INFO L280 TraceCheckUtils]: 35: Hoare triple {7408#true} ~cond~0 := #t~nondet7; {7408#true} is VALID [2020-07-18 05:07:16,198 INFO L280 TraceCheckUtils]: 36: Hoare triple {7408#true} havoc #t~nondet7; {7408#true} is VALID [2020-07-18 05:07:16,198 INFO L280 TraceCheckUtils]: 37: Hoare triple {7408#true} assume !(0 == ~cond~0); {7408#true} is VALID [2020-07-18 05:07:16,198 INFO L280 TraceCheckUtils]: 38: Hoare triple {7408#true} ~lk1~0 := 0; {7408#true} is VALID [2020-07-18 05:07:16,198 INFO L280 TraceCheckUtils]: 39: Hoare triple {7408#true} ~lk2~0 := 0; {7408#true} is VALID [2020-07-18 05:07:16,199 INFO L280 TraceCheckUtils]: 40: Hoare triple {7408#true} ~lk3~0 := 0; {7408#true} is VALID [2020-07-18 05:07:16,199 INFO L280 TraceCheckUtils]: 41: Hoare triple {7408#true} ~lk4~0 := 0; {7408#true} is VALID [2020-07-18 05:07:16,199 INFO L280 TraceCheckUtils]: 42: Hoare triple {7408#true} ~lk5~0 := 0; {7408#true} is VALID [2020-07-18 05:07:16,199 INFO L280 TraceCheckUtils]: 43: Hoare triple {7408#true} ~lk6~0 := 0; {7408#true} is VALID [2020-07-18 05:07:16,200 INFO L280 TraceCheckUtils]: 44: Hoare triple {7408#true} ~lk7~0 := 0; {7408#true} is VALID [2020-07-18 05:07:16,200 INFO L280 TraceCheckUtils]: 45: Hoare triple {7408#true} assume !(0 != ~p1~0); {7408#true} is VALID [2020-07-18 05:07:16,200 INFO L280 TraceCheckUtils]: 46: Hoare triple {7408#true} assume !(0 != ~p2~0); {7408#true} is VALID [2020-07-18 05:07:16,200 INFO L280 TraceCheckUtils]: 47: Hoare triple {7408#true} assume 0 != ~p3~0; {7408#true} is VALID [2020-07-18 05:07:16,201 INFO L280 TraceCheckUtils]: 48: Hoare triple {7408#true} ~lk3~0 := 1; {7412#(= 1 main_~lk3~0)} is VALID [2020-07-18 05:07:16,201 INFO L280 TraceCheckUtils]: 49: Hoare triple {7412#(= 1 main_~lk3~0)} assume !(0 != ~p4~0); {7412#(= 1 main_~lk3~0)} is VALID [2020-07-18 05:07:16,202 INFO L280 TraceCheckUtils]: 50: Hoare triple {7412#(= 1 main_~lk3~0)} assume !(0 != ~p5~0); {7412#(= 1 main_~lk3~0)} is VALID [2020-07-18 05:07:16,202 INFO L280 TraceCheckUtils]: 51: Hoare triple {7412#(= 1 main_~lk3~0)} assume !(0 != ~p6~0); {7412#(= 1 main_~lk3~0)} is VALID [2020-07-18 05:07:16,203 INFO L280 TraceCheckUtils]: 52: Hoare triple {7412#(= 1 main_~lk3~0)} assume !(0 != ~p7~0); {7412#(= 1 main_~lk3~0)} is VALID [2020-07-18 05:07:16,203 INFO L280 TraceCheckUtils]: 53: Hoare triple {7412#(= 1 main_~lk3~0)} assume !(0 != ~p1~0); {7412#(= 1 main_~lk3~0)} is VALID [2020-07-18 05:07:16,204 INFO L280 TraceCheckUtils]: 54: Hoare triple {7412#(= 1 main_~lk3~0)} assume !(0 != ~p2~0); {7412#(= 1 main_~lk3~0)} is VALID [2020-07-18 05:07:16,204 INFO L280 TraceCheckUtils]: 55: Hoare triple {7412#(= 1 main_~lk3~0)} assume 0 != ~p3~0; {7412#(= 1 main_~lk3~0)} is VALID [2020-07-18 05:07:16,205 INFO L280 TraceCheckUtils]: 56: Hoare triple {7412#(= 1 main_~lk3~0)} assume 1 != ~lk3~0; {7409#false} is VALID [2020-07-18 05:07:16,205 INFO L280 TraceCheckUtils]: 57: Hoare triple {7409#false} assume !false; {7409#false} is VALID [2020-07-18 05:07:16,207 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,207 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1517146108] [2020-07-18 05:07:16,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:07:16,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:07:16,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496563650] [2020-07-18 05:07:16,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2020-07-18 05:07:16,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:07:16,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:07:16,257 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:16,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:07:16,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:07:16,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:07:16,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:16,259 INFO L87 Difference]: Start difference. First operand 375 states and 498 transitions. Second operand 3 states. [2020-07-18 05:07:17,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:17,052 INFO L93 Difference]: Finished difference Result 459 states and 612 transitions. [2020-07-18 05:07:17,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:07:17,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2020-07-18 05:07:17,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:07:17,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:17,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2020-07-18 05:07:17,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:17,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2020-07-18 05:07:17,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 151 transitions. [2020-07-18 05:07:17,204 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:17,218 INFO L225 Difference]: With dead ends: 459 [2020-07-18 05:07:17,218 INFO L226 Difference]: Without dead ends: 457 [2020-07-18 05:07:17,219 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,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2020-07-18 05:07:17,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 375. [2020-07-18 05:07:17,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:07:17,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 457 states. Second operand 375 states. [2020-07-18 05:07:17,747 INFO L74 IsIncluded]: Start isIncluded. First operand 457 states. Second operand 375 states. [2020-07-18 05:07:17,748 INFO L87 Difference]: Start difference. First operand 457 states. Second operand 375 states. [2020-07-18 05:07:17,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:17,763 INFO L93 Difference]: Finished difference Result 457 states and 607 transitions. [2020-07-18 05:07:17,763 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 607 transitions. [2020-07-18 05:07:17,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:17,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:17,764 INFO L74 IsIncluded]: Start isIncluded. First operand 375 states. Second operand 457 states. [2020-07-18 05:07:17,764 INFO L87 Difference]: Start difference. First operand 375 states. Second operand 457 states. [2020-07-18 05:07:17,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:17,780 INFO L93 Difference]: Finished difference Result 457 states and 607 transitions. [2020-07-18 05:07:17,780 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 607 transitions. [2020-07-18 05:07:17,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:17,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:17,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:07:17,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:07:17,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-07-18 05:07:17,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 494 transitions. [2020-07-18 05:07:17,794 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 494 transitions. Word has length 58 [2020-07-18 05:07:17,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:07:17,795 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 494 transitions. [2020-07-18 05:07:17,795 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:07:17,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 375 states and 494 transitions. [2020-07-18 05:07:18,266 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 494 edges. 494 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:18,266 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 494 transitions. [2020-07-18 05:07:18,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-18 05:07:18,267 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:07:18,268 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] [2020-07-18 05:07:18,268 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 05:07:18,268 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:07:18,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:07:18,269 INFO L82 PathProgramCache]: Analyzing trace with hash 92380246, now seen corresponding path program 1 times [2020-07-18 05:07:18,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:07:18,269 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2146180365] [2020-07-18 05:07:18,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:07:18,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:18,321 INFO L280 TraceCheckUtils]: 0: Hoare triple {9997#true} assume true; {9997#true} is VALID [2020-07-18 05:07:18,322 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {9997#true} {9997#true} #199#return; {9997#true} is VALID [2020-07-18 05:07:18,322 INFO L263 TraceCheckUtils]: 0: Hoare triple {9997#true} call ULTIMATE.init(); {9997#true} is VALID [2020-07-18 05:07:18,322 INFO L280 TraceCheckUtils]: 1: Hoare triple {9997#true} assume true; {9997#true} is VALID [2020-07-18 05:07:18,322 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {9997#true} {9997#true} #199#return; {9997#true} is VALID [2020-07-18 05:07:18,322 INFO L263 TraceCheckUtils]: 3: Hoare triple {9997#true} call #t~ret8 := main(); {9997#true} is VALID [2020-07-18 05:07:18,322 INFO L280 TraceCheckUtils]: 4: Hoare triple {9997#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {9997#true} is VALID [2020-07-18 05:07:18,323 INFO L280 TraceCheckUtils]: 5: Hoare triple {9997#true} ~p1~0 := #t~nondet0; {9997#true} is VALID [2020-07-18 05:07:18,323 INFO L280 TraceCheckUtils]: 6: Hoare triple {9997#true} havoc #t~nondet0; {9997#true} is VALID [2020-07-18 05:07:18,323 INFO L280 TraceCheckUtils]: 7: Hoare triple {9997#true} havoc ~lk1~0; {9997#true} is VALID [2020-07-18 05:07:18,323 INFO L280 TraceCheckUtils]: 8: Hoare triple {9997#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {9997#true} is VALID [2020-07-18 05:07:18,323 INFO L280 TraceCheckUtils]: 9: Hoare triple {9997#true} ~p2~0 := #t~nondet1; {9997#true} is VALID [2020-07-18 05:07:18,323 INFO L280 TraceCheckUtils]: 10: Hoare triple {9997#true} havoc #t~nondet1; {9997#true} is VALID [2020-07-18 05:07:18,323 INFO L280 TraceCheckUtils]: 11: Hoare triple {9997#true} havoc ~lk2~0; {9997#true} is VALID [2020-07-18 05:07:18,324 INFO L280 TraceCheckUtils]: 12: Hoare triple {9997#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {9997#true} is VALID [2020-07-18 05:07:18,324 INFO L280 TraceCheckUtils]: 13: Hoare triple {9997#true} ~p3~0 := #t~nondet2; {9997#true} is VALID [2020-07-18 05:07:18,324 INFO L280 TraceCheckUtils]: 14: Hoare triple {9997#true} havoc #t~nondet2; {9997#true} is VALID [2020-07-18 05:07:18,324 INFO L280 TraceCheckUtils]: 15: Hoare triple {9997#true} havoc ~lk3~0; {9997#true} is VALID [2020-07-18 05:07:18,324 INFO L280 TraceCheckUtils]: 16: Hoare triple {9997#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {9997#true} is VALID [2020-07-18 05:07:18,324 INFO L280 TraceCheckUtils]: 17: Hoare triple {9997#true} ~p4~0 := #t~nondet3; {9997#true} is VALID [2020-07-18 05:07:18,325 INFO L280 TraceCheckUtils]: 18: Hoare triple {9997#true} havoc #t~nondet3; {9997#true} is VALID [2020-07-18 05:07:18,325 INFO L280 TraceCheckUtils]: 19: Hoare triple {9997#true} havoc ~lk4~0; {9997#true} is VALID [2020-07-18 05:07:18,325 INFO L280 TraceCheckUtils]: 20: Hoare triple {9997#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {9997#true} is VALID [2020-07-18 05:07:18,325 INFO L280 TraceCheckUtils]: 21: Hoare triple {9997#true} ~p5~0 := #t~nondet4; {9997#true} is VALID [2020-07-18 05:07:18,325 INFO L280 TraceCheckUtils]: 22: Hoare triple {9997#true} havoc #t~nondet4; {9997#true} is VALID [2020-07-18 05:07:18,325 INFO L280 TraceCheckUtils]: 23: Hoare triple {9997#true} havoc ~lk5~0; {9997#true} is VALID [2020-07-18 05:07:18,325 INFO L280 TraceCheckUtils]: 24: Hoare triple {9997#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {9997#true} is VALID [2020-07-18 05:07:18,326 INFO L280 TraceCheckUtils]: 25: Hoare triple {9997#true} ~p6~0 := #t~nondet5; {9997#true} is VALID [2020-07-18 05:07:18,326 INFO L280 TraceCheckUtils]: 26: Hoare triple {9997#true} havoc #t~nondet5; {9997#true} is VALID [2020-07-18 05:07:18,326 INFO L280 TraceCheckUtils]: 27: Hoare triple {9997#true} havoc ~lk6~0; {9997#true} is VALID [2020-07-18 05:07:18,326 INFO L280 TraceCheckUtils]: 28: Hoare triple {9997#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {9997#true} is VALID [2020-07-18 05:07:18,326 INFO L280 TraceCheckUtils]: 29: Hoare triple {9997#true} ~p7~0 := #t~nondet6; {9997#true} is VALID [2020-07-18 05:07:18,326 INFO L280 TraceCheckUtils]: 30: Hoare triple {9997#true} havoc #t~nondet6; {9997#true} is VALID [2020-07-18 05:07:18,327 INFO L280 TraceCheckUtils]: 31: Hoare triple {9997#true} havoc ~lk7~0; {9997#true} is VALID [2020-07-18 05:07:18,327 INFO L280 TraceCheckUtils]: 32: Hoare triple {9997#true} havoc ~cond~0; {9997#true} is VALID [2020-07-18 05:07:18,327 INFO L280 TraceCheckUtils]: 33: Hoare triple {9997#true} assume !false; {9997#true} is VALID [2020-07-18 05:07:18,327 INFO L280 TraceCheckUtils]: 34: Hoare triple {9997#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {9997#true} is VALID [2020-07-18 05:07:18,328 INFO L280 TraceCheckUtils]: 35: Hoare triple {9997#true} ~cond~0 := #t~nondet7; {9997#true} is VALID [2020-07-18 05:07:18,328 INFO L280 TraceCheckUtils]: 36: Hoare triple {9997#true} havoc #t~nondet7; {9997#true} is VALID [2020-07-18 05:07:18,328 INFO L280 TraceCheckUtils]: 37: Hoare triple {9997#true} assume !(0 == ~cond~0); {9997#true} is VALID [2020-07-18 05:07:18,328 INFO L280 TraceCheckUtils]: 38: Hoare triple {9997#true} ~lk1~0 := 0; {9997#true} is VALID [2020-07-18 05:07:18,328 INFO L280 TraceCheckUtils]: 39: Hoare triple {9997#true} ~lk2~0 := 0; {9997#true} is VALID [2020-07-18 05:07:18,329 INFO L280 TraceCheckUtils]: 40: Hoare triple {9997#true} ~lk3~0 := 0; {9997#true} is VALID [2020-07-18 05:07:18,329 INFO L280 TraceCheckUtils]: 41: Hoare triple {9997#true} ~lk4~0 := 0; {9997#true} is VALID [2020-07-18 05:07:18,329 INFO L280 TraceCheckUtils]: 42: Hoare triple {9997#true} ~lk5~0 := 0; {9997#true} is VALID [2020-07-18 05:07:18,329 INFO L280 TraceCheckUtils]: 43: Hoare triple {9997#true} ~lk6~0 := 0; {9997#true} is VALID [2020-07-18 05:07:18,329 INFO L280 TraceCheckUtils]: 44: Hoare triple {9997#true} ~lk7~0 := 0; {9997#true} is VALID [2020-07-18 05:07:18,330 INFO L280 TraceCheckUtils]: 45: Hoare triple {9997#true} assume !(0 != ~p1~0); {9997#true} is VALID [2020-07-18 05:07:18,330 INFO L280 TraceCheckUtils]: 46: Hoare triple {9997#true} assume !(0 != ~p2~0); {9997#true} is VALID [2020-07-18 05:07:18,330 INFO L280 TraceCheckUtils]: 47: Hoare triple {9997#true} assume !(0 != ~p3~0); {9997#true} is VALID [2020-07-18 05:07:18,330 INFO L280 TraceCheckUtils]: 48: Hoare triple {9997#true} assume !(0 != ~p4~0); {10001#(= 0 main_~p4~0)} is VALID [2020-07-18 05:07:18,331 INFO L280 TraceCheckUtils]: 49: Hoare triple {10001#(= 0 main_~p4~0)} assume !(0 != ~p5~0); {10001#(= 0 main_~p4~0)} is VALID [2020-07-18 05:07:18,331 INFO L280 TraceCheckUtils]: 50: Hoare triple {10001#(= 0 main_~p4~0)} assume !(0 != ~p6~0); {10001#(= 0 main_~p4~0)} is VALID [2020-07-18 05:07:18,332 INFO L280 TraceCheckUtils]: 51: Hoare triple {10001#(= 0 main_~p4~0)} assume !(0 != ~p7~0); {10001#(= 0 main_~p4~0)} is VALID [2020-07-18 05:07:18,332 INFO L280 TraceCheckUtils]: 52: Hoare triple {10001#(= 0 main_~p4~0)} assume !(0 != ~p1~0); {10001#(= 0 main_~p4~0)} is VALID [2020-07-18 05:07:18,332 INFO L280 TraceCheckUtils]: 53: Hoare triple {10001#(= 0 main_~p4~0)} assume !(0 != ~p2~0); {10001#(= 0 main_~p4~0)} is VALID [2020-07-18 05:07:18,336 INFO L280 TraceCheckUtils]: 54: Hoare triple {10001#(= 0 main_~p4~0)} assume !(0 != ~p3~0); {10001#(= 0 main_~p4~0)} is VALID [2020-07-18 05:07:18,337 INFO L280 TraceCheckUtils]: 55: Hoare triple {10001#(= 0 main_~p4~0)} assume 0 != ~p4~0; {9998#false} is VALID [2020-07-18 05:07:18,337 INFO L280 TraceCheckUtils]: 56: Hoare triple {9998#false} assume 1 != ~lk4~0; {9998#false} is VALID [2020-07-18 05:07:18,337 INFO L280 TraceCheckUtils]: 57: Hoare triple {9998#false} assume !false; {9998#false} is VALID [2020-07-18 05:07:18,339 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:18,339 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2146180365] [2020-07-18 05:07:18,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:07:18,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:07:18,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584756329] [2020-07-18 05:07:18,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2020-07-18 05:07:18,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:07:18,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:07:18,390 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:18,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:07:18,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:07:18,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:07:18,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:18,391 INFO L87 Difference]: Start difference. First operand 375 states and 494 transitions. Second operand 3 states. [2020-07-18 05:07:19,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:19,763 INFO L93 Difference]: Finished difference Result 1035 states and 1384 transitions. [2020-07-18 05:07:19,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:07:19,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2020-07-18 05:07:19,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:07:19,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:19,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2020-07-18 05:07:19,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:19,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2020-07-18 05:07:19,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 227 transitions. [2020-07-18 05:07:19,988 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:20,020 INFO L225 Difference]: With dead ends: 1035 [2020-07-18 05:07:20,021 INFO L226 Difference]: Without dead ends: 693 [2020-07-18 05:07:20,028 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:20,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2020-07-18 05:07:21,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 691. [2020-07-18 05:07:21,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:07:21,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 693 states. Second operand 691 states. [2020-07-18 05:07:21,134 INFO L74 IsIncluded]: Start isIncluded. First operand 693 states. Second operand 691 states. [2020-07-18 05:07:21,134 INFO L87 Difference]: Start difference. First operand 693 states. Second operand 691 states. [2020-07-18 05:07:21,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:21,166 INFO L93 Difference]: Finished difference Result 693 states and 907 transitions. [2020-07-18 05:07:21,166 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 907 transitions. [2020-07-18 05:07:21,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:21,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:21,168 INFO L74 IsIncluded]: Start isIncluded. First operand 691 states. Second operand 693 states. [2020-07-18 05:07:21,169 INFO L87 Difference]: Start difference. First operand 691 states. Second operand 693 states. [2020-07-18 05:07:21,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:21,199 INFO L93 Difference]: Finished difference Result 693 states and 907 transitions. [2020-07-18 05:07:21,200 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 907 transitions. [2020-07-18 05:07:21,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:21,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:21,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:07:21,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:07:21,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2020-07-18 05:07:21,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 906 transitions. [2020-07-18 05:07:21,245 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 906 transitions. Word has length 58 [2020-07-18 05:07:21,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:07:21,245 INFO L479 AbstractCegarLoop]: Abstraction has 691 states and 906 transitions. [2020-07-18 05:07:21,246 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:07:21,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 691 states and 906 transitions. [2020-07-18 05:07:22,245 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 906 edges. 906 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:22,245 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 906 transitions. [2020-07-18 05:07:22,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-07-18 05:07:22,247 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:07:22,247 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] [2020-07-18 05:07:22,247 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-18 05:07:22,248 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:07:22,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:07:22,248 INFO L82 PathProgramCache]: Analyzing trace with hash -529027402, now seen corresponding path program 1 times [2020-07-18 05:07:22,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:07:22,248 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [120448774] [2020-07-18 05:07:22,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:07:22,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:22,285 INFO L280 TraceCheckUtils]: 0: Hoare triple {14842#true} assume true; {14842#true} is VALID [2020-07-18 05:07:22,285 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {14842#true} {14842#true} #199#return; {14842#true} is VALID [2020-07-18 05:07:22,285 INFO L263 TraceCheckUtils]: 0: Hoare triple {14842#true} call ULTIMATE.init(); {14842#true} is VALID [2020-07-18 05:07:22,285 INFO L280 TraceCheckUtils]: 1: Hoare triple {14842#true} assume true; {14842#true} is VALID [2020-07-18 05:07:22,285 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {14842#true} {14842#true} #199#return; {14842#true} is VALID [2020-07-18 05:07:22,286 INFO L263 TraceCheckUtils]: 3: Hoare triple {14842#true} call #t~ret8 := main(); {14842#true} is VALID [2020-07-18 05:07:22,286 INFO L280 TraceCheckUtils]: 4: Hoare triple {14842#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {14842#true} is VALID [2020-07-18 05:07:22,286 INFO L280 TraceCheckUtils]: 5: Hoare triple {14842#true} ~p1~0 := #t~nondet0; {14842#true} is VALID [2020-07-18 05:07:22,286 INFO L280 TraceCheckUtils]: 6: Hoare triple {14842#true} havoc #t~nondet0; {14842#true} is VALID [2020-07-18 05:07:22,286 INFO L280 TraceCheckUtils]: 7: Hoare triple {14842#true} havoc ~lk1~0; {14842#true} is VALID [2020-07-18 05:07:22,287 INFO L280 TraceCheckUtils]: 8: Hoare triple {14842#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {14842#true} is VALID [2020-07-18 05:07:22,287 INFO L280 TraceCheckUtils]: 9: Hoare triple {14842#true} ~p2~0 := #t~nondet1; {14842#true} is VALID [2020-07-18 05:07:22,287 INFO L280 TraceCheckUtils]: 10: Hoare triple {14842#true} havoc #t~nondet1; {14842#true} is VALID [2020-07-18 05:07:22,287 INFO L280 TraceCheckUtils]: 11: Hoare triple {14842#true} havoc ~lk2~0; {14842#true} is VALID [2020-07-18 05:07:22,287 INFO L280 TraceCheckUtils]: 12: Hoare triple {14842#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {14842#true} is VALID [2020-07-18 05:07:22,288 INFO L280 TraceCheckUtils]: 13: Hoare triple {14842#true} ~p3~0 := #t~nondet2; {14842#true} is VALID [2020-07-18 05:07:22,288 INFO L280 TraceCheckUtils]: 14: Hoare triple {14842#true} havoc #t~nondet2; {14842#true} is VALID [2020-07-18 05:07:22,288 INFO L280 TraceCheckUtils]: 15: Hoare triple {14842#true} havoc ~lk3~0; {14842#true} is VALID [2020-07-18 05:07:22,288 INFO L280 TraceCheckUtils]: 16: Hoare triple {14842#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {14842#true} is VALID [2020-07-18 05:07:22,288 INFO L280 TraceCheckUtils]: 17: Hoare triple {14842#true} ~p4~0 := #t~nondet3; {14842#true} is VALID [2020-07-18 05:07:22,288 INFO L280 TraceCheckUtils]: 18: Hoare triple {14842#true} havoc #t~nondet3; {14842#true} is VALID [2020-07-18 05:07:22,289 INFO L280 TraceCheckUtils]: 19: Hoare triple {14842#true} havoc ~lk4~0; {14842#true} is VALID [2020-07-18 05:07:22,289 INFO L280 TraceCheckUtils]: 20: Hoare triple {14842#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {14842#true} is VALID [2020-07-18 05:07:22,289 INFO L280 TraceCheckUtils]: 21: Hoare triple {14842#true} ~p5~0 := #t~nondet4; {14842#true} is VALID [2020-07-18 05:07:22,289 INFO L280 TraceCheckUtils]: 22: Hoare triple {14842#true} havoc #t~nondet4; {14842#true} is VALID [2020-07-18 05:07:22,289 INFO L280 TraceCheckUtils]: 23: Hoare triple {14842#true} havoc ~lk5~0; {14842#true} is VALID [2020-07-18 05:07:22,290 INFO L280 TraceCheckUtils]: 24: Hoare triple {14842#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {14842#true} is VALID [2020-07-18 05:07:22,290 INFO L280 TraceCheckUtils]: 25: Hoare triple {14842#true} ~p6~0 := #t~nondet5; {14842#true} is VALID [2020-07-18 05:07:22,290 INFO L280 TraceCheckUtils]: 26: Hoare triple {14842#true} havoc #t~nondet5; {14842#true} is VALID [2020-07-18 05:07:22,290 INFO L280 TraceCheckUtils]: 27: Hoare triple {14842#true} havoc ~lk6~0; {14842#true} is VALID [2020-07-18 05:07:22,290 INFO L280 TraceCheckUtils]: 28: Hoare triple {14842#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {14842#true} is VALID [2020-07-18 05:07:22,290 INFO L280 TraceCheckUtils]: 29: Hoare triple {14842#true} ~p7~0 := #t~nondet6; {14842#true} is VALID [2020-07-18 05:07:22,291 INFO L280 TraceCheckUtils]: 30: Hoare triple {14842#true} havoc #t~nondet6; {14842#true} is VALID [2020-07-18 05:07:22,291 INFO L280 TraceCheckUtils]: 31: Hoare triple {14842#true} havoc ~lk7~0; {14842#true} is VALID [2020-07-18 05:07:22,291 INFO L280 TraceCheckUtils]: 32: Hoare triple {14842#true} havoc ~cond~0; {14842#true} is VALID [2020-07-18 05:07:22,291 INFO L280 TraceCheckUtils]: 33: Hoare triple {14842#true} assume !false; {14842#true} is VALID [2020-07-18 05:07:22,291 INFO L280 TraceCheckUtils]: 34: Hoare triple {14842#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {14842#true} is VALID [2020-07-18 05:07:22,292 INFO L280 TraceCheckUtils]: 35: Hoare triple {14842#true} ~cond~0 := #t~nondet7; {14842#true} is VALID [2020-07-18 05:07:22,292 INFO L280 TraceCheckUtils]: 36: Hoare triple {14842#true} havoc #t~nondet7; {14842#true} is VALID [2020-07-18 05:07:22,292 INFO L280 TraceCheckUtils]: 37: Hoare triple {14842#true} assume !(0 == ~cond~0); {14842#true} is VALID [2020-07-18 05:07:22,292 INFO L280 TraceCheckUtils]: 38: Hoare triple {14842#true} ~lk1~0 := 0; {14842#true} is VALID [2020-07-18 05:07:22,292 INFO L280 TraceCheckUtils]: 39: Hoare triple {14842#true} ~lk2~0 := 0; {14842#true} is VALID [2020-07-18 05:07:22,293 INFO L280 TraceCheckUtils]: 40: Hoare triple {14842#true} ~lk3~0 := 0; {14842#true} is VALID [2020-07-18 05:07:22,293 INFO L280 TraceCheckUtils]: 41: Hoare triple {14842#true} ~lk4~0 := 0; {14842#true} is VALID [2020-07-18 05:07:22,293 INFO L280 TraceCheckUtils]: 42: Hoare triple {14842#true} ~lk5~0 := 0; {14842#true} is VALID [2020-07-18 05:07:22,293 INFO L280 TraceCheckUtils]: 43: Hoare triple {14842#true} ~lk6~0 := 0; {14842#true} is VALID [2020-07-18 05:07:22,293 INFO L280 TraceCheckUtils]: 44: Hoare triple {14842#true} ~lk7~0 := 0; {14842#true} is VALID [2020-07-18 05:07:22,293 INFO L280 TraceCheckUtils]: 45: Hoare triple {14842#true} assume !(0 != ~p1~0); {14842#true} is VALID [2020-07-18 05:07:22,294 INFO L280 TraceCheckUtils]: 46: Hoare triple {14842#true} assume !(0 != ~p2~0); {14842#true} is VALID [2020-07-18 05:07:22,294 INFO L280 TraceCheckUtils]: 47: Hoare triple {14842#true} assume !(0 != ~p3~0); {14842#true} is VALID [2020-07-18 05:07:22,294 INFO L280 TraceCheckUtils]: 48: Hoare triple {14842#true} assume 0 != ~p4~0; {14842#true} is VALID [2020-07-18 05:07:22,296 INFO L280 TraceCheckUtils]: 49: Hoare triple {14842#true} ~lk4~0 := 1; {14846#(= 1 main_~lk4~0)} is VALID [2020-07-18 05:07:22,297 INFO L280 TraceCheckUtils]: 50: Hoare triple {14846#(= 1 main_~lk4~0)} assume !(0 != ~p5~0); {14846#(= 1 main_~lk4~0)} is VALID [2020-07-18 05:07:22,297 INFO L280 TraceCheckUtils]: 51: Hoare triple {14846#(= 1 main_~lk4~0)} assume !(0 != ~p6~0); {14846#(= 1 main_~lk4~0)} is VALID [2020-07-18 05:07:22,298 INFO L280 TraceCheckUtils]: 52: Hoare triple {14846#(= 1 main_~lk4~0)} assume !(0 != ~p7~0); {14846#(= 1 main_~lk4~0)} is VALID [2020-07-18 05:07:22,298 INFO L280 TraceCheckUtils]: 53: Hoare triple {14846#(= 1 main_~lk4~0)} assume !(0 != ~p1~0); {14846#(= 1 main_~lk4~0)} is VALID [2020-07-18 05:07:22,298 INFO L280 TraceCheckUtils]: 54: Hoare triple {14846#(= 1 main_~lk4~0)} assume !(0 != ~p2~0); {14846#(= 1 main_~lk4~0)} is VALID [2020-07-18 05:07:22,299 INFO L280 TraceCheckUtils]: 55: Hoare triple {14846#(= 1 main_~lk4~0)} assume !(0 != ~p3~0); {14846#(= 1 main_~lk4~0)} is VALID [2020-07-18 05:07:22,299 INFO L280 TraceCheckUtils]: 56: Hoare triple {14846#(= 1 main_~lk4~0)} assume 0 != ~p4~0; {14846#(= 1 main_~lk4~0)} is VALID [2020-07-18 05:07:22,299 INFO L280 TraceCheckUtils]: 57: Hoare triple {14846#(= 1 main_~lk4~0)} assume 1 != ~lk4~0; {14843#false} is VALID [2020-07-18 05:07:22,300 INFO L280 TraceCheckUtils]: 58: Hoare triple {14843#false} assume !false; {14843#false} is VALID [2020-07-18 05:07:22,303 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:22,303 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [120448774] [2020-07-18 05:07:22,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:07:22,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:07:22,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298633548] [2020-07-18 05:07:22,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-07-18 05:07:22,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:07:22,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:07:22,360 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:22,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:07:22,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:07:22,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:07:22,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:22,361 INFO L87 Difference]: Start difference. First operand 691 states and 906 transitions. Second operand 3 states. [2020-07-18 05:07:24,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:24,032 INFO L93 Difference]: Finished difference Result 839 states and 1100 transitions. [2020-07-18 05:07:24,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:07:24,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-07-18 05:07:24,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:07:24,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:24,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2020-07-18 05:07:24,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:24,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2020-07-18 05:07:24,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 147 transitions. [2020-07-18 05:07:24,169 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:24,211 INFO L225 Difference]: With dead ends: 839 [2020-07-18 05:07:24,212 INFO L226 Difference]: Without dead ends: 837 [2020-07-18 05:07:24,212 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:24,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2020-07-18 05:07:25,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 691. [2020-07-18 05:07:25,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:07:25,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 837 states. Second operand 691 states. [2020-07-18 05:07:25,399 INFO L74 IsIncluded]: Start isIncluded. First operand 837 states. Second operand 691 states. [2020-07-18 05:07:25,399 INFO L87 Difference]: Start difference. First operand 837 states. Second operand 691 states. [2020-07-18 05:07:25,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:25,439 INFO L93 Difference]: Finished difference Result 837 states and 1091 transitions. [2020-07-18 05:07:25,439 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1091 transitions. [2020-07-18 05:07:25,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:25,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:25,441 INFO L74 IsIncluded]: Start isIncluded. First operand 691 states. Second operand 837 states. [2020-07-18 05:07:25,441 INFO L87 Difference]: Start difference. First operand 691 states. Second operand 837 states. [2020-07-18 05:07:25,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:25,478 INFO L93 Difference]: Finished difference Result 837 states and 1091 transitions. [2020-07-18 05:07:25,478 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1091 transitions. [2020-07-18 05:07:25,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:25,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:25,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:07:25,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:07:25,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2020-07-18 05:07:25,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 898 transitions. [2020-07-18 05:07:25,499 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 898 transitions. Word has length 59 [2020-07-18 05:07:25,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:07:25,500 INFO L479 AbstractCegarLoop]: Abstraction has 691 states and 898 transitions. [2020-07-18 05:07:25,500 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:07:25,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 691 states and 898 transitions. [2020-07-18 05:07:26,549 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 898 edges. 898 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:26,550 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 898 transitions. [2020-07-18 05:07:26,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-07-18 05:07:26,551 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:07:26,552 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] [2020-07-18 05:07:26,552 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-18 05:07:26,552 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:07:26,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:07:26,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1430933584, now seen corresponding path program 1 times [2020-07-18 05:07:26,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:07:26,553 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1768121220] [2020-07-18 05:07:26,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:07:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:26,641 INFO L280 TraceCheckUtils]: 0: Hoare triple {19583#true} assume true; {19583#true} is VALID [2020-07-18 05:07:26,642 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {19583#true} {19583#true} #199#return; {19583#true} is VALID [2020-07-18 05:07:26,642 INFO L263 TraceCheckUtils]: 0: Hoare triple {19583#true} call ULTIMATE.init(); {19583#true} is VALID [2020-07-18 05:07:26,642 INFO L280 TraceCheckUtils]: 1: Hoare triple {19583#true} assume true; {19583#true} is VALID [2020-07-18 05:07:26,643 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {19583#true} {19583#true} #199#return; {19583#true} is VALID [2020-07-18 05:07:26,643 INFO L263 TraceCheckUtils]: 3: Hoare triple {19583#true} call #t~ret8 := main(); {19583#true} is VALID [2020-07-18 05:07:26,643 INFO L280 TraceCheckUtils]: 4: Hoare triple {19583#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {19583#true} is VALID [2020-07-18 05:07:26,643 INFO L280 TraceCheckUtils]: 5: Hoare triple {19583#true} ~p1~0 := #t~nondet0; {19583#true} is VALID [2020-07-18 05:07:26,643 INFO L280 TraceCheckUtils]: 6: Hoare triple {19583#true} havoc #t~nondet0; {19583#true} is VALID [2020-07-18 05:07:26,643 INFO L280 TraceCheckUtils]: 7: Hoare triple {19583#true} havoc ~lk1~0; {19583#true} is VALID [2020-07-18 05:07:26,644 INFO L280 TraceCheckUtils]: 8: Hoare triple {19583#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {19583#true} is VALID [2020-07-18 05:07:26,644 INFO L280 TraceCheckUtils]: 9: Hoare triple {19583#true} ~p2~0 := #t~nondet1; {19583#true} is VALID [2020-07-18 05:07:26,644 INFO L280 TraceCheckUtils]: 10: Hoare triple {19583#true} havoc #t~nondet1; {19583#true} is VALID [2020-07-18 05:07:26,644 INFO L280 TraceCheckUtils]: 11: Hoare triple {19583#true} havoc ~lk2~0; {19583#true} is VALID [2020-07-18 05:07:26,644 INFO L280 TraceCheckUtils]: 12: Hoare triple {19583#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {19583#true} is VALID [2020-07-18 05:07:26,645 INFO L280 TraceCheckUtils]: 13: Hoare triple {19583#true} ~p3~0 := #t~nondet2; {19583#true} is VALID [2020-07-18 05:07:26,645 INFO L280 TraceCheckUtils]: 14: Hoare triple {19583#true} havoc #t~nondet2; {19583#true} is VALID [2020-07-18 05:07:26,645 INFO L280 TraceCheckUtils]: 15: Hoare triple {19583#true} havoc ~lk3~0; {19583#true} is VALID [2020-07-18 05:07:26,645 INFO L280 TraceCheckUtils]: 16: Hoare triple {19583#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {19583#true} is VALID [2020-07-18 05:07:26,645 INFO L280 TraceCheckUtils]: 17: Hoare triple {19583#true} ~p4~0 := #t~nondet3; {19583#true} is VALID [2020-07-18 05:07:26,646 INFO L280 TraceCheckUtils]: 18: Hoare triple {19583#true} havoc #t~nondet3; {19583#true} is VALID [2020-07-18 05:07:26,646 INFO L280 TraceCheckUtils]: 19: Hoare triple {19583#true} havoc ~lk4~0; {19583#true} is VALID [2020-07-18 05:07:26,646 INFO L280 TraceCheckUtils]: 20: Hoare triple {19583#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {19583#true} is VALID [2020-07-18 05:07:26,646 INFO L280 TraceCheckUtils]: 21: Hoare triple {19583#true} ~p5~0 := #t~nondet4; {19583#true} is VALID [2020-07-18 05:07:26,646 INFO L280 TraceCheckUtils]: 22: Hoare triple {19583#true} havoc #t~nondet4; {19583#true} is VALID [2020-07-18 05:07:26,646 INFO L280 TraceCheckUtils]: 23: Hoare triple {19583#true} havoc ~lk5~0; {19583#true} is VALID [2020-07-18 05:07:26,647 INFO L280 TraceCheckUtils]: 24: Hoare triple {19583#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {19583#true} is VALID [2020-07-18 05:07:26,647 INFO L280 TraceCheckUtils]: 25: Hoare triple {19583#true} ~p6~0 := #t~nondet5; {19583#true} is VALID [2020-07-18 05:07:26,647 INFO L280 TraceCheckUtils]: 26: Hoare triple {19583#true} havoc #t~nondet5; {19583#true} is VALID [2020-07-18 05:07:26,647 INFO L280 TraceCheckUtils]: 27: Hoare triple {19583#true} havoc ~lk6~0; {19583#true} is VALID [2020-07-18 05:07:26,647 INFO L280 TraceCheckUtils]: 28: Hoare triple {19583#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {19583#true} is VALID [2020-07-18 05:07:26,648 INFO L280 TraceCheckUtils]: 29: Hoare triple {19583#true} ~p7~0 := #t~nondet6; {19583#true} is VALID [2020-07-18 05:07:26,648 INFO L280 TraceCheckUtils]: 30: Hoare triple {19583#true} havoc #t~nondet6; {19583#true} is VALID [2020-07-18 05:07:26,648 INFO L280 TraceCheckUtils]: 31: Hoare triple {19583#true} havoc ~lk7~0; {19583#true} is VALID [2020-07-18 05:07:26,648 INFO L280 TraceCheckUtils]: 32: Hoare triple {19583#true} havoc ~cond~0; {19583#true} is VALID [2020-07-18 05:07:26,648 INFO L280 TraceCheckUtils]: 33: Hoare triple {19583#true} assume !false; {19583#true} is VALID [2020-07-18 05:07:26,648 INFO L280 TraceCheckUtils]: 34: Hoare triple {19583#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {19583#true} is VALID [2020-07-18 05:07:26,649 INFO L280 TraceCheckUtils]: 35: Hoare triple {19583#true} ~cond~0 := #t~nondet7; {19583#true} is VALID [2020-07-18 05:07:26,649 INFO L280 TraceCheckUtils]: 36: Hoare triple {19583#true} havoc #t~nondet7; {19583#true} is VALID [2020-07-18 05:07:26,659 INFO L280 TraceCheckUtils]: 37: Hoare triple {19583#true} assume !(0 == ~cond~0); {19583#true} is VALID [2020-07-18 05:07:26,660 INFO L280 TraceCheckUtils]: 38: Hoare triple {19583#true} ~lk1~0 := 0; {19583#true} is VALID [2020-07-18 05:07:26,660 INFO L280 TraceCheckUtils]: 39: Hoare triple {19583#true} ~lk2~0 := 0; {19583#true} is VALID [2020-07-18 05:07:26,660 INFO L280 TraceCheckUtils]: 40: Hoare triple {19583#true} ~lk3~0 := 0; {19583#true} is VALID [2020-07-18 05:07:26,660 INFO L280 TraceCheckUtils]: 41: Hoare triple {19583#true} ~lk4~0 := 0; {19583#true} is VALID [2020-07-18 05:07:26,660 INFO L280 TraceCheckUtils]: 42: Hoare triple {19583#true} ~lk5~0 := 0; {19583#true} is VALID [2020-07-18 05:07:26,661 INFO L280 TraceCheckUtils]: 43: Hoare triple {19583#true} ~lk6~0 := 0; {19583#true} is VALID [2020-07-18 05:07:26,661 INFO L280 TraceCheckUtils]: 44: Hoare triple {19583#true} ~lk7~0 := 0; {19583#true} is VALID [2020-07-18 05:07:26,661 INFO L280 TraceCheckUtils]: 45: Hoare triple {19583#true} assume !(0 != ~p1~0); {19583#true} is VALID [2020-07-18 05:07:26,664 INFO L280 TraceCheckUtils]: 46: Hoare triple {19583#true} assume !(0 != ~p2~0); {19583#true} is VALID [2020-07-18 05:07:26,664 INFO L280 TraceCheckUtils]: 47: Hoare triple {19583#true} assume !(0 != ~p3~0); {19583#true} is VALID [2020-07-18 05:07:26,665 INFO L280 TraceCheckUtils]: 48: Hoare triple {19583#true} assume !(0 != ~p4~0); {19583#true} is VALID [2020-07-18 05:07:26,671 INFO L280 TraceCheckUtils]: 49: Hoare triple {19583#true} assume !(0 != ~p5~0); {19587#(= 0 main_~p5~0)} is VALID [2020-07-18 05:07:26,672 INFO L280 TraceCheckUtils]: 50: Hoare triple {19587#(= 0 main_~p5~0)} assume !(0 != ~p6~0); {19587#(= 0 main_~p5~0)} is VALID [2020-07-18 05:07:26,673 INFO L280 TraceCheckUtils]: 51: Hoare triple {19587#(= 0 main_~p5~0)} assume !(0 != ~p7~0); {19587#(= 0 main_~p5~0)} is VALID [2020-07-18 05:07:26,673 INFO L280 TraceCheckUtils]: 52: Hoare triple {19587#(= 0 main_~p5~0)} assume !(0 != ~p1~0); {19587#(= 0 main_~p5~0)} is VALID [2020-07-18 05:07:26,674 INFO L280 TraceCheckUtils]: 53: Hoare triple {19587#(= 0 main_~p5~0)} assume !(0 != ~p2~0); {19587#(= 0 main_~p5~0)} is VALID [2020-07-18 05:07:26,674 INFO L280 TraceCheckUtils]: 54: Hoare triple {19587#(= 0 main_~p5~0)} assume !(0 != ~p3~0); {19587#(= 0 main_~p5~0)} is VALID [2020-07-18 05:07:26,675 INFO L280 TraceCheckUtils]: 55: Hoare triple {19587#(= 0 main_~p5~0)} assume !(0 != ~p4~0); {19587#(= 0 main_~p5~0)} is VALID [2020-07-18 05:07:26,675 INFO L280 TraceCheckUtils]: 56: Hoare triple {19587#(= 0 main_~p5~0)} assume 0 != ~p5~0; {19584#false} is VALID [2020-07-18 05:07:26,675 INFO L280 TraceCheckUtils]: 57: Hoare triple {19584#false} assume 1 != ~lk5~0; {19584#false} is VALID [2020-07-18 05:07:26,676 INFO L280 TraceCheckUtils]: 58: Hoare triple {19584#false} assume !false; {19584#false} is VALID [2020-07-18 05:07:26,677 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:26,678 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1768121220] [2020-07-18 05:07:26,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:07:26,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:07:26,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047271743] [2020-07-18 05:07:26,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-07-18 05:07:26,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:07:26,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:07:26,725 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:26,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:07:26,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:07:26,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:07:26,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:26,726 INFO L87 Difference]: Start difference. First operand 691 states and 898 transitions. Second operand 3 states. [2020-07-18 05:07:29,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:29,686 INFO L93 Difference]: Finished difference Result 1959 states and 2564 transitions. [2020-07-18 05:07:29,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:07:29,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-07-18 05:07:29,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:07:29,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:29,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2020-07-18 05:07:29,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:29,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2020-07-18 05:07:29,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 224 transitions. [2020-07-18 05:07:29,908 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:29,973 INFO L225 Difference]: With dead ends: 1959 [2020-07-18 05:07:29,973 INFO L226 Difference]: Without dead ends: 1301 [2020-07-18 05:07:29,975 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:29,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2020-07-18 05:07:32,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1299. [2020-07-18 05:07:32,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:07:32,432 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1301 states. Second operand 1299 states. [2020-07-18 05:07:32,432 INFO L74 IsIncluded]: Start isIncluded. First operand 1301 states. Second operand 1299 states. [2020-07-18 05:07:32,433 INFO L87 Difference]: Start difference. First operand 1301 states. Second operand 1299 states. [2020-07-18 05:07:32,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:32,488 INFO L93 Difference]: Finished difference Result 1301 states and 1667 transitions. [2020-07-18 05:07:32,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 1667 transitions. [2020-07-18 05:07:32,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:32,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:32,491 INFO L74 IsIncluded]: Start isIncluded. First operand 1299 states. Second operand 1301 states. [2020-07-18 05:07:32,491 INFO L87 Difference]: Start difference. First operand 1299 states. Second operand 1301 states. [2020-07-18 05:07:32,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:32,574 INFO L93 Difference]: Finished difference Result 1301 states and 1667 transitions. [2020-07-18 05:07:32,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 1667 transitions. [2020-07-18 05:07:32,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:32,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:32,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:07:32,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:07:32,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1299 states. [2020-07-18 05:07:32,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1666 transitions. [2020-07-18 05:07:32,631 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1666 transitions. Word has length 59 [2020-07-18 05:07:32,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:07:32,631 INFO L479 AbstractCegarLoop]: Abstraction has 1299 states and 1666 transitions. [2020-07-18 05:07:32,631 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:07:32,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 1299 states and 1666 transitions. [2020-07-18 05:07:34,633 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 1666 edges. 1666 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:34,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1666 transitions. [2020-07-18 05:07:34,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-07-18 05:07:34,635 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:07:34,635 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] [2020-07-18 05:07:34,637 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-18 05:07:34,637 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:07:34,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:07:34,638 INFO L82 PathProgramCache]: Analyzing trace with hash -631232587, now seen corresponding path program 1 times [2020-07-18 05:07:34,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:07:34,638 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1425362442] [2020-07-18 05:07:34,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:07:34,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:34,683 INFO L280 TraceCheckUtils]: 0: Hoare triple {28708#true} assume true; {28708#true} is VALID [2020-07-18 05:07:34,683 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {28708#true} {28708#true} #199#return; {28708#true} is VALID [2020-07-18 05:07:34,684 INFO L263 TraceCheckUtils]: 0: Hoare triple {28708#true} call ULTIMATE.init(); {28708#true} is VALID [2020-07-18 05:07:34,684 INFO L280 TraceCheckUtils]: 1: Hoare triple {28708#true} assume true; {28708#true} is VALID [2020-07-18 05:07:34,684 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {28708#true} {28708#true} #199#return; {28708#true} is VALID [2020-07-18 05:07:34,684 INFO L263 TraceCheckUtils]: 3: Hoare triple {28708#true} call #t~ret8 := main(); {28708#true} is VALID [2020-07-18 05:07:34,685 INFO L280 TraceCheckUtils]: 4: Hoare triple {28708#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {28708#true} is VALID [2020-07-18 05:07:34,685 INFO L280 TraceCheckUtils]: 5: Hoare triple {28708#true} ~p1~0 := #t~nondet0; {28708#true} is VALID [2020-07-18 05:07:34,685 INFO L280 TraceCheckUtils]: 6: Hoare triple {28708#true} havoc #t~nondet0; {28708#true} is VALID [2020-07-18 05:07:34,685 INFO L280 TraceCheckUtils]: 7: Hoare triple {28708#true} havoc ~lk1~0; {28708#true} is VALID [2020-07-18 05:07:34,685 INFO L280 TraceCheckUtils]: 8: Hoare triple {28708#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {28708#true} is VALID [2020-07-18 05:07:34,685 INFO L280 TraceCheckUtils]: 9: Hoare triple {28708#true} ~p2~0 := #t~nondet1; {28708#true} is VALID [2020-07-18 05:07:34,686 INFO L280 TraceCheckUtils]: 10: Hoare triple {28708#true} havoc #t~nondet1; {28708#true} is VALID [2020-07-18 05:07:34,686 INFO L280 TraceCheckUtils]: 11: Hoare triple {28708#true} havoc ~lk2~0; {28708#true} is VALID [2020-07-18 05:07:34,686 INFO L280 TraceCheckUtils]: 12: Hoare triple {28708#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {28708#true} is VALID [2020-07-18 05:07:34,686 INFO L280 TraceCheckUtils]: 13: Hoare triple {28708#true} ~p3~0 := #t~nondet2; {28708#true} is VALID [2020-07-18 05:07:34,686 INFO L280 TraceCheckUtils]: 14: Hoare triple {28708#true} havoc #t~nondet2; {28708#true} is VALID [2020-07-18 05:07:34,687 INFO L280 TraceCheckUtils]: 15: Hoare triple {28708#true} havoc ~lk3~0; {28708#true} is VALID [2020-07-18 05:07:34,687 INFO L280 TraceCheckUtils]: 16: Hoare triple {28708#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {28708#true} is VALID [2020-07-18 05:07:34,687 INFO L280 TraceCheckUtils]: 17: Hoare triple {28708#true} ~p4~0 := #t~nondet3; {28708#true} is VALID [2020-07-18 05:07:34,687 INFO L280 TraceCheckUtils]: 18: Hoare triple {28708#true} havoc #t~nondet3; {28708#true} is VALID [2020-07-18 05:07:34,687 INFO L280 TraceCheckUtils]: 19: Hoare triple {28708#true} havoc ~lk4~0; {28708#true} is VALID [2020-07-18 05:07:34,687 INFO L280 TraceCheckUtils]: 20: Hoare triple {28708#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {28708#true} is VALID [2020-07-18 05:07:34,688 INFO L280 TraceCheckUtils]: 21: Hoare triple {28708#true} ~p5~0 := #t~nondet4; {28708#true} is VALID [2020-07-18 05:07:34,688 INFO L280 TraceCheckUtils]: 22: Hoare triple {28708#true} havoc #t~nondet4; {28708#true} is VALID [2020-07-18 05:07:34,688 INFO L280 TraceCheckUtils]: 23: Hoare triple {28708#true} havoc ~lk5~0; {28708#true} is VALID [2020-07-18 05:07:34,688 INFO L280 TraceCheckUtils]: 24: Hoare triple {28708#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {28708#true} is VALID [2020-07-18 05:07:34,688 INFO L280 TraceCheckUtils]: 25: Hoare triple {28708#true} ~p6~0 := #t~nondet5; {28708#true} is VALID [2020-07-18 05:07:34,688 INFO L280 TraceCheckUtils]: 26: Hoare triple {28708#true} havoc #t~nondet5; {28708#true} is VALID [2020-07-18 05:07:34,688 INFO L280 TraceCheckUtils]: 27: Hoare triple {28708#true} havoc ~lk6~0; {28708#true} is VALID [2020-07-18 05:07:34,688 INFO L280 TraceCheckUtils]: 28: Hoare triple {28708#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {28708#true} is VALID [2020-07-18 05:07:34,688 INFO L280 TraceCheckUtils]: 29: Hoare triple {28708#true} ~p7~0 := #t~nondet6; {28708#true} is VALID [2020-07-18 05:07:34,689 INFO L280 TraceCheckUtils]: 30: Hoare triple {28708#true} havoc #t~nondet6; {28708#true} is VALID [2020-07-18 05:07:34,689 INFO L280 TraceCheckUtils]: 31: Hoare triple {28708#true} havoc ~lk7~0; {28708#true} is VALID [2020-07-18 05:07:34,689 INFO L280 TraceCheckUtils]: 32: Hoare triple {28708#true} havoc ~cond~0; {28708#true} is VALID [2020-07-18 05:07:34,689 INFO L280 TraceCheckUtils]: 33: Hoare triple {28708#true} assume !false; {28708#true} is VALID [2020-07-18 05:07:34,689 INFO L280 TraceCheckUtils]: 34: Hoare triple {28708#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {28708#true} is VALID [2020-07-18 05:07:34,689 INFO L280 TraceCheckUtils]: 35: Hoare triple {28708#true} ~cond~0 := #t~nondet7; {28708#true} is VALID [2020-07-18 05:07:34,689 INFO L280 TraceCheckUtils]: 36: Hoare triple {28708#true} havoc #t~nondet7; {28708#true} is VALID [2020-07-18 05:07:34,689 INFO L280 TraceCheckUtils]: 37: Hoare triple {28708#true} assume !(0 == ~cond~0); {28708#true} is VALID [2020-07-18 05:07:34,690 INFO L280 TraceCheckUtils]: 38: Hoare triple {28708#true} ~lk1~0 := 0; {28708#true} is VALID [2020-07-18 05:07:34,690 INFO L280 TraceCheckUtils]: 39: Hoare triple {28708#true} ~lk2~0 := 0; {28708#true} is VALID [2020-07-18 05:07:34,690 INFO L280 TraceCheckUtils]: 40: Hoare triple {28708#true} ~lk3~0 := 0; {28708#true} is VALID [2020-07-18 05:07:34,690 INFO L280 TraceCheckUtils]: 41: Hoare triple {28708#true} ~lk4~0 := 0; {28708#true} is VALID [2020-07-18 05:07:34,690 INFO L280 TraceCheckUtils]: 42: Hoare triple {28708#true} ~lk5~0 := 0; {28708#true} is VALID [2020-07-18 05:07:34,690 INFO L280 TraceCheckUtils]: 43: Hoare triple {28708#true} ~lk6~0 := 0; {28708#true} is VALID [2020-07-18 05:07:34,690 INFO L280 TraceCheckUtils]: 44: Hoare triple {28708#true} ~lk7~0 := 0; {28708#true} is VALID [2020-07-18 05:07:34,690 INFO L280 TraceCheckUtils]: 45: Hoare triple {28708#true} assume !(0 != ~p1~0); {28708#true} is VALID [2020-07-18 05:07:34,690 INFO L280 TraceCheckUtils]: 46: Hoare triple {28708#true} assume !(0 != ~p2~0); {28708#true} is VALID [2020-07-18 05:07:34,691 INFO L280 TraceCheckUtils]: 47: Hoare triple {28708#true} assume !(0 != ~p3~0); {28708#true} is VALID [2020-07-18 05:07:34,691 INFO L280 TraceCheckUtils]: 48: Hoare triple {28708#true} assume !(0 != ~p4~0); {28708#true} is VALID [2020-07-18 05:07:34,691 INFO L280 TraceCheckUtils]: 49: Hoare triple {28708#true} assume 0 != ~p5~0; {28708#true} is VALID [2020-07-18 05:07:34,691 INFO L280 TraceCheckUtils]: 50: Hoare triple {28708#true} ~lk5~0 := 1; {28712#(= 1 main_~lk5~0)} is VALID [2020-07-18 05:07:34,692 INFO L280 TraceCheckUtils]: 51: Hoare triple {28712#(= 1 main_~lk5~0)} assume !(0 != ~p6~0); {28712#(= 1 main_~lk5~0)} is VALID [2020-07-18 05:07:34,692 INFO L280 TraceCheckUtils]: 52: Hoare triple {28712#(= 1 main_~lk5~0)} assume !(0 != ~p7~0); {28712#(= 1 main_~lk5~0)} is VALID [2020-07-18 05:07:34,692 INFO L280 TraceCheckUtils]: 53: Hoare triple {28712#(= 1 main_~lk5~0)} assume !(0 != ~p1~0); {28712#(= 1 main_~lk5~0)} is VALID [2020-07-18 05:07:34,693 INFO L280 TraceCheckUtils]: 54: Hoare triple {28712#(= 1 main_~lk5~0)} assume !(0 != ~p2~0); {28712#(= 1 main_~lk5~0)} is VALID [2020-07-18 05:07:34,693 INFO L280 TraceCheckUtils]: 55: Hoare triple {28712#(= 1 main_~lk5~0)} assume !(0 != ~p3~0); {28712#(= 1 main_~lk5~0)} is VALID [2020-07-18 05:07:34,694 INFO L280 TraceCheckUtils]: 56: Hoare triple {28712#(= 1 main_~lk5~0)} assume !(0 != ~p4~0); {28712#(= 1 main_~lk5~0)} is VALID [2020-07-18 05:07:34,694 INFO L280 TraceCheckUtils]: 57: Hoare triple {28712#(= 1 main_~lk5~0)} assume 0 != ~p5~0; {28712#(= 1 main_~lk5~0)} is VALID [2020-07-18 05:07:34,694 INFO L280 TraceCheckUtils]: 58: Hoare triple {28712#(= 1 main_~lk5~0)} assume 1 != ~lk5~0; {28709#false} is VALID [2020-07-18 05:07:34,694 INFO L280 TraceCheckUtils]: 59: Hoare triple {28709#false} assume !false; {28709#false} is VALID [2020-07-18 05:07:34,696 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:34,696 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1425362442] [2020-07-18 05:07:34,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:07:34,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:07:34,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053858413] [2020-07-18 05:07:34,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-07-18 05:07:34,697 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:07:34,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:07:34,747 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:34,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:07:34,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:07:34,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:07:34,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:34,748 INFO L87 Difference]: Start difference. First operand 1299 states and 1666 transitions. Second operand 3 states. [2020-07-18 05:07:38,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:38,174 INFO L93 Difference]: Finished difference Result 1559 states and 1988 transitions. [2020-07-18 05:07:38,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:07:38,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-07-18 05:07:38,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:07:38,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:38,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2020-07-18 05:07:38,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:38,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2020-07-18 05:07:38,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 143 transitions. [2020-07-18 05:07:38,309 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:38,395 INFO L225 Difference]: With dead ends: 1559 [2020-07-18 05:07:38,395 INFO L226 Difference]: Without dead ends: 1557 [2020-07-18 05:07:38,396 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:38,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2020-07-18 05:07:41,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1299. [2020-07-18 05:07:41,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:07:41,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1557 states. Second operand 1299 states. [2020-07-18 05:07:41,067 INFO L74 IsIncluded]: Start isIncluded. First operand 1557 states. Second operand 1299 states. [2020-07-18 05:07:41,067 INFO L87 Difference]: Start difference. First operand 1557 states. Second operand 1299 states. [2020-07-18 05:07:41,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:41,147 INFO L93 Difference]: Finished difference Result 1557 states and 1971 transitions. [2020-07-18 05:07:41,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 1971 transitions. [2020-07-18 05:07:41,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:41,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:41,149 INFO L74 IsIncluded]: Start isIncluded. First operand 1299 states. Second operand 1557 states. [2020-07-18 05:07:41,149 INFO L87 Difference]: Start difference. First operand 1299 states. Second operand 1557 states. [2020-07-18 05:07:41,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:41,246 INFO L93 Difference]: Finished difference Result 1557 states and 1971 transitions. [2020-07-18 05:07:41,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 1971 transitions. [2020-07-18 05:07:41,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:41,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:41,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:07:41,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:07:41,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1299 states. [2020-07-18 05:07:41,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1650 transitions. [2020-07-18 05:07:41,302 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1650 transitions. Word has length 60 [2020-07-18 05:07:41,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:07:41,302 INFO L479 AbstractCegarLoop]: Abstraction has 1299 states and 1650 transitions. [2020-07-18 05:07:41,302 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:07:41,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 1299 states and 1650 transitions. [2020-07-18 05:07:43,342 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 1650 edges. 1650 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:43,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1650 transitions. [2020-07-18 05:07:43,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-07-18 05:07:43,343 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:07:43,344 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] [2020-07-18 05:07:43,344 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-18 05:07:43,344 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:07:43,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:07:43,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1409021686, now seen corresponding path program 1 times [2020-07-18 05:07:43,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:07:43,345 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2084226713] [2020-07-18 05:07:43,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:07:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:07:43,392 INFO L280 TraceCheckUtils]: 0: Hoare triple {37545#true} assume true; {37545#true} is VALID [2020-07-18 05:07:43,393 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {37545#true} {37545#true} #199#return; {37545#true} is VALID [2020-07-18 05:07:43,393 INFO L263 TraceCheckUtils]: 0: Hoare triple {37545#true} call ULTIMATE.init(); {37545#true} is VALID [2020-07-18 05:07:43,393 INFO L280 TraceCheckUtils]: 1: Hoare triple {37545#true} assume true; {37545#true} is VALID [2020-07-18 05:07:43,393 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {37545#true} {37545#true} #199#return; {37545#true} is VALID [2020-07-18 05:07:43,394 INFO L263 TraceCheckUtils]: 3: Hoare triple {37545#true} call #t~ret8 := main(); {37545#true} is VALID [2020-07-18 05:07:43,394 INFO L280 TraceCheckUtils]: 4: Hoare triple {37545#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {37545#true} is VALID [2020-07-18 05:07:43,394 INFO L280 TraceCheckUtils]: 5: Hoare triple {37545#true} ~p1~0 := #t~nondet0; {37545#true} is VALID [2020-07-18 05:07:43,394 INFO L280 TraceCheckUtils]: 6: Hoare triple {37545#true} havoc #t~nondet0; {37545#true} is VALID [2020-07-18 05:07:43,394 INFO L280 TraceCheckUtils]: 7: Hoare triple {37545#true} havoc ~lk1~0; {37545#true} is VALID [2020-07-18 05:07:43,394 INFO L280 TraceCheckUtils]: 8: Hoare triple {37545#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {37545#true} is VALID [2020-07-18 05:07:43,395 INFO L280 TraceCheckUtils]: 9: Hoare triple {37545#true} ~p2~0 := #t~nondet1; {37545#true} is VALID [2020-07-18 05:07:43,395 INFO L280 TraceCheckUtils]: 10: Hoare triple {37545#true} havoc #t~nondet1; {37545#true} is VALID [2020-07-18 05:07:43,395 INFO L280 TraceCheckUtils]: 11: Hoare triple {37545#true} havoc ~lk2~0; {37545#true} is VALID [2020-07-18 05:07:43,395 INFO L280 TraceCheckUtils]: 12: Hoare triple {37545#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {37545#true} is VALID [2020-07-18 05:07:43,395 INFO L280 TraceCheckUtils]: 13: Hoare triple {37545#true} ~p3~0 := #t~nondet2; {37545#true} is VALID [2020-07-18 05:07:43,396 INFO L280 TraceCheckUtils]: 14: Hoare triple {37545#true} havoc #t~nondet2; {37545#true} is VALID [2020-07-18 05:07:43,396 INFO L280 TraceCheckUtils]: 15: Hoare triple {37545#true} havoc ~lk3~0; {37545#true} is VALID [2020-07-18 05:07:43,396 INFO L280 TraceCheckUtils]: 16: Hoare triple {37545#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {37545#true} is VALID [2020-07-18 05:07:43,396 INFO L280 TraceCheckUtils]: 17: Hoare triple {37545#true} ~p4~0 := #t~nondet3; {37545#true} is VALID [2020-07-18 05:07:43,396 INFO L280 TraceCheckUtils]: 18: Hoare triple {37545#true} havoc #t~nondet3; {37545#true} is VALID [2020-07-18 05:07:43,396 INFO L280 TraceCheckUtils]: 19: Hoare triple {37545#true} havoc ~lk4~0; {37545#true} is VALID [2020-07-18 05:07:43,397 INFO L280 TraceCheckUtils]: 20: Hoare triple {37545#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {37545#true} is VALID [2020-07-18 05:07:43,397 INFO L280 TraceCheckUtils]: 21: Hoare triple {37545#true} ~p5~0 := #t~nondet4; {37545#true} is VALID [2020-07-18 05:07:43,397 INFO L280 TraceCheckUtils]: 22: Hoare triple {37545#true} havoc #t~nondet4; {37545#true} is VALID [2020-07-18 05:07:43,397 INFO L280 TraceCheckUtils]: 23: Hoare triple {37545#true} havoc ~lk5~0; {37545#true} is VALID [2020-07-18 05:07:43,397 INFO L280 TraceCheckUtils]: 24: Hoare triple {37545#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {37545#true} is VALID [2020-07-18 05:07:43,398 INFO L280 TraceCheckUtils]: 25: Hoare triple {37545#true} ~p6~0 := #t~nondet5; {37545#true} is VALID [2020-07-18 05:07:43,398 INFO L280 TraceCheckUtils]: 26: Hoare triple {37545#true} havoc #t~nondet5; {37545#true} is VALID [2020-07-18 05:07:43,398 INFO L280 TraceCheckUtils]: 27: Hoare triple {37545#true} havoc ~lk6~0; {37545#true} is VALID [2020-07-18 05:07:43,398 INFO L280 TraceCheckUtils]: 28: Hoare triple {37545#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {37545#true} is VALID [2020-07-18 05:07:43,398 INFO L280 TraceCheckUtils]: 29: Hoare triple {37545#true} ~p7~0 := #t~nondet6; {37545#true} is VALID [2020-07-18 05:07:43,399 INFO L280 TraceCheckUtils]: 30: Hoare triple {37545#true} havoc #t~nondet6; {37545#true} is VALID [2020-07-18 05:07:43,399 INFO L280 TraceCheckUtils]: 31: Hoare triple {37545#true} havoc ~lk7~0; {37545#true} is VALID [2020-07-18 05:07:43,399 INFO L280 TraceCheckUtils]: 32: Hoare triple {37545#true} havoc ~cond~0; {37545#true} is VALID [2020-07-18 05:07:43,399 INFO L280 TraceCheckUtils]: 33: Hoare triple {37545#true} assume !false; {37545#true} is VALID [2020-07-18 05:07:43,399 INFO L280 TraceCheckUtils]: 34: Hoare triple {37545#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {37545#true} is VALID [2020-07-18 05:07:43,400 INFO L280 TraceCheckUtils]: 35: Hoare triple {37545#true} ~cond~0 := #t~nondet7; {37545#true} is VALID [2020-07-18 05:07:43,400 INFO L280 TraceCheckUtils]: 36: Hoare triple {37545#true} havoc #t~nondet7; {37545#true} is VALID [2020-07-18 05:07:43,400 INFO L280 TraceCheckUtils]: 37: Hoare triple {37545#true} assume !(0 == ~cond~0); {37545#true} is VALID [2020-07-18 05:07:43,400 INFO L280 TraceCheckUtils]: 38: Hoare triple {37545#true} ~lk1~0 := 0; {37545#true} is VALID [2020-07-18 05:07:43,400 INFO L280 TraceCheckUtils]: 39: Hoare triple {37545#true} ~lk2~0 := 0; {37545#true} is VALID [2020-07-18 05:07:43,401 INFO L280 TraceCheckUtils]: 40: Hoare triple {37545#true} ~lk3~0 := 0; {37545#true} is VALID [2020-07-18 05:07:43,403 INFO L280 TraceCheckUtils]: 41: Hoare triple {37545#true} ~lk4~0 := 0; {37545#true} is VALID [2020-07-18 05:07:43,403 INFO L280 TraceCheckUtils]: 42: Hoare triple {37545#true} ~lk5~0 := 0; {37545#true} is VALID [2020-07-18 05:07:43,403 INFO L280 TraceCheckUtils]: 43: Hoare triple {37545#true} ~lk6~0 := 0; {37545#true} is VALID [2020-07-18 05:07:43,404 INFO L280 TraceCheckUtils]: 44: Hoare triple {37545#true} ~lk7~0 := 0; {37545#true} is VALID [2020-07-18 05:07:43,404 INFO L280 TraceCheckUtils]: 45: Hoare triple {37545#true} assume !(0 != ~p1~0); {37545#true} is VALID [2020-07-18 05:07:43,404 INFO L280 TraceCheckUtils]: 46: Hoare triple {37545#true} assume !(0 != ~p2~0); {37545#true} is VALID [2020-07-18 05:07:43,404 INFO L280 TraceCheckUtils]: 47: Hoare triple {37545#true} assume !(0 != ~p3~0); {37545#true} is VALID [2020-07-18 05:07:43,404 INFO L280 TraceCheckUtils]: 48: Hoare triple {37545#true} assume !(0 != ~p4~0); {37545#true} is VALID [2020-07-18 05:07:43,404 INFO L280 TraceCheckUtils]: 49: Hoare triple {37545#true} assume !(0 != ~p5~0); {37545#true} is VALID [2020-07-18 05:07:43,407 INFO L280 TraceCheckUtils]: 50: Hoare triple {37545#true} assume !(0 != ~p6~0); {37549#(= 0 main_~p6~0)} is VALID [2020-07-18 05:07:43,408 INFO L280 TraceCheckUtils]: 51: Hoare triple {37549#(= 0 main_~p6~0)} assume !(0 != ~p7~0); {37549#(= 0 main_~p6~0)} is VALID [2020-07-18 05:07:43,408 INFO L280 TraceCheckUtils]: 52: Hoare triple {37549#(= 0 main_~p6~0)} assume !(0 != ~p1~0); {37549#(= 0 main_~p6~0)} is VALID [2020-07-18 05:07:43,409 INFO L280 TraceCheckUtils]: 53: Hoare triple {37549#(= 0 main_~p6~0)} assume !(0 != ~p2~0); {37549#(= 0 main_~p6~0)} is VALID [2020-07-18 05:07:43,409 INFO L280 TraceCheckUtils]: 54: Hoare triple {37549#(= 0 main_~p6~0)} assume !(0 != ~p3~0); {37549#(= 0 main_~p6~0)} is VALID [2020-07-18 05:07:43,410 INFO L280 TraceCheckUtils]: 55: Hoare triple {37549#(= 0 main_~p6~0)} assume !(0 != ~p4~0); {37549#(= 0 main_~p6~0)} is VALID [2020-07-18 05:07:43,410 INFO L280 TraceCheckUtils]: 56: Hoare triple {37549#(= 0 main_~p6~0)} assume !(0 != ~p5~0); {37549#(= 0 main_~p6~0)} is VALID [2020-07-18 05:07:43,411 INFO L280 TraceCheckUtils]: 57: Hoare triple {37549#(= 0 main_~p6~0)} assume 0 != ~p6~0; {37546#false} is VALID [2020-07-18 05:07:43,411 INFO L280 TraceCheckUtils]: 58: Hoare triple {37546#false} assume 1 != ~lk6~0; {37546#false} is VALID [2020-07-18 05:07:43,411 INFO L280 TraceCheckUtils]: 59: Hoare triple {37546#false} assume !false; {37546#false} is VALID [2020-07-18 05:07:43,413 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:43,414 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2084226713] [2020-07-18 05:07:43,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:07:43,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:07:43,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855223134] [2020-07-18 05:07:43,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-07-18 05:07:43,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:07:43,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:07:43,460 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:43,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:07:43,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:07:43,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:07:43,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:07:43,461 INFO L87 Difference]: Start difference. First operand 1299 states and 1650 transitions. Second operand 3 states. [2020-07-18 05:07:49,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:49,954 INFO L93 Difference]: Finished difference Result 3735 states and 4756 transitions. [2020-07-18 05:07:49,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:07:49,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-07-18 05:07:49,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:07:49,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:49,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2020-07-18 05:07:49,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:07:49,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2020-07-18 05:07:49,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 221 transitions. [2020-07-18 05:07:50,152 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:07:50,356 INFO L225 Difference]: With dead ends: 3735 [2020-07-18 05:07:50,356 INFO L226 Difference]: Without dead ends: 2469 [2020-07-18 05:07:50,358 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:50,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2469 states. [2020-07-18 05:07:56,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2469 to 2467. [2020-07-18 05:07:56,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:07:56,026 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2469 states. Second operand 2467 states. [2020-07-18 05:07:56,027 INFO L74 IsIncluded]: Start isIncluded. First operand 2469 states. Second operand 2467 states. [2020-07-18 05:07:56,027 INFO L87 Difference]: Start difference. First operand 2469 states. Second operand 2467 states. [2020-07-18 05:07:56,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:56,199 INFO L93 Difference]: Finished difference Result 2469 states and 3075 transitions. [2020-07-18 05:07:56,199 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 3075 transitions. [2020-07-18 05:07:56,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:56,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:56,201 INFO L74 IsIncluded]: Start isIncluded. First operand 2467 states. Second operand 2469 states. [2020-07-18 05:07:56,201 INFO L87 Difference]: Start difference. First operand 2467 states. Second operand 2469 states. [2020-07-18 05:07:56,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:07:56,379 INFO L93 Difference]: Finished difference Result 2469 states and 3075 transitions. [2020-07-18 05:07:56,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 3075 transitions. [2020-07-18 05:07:56,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:07:56,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:07:56,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:07:56,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:07:56,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2467 states. [2020-07-18 05:07:56,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 3074 transitions. [2020-07-18 05:07:56,563 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 3074 transitions. Word has length 60 [2020-07-18 05:07:56,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:07:56,564 INFO L479 AbstractCegarLoop]: Abstraction has 2467 states and 3074 transitions. [2020-07-18 05:07:56,564 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:07:56,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2467 states and 3074 transitions. [2020-07-18 05:08:00,364 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3074 edges. 3074 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:08:00,364 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 3074 transitions. [2020-07-18 05:08:00,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-18 05:08:00,366 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:08:00,366 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:08:00,366 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-18 05:08:00,367 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:08:00,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:08:00,367 INFO L82 PathProgramCache]: Analyzing trace with hash -729752476, now seen corresponding path program 1 times [2020-07-18 05:08:00,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:08:00,367 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1538537932] [2020-07-18 05:08:00,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:08:00,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:08:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:08:00,411 INFO L280 TraceCheckUtils]: 0: Hoare triple {54894#true} assume true; {54894#true} is VALID [2020-07-18 05:08:00,411 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {54894#true} {54894#true} #199#return; {54894#true} is VALID [2020-07-18 05:08:00,412 INFO L263 TraceCheckUtils]: 0: Hoare triple {54894#true} call ULTIMATE.init(); {54894#true} is VALID [2020-07-18 05:08:00,412 INFO L280 TraceCheckUtils]: 1: Hoare triple {54894#true} assume true; {54894#true} is VALID [2020-07-18 05:08:00,412 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {54894#true} {54894#true} #199#return; {54894#true} is VALID [2020-07-18 05:08:00,412 INFO L263 TraceCheckUtils]: 3: Hoare triple {54894#true} call #t~ret8 := main(); {54894#true} is VALID [2020-07-18 05:08:00,413 INFO L280 TraceCheckUtils]: 4: Hoare triple {54894#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {54894#true} is VALID [2020-07-18 05:08:00,413 INFO L280 TraceCheckUtils]: 5: Hoare triple {54894#true} ~p1~0 := #t~nondet0; {54894#true} is VALID [2020-07-18 05:08:00,413 INFO L280 TraceCheckUtils]: 6: Hoare triple {54894#true} havoc #t~nondet0; {54894#true} is VALID [2020-07-18 05:08:00,413 INFO L280 TraceCheckUtils]: 7: Hoare triple {54894#true} havoc ~lk1~0; {54894#true} is VALID [2020-07-18 05:08:00,413 INFO L280 TraceCheckUtils]: 8: Hoare triple {54894#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {54894#true} is VALID [2020-07-18 05:08:00,414 INFO L280 TraceCheckUtils]: 9: Hoare triple {54894#true} ~p2~0 := #t~nondet1; {54894#true} is VALID [2020-07-18 05:08:00,414 INFO L280 TraceCheckUtils]: 10: Hoare triple {54894#true} havoc #t~nondet1; {54894#true} is VALID [2020-07-18 05:08:00,414 INFO L280 TraceCheckUtils]: 11: Hoare triple {54894#true} havoc ~lk2~0; {54894#true} is VALID [2020-07-18 05:08:00,414 INFO L280 TraceCheckUtils]: 12: Hoare triple {54894#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {54894#true} is VALID [2020-07-18 05:08:00,414 INFO L280 TraceCheckUtils]: 13: Hoare triple {54894#true} ~p3~0 := #t~nondet2; {54894#true} is VALID [2020-07-18 05:08:00,415 INFO L280 TraceCheckUtils]: 14: Hoare triple {54894#true} havoc #t~nondet2; {54894#true} is VALID [2020-07-18 05:08:00,415 INFO L280 TraceCheckUtils]: 15: Hoare triple {54894#true} havoc ~lk3~0; {54894#true} is VALID [2020-07-18 05:08:00,415 INFO L280 TraceCheckUtils]: 16: Hoare triple {54894#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {54894#true} is VALID [2020-07-18 05:08:00,415 INFO L280 TraceCheckUtils]: 17: Hoare triple {54894#true} ~p4~0 := #t~nondet3; {54894#true} is VALID [2020-07-18 05:08:00,415 INFO L280 TraceCheckUtils]: 18: Hoare triple {54894#true} havoc #t~nondet3; {54894#true} is VALID [2020-07-18 05:08:00,415 INFO L280 TraceCheckUtils]: 19: Hoare triple {54894#true} havoc ~lk4~0; {54894#true} is VALID [2020-07-18 05:08:00,416 INFO L280 TraceCheckUtils]: 20: Hoare triple {54894#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {54894#true} is VALID [2020-07-18 05:08:00,416 INFO L280 TraceCheckUtils]: 21: Hoare triple {54894#true} ~p5~0 := #t~nondet4; {54894#true} is VALID [2020-07-18 05:08:00,416 INFO L280 TraceCheckUtils]: 22: Hoare triple {54894#true} havoc #t~nondet4; {54894#true} is VALID [2020-07-18 05:08:00,416 INFO L280 TraceCheckUtils]: 23: Hoare triple {54894#true} havoc ~lk5~0; {54894#true} is VALID [2020-07-18 05:08:00,416 INFO L280 TraceCheckUtils]: 24: Hoare triple {54894#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {54894#true} is VALID [2020-07-18 05:08:00,417 INFO L280 TraceCheckUtils]: 25: Hoare triple {54894#true} ~p6~0 := #t~nondet5; {54894#true} is VALID [2020-07-18 05:08:00,417 INFO L280 TraceCheckUtils]: 26: Hoare triple {54894#true} havoc #t~nondet5; {54894#true} is VALID [2020-07-18 05:08:00,417 INFO L280 TraceCheckUtils]: 27: Hoare triple {54894#true} havoc ~lk6~0; {54894#true} is VALID [2020-07-18 05:08:00,417 INFO L280 TraceCheckUtils]: 28: Hoare triple {54894#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {54894#true} is VALID [2020-07-18 05:08:00,417 INFO L280 TraceCheckUtils]: 29: Hoare triple {54894#true} ~p7~0 := #t~nondet6; {54894#true} is VALID [2020-07-18 05:08:00,417 INFO L280 TraceCheckUtils]: 30: Hoare triple {54894#true} havoc #t~nondet6; {54894#true} is VALID [2020-07-18 05:08:00,418 INFO L280 TraceCheckUtils]: 31: Hoare triple {54894#true} havoc ~lk7~0; {54894#true} is VALID [2020-07-18 05:08:00,418 INFO L280 TraceCheckUtils]: 32: Hoare triple {54894#true} havoc ~cond~0; {54894#true} is VALID [2020-07-18 05:08:00,418 INFO L280 TraceCheckUtils]: 33: Hoare triple {54894#true} assume !false; {54894#true} is VALID [2020-07-18 05:08:00,418 INFO L280 TraceCheckUtils]: 34: Hoare triple {54894#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {54894#true} is VALID [2020-07-18 05:08:00,418 INFO L280 TraceCheckUtils]: 35: Hoare triple {54894#true} ~cond~0 := #t~nondet7; {54894#true} is VALID [2020-07-18 05:08:00,418 INFO L280 TraceCheckUtils]: 36: Hoare triple {54894#true} havoc #t~nondet7; {54894#true} is VALID [2020-07-18 05:08:00,419 INFO L280 TraceCheckUtils]: 37: Hoare triple {54894#true} assume !(0 == ~cond~0); {54894#true} is VALID [2020-07-18 05:08:00,419 INFO L280 TraceCheckUtils]: 38: Hoare triple {54894#true} ~lk1~0 := 0; {54894#true} is VALID [2020-07-18 05:08:00,419 INFO L280 TraceCheckUtils]: 39: Hoare triple {54894#true} ~lk2~0 := 0; {54894#true} is VALID [2020-07-18 05:08:00,419 INFO L280 TraceCheckUtils]: 40: Hoare triple {54894#true} ~lk3~0 := 0; {54894#true} is VALID [2020-07-18 05:08:00,419 INFO L280 TraceCheckUtils]: 41: Hoare triple {54894#true} ~lk4~0 := 0; {54894#true} is VALID [2020-07-18 05:08:00,420 INFO L280 TraceCheckUtils]: 42: Hoare triple {54894#true} ~lk5~0 := 0; {54894#true} is VALID [2020-07-18 05:08:00,420 INFO L280 TraceCheckUtils]: 43: Hoare triple {54894#true} ~lk6~0 := 0; {54894#true} is VALID [2020-07-18 05:08:00,420 INFO L280 TraceCheckUtils]: 44: Hoare triple {54894#true} ~lk7~0 := 0; {54894#true} is VALID [2020-07-18 05:08:00,420 INFO L280 TraceCheckUtils]: 45: Hoare triple {54894#true} assume !(0 != ~p1~0); {54894#true} is VALID [2020-07-18 05:08:00,420 INFO L280 TraceCheckUtils]: 46: Hoare triple {54894#true} assume !(0 != ~p2~0); {54894#true} is VALID [2020-07-18 05:08:00,420 INFO L280 TraceCheckUtils]: 47: Hoare triple {54894#true} assume !(0 != ~p3~0); {54894#true} is VALID [2020-07-18 05:08:00,421 INFO L280 TraceCheckUtils]: 48: Hoare triple {54894#true} assume !(0 != ~p4~0); {54894#true} is VALID [2020-07-18 05:08:00,421 INFO L280 TraceCheckUtils]: 49: Hoare triple {54894#true} assume !(0 != ~p5~0); {54894#true} is VALID [2020-07-18 05:08:00,421 INFO L280 TraceCheckUtils]: 50: Hoare triple {54894#true} assume !(0 != ~p6~0); {54894#true} is VALID [2020-07-18 05:08:00,422 INFO L280 TraceCheckUtils]: 51: Hoare triple {54894#true} assume !(0 != ~p7~0); {54898#(= 0 main_~p7~0)} is VALID [2020-07-18 05:08:00,422 INFO L280 TraceCheckUtils]: 52: Hoare triple {54898#(= 0 main_~p7~0)} assume !(0 != ~p1~0); {54898#(= 0 main_~p7~0)} is VALID [2020-07-18 05:08:00,422 INFO L280 TraceCheckUtils]: 53: Hoare triple {54898#(= 0 main_~p7~0)} assume !(0 != ~p2~0); {54898#(= 0 main_~p7~0)} is VALID [2020-07-18 05:08:00,423 INFO L280 TraceCheckUtils]: 54: Hoare triple {54898#(= 0 main_~p7~0)} assume !(0 != ~p3~0); {54898#(= 0 main_~p7~0)} is VALID [2020-07-18 05:08:00,423 INFO L280 TraceCheckUtils]: 55: Hoare triple {54898#(= 0 main_~p7~0)} assume !(0 != ~p4~0); {54898#(= 0 main_~p7~0)} is VALID [2020-07-18 05:08:00,424 INFO L280 TraceCheckUtils]: 56: Hoare triple {54898#(= 0 main_~p7~0)} assume !(0 != ~p5~0); {54898#(= 0 main_~p7~0)} is VALID [2020-07-18 05:08:00,424 INFO L280 TraceCheckUtils]: 57: Hoare triple {54898#(= 0 main_~p7~0)} assume !(0 != ~p6~0); {54898#(= 0 main_~p7~0)} is VALID [2020-07-18 05:08:00,425 INFO L280 TraceCheckUtils]: 58: Hoare triple {54898#(= 0 main_~p7~0)} assume 0 != ~p7~0; {54895#false} is VALID [2020-07-18 05:08:00,425 INFO L280 TraceCheckUtils]: 59: Hoare triple {54895#false} assume 1 != ~lk7~0; {54895#false} is VALID [2020-07-18 05:08:00,425 INFO L280 TraceCheckUtils]: 60: Hoare triple {54895#false} assume !false; {54895#false} is VALID [2020-07-18 05:08:00,427 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:00,428 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1538537932] [2020-07-18 05:08:00,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:08:00,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:08:00,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592536535] [2020-07-18 05:08:00,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-07-18 05:08:00,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:08:00,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:08:00,475 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:08:00,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:08:00,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:08:00,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:08:00,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:08:00,477 INFO L87 Difference]: Start difference. First operand 2467 states and 3074 transitions. Second operand 3 states. [2020-07-18 05:08:14,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:08:14,453 INFO L93 Difference]: Finished difference Result 7143 states and 8900 transitions. [2020-07-18 05:08:14,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:08:14,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-07-18 05:08:14,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:08:14,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:08:14,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2020-07-18 05:08:14,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:08:14,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2020-07-18 05:08:14,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 221 transitions. [2020-07-18 05:08:14,655 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:08:15,113 INFO L225 Difference]: With dead ends: 7143 [2020-07-18 05:08:15,113 INFO L226 Difference]: Without dead ends: 3637 [2020-07-18 05:08:15,120 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:15,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3637 states. [2020-07-18 05:08:23,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3637 to 3635. [2020-07-18 05:08:23,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:08:23,756 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3637 states. Second operand 3635 states. [2020-07-18 05:08:23,756 INFO L74 IsIncluded]: Start isIncluded. First operand 3637 states. Second operand 3635 states. [2020-07-18 05:08:23,756 INFO L87 Difference]: Start difference. First operand 3637 states. Second operand 3635 states. [2020-07-18 05:08:24,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:08:24,155 INFO L93 Difference]: Finished difference Result 3637 states and 4371 transitions. [2020-07-18 05:08:24,155 INFO L276 IsEmpty]: Start isEmpty. Operand 3637 states and 4371 transitions. [2020-07-18 05:08:24,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:08:24,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:08:24,159 INFO L74 IsIncluded]: Start isIncluded. First operand 3635 states. Second operand 3637 states. [2020-07-18 05:08:24,159 INFO L87 Difference]: Start difference. First operand 3635 states. Second operand 3637 states. [2020-07-18 05:08:24,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:08:24,578 INFO L93 Difference]: Finished difference Result 3637 states and 4371 transitions. [2020-07-18 05:08:24,578 INFO L276 IsEmpty]: Start isEmpty. Operand 3637 states and 4371 transitions. [2020-07-18 05:08:24,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:08:24,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:08:24,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:08:24,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:08:24,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3635 states. [2020-07-18 05:08:25,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3635 states to 3635 states and 4370 transitions. [2020-07-18 05:08:25,009 INFO L78 Accepts]: Start accepts. Automaton has 3635 states and 4370 transitions. Word has length 61 [2020-07-18 05:08:25,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:08:25,009 INFO L479 AbstractCegarLoop]: Abstraction has 3635 states and 4370 transitions. [2020-07-18 05:08:25,009 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:08:25,009 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3635 states and 4370 transitions. [2020-07-18 05:08:30,346 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4370 edges. 4370 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:08:30,346 INFO L276 IsEmpty]: Start isEmpty. Operand 3635 states and 4370 transitions. [2020-07-18 05:08:30,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-18 05:08:30,348 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:08:30,349 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:08:30,349 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-18 05:08:30,349 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:08:30,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:08:30,349 INFO L82 PathProgramCache]: Analyzing trace with hash 495374346, now seen corresponding path program 1 times [2020-07-18 05:08:30,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:08:30,350 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [390792123] [2020-07-18 05:08:30,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:08:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:08:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:08:30,391 INFO L280 TraceCheckUtils]: 0: Hoare triple {83731#true} assume true; {83731#true} is VALID [2020-07-18 05:08:30,392 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {83731#true} {83731#true} #199#return; {83731#true} is VALID [2020-07-18 05:08:30,392 INFO L263 TraceCheckUtils]: 0: Hoare triple {83731#true} call ULTIMATE.init(); {83731#true} is VALID [2020-07-18 05:08:30,392 INFO L280 TraceCheckUtils]: 1: Hoare triple {83731#true} assume true; {83731#true} is VALID [2020-07-18 05:08:30,392 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {83731#true} {83731#true} #199#return; {83731#true} is VALID [2020-07-18 05:08:30,393 INFO L263 TraceCheckUtils]: 3: Hoare triple {83731#true} call #t~ret8 := main(); {83731#true} is VALID [2020-07-18 05:08:30,393 INFO L280 TraceCheckUtils]: 4: Hoare triple {83731#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {83731#true} is VALID [2020-07-18 05:08:30,393 INFO L280 TraceCheckUtils]: 5: Hoare triple {83731#true} ~p1~0 := #t~nondet0; {83731#true} is VALID [2020-07-18 05:08:30,393 INFO L280 TraceCheckUtils]: 6: Hoare triple {83731#true} havoc #t~nondet0; {83731#true} is VALID [2020-07-18 05:08:30,393 INFO L280 TraceCheckUtils]: 7: Hoare triple {83731#true} havoc ~lk1~0; {83731#true} is VALID [2020-07-18 05:08:30,393 INFO L280 TraceCheckUtils]: 8: Hoare triple {83731#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {83731#true} is VALID [2020-07-18 05:08:30,394 INFO L280 TraceCheckUtils]: 9: Hoare triple {83731#true} ~p2~0 := #t~nondet1; {83731#true} is VALID [2020-07-18 05:08:30,394 INFO L280 TraceCheckUtils]: 10: Hoare triple {83731#true} havoc #t~nondet1; {83731#true} is VALID [2020-07-18 05:08:30,394 INFO L280 TraceCheckUtils]: 11: Hoare triple {83731#true} havoc ~lk2~0; {83731#true} is VALID [2020-07-18 05:08:30,394 INFO L280 TraceCheckUtils]: 12: Hoare triple {83731#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {83731#true} is VALID [2020-07-18 05:08:30,394 INFO L280 TraceCheckUtils]: 13: Hoare triple {83731#true} ~p3~0 := #t~nondet2; {83731#true} is VALID [2020-07-18 05:08:30,395 INFO L280 TraceCheckUtils]: 14: Hoare triple {83731#true} havoc #t~nondet2; {83731#true} is VALID [2020-07-18 05:08:30,395 INFO L280 TraceCheckUtils]: 15: Hoare triple {83731#true} havoc ~lk3~0; {83731#true} is VALID [2020-07-18 05:08:30,395 INFO L280 TraceCheckUtils]: 16: Hoare triple {83731#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {83731#true} is VALID [2020-07-18 05:08:30,395 INFO L280 TraceCheckUtils]: 17: Hoare triple {83731#true} ~p4~0 := #t~nondet3; {83731#true} is VALID [2020-07-18 05:08:30,396 INFO L280 TraceCheckUtils]: 18: Hoare triple {83731#true} havoc #t~nondet3; {83731#true} is VALID [2020-07-18 05:08:30,396 INFO L280 TraceCheckUtils]: 19: Hoare triple {83731#true} havoc ~lk4~0; {83731#true} is VALID [2020-07-18 05:08:30,396 INFO L280 TraceCheckUtils]: 20: Hoare triple {83731#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {83731#true} is VALID [2020-07-18 05:08:30,396 INFO L280 TraceCheckUtils]: 21: Hoare triple {83731#true} ~p5~0 := #t~nondet4; {83731#true} is VALID [2020-07-18 05:08:30,397 INFO L280 TraceCheckUtils]: 22: Hoare triple {83731#true} havoc #t~nondet4; {83731#true} is VALID [2020-07-18 05:08:30,397 INFO L280 TraceCheckUtils]: 23: Hoare triple {83731#true} havoc ~lk5~0; {83731#true} is VALID [2020-07-18 05:08:30,397 INFO L280 TraceCheckUtils]: 24: Hoare triple {83731#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {83731#true} is VALID [2020-07-18 05:08:30,397 INFO L280 TraceCheckUtils]: 25: Hoare triple {83731#true} ~p6~0 := #t~nondet5; {83731#true} is VALID [2020-07-18 05:08:30,397 INFO L280 TraceCheckUtils]: 26: Hoare triple {83731#true} havoc #t~nondet5; {83731#true} is VALID [2020-07-18 05:08:30,398 INFO L280 TraceCheckUtils]: 27: Hoare triple {83731#true} havoc ~lk6~0; {83731#true} is VALID [2020-07-18 05:08:30,398 INFO L280 TraceCheckUtils]: 28: Hoare triple {83731#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {83731#true} is VALID [2020-07-18 05:08:30,398 INFO L280 TraceCheckUtils]: 29: Hoare triple {83731#true} ~p7~0 := #t~nondet6; {83731#true} is VALID [2020-07-18 05:08:30,398 INFO L280 TraceCheckUtils]: 30: Hoare triple {83731#true} havoc #t~nondet6; {83731#true} is VALID [2020-07-18 05:08:30,399 INFO L280 TraceCheckUtils]: 31: Hoare triple {83731#true} havoc ~lk7~0; {83731#true} is VALID [2020-07-18 05:08:30,399 INFO L280 TraceCheckUtils]: 32: Hoare triple {83731#true} havoc ~cond~0; {83731#true} is VALID [2020-07-18 05:08:30,399 INFO L280 TraceCheckUtils]: 33: Hoare triple {83731#true} assume !false; {83731#true} is VALID [2020-07-18 05:08:30,399 INFO L280 TraceCheckUtils]: 34: Hoare triple {83731#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {83731#true} is VALID [2020-07-18 05:08:30,399 INFO L280 TraceCheckUtils]: 35: Hoare triple {83731#true} ~cond~0 := #t~nondet7; {83731#true} is VALID [2020-07-18 05:08:30,400 INFO L280 TraceCheckUtils]: 36: Hoare triple {83731#true} havoc #t~nondet7; {83731#true} is VALID [2020-07-18 05:08:30,400 INFO L280 TraceCheckUtils]: 37: Hoare triple {83731#true} assume !(0 == ~cond~0); {83731#true} is VALID [2020-07-18 05:08:30,400 INFO L280 TraceCheckUtils]: 38: Hoare triple {83731#true} ~lk1~0 := 0; {83731#true} is VALID [2020-07-18 05:08:30,400 INFO L280 TraceCheckUtils]: 39: Hoare triple {83731#true} ~lk2~0 := 0; {83731#true} is VALID [2020-07-18 05:08:30,401 INFO L280 TraceCheckUtils]: 40: Hoare triple {83731#true} ~lk3~0 := 0; {83731#true} is VALID [2020-07-18 05:08:30,401 INFO L280 TraceCheckUtils]: 41: Hoare triple {83731#true} ~lk4~0 := 0; {83731#true} is VALID [2020-07-18 05:08:30,401 INFO L280 TraceCheckUtils]: 42: Hoare triple {83731#true} ~lk5~0 := 0; {83731#true} is VALID [2020-07-18 05:08:30,401 INFO L280 TraceCheckUtils]: 43: Hoare triple {83731#true} ~lk6~0 := 0; {83731#true} is VALID [2020-07-18 05:08:30,401 INFO L280 TraceCheckUtils]: 44: Hoare triple {83731#true} ~lk7~0 := 0; {83731#true} is VALID [2020-07-18 05:08:30,402 INFO L280 TraceCheckUtils]: 45: Hoare triple {83731#true} assume !(0 != ~p1~0); {83731#true} is VALID [2020-07-18 05:08:30,402 INFO L280 TraceCheckUtils]: 46: Hoare triple {83731#true} assume !(0 != ~p2~0); {83731#true} is VALID [2020-07-18 05:08:30,402 INFO L280 TraceCheckUtils]: 47: Hoare triple {83731#true} assume !(0 != ~p3~0); {83731#true} is VALID [2020-07-18 05:08:30,402 INFO L280 TraceCheckUtils]: 48: Hoare triple {83731#true} assume !(0 != ~p4~0); {83731#true} is VALID [2020-07-18 05:08:30,402 INFO L280 TraceCheckUtils]: 49: Hoare triple {83731#true} assume !(0 != ~p5~0); {83731#true} is VALID [2020-07-18 05:08:30,403 INFO L280 TraceCheckUtils]: 50: Hoare triple {83731#true} assume 0 != ~p6~0; {83731#true} is VALID [2020-07-18 05:08:30,403 INFO L280 TraceCheckUtils]: 51: Hoare triple {83731#true} ~lk6~0 := 1; {83735#(= 1 main_~lk6~0)} is VALID [2020-07-18 05:08:30,424 INFO L280 TraceCheckUtils]: 52: Hoare triple {83735#(= 1 main_~lk6~0)} assume !(0 != ~p7~0); {83735#(= 1 main_~lk6~0)} is VALID [2020-07-18 05:08:30,425 INFO L280 TraceCheckUtils]: 53: Hoare triple {83735#(= 1 main_~lk6~0)} assume !(0 != ~p1~0); {83735#(= 1 main_~lk6~0)} is VALID [2020-07-18 05:08:30,426 INFO L280 TraceCheckUtils]: 54: Hoare triple {83735#(= 1 main_~lk6~0)} assume !(0 != ~p2~0); {83735#(= 1 main_~lk6~0)} is VALID [2020-07-18 05:08:30,428 INFO L280 TraceCheckUtils]: 55: Hoare triple {83735#(= 1 main_~lk6~0)} assume !(0 != ~p3~0); {83735#(= 1 main_~lk6~0)} is VALID [2020-07-18 05:08:30,429 INFO L280 TraceCheckUtils]: 56: Hoare triple {83735#(= 1 main_~lk6~0)} assume !(0 != ~p4~0); {83735#(= 1 main_~lk6~0)} is VALID [2020-07-18 05:08:30,429 INFO L280 TraceCheckUtils]: 57: Hoare triple {83735#(= 1 main_~lk6~0)} assume !(0 != ~p5~0); {83735#(= 1 main_~lk6~0)} is VALID [2020-07-18 05:08:30,430 INFO L280 TraceCheckUtils]: 58: Hoare triple {83735#(= 1 main_~lk6~0)} assume 0 != ~p6~0; {83735#(= 1 main_~lk6~0)} is VALID [2020-07-18 05:08:30,430 INFO L280 TraceCheckUtils]: 59: Hoare triple {83735#(= 1 main_~lk6~0)} assume 1 != ~lk6~0; {83732#false} is VALID [2020-07-18 05:08:30,431 INFO L280 TraceCheckUtils]: 60: Hoare triple {83732#false} assume !false; {83732#false} is VALID [2020-07-18 05:08:30,433 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:30,433 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [390792123] [2020-07-18 05:08:30,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:08:30,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:08:30,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926895900] [2020-07-18 05:08:30,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-07-18 05:08:30,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:08:30,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:08:30,499 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:08:30,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:08:30,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:08:30,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:08:30,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:08:30,501 INFO L87 Difference]: Start difference. First operand 3635 states and 4370 transitions. Second operand 3 states. [2020-07-18 05:08:41,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:08:41,420 INFO L93 Difference]: Finished difference Result 4087 states and 4852 transitions. [2020-07-18 05:08:41,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:08:41,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-07-18 05:08:41,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:08:41,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:08:41,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2020-07-18 05:08:41,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:08:41,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2020-07-18 05:08:41,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 137 transitions. [2020-07-18 05:08:41,544 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:08:41,822 INFO L225 Difference]: With dead ends: 4087 [2020-07-18 05:08:41,822 INFO L226 Difference]: Without dead ends: 2917 [2020-07-18 05:08:41,824 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:41,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2020-07-18 05:08:47,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 2467. [2020-07-18 05:08:47,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:08:47,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2917 states. Second operand 2467 states. [2020-07-18 05:08:47,843 INFO L74 IsIncluded]: Start isIncluded. First operand 2917 states. Second operand 2467 states. [2020-07-18 05:08:47,843 INFO L87 Difference]: Start difference. First operand 2917 states. Second operand 2467 states. [2020-07-18 05:08:48,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:08:48,071 INFO L93 Difference]: Finished difference Result 2917 states and 3395 transitions. [2020-07-18 05:08:48,071 INFO L276 IsEmpty]: Start isEmpty. Operand 2917 states and 3395 transitions. [2020-07-18 05:08:48,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:08:48,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:08:48,074 INFO L74 IsIncluded]: Start isIncluded. First operand 2467 states. Second operand 2917 states. [2020-07-18 05:08:48,074 INFO L87 Difference]: Start difference. First operand 2467 states. Second operand 2917 states. [2020-07-18 05:08:48,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:08:48,318 INFO L93 Difference]: Finished difference Result 2917 states and 3395 transitions. [2020-07-18 05:08:48,318 INFO L276 IsEmpty]: Start isEmpty. Operand 2917 states and 3395 transitions. [2020-07-18 05:08:48,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:08:48,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:08:48,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:08:48,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:08:48,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2467 states. [2020-07-18 05:08:48,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 2914 transitions. [2020-07-18 05:08:48,499 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 2914 transitions. Word has length 61 [2020-07-18 05:08:48,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:08:48,499 INFO L479 AbstractCegarLoop]: Abstraction has 2467 states and 2914 transitions. [2020-07-18 05:08:48,499 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:08:48,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2467 states and 2914 transitions. [2020-07-18 05:08:52,210 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2914 edges. 2914 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:08:52,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 2914 transitions. [2020-07-18 05:08:52,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-07-18 05:08:52,212 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:08:52,212 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:08:52,212 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-18 05:08:52,212 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:08:52,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:08:52,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1060451273, now seen corresponding path program 1 times [2020-07-18 05:08:52,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:08:52,213 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [113205736] [2020-07-18 05:08:52,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:08:52,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:08:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:08:52,250 INFO L280 TraceCheckUtils]: 0: Hoare triple {102680#true} assume true; {102680#true} is VALID [2020-07-18 05:08:52,250 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {102680#true} {102680#true} #199#return; {102680#true} is VALID [2020-07-18 05:08:52,251 INFO L263 TraceCheckUtils]: 0: Hoare triple {102680#true} call ULTIMATE.init(); {102680#true} is VALID [2020-07-18 05:08:52,251 INFO L280 TraceCheckUtils]: 1: Hoare triple {102680#true} assume true; {102680#true} is VALID [2020-07-18 05:08:52,251 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {102680#true} {102680#true} #199#return; {102680#true} is VALID [2020-07-18 05:08:52,252 INFO L263 TraceCheckUtils]: 3: Hoare triple {102680#true} call #t~ret8 := main(); {102680#true} is VALID [2020-07-18 05:08:52,252 INFO L280 TraceCheckUtils]: 4: Hoare triple {102680#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {102680#true} is VALID [2020-07-18 05:08:52,252 INFO L280 TraceCheckUtils]: 5: Hoare triple {102680#true} ~p1~0 := #t~nondet0; {102680#true} is VALID [2020-07-18 05:08:52,253 INFO L280 TraceCheckUtils]: 6: Hoare triple {102680#true} havoc #t~nondet0; {102680#true} is VALID [2020-07-18 05:08:52,253 INFO L280 TraceCheckUtils]: 7: Hoare triple {102680#true} havoc ~lk1~0; {102680#true} is VALID [2020-07-18 05:08:52,253 INFO L280 TraceCheckUtils]: 8: Hoare triple {102680#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {102680#true} is VALID [2020-07-18 05:08:52,253 INFO L280 TraceCheckUtils]: 9: Hoare triple {102680#true} ~p2~0 := #t~nondet1; {102680#true} is VALID [2020-07-18 05:08:52,253 INFO L280 TraceCheckUtils]: 10: Hoare triple {102680#true} havoc #t~nondet1; {102680#true} is VALID [2020-07-18 05:08:52,254 INFO L280 TraceCheckUtils]: 11: Hoare triple {102680#true} havoc ~lk2~0; {102680#true} is VALID [2020-07-18 05:08:52,254 INFO L280 TraceCheckUtils]: 12: Hoare triple {102680#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {102680#true} is VALID [2020-07-18 05:08:52,254 INFO L280 TraceCheckUtils]: 13: Hoare triple {102680#true} ~p3~0 := #t~nondet2; {102680#true} is VALID [2020-07-18 05:08:52,254 INFO L280 TraceCheckUtils]: 14: Hoare triple {102680#true} havoc #t~nondet2; {102680#true} is VALID [2020-07-18 05:08:52,254 INFO L280 TraceCheckUtils]: 15: Hoare triple {102680#true} havoc ~lk3~0; {102680#true} is VALID [2020-07-18 05:08:52,254 INFO L280 TraceCheckUtils]: 16: Hoare triple {102680#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {102680#true} is VALID [2020-07-18 05:08:52,255 INFO L280 TraceCheckUtils]: 17: Hoare triple {102680#true} ~p4~0 := #t~nondet3; {102680#true} is VALID [2020-07-18 05:08:52,255 INFO L280 TraceCheckUtils]: 18: Hoare triple {102680#true} havoc #t~nondet3; {102680#true} is VALID [2020-07-18 05:08:52,255 INFO L280 TraceCheckUtils]: 19: Hoare triple {102680#true} havoc ~lk4~0; {102680#true} is VALID [2020-07-18 05:08:52,255 INFO L280 TraceCheckUtils]: 20: Hoare triple {102680#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {102680#true} is VALID [2020-07-18 05:08:52,255 INFO L280 TraceCheckUtils]: 21: Hoare triple {102680#true} ~p5~0 := #t~nondet4; {102680#true} is VALID [2020-07-18 05:08:52,256 INFO L280 TraceCheckUtils]: 22: Hoare triple {102680#true} havoc #t~nondet4; {102680#true} is VALID [2020-07-18 05:08:52,256 INFO L280 TraceCheckUtils]: 23: Hoare triple {102680#true} havoc ~lk5~0; {102680#true} is VALID [2020-07-18 05:08:52,256 INFO L280 TraceCheckUtils]: 24: Hoare triple {102680#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {102680#true} is VALID [2020-07-18 05:08:52,256 INFO L280 TraceCheckUtils]: 25: Hoare triple {102680#true} ~p6~0 := #t~nondet5; {102680#true} is VALID [2020-07-18 05:08:52,256 INFO L280 TraceCheckUtils]: 26: Hoare triple {102680#true} havoc #t~nondet5; {102680#true} is VALID [2020-07-18 05:08:52,256 INFO L280 TraceCheckUtils]: 27: Hoare triple {102680#true} havoc ~lk6~0; {102680#true} is VALID [2020-07-18 05:08:52,257 INFO L280 TraceCheckUtils]: 28: Hoare triple {102680#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {102680#true} is VALID [2020-07-18 05:08:52,257 INFO L280 TraceCheckUtils]: 29: Hoare triple {102680#true} ~p7~0 := #t~nondet6; {102680#true} is VALID [2020-07-18 05:08:52,257 INFO L280 TraceCheckUtils]: 30: Hoare triple {102680#true} havoc #t~nondet6; {102680#true} is VALID [2020-07-18 05:08:52,257 INFO L280 TraceCheckUtils]: 31: Hoare triple {102680#true} havoc ~lk7~0; {102680#true} is VALID [2020-07-18 05:08:52,257 INFO L280 TraceCheckUtils]: 32: Hoare triple {102680#true} havoc ~cond~0; {102680#true} is VALID [2020-07-18 05:08:52,258 INFO L280 TraceCheckUtils]: 33: Hoare triple {102680#true} assume !false; {102680#true} is VALID [2020-07-18 05:08:52,258 INFO L280 TraceCheckUtils]: 34: Hoare triple {102680#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {102680#true} is VALID [2020-07-18 05:08:52,258 INFO L280 TraceCheckUtils]: 35: Hoare triple {102680#true} ~cond~0 := #t~nondet7; {102680#true} is VALID [2020-07-18 05:08:52,258 INFO L280 TraceCheckUtils]: 36: Hoare triple {102680#true} havoc #t~nondet7; {102680#true} is VALID [2020-07-18 05:08:52,258 INFO L280 TraceCheckUtils]: 37: Hoare triple {102680#true} assume !(0 == ~cond~0); {102680#true} is VALID [2020-07-18 05:08:52,258 INFO L280 TraceCheckUtils]: 38: Hoare triple {102680#true} ~lk1~0 := 0; {102680#true} is VALID [2020-07-18 05:08:52,259 INFO L280 TraceCheckUtils]: 39: Hoare triple {102680#true} ~lk2~0 := 0; {102680#true} is VALID [2020-07-18 05:08:52,259 INFO L280 TraceCheckUtils]: 40: Hoare triple {102680#true} ~lk3~0 := 0; {102680#true} is VALID [2020-07-18 05:08:52,259 INFO L280 TraceCheckUtils]: 41: Hoare triple {102680#true} ~lk4~0 := 0; {102680#true} is VALID [2020-07-18 05:08:52,259 INFO L280 TraceCheckUtils]: 42: Hoare triple {102680#true} ~lk5~0 := 0; {102680#true} is VALID [2020-07-18 05:08:52,259 INFO L280 TraceCheckUtils]: 43: Hoare triple {102680#true} ~lk6~0 := 0; {102680#true} is VALID [2020-07-18 05:08:52,259 INFO L280 TraceCheckUtils]: 44: Hoare triple {102680#true} ~lk7~0 := 0; {102680#true} is VALID [2020-07-18 05:08:52,260 INFO L280 TraceCheckUtils]: 45: Hoare triple {102680#true} assume !(0 != ~p1~0); {102680#true} is VALID [2020-07-18 05:08:52,260 INFO L280 TraceCheckUtils]: 46: Hoare triple {102680#true} assume !(0 != ~p2~0); {102680#true} is VALID [2020-07-18 05:08:52,260 INFO L280 TraceCheckUtils]: 47: Hoare triple {102680#true} assume !(0 != ~p3~0); {102680#true} is VALID [2020-07-18 05:08:52,260 INFO L280 TraceCheckUtils]: 48: Hoare triple {102680#true} assume !(0 != ~p4~0); {102680#true} is VALID [2020-07-18 05:08:52,260 INFO L280 TraceCheckUtils]: 49: Hoare triple {102680#true} assume !(0 != ~p5~0); {102680#true} is VALID [2020-07-18 05:08:52,260 INFO L280 TraceCheckUtils]: 50: Hoare triple {102680#true} assume !(0 != ~p6~0); {102680#true} is VALID [2020-07-18 05:08:52,261 INFO L280 TraceCheckUtils]: 51: Hoare triple {102680#true} assume 0 != ~p7~0; {102680#true} is VALID [2020-07-18 05:08:52,261 INFO L280 TraceCheckUtils]: 52: Hoare triple {102680#true} ~lk7~0 := 1; {102684#(= main_~lk7~0 1)} is VALID [2020-07-18 05:08:52,262 INFO L280 TraceCheckUtils]: 53: Hoare triple {102684#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {102684#(= main_~lk7~0 1)} is VALID [2020-07-18 05:08:52,262 INFO L280 TraceCheckUtils]: 54: Hoare triple {102684#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {102684#(= main_~lk7~0 1)} is VALID [2020-07-18 05:08:52,263 INFO L280 TraceCheckUtils]: 55: Hoare triple {102684#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {102684#(= main_~lk7~0 1)} is VALID [2020-07-18 05:08:52,263 INFO L280 TraceCheckUtils]: 56: Hoare triple {102684#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {102684#(= main_~lk7~0 1)} is VALID [2020-07-18 05:08:52,264 INFO L280 TraceCheckUtils]: 57: Hoare triple {102684#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {102684#(= main_~lk7~0 1)} is VALID [2020-07-18 05:08:52,264 INFO L280 TraceCheckUtils]: 58: Hoare triple {102684#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {102684#(= main_~lk7~0 1)} is VALID [2020-07-18 05:08:52,265 INFO L280 TraceCheckUtils]: 59: Hoare triple {102684#(= main_~lk7~0 1)} assume 0 != ~p7~0; {102684#(= main_~lk7~0 1)} is VALID [2020-07-18 05:08:52,265 INFO L280 TraceCheckUtils]: 60: Hoare triple {102684#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {102681#false} is VALID [2020-07-18 05:08:52,265 INFO L280 TraceCheckUtils]: 61: Hoare triple {102681#false} assume !false; {102681#false} is VALID [2020-07-18 05:08:52,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:08:52,268 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [113205736] [2020-07-18 05:08:52,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:08:52,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 05:08:52,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268739935] [2020-07-18 05:08:52,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-07-18 05:08:52,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:08:52,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 05:08:52,320 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:08:52,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 05:08:52,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:08:52,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 05:08:52,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 05:08:52,321 INFO L87 Difference]: Start difference. First operand 2467 states and 2914 transitions. Second operand 3 states. [2020-07-18 05:08:59,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:08:59,015 INFO L93 Difference]: Finished difference Result 2467 states and 2914 transitions. [2020-07-18 05:08:59,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 05:08:59,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-07-18 05:08:59,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:08:59,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:08:59,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2020-07-18 05:08:59,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 05:08:59,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2020-07-18 05:08:59,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 94 transitions. [2020-07-18 05:08:59,103 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:08:59,103 INFO L225 Difference]: With dead ends: 2467 [2020-07-18 05:08:59,103 INFO L226 Difference]: Without dead ends: 0 [2020-07-18 05:08:59,108 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:59,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-18 05:08:59,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-18 05:08:59,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:08:59,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-18 05:08:59,109 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 05:08:59,109 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 05:08:59,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:08:59,110 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 05:08:59,110 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 05:08:59,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:08:59,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:08:59,110 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 05:08:59,110 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 05:08:59,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:08:59,111 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 05:08:59,111 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 05:08:59,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:08:59,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:08:59,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:08:59,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:08:59,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-18 05:08:59,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-18 05:08:59,112 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2020-07-18 05:08:59,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:08:59,112 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-18 05:08:59,112 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 05:08:59,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-18 05:08:59,112 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:08:59,113 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 05:08:59,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:08:59,113 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-18 05:08:59,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-18 05:08:59,252 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-18 05:08:59,618 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 275 DAG size of output: 3 [2020-07-18 05:08:59,719 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 7 [2020-07-18 05:08:59,897 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 340 DAG size of output: 7 [2020-07-18 05:09:00,266 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 91 [2020-07-18 05:09:00,821 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 91 [2020-07-18 05:09:01,250 WARN L193 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2020-07-18 05:09:01,366 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 55 [2020-07-18 05:09:01,605 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 15 [2020-07-18 05:09:02,713 WARN L193 SmtUtils]: Spent 878.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-18 05:09:03,082 WARN L193 SmtUtils]: Spent 364.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-18 05:09:03,286 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-18 05:09:03,750 WARN L193 SmtUtils]: Spent 378.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-18 05:09:04,710 WARN L193 SmtUtils]: Spent 896.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-18 05:09:04,868 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-18 05:09:05,028 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-18 05:09:05,431 WARN L193 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-18 05:09:06,339 WARN L193 SmtUtils]: Spent 891.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-18 05:09:07,374 WARN L193 SmtUtils]: Spent 995.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-07-18 05:09:07,536 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-18 05:09:10,089 WARN L193 SmtUtils]: Spent 2.54 s on a formula simplification that was a NOOP. DAG size: 159 [2020-07-18 05:09:10,417 WARN L193 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-18 05:09:10,718 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-18 05:09:11,057 WARN L193 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-18 05:09:12,087 WARN L193 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 93 [2020-07-18 05:09:12,101 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-18 05:09:12,101 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-18 05:09:12,101 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-18 05:09:12,101 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 05:09:12,101 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-18 05:09:12,102 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-18 05:09:12,102 INFO L264 CegarLoopResult]: At program point L93(line 93) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk7~0)) (.cse1 (= 0 main_~p4~0)) (.cse3 (= 0 main_~p5~0)) (.cse4 (= 0 main_~p6~0)) (.cse6 (= 1 main_~lk6~0)) (.cse5 (= 0 main_~p7~0)) (.cse2 (= 1 main_~lk3~0)) (.cse7 (= 1 main_~lk5~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse5 .cse1 .cse2 .cse7) (and .cse5 .cse2 .cse4 .cse7 .cse8) (and .cse6 .cse0 .cse2 .cse7 .cse8) (and .cse6 .cse5 .cse2 .cse3 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse8) (and .cse6 .cse0 .cse1 .cse2 .cse3) (and .cse5 .cse1 .cse2 .cse4 .cse7) (and .cse6 .cse5 .cse1 .cse2 .cse3) (and .cse6 .cse0 .cse2 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse7) (and .cse0 .cse2 .cse4 .cse7 .cse8) (and .cse6 .cse0 .cse1 .cse2 .cse7) (and .cse5 .cse2 .cse3 .cse4 .cse8) (and .cse6 .cse5 .cse2 .cse7 .cse8))) [2020-07-18 05:09:12,102 INFO L264 CegarLoopResult]: At program point L60(line 60) 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:09:12,102 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 4 121) the Hoare annotation is: true [2020-07-18 05:09:12,103 INFO L271 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: true [2020-07-18 05:09:12,103 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-18 05:09:12,103 INFO L264 CegarLoopResult]: At program point L102(line 102) the Hoare annotation is: (let ((.cse3 (= 1 main_~lk6~0)) (.cse0 (= 0 main_~p7~0)) (.cse4 (= 1 main_~lk7~0)) (.cse1 (= 0 main_~p6~0)) (.cse2 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse3 .cse0 .cse2) (and .cse4 .cse1 .cse2))) [2020-07-18 05:09:12,103 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-07-18 05:09:12,104 INFO L264 CegarLoopResult]: At program point L86-1(lines 30 116) the Hoare annotation is: (let ((.cse5 (= 1 main_~lk7~0)) (.cse1 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p4~0)) (.cse9 (= 1 main_~lk6~0)) (.cse7 (= 1 main_~lk5~0)) (.cse0 (= 0 main_~p7~0)) (.cse6 (= 1 main_~lk3~0)) (.cse3 (= 0 main_~p5~0)) (.cse4 (= 0 main_~p6~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse2 .cse6 .cse3 .cse4) (and .cse0 .cse6 .cse4 .cse7 .cse8) (and .cse5 .cse6 .cse3 .cse4 .cse8) (and .cse9 .cse5 .cse2 .cse6 .cse3) (and .cse9 .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse6 .cse4 .cse7) (and .cse9 .cse5 .cse6 .cse3 .cse8) (and .cse1 .cse5 .cse4 .cse7 .cse8) (and .cse5 .cse2 .cse6 .cse4 .cse7) (and .cse9 .cse0 .cse1 .cse3 .cse8) (and .cse1 .cse5 .cse2 .cse4 .cse7) (and .cse9 .cse1 .cse5 .cse2 .cse7) (and .cse9 .cse5 .cse2 .cse6 .cse7) (and .cse0 .cse1 .cse4 .cse7 .cse8) (and .cse1 .cse5 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4 .cse8) (and .cse9 .cse1 .cse5 .cse7 .cse8) (and .cse0 .cse2 .cse6 .cse3 .cse4) (and .cse9 .cse0 .cse2 .cse6 .cse7) (and .cse9 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse1 .cse5 .cse2 .cse3) (and .cse9 .cse0 .cse1 .cse2 .cse7) (and .cse9 .cse0 .cse6 .cse3 .cse8) (and .cse9 .cse1 .cse5 .cse3 .cse8) (and .cse1 .cse5 .cse3 .cse4 .cse8) (and .cse9 .cse0 .cse2 .cse6 .cse3) (and .cse9 .cse0 .cse1 .cse7 .cse8) (and .cse5 .cse6 .cse4 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse7) (and .cse9 .cse0 .cse6 .cse7 .cse8) (and .cse0 .cse6 .cse3 .cse4 .cse8))) [2020-07-18 05:09:12,104 INFO L271 CegarLoopResult]: At program point L111-1(lines 30 116) the Hoare annotation is: true [2020-07-18 05:09:12,104 INFO L271 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: true [2020-07-18 05:09:12,104 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-07-18 05:09:12,104 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-07-18 05:09:12,104 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-07-18 05:09:12,104 INFO L264 CegarLoopResult]: At program point L103(line 103) the Hoare annotation is: (let ((.cse3 (= 1 main_~lk6~0)) (.cse0 (= 0 main_~p7~0)) (.cse4 (= 1 main_~lk7~0)) (.cse1 (= 0 main_~p6~0)) (.cse2 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse3 .cse0 .cse2) (and .cse4 .cse1 .cse2))) [2020-07-18 05:09:12,104 INFO L271 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: true [2020-07-18 05:09:12,104 INFO L264 CegarLoopResult]: At program point L120(line 120) the Hoare annotation is: false [2020-07-18 05:09:12,105 INFO L264 CegarLoopResult]: At program point L87(line 87) the Hoare annotation is: (let ((.cse3 (= 1 main_~lk7~0)) (.cse9 (= 1 main_~lk3~0)) (.cse0 (= 1 main_~lk6~0)) (.cse6 (= 0 main_~p4~0)) (.cse7 (= 1 main_~lk5~0)) (.cse8 (= 0 main_~p7~0)) (.cse1 (= 0 main_~p3~0)) (.cse2 (= 1 main_~lk2~0)) (.cse4 (= 0 main_~p5~0)) (.cse10 (= 0 main_~p6~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse5) (and .cse2 .cse3 .cse6 .cse9 .cse10 .cse7) (and .cse0 .cse2 .cse3 .cse9 .cse7 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse4) (and .cse8 .cse2 .cse9 .cse4 .cse10 .cse5) (and .cse8 .cse2 .cse6 .cse9 .cse4 .cse10) (and .cse0 .cse8 .cse2 .cse9 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse2 .cse7 .cse5) (and .cse8 .cse2 .cse6 .cse9 .cse10 .cse7) (and .cse2 .cse3 .cse9 .cse10 .cse7 .cse5) (and .cse2 .cse3 .cse6 .cse9 .cse4 .cse10) (and .cse2 .cse3 .cse9 .cse4 .cse10 .cse5) (and .cse1 .cse2 .cse3 .cse6 .cse4 .cse10) (and .cse8 .cse1 .cse2 .cse6 .cse10 .cse7) (and .cse1 .cse2 .cse3 .cse6 .cse10 .cse7) (and .cse1 .cse2 .cse3 .cse10 .cse7 .cse5) (and .cse0 .cse8 .cse1 .cse2 .cse6 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse0 .cse8 .cse2 .cse6 .cse9 .cse4) (and .cse8 .cse1 .cse2 .cse6 .cse4 .cse10) (and .cse8 .cse2 .cse9 .cse10 .cse7 .cse5) (and .cse0 .cse8 .cse2 .cse9 .cse7 .cse5) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse5) (and .cse0 .cse2 .cse3 .cse6 .cse9 .cse7) (and .cse0 .cse2 .cse3 .cse6 .cse9 .cse4) (and .cse0 .cse2 .cse3 .cse9 .cse4 .cse5) (and .cse8 .cse1 .cse2 .cse10 .cse7 .cse5) (and .cse0 .cse8 .cse2 .cse6 .cse9 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse4 .cse10 .cse5))) [2020-07-18 05:09:12,105 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-07-18 05:09:12,105 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-07-18 05:09:12,105 INFO L271 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: true [2020-07-18 05:09:12,105 INFO L264 CegarLoopResult]: At program point L112(line 112) the Hoare annotation is: (= 1 main_~lk7~0) [2020-07-18 05:09:12,105 INFO L264 CegarLoopResult]: At program point L112-1(lines 5 121) the Hoare annotation is: false [2020-07-18 05:09:12,105 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-07-18 05:09:12,105 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 4 121) the Hoare annotation is: true [2020-07-18 05:09:12,106 INFO L264 CegarLoopResult]: At program point L71-1(lines 30 116) 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 .cse0 .cse9 .cse6 .cse3 .cse7 .cse8) (and .cse11 .cse0 .cse9 .cse6 .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 .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 .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:09:12,106 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 119) the Hoare annotation is: false [2020-07-18 05:09:12,106 INFO L264 CegarLoopResult]: At program point L96-1(lines 30 116) the Hoare annotation is: (let ((.cse4 (= 0 main_~p5~0)) (.cse3 (= 1 main_~lk6~0)) (.cse0 (= 0 main_~p7~0)) (.cse5 (= 1 main_~lk7~0)) (.cse1 (= 0 main_~p6~0)) (.cse2 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse4) (and .cse0 .cse4 .cse1) (and .cse5 .cse4 .cse1) (and .cse3 .cse5 .cse2) (and .cse3 .cse5 .cse4) (and .cse3 .cse0 .cse2) (and .cse5 .cse1 .cse2))) [2020-07-18 05:09:12,107 INFO L264 CegarLoopResult]: At program point L63-1(lines 30 116) 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:09:12,107 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 121) the Hoare annotation is: true [2020-07-18 05:09:12,107 INFO L264 CegarLoopResult]: At program point L88(line 88) the Hoare annotation is: (let ((.cse3 (= 1 main_~lk7~0)) (.cse9 (= 1 main_~lk3~0)) (.cse0 (= 1 main_~lk6~0)) (.cse6 (= 0 main_~p4~0)) (.cse7 (= 1 main_~lk5~0)) (.cse8 (= 0 main_~p7~0)) (.cse1 (= 0 main_~p3~0)) (.cse2 (= 1 main_~lk2~0)) (.cse4 (= 0 main_~p5~0)) (.cse10 (= 0 main_~p6~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse5) (and .cse2 .cse3 .cse6 .cse9 .cse10 .cse7) (and .cse0 .cse2 .cse3 .cse9 .cse7 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse4) (and .cse8 .cse2 .cse9 .cse4 .cse10 .cse5) (and .cse8 .cse2 .cse6 .cse9 .cse4 .cse10) (and .cse0 .cse8 .cse2 .cse9 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse2 .cse7 .cse5) (and .cse8 .cse2 .cse6 .cse9 .cse10 .cse7) (and .cse2 .cse3 .cse9 .cse10 .cse7 .cse5) (and .cse2 .cse3 .cse6 .cse9 .cse4 .cse10) (and .cse2 .cse3 .cse9 .cse4 .cse10 .cse5) (and .cse1 .cse2 .cse3 .cse6 .cse4 .cse10) (and .cse8 .cse1 .cse2 .cse6 .cse10 .cse7) (and .cse1 .cse2 .cse3 .cse6 .cse10 .cse7) (and .cse1 .cse2 .cse3 .cse10 .cse7 .cse5) (and .cse0 .cse8 .cse1 .cse2 .cse6 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse0 .cse8 .cse2 .cse6 .cse9 .cse4) (and .cse8 .cse1 .cse2 .cse6 .cse4 .cse10) (and .cse8 .cse2 .cse9 .cse10 .cse7 .cse5) (and .cse0 .cse8 .cse2 .cse9 .cse7 .cse5) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse5) (and .cse0 .cse2 .cse3 .cse6 .cse9 .cse7) (and .cse0 .cse2 .cse3 .cse6 .cse9 .cse4) (and .cse0 .cse2 .cse3 .cse9 .cse4 .cse5) (and .cse8 .cse1 .cse2 .cse10 .cse7 .cse5) (and .cse0 .cse8 .cse2 .cse6 .cse9 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse4 .cse10 .cse5))) [2020-07-18 05:09:12,107 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-07-18 05:09:12,107 INFO L264 CegarLoopResult]: At program point L55-1(lines 30 116) 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:09:12,107 INFO L264 CegarLoopResult]: At program point L113(line 113) the Hoare annotation is: (= 1 main_~lk7~0) [2020-07-18 05:09:12,107 INFO L271 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: true [2020-07-18 05:09:12,108 INFO L264 CegarLoopResult]: At program point L72(line 72) 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 .cse1 .cse7 .cse2 .cse6 .cse4) (and .cse5 .cse7 .cse9 .cse3 .cse8) (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 .cse7 .cse2 .cse6 .cse9 .cse8) (and .cse0 .cse2 .cse3 .cse4 .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:09:12,108 INFO L271 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: true [2020-07-18 05:09:12,108 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-18 05:09:12,108 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-07-18 05:09:12,108 INFO L264 CegarLoopResult]: At program point L97(line 97) the Hoare annotation is: (let ((.cse5 (= 0 main_~p6~0)) (.cse2 (= 1 main_~lk5~0)) (.cse6 (= 1 main_~lk7~0)) (.cse0 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p7~0)) (.cse4 (= 0 main_~p5~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse4 .cse5 .cse3) (and .cse0 .cse6 .cse2 .cse3) (and .cse6 .cse4 .cse5 .cse3) (and .cse6 .cse5 .cse2 .cse3) (and .cse1 .cse5 .cse2 .cse3) (and .cse0 .cse6 .cse4 .cse3) (and .cse0 .cse1 .cse4 .cse3))) [2020-07-18 05:09:12,108 INFO L264 CegarLoopResult]: At program point L64(line 64) 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:09:12,108 INFO L271 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-07-18 05:09:12,108 INFO L271 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: true [2020-07-18 05:09:12,108 INFO L271 CegarLoopResult]: At program point L31-2(line 31) the Hoare annotation is: true [2020-07-18 05:09:12,109 INFO L264 CegarLoopResult]: At program point L56(line 56) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-18 05:09:12,109 INFO L264 CegarLoopResult]: At program point L81-1(lines 30 116) the Hoare annotation is: (let ((.cse4 (= 0 main_~p5~0)) (.cse5 (= 1 main_~lk4~0)) (.cse8 (= 1 main_~lk3~0)) (.cse0 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p7~0)) (.cse3 (= 1 main_~lk2~0)) (.cse2 (= 0 main_~p3~0)) (.cse6 (= 1 main_~lk7~0)) (.cse7 (= 0 main_~p4~0)) (.cse11 (= 0 main_~p2~0)) (.cse9 (= 0 main_~p6~0)) (.cse10 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse3 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse3 .cse6 .cse8 .cse10 .cse5) (and .cse0 .cse2 .cse6 .cse11 .cse4 .cse5) (and .cse1 .cse2 .cse7 .cse11 .cse9 .cse10) (and .cse1 .cse3 .cse8 .cse4 .cse9 .cse5) (and .cse1 .cse3 .cse7 .cse8 .cse4 .cse9) (and .cse0 .cse1 .cse11 .cse8 .cse4 .cse5) (and .cse3 .cse6 .cse8 .cse9 .cse10 .cse5) (and .cse3 .cse6 .cse7 .cse8 .cse4 .cse9) (and .cse0 .cse2 .cse6 .cse11 .cse10 .cse5) (and .cse3 .cse6 .cse8 .cse4 .cse9 .cse5) (and .cse2 .cse3 .cse6 .cse7 .cse4 .cse9) (and .cse1 .cse2 .cse3 .cse7 .cse9 .cse10) (and .cse1 .cse2 .cse7 .cse11 .cse4 .cse9) (and .cse2 .cse3 .cse6 .cse9 .cse10 .cse5) (and .cse2 .cse6 .cse7 .cse11 .cse4 .cse9) (and .cse2 .cse3 .cse6 .cse7 .cse9 .cse10) (and .cse0 .cse2 .cse6 .cse7 .cse11 .cse4) (and .cse1 .cse7 .cse11 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse3 .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse7 .cse11 .cse8 .cse10) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse9) (and .cse2 .cse6 .cse11 .cse4 .cse9 .cse5) (and .cse0 .cse1 .cse2 .cse7 .cse11 .cse10) (and .cse0 .cse1 .cse11 .cse8 .cse10 .cse5) (and .cse0 .cse3 .cse6 .cse7 .cse8 .cse10) (and .cse6 .cse7 .cse11 .cse8 .cse9 .cse10) (and .cse0 .cse6 .cse7 .cse11 .cse8 .cse4) (and .cse0 .cse6 .cse7 .cse11 .cse8 .cse10) (and .cse0 .cse3 .cse6 .cse8 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse9 .cse10 .cse5) (and .cse1 .cse2 .cse3 .cse9 .cse10 .cse5) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse5) (and .cse0 .cse2 .cse3 .cse6 .cse4 .cse5) (and .cse0 .cse6 .cse11 .cse8 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse6 .cse7 .cse10) (and .cse0 .cse2 .cse6 .cse7 .cse11 .cse10) (and .cse0 .cse1 .cse2 .cse11 .cse10 .cse5) (and .cse2 .cse6 .cse11 .cse9 .cse10 .cse5) (and .cse1 .cse11 .cse8 .cse4 .cse9 .cse5) (and .cse0 .cse2 .cse3 .cse6 .cse7 .cse4) (and .cse1 .cse2 .cse11 .cse4 .cse9 .cse5) (and .cse1 .cse7 .cse11 .cse8 .cse4 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse0 .cse1 .cse3 .cse8 .cse4 .cse5) (and .cse1 .cse3 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse7 .cse11 .cse8 .cse4) (and .cse1 .cse11 .cse8 .cse9 .cse10 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse5) (and .cse1 .cse3 .cse8 .cse9 .cse10 .cse5) (and .cse0 .cse1 .cse3 .cse8 .cse10 .cse5) (and .cse6 .cse7 .cse11 .cse8 .cse4 .cse9) (and .cse6 .cse11 .cse8 .cse4 .cse9 .cse5) (and .cse2 .cse3 .cse6 .cse4 .cse9 .cse5) (and .cse0 .cse3 .cse6 .cse7 .cse8 .cse4) (and .cse0 .cse6 .cse11 .cse8 .cse10 .cse5) (and .cse6 .cse11 .cse8 .cse9 .cse10 .cse5) (and .cse0 .cse1 .cse2 .cse7 .cse11 .cse4) (and .cse0 .cse1 .cse2 .cse11 .cse4 .cse5) (and .cse0 .cse1 .cse3 .cse7 .cse8 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse10) (and .cse2 .cse6 .cse7 .cse11 .cse9 .cse10))) [2020-07-18 05:09:12,109 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-18 05:09:12,110 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-07-18 05:09:12,110 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-07-18 05:09:12,110 INFO L264 CegarLoopResult]: At program point L106-1(lines 30 116) the Hoare annotation is: (or (= 0 main_~p7~0) (= 1 main_~lk7~0)) [2020-07-18 05:09:12,110 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-07-18 05:09:12,110 INFO L264 CegarLoopResult]: At program point L98(line 98) the Hoare annotation is: (let ((.cse5 (= 0 main_~p6~0)) (.cse2 (= 1 main_~lk5~0)) (.cse6 (= 1 main_~lk7~0)) (.cse0 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p7~0)) (.cse4 (= 0 main_~p5~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse4 .cse5 .cse3) (and .cse0 .cse6 .cse2 .cse3) (and .cse6 .cse4 .cse5 .cse3) (and .cse1 .cse5 .cse2 .cse3) (and .cse6 .cse5 .cse2 .cse3) (and .cse0 .cse6 .cse4 .cse3) (and .cse0 .cse1 .cse4 .cse3))) [2020-07-18 05:09:12,110 INFO L271 CegarLoopResult]: At program point L32(lines 32 34) the Hoare annotation is: true [2020-07-18 05:09:12,110 INFO L271 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-07-18 05:09:12,111 INFO L271 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: true [2020-07-18 05:09:12,111 INFO L271 CegarLoopResult]: At program point L24-2(line 24) the Hoare annotation is: true [2020-07-18 05:09:12,111 INFO L264 CegarLoopResult]: At program point L82(line 82) the Hoare annotation is: (let ((.cse2 (= 0 main_~p2~0)) (.cse8 (= 0 main_~p3~0)) (.cse9 (= main_~lk7~0 1)) (.cse7 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p4~0)) (.cse10 (= 1 main_~lk5~0)) (.cse0 (= 0 main_~p7~0)) (.cse11 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk3~0)) (.cse4 (= 0 main_~p5~0)) (.cse5 (= 0 main_~p6~0)) (.cse6 (= 1 main_~lk1~0)) (.cse12 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse1 .cse2 .cse10 .cse6) (and .cse11 .cse9 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse11 .cse9 .cse10 .cse6 .cse12) (and .cse7 .cse11 .cse9 .cse1 .cse3 .cse4 .cse6) (and .cse7 .cse11 .cse9 .cse3 .cse4 .cse6 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse5 .cse10 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse9 .cse2 .cse3 .cse4 .cse6 .cse12) (and .cse9 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse9 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse8 .cse11 .cse9 .cse5 .cse10 .cse6 .cse12) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse1 .cse10 .cse6) (and .cse0 .cse11 .cse1 .cse3 .cse5 .cse10 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse4 .cse6 .cse12) (and .cse7 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse0 .cse8 .cse11 .cse1 .cse4 .cse6) (and .cse7 .cse0 .cse8 .cse11 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse11 .cse4 .cse6 .cse12) (and .cse11 .cse9 .cse1 .cse3 .cse5 .cse10 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse1 .cse4 .cse6) (and .cse7 .cse0 .cse8 .cse2 .cse4 .cse6 .cse12) (and .cse7 .cse0 .cse2 .cse3 .cse4 .cse6 .cse12) (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse2 .cse10 .cse6 .cse12) (and .cse7 .cse9 .cse2 .cse3 .cse10 .cse6 .cse12) (and .cse9 .cse2 .cse3 .cse5 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse1 .cse2 .cse4 .cse6) (and .cse11 .cse9 .cse3 .cse5 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse11 .cse3 .cse10 .cse6 .cse12) (and .cse8 .cse9 .cse2 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse11 .cse1 .cse10 .cse6) (and .cse7 .cse0 .cse11 .cse1 .cse3 .cse10 .cse6) (and .cse7 .cse8 .cse9 .cse2 .cse10 .cse6 .cse12) (and .cse0 .cse8 .cse11 .cse1 .cse5 .cse10 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse3 .cse10 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse8 .cse9 .cse1 .cse2 .cse5 .cse10 .cse6) (and .cse11 .cse9 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse1 .cse2 .cse4 .cse6) (and .cse9 .cse1 .cse2 .cse3 .cse5 .cse10 .cse6) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse6 .cse12) (and .cse0 .cse8 .cse2 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse11 .cse9 .cse3 .cse10 .cse6 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10 .cse6) (and .cse7 .cse0 .cse8 .cse1 .cse2 .cse10 .cse6) (and .cse7 .cse0 .cse11 .cse3 .cse4 .cse6 .cse12) (and .cse0 .cse8 .cse2 .cse5 .cse10 .cse6 .cse12) (and .cse8 .cse11 .cse9 .cse1 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse2 .cse4 .cse6 .cse12) (and .cse0 .cse8 .cse11 .cse5 .cse10 .cse6 .cse12) (and .cse8 .cse9 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse0 .cse8 .cse11 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse8 .cse11 .cse1 .cse4 .cse5 .cse6) (and .cse8 .cse11 .cse9 .cse1 .cse5 .cse10 .cse6) (and .cse8 .cse9 .cse2 .cse5 .cse10 .cse6 .cse12) (and .cse8 .cse11 .cse9 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse0 .cse11 .cse1 .cse3 .cse4 .cse6) (and .cse0 .cse11 .cse3 .cse5 .cse10 .cse6 .cse12) (and .cse0 .cse11 .cse3 .cse4 .cse5 .cse6 .cse12))) [2020-07-18 05:09:12,112 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-18 05:09:12,112 INFO L264 CegarLoopResult]: At program point L107(line 107) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk6~0))) (or (and .cse0 (= 1 main_~lk7~0)) (and .cse0 (= 0 main_~p7~0)))) [2020-07-18 05:09:12,112 INFO L271 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: true [2020-07-18 05:09:12,112 INFO L264 CegarLoopResult]: At program point L91-1(lines 30 116) the Hoare annotation is: (let ((.cse3 (= 1 main_~lk4~0)) (.cse0 (= 0 main_~p7~0)) (.cse7 (= 1 main_~lk5~0)) (.cse5 (= 1 main_~lk6~0)) (.cse6 (= 1 main_~lk7~0)) (.cse4 (= 0 main_~p4~0)) (.cse1 (= 0 main_~p5~0)) (.cse2 (= 0 main_~p6~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse1 .cse2) (and .cse5 .cse6 .cse7 .cse3) (and .cse6 .cse2 .cse7 .cse3) (and .cse5 .cse0 .cse1 .cse3) (and .cse6 .cse4 .cse2 .cse7) (and .cse5 .cse0 .cse7 .cse3) (and .cse6 .cse1 .cse2 .cse3) (and .cse5 .cse6 .cse4 .cse7) (and .cse5 .cse0 .cse4 .cse1) (and .cse5 .cse0 .cse4 .cse7) (and .cse5 .cse6 .cse1 .cse3) (and .cse0 .cse2 .cse7 .cse3) (and .cse0 .cse4 .cse2 .cse7) (and .cse5 .cse6 .cse4 .cse1) (and .cse6 .cse4 .cse1 .cse2))) [2020-07-18 05:09:12,112 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-07-18 05:09:12,113 INFO L264 CegarLoopResult]: At program point L83(line 83) the Hoare annotation is: (let ((.cse2 (= 0 main_~p2~0)) (.cse8 (= 0 main_~p3~0)) (.cse9 (= main_~lk7~0 1)) (.cse7 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p4~0)) (.cse10 (= 1 main_~lk5~0)) (.cse0 (= 0 main_~p7~0)) (.cse11 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk3~0)) (.cse4 (= 0 main_~p5~0)) (.cse5 (= 0 main_~p6~0)) (.cse6 (= 1 main_~lk1~0)) (.cse12 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse1 .cse2 .cse10 .cse6) (and .cse11 .cse9 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse11 .cse9 .cse1 .cse3 .cse4 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse10 .cse6 .cse12) (and .cse7 .cse11 .cse9 .cse3 .cse4 .cse6 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse5 .cse10 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse9 .cse2 .cse3 .cse4 .cse6 .cse12) (and .cse7 .cse9 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse9 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse8 .cse11 .cse9 .cse5 .cse10 .cse6 .cse12) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse1 .cse10 .cse6) (and .cse0 .cse11 .cse1 .cse3 .cse5 .cse10 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse4 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse11 .cse1 .cse4 .cse6) (and .cse7 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse0 .cse8 .cse11 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse11 .cse4 .cse6 .cse12) (and .cse11 .cse9 .cse1 .cse3 .cse5 .cse10 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse1 .cse4 .cse6) (and .cse7 .cse0 .cse8 .cse2 .cse4 .cse6 .cse12) (and .cse7 .cse0 .cse2 .cse3 .cse4 .cse6 .cse12) (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse2 .cse10 .cse6 .cse12) (and .cse9 .cse2 .cse3 .cse5 .cse10 .cse6 .cse12) (and .cse7 .cse9 .cse2 .cse3 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse1 .cse2 .cse4 .cse6) (and .cse11 .cse9 .cse3 .cse5 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse11 .cse3 .cse10 .cse6 .cse12) (and .cse8 .cse9 .cse2 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse11 .cse1 .cse10 .cse6) (and .cse7 .cse8 .cse9 .cse2 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse11 .cse1 .cse3 .cse10 .cse6) (and .cse0 .cse8 .cse11 .cse1 .cse5 .cse10 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse3 .cse10 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse8 .cse9 .cse1 .cse2 .cse5 .cse10 .cse6) (and .cse11 .cse9 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse1 .cse2 .cse4 .cse6) (and .cse9 .cse1 .cse2 .cse3 .cse5 .cse10 .cse6) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse6 .cse12) (and .cse0 .cse8 .cse2 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse11 .cse9 .cse3 .cse10 .cse6 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10 .cse6) (and .cse7 .cse0 .cse8 .cse1 .cse2 .cse10 .cse6) (and .cse0 .cse8 .cse2 .cse5 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse11 .cse3 .cse4 .cse6 .cse12) (and .cse8 .cse11 .cse9 .cse1 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse2 .cse4 .cse6 .cse12) (and .cse0 .cse8 .cse11 .cse5 .cse10 .cse6 .cse12) (and .cse0 .cse8 .cse11 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse8 .cse11 .cse1 .cse4 .cse5 .cse6) (and .cse8 .cse9 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse8 .cse11 .cse9 .cse1 .cse5 .cse10 .cse6) (and .cse8 .cse9 .cse2 .cse5 .cse10 .cse6 .cse12) (and .cse8 .cse11 .cse9 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse0 .cse11 .cse1 .cse3 .cse4 .cse6) (and .cse0 .cse11 .cse3 .cse5 .cse10 .cse6 .cse12) (and .cse0 .cse11 .cse3 .cse4 .cse5 .cse6 .cse12))) [2020-07-18 05:09:12,113 INFO L264 CegarLoopResult]: At program point L108(line 108) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk6~0))) (or (and .cse0 (= 1 main_~lk7~0)) (and .cse0 (= 0 main_~p7~0)))) [2020-07-18 05:09:12,115 INFO L264 CegarLoopResult]: At program point L75-1(lines 30 116) the Hoare annotation is: (let ((.cse7 (= 1 main_~lk6~0)) (.cse6 (= 1 main_~lk5~0)) (.cse8 (= 0 main_~p3~0)) (.cse0 (= main_~lk7~0 1)) (.cse1 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p2~0)) (.cse5 (= 0 main_~p1~0)) (.cse13 (= 0 main_~p7~0)) (.cse9 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk3~0)) (.cse10 (= 0 main_~p5~0)) (.cse4 (= 0 main_~p6~0)) (.cse11 (= 1 main_~lk1~0)) (.cse12 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse0 .cse1 .cse10 .cse5) (and .cse9 .cse0 .cse3 .cse10 .cse4 .cse11 .cse12) (and .cse7 .cse9 .cse0 .cse1 .cse3 .cse10 .cse11) (and .cse13 .cse8 .cse1 .cse2 .cse4 .cse6 .cse11) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse11 .cse12) (and .cse8 .cse9 .cse0 .cse1 .cse10 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse10 .cse4 .cse11 .cse12) (and .cse13 .cse8 .cse1 .cse2 .cse10 .cse4 .cse11) (and .cse13 .cse9 .cse1 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse9 .cse0 .cse3 .cse10 .cse5 .cse12) (and .cse7 .cse13 .cse8 .cse9 .cse1 .cse10 .cse11) (and .cse13 .cse8 .cse9 .cse1 .cse10 .cse4 .cse5) (and .cse13 .cse9 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse13 .cse8 .cse2 .cse10 .cse5 .cse12) (and .cse9 .cse0 .cse1 .cse3 .cse4 .cse6 .cse11) (and .cse7 .cse8 .cse9 .cse0 .cse1 .cse10 .cse11) (and .cse7 .cse13 .cse8 .cse2 .cse10 .cse11 .cse12) (and .cse13 .cse8 .cse9 .cse10 .cse4 .cse5 .cse12) (and .cse7 .cse8 .cse9 .cse0 .cse10 .cse5 .cse12) (and .cse7 .cse13 .cse8 .cse2 .cse6 .cse11 .cse12) (and .cse7 .cse13 .cse8 .cse2 .cse5 .cse6 .cse12) (and .cse7 .cse0 .cse2 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse0 .cse2 .cse5 .cse6 .cse12) (and .cse7 .cse13 .cse9 .cse1 .cse3 .cse5 .cse6) (and .cse13 .cse8 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse0 .cse2 .cse10 .cse5 .cse12) (and .cse13 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse5 .cse12) (and .cse7 .cse8 .cse0 .cse2 .cse6 .cse11 .cse12) (and .cse7 .cse13 .cse9 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse13 .cse8 .cse9 .cse1 .cse10 .cse5) (and .cse9 .cse0 .cse3 .cse10 .cse4 .cse5 .cse12) (and .cse7 .cse9 .cse0 .cse1 .cse3 .cse6 .cse11) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse6 .cse11) (and .cse7 .cse13 .cse8 .cse9 .cse1 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse3 .cse10 .cse4 .cse11) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse10 .cse11) (and .cse9 .cse0 .cse1 .cse3 .cse10 .cse4 .cse5) (and .cse9 .cse0 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse13 .cse8 .cse1 .cse2 .cse10 .cse4 .cse5) (and .cse7 .cse13 .cse2 .cse3 .cse6 .cse11 .cse12) (and .cse7 .cse13 .cse9 .cse3 .cse10 .cse5 .cse12) (and .cse7 .cse9 .cse0 .cse3 .cse6 .cse11 .cse12) (and .cse13 .cse1 .cse2 .cse3 .cse4 .cse6 .cse11) (and .cse7 .cse13 .cse8 .cse1 .cse2 .cse6 .cse11) (and .cse7 .cse13 .cse9 .cse3 .cse10 .cse11 .cse12) (and .cse8 .cse9 .cse0 .cse1 .cse10 .cse4 .cse11) (and .cse7 .cse9 .cse0 .cse1 .cse3 .cse10 .cse5) (and .cse13 .cse8 .cse2 .cse10 .cse4 .cse5 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse8 .cse0 .cse2 .cse10 .cse11 .cse12) (and .cse13 .cse2 .cse3 .cse10 .cse4 .cse5 .cse12) (and .cse13 .cse8 .cse9 .cse4 .cse6 .cse11 .cse12) (and .cse13 .cse8 .cse9 .cse1 .cse10 .cse4 .cse11) (and .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse8 .cse0 .cse2 .cse4 .cse6 .cse11 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse8 .cse9 .cse0 .cse10 .cse4 .cse11 .cse12) (and .cse7 .cse13 .cse8 .cse1 .cse2 .cse10 .cse5) (and .cse13 .cse8 .cse9 .cse1 .cse4 .cse5 .cse6) (and .cse13 .cse9 .cse3 .cse4 .cse6 .cse11 .cse12) (and .cse13 .cse1 .cse2 .cse3 .cse10 .cse4 .cse11) (and .cse13 .cse8 .cse2 .cse4 .cse5 .cse6 .cse12) (and .cse8 .cse0 .cse2 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse6 .cse11) (and .cse0 .cse2 .cse3 .cse10 .cse4 .cse5 .cse12) (and .cse7 .cse8 .cse9 .cse0 .cse6 .cse11 .cse12) (and .cse7 .cse9 .cse0 .cse3 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse13 .cse1 .cse2 .cse3 .cse10 .cse11) (and .cse9 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse6 .cse11) (and .cse8 .cse9 .cse0 .cse4 .cse6 .cse11 .cse12) (and .cse13 .cse9 .cse1 .cse3 .cse10 .cse4 .cse11) (and .cse7 .cse8 .cse9 .cse0 .cse1 .cse6 .cse11) (and .cse13 .cse9 .cse1 .cse3 .cse4 .cse6 .cse11) (and .cse7 .cse8 .cse9 .cse0 .cse10 .cse11 .cse12) (and .cse13 .cse9 .cse3 .cse10 .cse4 .cse5 .cse12) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse11) (and .cse7 .cse13 .cse8 .cse9 .cse6 .cse11 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse7 .cse13 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse7 .cse13 .cse8 .cse1 .cse2 .cse5 .cse6) (and .cse7 .cse13 .cse2 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse13 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse8 .cse0 .cse2 .cse10 .cse4 .cse5 .cse12) (and .cse8 .cse9 .cse0 .cse1 .cse4 .cse5 .cse6) (and .cse7 .cse13 .cse2 .cse3 .cse10 .cse11 .cse12) (and .cse13 .cse2 .cse3 .cse4 .cse6 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse11 .cse12) (and .cse7 .cse0 .cse2 .cse3 .cse6 .cse11 .cse12) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse10 .cse5) (and .cse7 .cse9 .cse0 .cse1 .cse3 .cse5 .cse6) (and .cse7 .cse13 .cse8 .cse1 .cse2 .cse10 .cse11) (and .cse9 .cse0 .cse3 .cse4 .cse6 .cse11 .cse12) (and .cse7 .cse13 .cse9 .cse3 .cse6 .cse11 .cse12) (and .cse13 .cse8 .cse9 .cse4 .cse5 .cse6 .cse12) (and .cse8 .cse0 .cse2 .cse10 .cse4 .cse11 .cse12) (and .cse7 .cse13 .cse8 .cse9 .cse1 .cse6 .cse11) (and .cse7 .cse13 .cse9 .cse1 .cse3 .cse6 .cse11) (and .cse13 .cse8 .cse9 .cse1 .cse4 .cse6 .cse11) (and .cse13 .cse9 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse5 .cse6) (and .cse13 .cse2 .cse3 .cse10 .cse4 .cse11 .cse12) (and .cse7 .cse13 .cse1 .cse2 .cse3 .cse6 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse11) (and .cse7 .cse13 .cse2 .cse3 .cse10 .cse5 .cse12) (and .cse7 .cse13 .cse8 .cse9 .cse10 .cse5 .cse12) (and .cse8 .cse9 .cse0 .cse4 .cse5 .cse6 .cse12) (and .cse13 .cse8 .cse2 .cse10 .cse4 .cse11 .cse12) (and .cse13 .cse8 .cse2 .cse4 .cse6 .cse11 .cse12) (and .cse7 .cse8 .cse9 .cse0 .cse1 .cse5 .cse6) (and .cse7 .cse13 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse13 .cse8 .cse9 .cse10 .cse4 .cse11 .cse12) (and .cse8 .cse0 .cse1 .cse2 .cse10 .cse4 .cse11) (and .cse8 .cse9 .cse0 .cse1 .cse4 .cse6 .cse11) (and .cse7 .cse13 .cse9 .cse1 .cse3 .cse10 .cse5) (and .cse7 .cse13 .cse9 .cse1 .cse3 .cse10 .cse11) (and .cse8 .cse9 .cse0 .cse10 .cse4 .cse5 .cse12) (and .cse7 .cse13 .cse8 .cse9 .cse5 .cse6 .cse12) (and .cse13 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse9 .cse0 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse6 .cse12) (and .cse8 .cse0 .cse1 .cse2 .cse10 .cse4 .cse5) (and .cse13 .cse9 .cse3 .cse10 .cse4 .cse11 .cse12))) [2020-07-18 05:09:12,115 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-07-18 05:09:12,115 INFO L271 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: true [2020-07-18 05:09:12,115 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-07-18 05:09:12,116 INFO L264 CegarLoopResult]: At program point L67-1(lines 30 116) 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:09:12,116 INFO L264 CegarLoopResult]: At program point L92(line 92) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk7~0)) (.cse1 (= 0 main_~p4~0)) (.cse3 (= 0 main_~p5~0)) (.cse4 (= 0 main_~p6~0)) (.cse6 (= 1 main_~lk6~0)) (.cse5 (= 0 main_~p7~0)) (.cse2 (= 1 main_~lk3~0)) (.cse7 (= 1 main_~lk5~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse5 .cse1 .cse2 .cse7) (and .cse5 .cse2 .cse4 .cse7 .cse8) (and .cse6 .cse0 .cse2 .cse7 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse8) (and .cse6 .cse5 .cse2 .cse3 .cse8) (and .cse6 .cse0 .cse1 .cse2 .cse3) (and .cse5 .cse1 .cse2 .cse4 .cse7) (and .cse6 .cse5 .cse1 .cse2 .cse3) (and .cse6 .cse0 .cse2 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse7) (and .cse0 .cse2 .cse4 .cse7 .cse8) (and .cse6 .cse0 .cse1 .cse2 .cse7) (and .cse5 .cse2 .cse3 .cse4 .cse8) (and .cse6 .cse5 .cse2 .cse7 .cse8))) [2020-07-18 05:09:12,116 INFO L264 CegarLoopResult]: At program point L59-1(lines 30 116) 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:09:12,116 INFO L271 CegarLoopResult]: At program point L117(lines 5 121) the Hoare annotation is: true [2020-07-18 05:09:12,116 INFO L271 CegarLoopResult]: At program point L51(lines 51 53) the Hoare annotation is: true [2020-07-18 05:09:12,116 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-18 05:09:12,117 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-07-18 05:09:12,117 INFO L264 CegarLoopResult]: At program point L51-2(lines 30 116) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-18 05:09:12,117 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-07-18 05:09:12,118 INFO L264 CegarLoopResult]: At program point L76(line 76) 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 .cse0 .cse9 .cse6 .cse2 .cse3 .cse4) (and .cse11 .cse0 .cse6 .cse2 .cse4 .cse5) (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 .cse11 .cse0 .cse6 .cse2 .cse8 .cse5) (and .cse6 .cse10 .cse3 .cse4 .cse7 .cse5) (and .cse1 .cse10 .cse3 .cse7 .cse8 .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 .cse9 .cse6 .cse10 .cse4 .cse7) (and .cse11 .cse0 .cse9 .cse6 .cse4 .cse7) (and .cse11 .cse9 .cse6 .cse10 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse8) (and .cse11 .cse6 .cse10 .cse2 .cse8 .cse5) (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 .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:09:12,118 INFO L271 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: true [2020-07-18 05:09:12,118 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-07-18 05:09:12,118 INFO L264 CegarLoopResult]: At program point L68(line 68) 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 .cse4 .cse0 .cse6 .cse3) (and .cse5 .cse7 .cse1 .cse6) (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:09:12,118 INFO L264 CegarLoopResult]: At program point L101-1(lines 30 116) the Hoare annotation is: (let ((.cse1 (= 1 main_~lk7~0)) (.cse3 (= 0 main_~p6~0)) (.cse0 (= 1 main_~lk6~0)) (.cse2 (= 0 main_~p7~0))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse1 .cse3) (and .cse0 .cse2))) [2020-07-18 05:09:12,118 INFO L271 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: true [2020-07-18 05:09:12,228 INFO L163 areAnnotationChecker]: CFG has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 05:09:12,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 05:09:12 BoogieIcfgContainer [2020-07-18 05:09:12,238 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 05:09:12,240 INFO L168 Benchmark]: Toolchain (without parser) took 124454.61 ms. Allocated memory was 144.2 MB in the beginning and 839.9 MB in the end (delta: 695.7 MB). Free memory was 100.9 MB in the beginning and 755.2 MB in the end (delta: -654.3 MB). Peak memory consumption was 41.4 MB. Max. memory is 7.1 GB. [2020-07-18 05:09:12,240 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 144.2 MB. Free memory was 119.4 MB in the beginning and 119.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:09:12,241 INFO L168 Benchmark]: CACSL2BoogieTranslator took 253.85 ms. Allocated memory is still 144.2 MB. Free memory was 100.5 MB in the beginning and 90.1 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-18 05:09:12,242 INFO L168 Benchmark]: Boogie Preprocessor took 122.18 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 90.1 MB in the beginning and 178.9 MB in the end (delta: -88.7 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2020-07-18 05:09:12,242 INFO L168 Benchmark]: RCFGBuilder took 541.81 ms. Allocated memory is still 200.8 MB. Free memory was 178.9 MB in the beginning and 146.0 MB in the end (delta: 32.9 MB). Peak memory consumption was 32.9 MB. Max. memory is 7.1 GB. [2020-07-18 05:09:12,243 INFO L168 Benchmark]: TraceAbstraction took 123529.14 ms. Allocated memory was 200.8 MB in the beginning and 839.9 MB in the end (delta: 639.1 MB). Free memory was 145.3 MB in the beginning and 755.2 MB in the end (delta: -609.9 MB). Peak memory consumption was 29.2 MB. Max. memory is 7.1 GB. [2020-07-18 05:09:12,245 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.22 ms. Allocated memory is still 144.2 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 253.85 ms. Allocated memory is still 144.2 MB. Free memory was 100.5 MB in the beginning and 90.1 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 122.18 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 90.1 MB in the beginning and 178.9 MB in the end (delta: -88.7 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 541.81 ms. Allocated memory is still 200.8 MB. Free memory was 178.9 MB in the beginning and 146.0 MB in the end (delta: 32.9 MB). Peak memory consumption was 32.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 123529.14 ms. Allocated memory was 200.8 MB in the beginning and 839.9 MB in the end (delta: 639.1 MB). Free memory was 145.3 MB in the beginning and 755.2 MB in the end (delta: -609.9 MB). Peak memory consumption was 29.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 119]: 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: 30]: 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, 88 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 110.3s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 54.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 12.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1813 SDtfs, 648 SDslu, 1281 SDs, 0 SdLazy, 69 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3635occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 32.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 1022 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 88 LocationsWithAnnotation, 88 PreInvPairs, 4768 NumberOfFragments, 13918 HoareAnnotationTreeSize, 88 FomulaSimplifications, 98944 FormulaSimplificationTreeSizeReduction, 2.6s HoareSimplificationTime, 88 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 10.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 819 NumberOfCodeBlocks, 819 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 805 ConstructedInterpolants, 0 QuantifiedInterpolants, 58429 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...