/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 -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-lit/cggmp2005b.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:49:21,082 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:49:21,084 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:49:21,096 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:49:21,097 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:49:21,098 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:49:21,099 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:49:21,101 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:49:21,103 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:49:21,104 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:49:21,105 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:49:21,106 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:49:21,106 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:49:21,107 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:49:21,108 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:49:21,110 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:49:21,111 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:49:21,111 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:49:21,113 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:49:21,115 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:49:21,117 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:49:21,118 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:49:21,119 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:49:21,120 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:49:21,123 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:49:21,123 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:49:21,123 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:49:21,124 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:49:21,125 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:49:21,126 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:49:21,126 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:49:21,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:49:21,128 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:49:21,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:49:21,130 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:49:21,130 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:49:21,131 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:49:21,131 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:49:21,131 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:49:21,132 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:49:21,133 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:49:21,134 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 00:49:21,143 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:49:21,144 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:49:21,145 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:49:21,145 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:49:21,145 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:49:21,146 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:49:21,146 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:49:21,146 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:49:21,146 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:49:21,146 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:49:21,147 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:49:21,147 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:49:21,147 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:49:21,147 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:49:21,147 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:49:21,148 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:49:21,148 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:49:21,148 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:49:21,148 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:49:21,149 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:49:21,149 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:49:21,149 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:49:21,149 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:49:21,457 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:49:21,472 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:49:21,476 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:49:21,477 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:49:21,478 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:49:21,478 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/cggmp2005b.i [2020-07-18 00:49:21,557 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73ded29a5/c580017d82c84e2c89bcc641bb739754/FLAG89c26acf6 [2020-07-18 00:49:22,055 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:49:22,057 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005b.i [2020-07-18 00:49:22,063 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73ded29a5/c580017d82c84e2c89bcc641bb739754/FLAG89c26acf6 [2020-07-18 00:49:22,456 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73ded29a5/c580017d82c84e2c89bcc641bb739754 [2020-07-18 00:49:22,464 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:49:22,467 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:49:22,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:49:22,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:49:22,475 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:49:22,477 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:49:22" (1/1) ... [2020-07-18 00:49:22,481 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65ae2795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:22, skipping insertion in model container [2020-07-18 00:49:22,481 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:49:22" (1/1) ... [2020-07-18 00:49:22,490 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:49:22,511 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:49:22,692 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:49:22,699 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:49:22,721 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:49:22,741 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:49:22,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:22 WrapperNode [2020-07-18 00:49:22,742 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:49:22,743 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:49:22,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:49:22,744 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:49:22,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:22" (1/1) ... [2020-07-18 00:49:22,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:22" (1/1) ... [2020-07-18 00:49:22,768 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:22" (1/1) ... [2020-07-18 00:49:22,768 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:22" (1/1) ... [2020-07-18 00:49:22,777 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:22" (1/1) ... [2020-07-18 00:49:22,786 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:22" (1/1) ... [2020-07-18 00:49:22,787 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:22" (1/1) ... [2020-07-18 00:49:22,934 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:49:22,935 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:49:22,935 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:49:22,935 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:49:22,936 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:22" (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 00:49:23,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:49:23,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:49:23,005 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-18 00:49:23,005 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 00:49:23,005 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:49:23,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:49:23,006 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 00:49:23,006 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-18 00:49:23,006 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 00:49:23,006 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:49:23,006 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:49:23,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:49:23,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:49:23,252 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:49:23,253 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-18 00:49:23,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:49:23 BoogieIcfgContainer [2020-07-18 00:49:23,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:49:23,261 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:49:23,261 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:49:23,264 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:49:23,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:49:22" (1/3) ... [2020-07-18 00:49:23,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69b92699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:49:23, skipping insertion in model container [2020-07-18 00:49:23,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:22" (2/3) ... [2020-07-18 00:49:23,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69b92699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:49:23, skipping insertion in model container [2020-07-18 00:49:23,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:49:23" (3/3) ... [2020-07-18 00:49:23,268 INFO L109 eAbstractionObserver]: Analyzing ICFG cggmp2005b.i [2020-07-18 00:49:23,282 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:49:23,289 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:49:23,310 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:49:23,334 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:49:23,335 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:49:23,335 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:49:23,335 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:49:23,335 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:49:23,336 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:49:23,336 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:49:23,336 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:49:23,353 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2020-07-18 00:49:23,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-18 00:49:23,364 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:23,365 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:49:23,366 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:23,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:23,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1930258608, now seen corresponding path program 1 times [2020-07-18 00:49:23,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:23,382 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [120075845] [2020-07-18 00:49:23,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:23,551 INFO L280 TraceCheckUtils]: 0: Hoare triple {32#true} assume true; {32#true} is VALID [2020-07-18 00:49:23,552 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {32#true} {32#true} #74#return; {32#true} is VALID [2020-07-18 00:49:23,558 INFO L263 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2020-07-18 00:49:23,560 INFO L280 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2020-07-18 00:49:23,561 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #74#return; {32#true} is VALID [2020-07-18 00:49:23,561 INFO L263 TraceCheckUtils]: 3: Hoare triple {32#true} call #t~ret0 := main(); {32#true} is VALID [2020-07-18 00:49:23,562 INFO L280 TraceCheckUtils]: 4: Hoare triple {32#true} havoc ~i~0; {32#true} is VALID [2020-07-18 00:49:23,562 INFO L280 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~j~0; {32#true} is VALID [2020-07-18 00:49:23,563 INFO L280 TraceCheckUtils]: 6: Hoare triple {32#true} havoc ~k~0; {32#true} is VALID [2020-07-18 00:49:23,563 INFO L280 TraceCheckUtils]: 7: Hoare triple {32#true} ~i~0 := 0; {32#true} is VALID [2020-07-18 00:49:23,564 INFO L280 TraceCheckUtils]: 8: Hoare triple {32#true} ~k~0 := 9; {32#true} is VALID [2020-07-18 00:49:23,564 INFO L280 TraceCheckUtils]: 9: Hoare triple {32#true} ~j~0 := -100; {32#true} is VALID [2020-07-18 00:49:23,571 INFO L280 TraceCheckUtils]: 10: Hoare triple {32#true} assume !true; {33#false} is VALID [2020-07-18 00:49:23,572 INFO L263 TraceCheckUtils]: 11: Hoare triple {33#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {33#false} is VALID [2020-07-18 00:49:23,572 INFO L280 TraceCheckUtils]: 12: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2020-07-18 00:49:23,573 INFO L280 TraceCheckUtils]: 13: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2020-07-18 00:49:23,573 INFO L280 TraceCheckUtils]: 14: Hoare triple {33#false} assume !false; {33#false} is VALID [2020-07-18 00:49:23,575 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 00:49:23,581 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:23,583 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [120075845] [2020-07-18 00:49:23,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:23,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-18 00:49:23,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695744552] [2020-07-18 00:49:23,597 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2020-07-18 00:49:23,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:23,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-18 00:49:23,651 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:23,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-18 00:49:23,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:23,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-18 00:49:23,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-18 00:49:23,663 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2020-07-18 00:49:23,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:23,776 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2020-07-18 00:49:23,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-18 00:49:23,776 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2020-07-18 00:49:23,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:23,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-18 00:49:23,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 61 transitions. [2020-07-18 00:49:23,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-18 00:49:23,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 61 transitions. [2020-07-18 00:49:23,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 61 transitions. [2020-07-18 00:49:23,937 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 00:49:23,949 INFO L225 Difference]: With dead ends: 48 [2020-07-18 00:49:23,949 INFO L226 Difference]: Without dead ends: 22 [2020-07-18 00:49:23,953 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-18 00:49:23,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-18 00:49:24,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-18 00:49:24,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:24,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2020-07-18 00:49:24,010 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-18 00:49:24,010 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-18 00:49:24,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:24,014 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2020-07-18 00:49:24,014 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2020-07-18 00:49:24,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:24,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:24,016 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-18 00:49:24,016 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-18 00:49:24,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:24,020 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2020-07-18 00:49:24,020 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2020-07-18 00:49:24,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:24,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:24,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:24,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:24,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-18 00:49:24,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2020-07-18 00:49:24,026 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2020-07-18 00:49:24,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:24,026 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-07-18 00:49:24,026 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-18 00:49:24,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 24 transitions. [2020-07-18 00:49:24,060 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:24,061 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2020-07-18 00:49:24,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-18 00:49:24,062 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:24,062 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:49:24,062 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:49:24,062 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:24,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:24,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1900705936, now seen corresponding path program 1 times [2020-07-18 00:49:24,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:24,064 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [22530932] [2020-07-18 00:49:24,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:24,127 INFO L280 TraceCheckUtils]: 0: Hoare triple {222#true} assume true; {222#true} is VALID [2020-07-18 00:49:24,128 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {222#true} {222#true} #74#return; {222#true} is VALID [2020-07-18 00:49:24,128 INFO L263 TraceCheckUtils]: 0: Hoare triple {222#true} call ULTIMATE.init(); {222#true} is VALID [2020-07-18 00:49:24,129 INFO L280 TraceCheckUtils]: 1: Hoare triple {222#true} assume true; {222#true} is VALID [2020-07-18 00:49:24,129 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {222#true} {222#true} #74#return; {222#true} is VALID [2020-07-18 00:49:24,130 INFO L263 TraceCheckUtils]: 3: Hoare triple {222#true} call #t~ret0 := main(); {222#true} is VALID [2020-07-18 00:49:24,130 INFO L280 TraceCheckUtils]: 4: Hoare triple {222#true} havoc ~i~0; {222#true} is VALID [2020-07-18 00:49:24,130 INFO L280 TraceCheckUtils]: 5: Hoare triple {222#true} havoc ~j~0; {222#true} is VALID [2020-07-18 00:49:24,131 INFO L280 TraceCheckUtils]: 6: Hoare triple {222#true} havoc ~k~0; {222#true} is VALID [2020-07-18 00:49:24,132 INFO L280 TraceCheckUtils]: 7: Hoare triple {222#true} ~i~0 := 0; {226#(<= main_~i~0 0)} is VALID [2020-07-18 00:49:24,133 INFO L280 TraceCheckUtils]: 8: Hoare triple {226#(<= main_~i~0 0)} ~k~0 := 9; {226#(<= main_~i~0 0)} is VALID [2020-07-18 00:49:24,134 INFO L280 TraceCheckUtils]: 9: Hoare triple {226#(<= main_~i~0 0)} ~j~0 := -100; {226#(<= main_~i~0 0)} is VALID [2020-07-18 00:49:24,135 INFO L280 TraceCheckUtils]: 10: Hoare triple {226#(<= main_~i~0 0)} assume !(~i~0 <= 100); {223#false} is VALID [2020-07-18 00:49:24,135 INFO L263 TraceCheckUtils]: 11: Hoare triple {223#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {223#false} is VALID [2020-07-18 00:49:24,136 INFO L280 TraceCheckUtils]: 12: Hoare triple {223#false} ~cond := #in~cond; {223#false} is VALID [2020-07-18 00:49:24,136 INFO L280 TraceCheckUtils]: 13: Hoare triple {223#false} assume 0 == ~cond; {223#false} is VALID [2020-07-18 00:49:24,137 INFO L280 TraceCheckUtils]: 14: Hoare triple {223#false} assume !false; {223#false} is VALID [2020-07-18 00:49:24,138 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 00:49:24,143 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:24,144 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [22530932] [2020-07-18 00:49:24,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:24,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:49:24,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874734379] [2020-07-18 00:49:24,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-18 00:49:24,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:24,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:49:24,167 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:24,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:49:24,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:24,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:49:24,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:49:24,168 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2020-07-18 00:49:24,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:24,240 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-18 00:49:24,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:49:24,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-18 00:49:24,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:24,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:49:24,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2020-07-18 00:49:24,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:49:24,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2020-07-18 00:49:24,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 31 transitions. [2020-07-18 00:49:24,298 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:24,300 INFO L225 Difference]: With dead ends: 29 [2020-07-18 00:49:24,300 INFO L226 Difference]: Without dead ends: 24 [2020-07-18 00:49:24,302 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 1 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 00:49:24,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-18 00:49:24,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2020-07-18 00:49:24,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:24,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2020-07-18 00:49:24,320 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2020-07-18 00:49:24,320 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2020-07-18 00:49:24,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:24,323 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-18 00:49:24,323 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-18 00:49:24,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:24,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:24,324 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2020-07-18 00:49:24,324 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2020-07-18 00:49:24,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:24,327 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-18 00:49:24,327 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-18 00:49:24,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:24,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:24,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:24,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:24,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-18 00:49:24,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2020-07-18 00:49:24,330 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2020-07-18 00:49:24,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:24,330 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2020-07-18 00:49:24,330 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:49:24,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 25 transitions. [2020-07-18 00:49:24,360 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:24,361 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-18 00:49:24,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-18 00:49:24,361 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:24,362 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] [2020-07-18 00:49:24,362 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:49:24,362 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:24,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:24,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1024587775, now seen corresponding path program 1 times [2020-07-18 00:49:24,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:24,363 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1509626020] [2020-07-18 00:49:24,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:26,672 INFO L280 TraceCheckUtils]: 0: Hoare triple {381#true} assume true; {381#true} is VALID [2020-07-18 00:49:26,673 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {381#true} {381#true} #74#return; {381#true} is VALID [2020-07-18 00:49:26,674 INFO L263 TraceCheckUtils]: 0: Hoare triple {381#true} call ULTIMATE.init(); {381#true} is VALID [2020-07-18 00:49:26,674 INFO L280 TraceCheckUtils]: 1: Hoare triple {381#true} assume true; {381#true} is VALID [2020-07-18 00:49:26,675 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {381#true} {381#true} #74#return; {381#true} is VALID [2020-07-18 00:49:26,675 INFO L263 TraceCheckUtils]: 3: Hoare triple {381#true} call #t~ret0 := main(); {381#true} is VALID [2020-07-18 00:49:26,675 INFO L280 TraceCheckUtils]: 4: Hoare triple {381#true} havoc ~i~0; {381#true} is VALID [2020-07-18 00:49:26,676 INFO L280 TraceCheckUtils]: 5: Hoare triple {381#true} havoc ~j~0; {381#true} is VALID [2020-07-18 00:49:26,676 INFO L280 TraceCheckUtils]: 6: Hoare triple {381#true} havoc ~k~0; {381#true} is VALID [2020-07-18 00:49:26,677 INFO L280 TraceCheckUtils]: 7: Hoare triple {381#true} ~i~0 := 0; {381#true} is VALID [2020-07-18 00:49:26,677 INFO L280 TraceCheckUtils]: 8: Hoare triple {381#true} ~k~0 := 9; {381#true} is VALID [2020-07-18 00:49:26,680 INFO L280 TraceCheckUtils]: 9: Hoare triple {381#true} ~j~0 := -100; {385#(<= (+ main_~j~0 100) 0)} is VALID [2020-07-18 00:49:26,682 INFO L280 TraceCheckUtils]: 10: Hoare triple {385#(<= (+ main_~j~0 100) 0)} [80] L24-3-->L18-2_primed: Formula: (let ((.cse6 (* 2 v_oct_main_~k~0_out_1))) (let ((.cse0 (<= v_oct_main_~j~0_out_1 v_oct_main_~j~0_in_1)) (.cse2 (<= 8 .cse6)) (.cse3 (<= v_oct_main_~j~0_in_1 v_oct_main_~j~0_out_1)) (.cse4 (<= .cse6 8)) (.cse5 (<= 40 (* 2 v_oct_main_~j~0_in_1)))) (or (let ((.cse1 (+ v_oct_main_~i~0_in_1 1))) (and .cse0 (<= .cse1 v_oct_main_~i~0_out_1) (<= (* 2 v_oct_main_~i~0_in_1) 200) .cse2 (<= v_oct_main_~i~0_out_1 .cse1) .cse3 .cse4 .cse5)) (and .cse0 (<= v_oct_main_~i~0_out_1 101) (<= v_oct_main_~i~0_in_1 100) (<= (+ v_oct_main_~i~0_in_1 2) v_oct_main_~i~0_out_1) .cse2 .cse3 (<= v_oct_main_~i~0_out_1 102) (<= v_oct_main_~i~0_in_1 99) .cse4 .cse5)))) InVars {main_~i~0=v_oct_main_~i~0_in_1, main_~j~0=v_oct_main_~j~0_in_1} OutVars{main_~i~0=v_oct_main_~i~0_out_1, main_~k~0=v_oct_main_~k~0_out_1, main_~j~0=v_oct_main_~j~0_out_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {382#false} is VALID [2020-07-18 00:49:26,683 INFO L280 TraceCheckUtils]: 11: Hoare triple {382#false} [79] L18-2_primed-->L18-2: Formula: (not (<= v_main_~i~0_4 100)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[] {382#false} is VALID [2020-07-18 00:49:26,683 INFO L263 TraceCheckUtils]: 12: Hoare triple {382#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {382#false} is VALID [2020-07-18 00:49:26,683 INFO L280 TraceCheckUtils]: 13: Hoare triple {382#false} ~cond := #in~cond; {382#false} is VALID [2020-07-18 00:49:26,684 INFO L280 TraceCheckUtils]: 14: Hoare triple {382#false} assume 0 == ~cond; {382#false} is VALID [2020-07-18 00:49:26,684 INFO L280 TraceCheckUtils]: 15: Hoare triple {382#false} assume !false; {382#false} is VALID [2020-07-18 00:49:26,685 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 00:49:26,744 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:26,745 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1509626020] [2020-07-18 00:49:26,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:26,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:49:26,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759901699] [2020-07-18 00:49:26,746 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-18 00:49:26,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:26,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:49:26,769 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:26,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:49:26,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:26,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:49:26,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:49:26,770 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 5 states. [2020-07-18 00:49:26,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:26,882 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2020-07-18 00:49:26,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 00:49:26,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-18 00:49:26,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:26,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:49:26,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2020-07-18 00:49:26,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:49:26,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2020-07-18 00:49:26,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2020-07-18 00:49:26,942 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:26,943 INFO L225 Difference]: With dead ends: 38 [2020-07-18 00:49:26,944 INFO L226 Difference]: Without dead ends: 26 [2020-07-18 00:49:26,945 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:49:26,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-18 00:49:26,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-07-18 00:49:26,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:26,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 25 states. [2020-07-18 00:49:26,970 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 25 states. [2020-07-18 00:49:26,970 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 25 states. [2020-07-18 00:49:26,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:26,972 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-18 00:49:26,973 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-18 00:49:26,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:26,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:26,974 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 26 states. [2020-07-18 00:49:26,974 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 26 states. [2020-07-18 00:49:26,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:26,976 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-18 00:49:26,976 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-18 00:49:26,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:26,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:26,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:26,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:26,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-18 00:49:26,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2020-07-18 00:49:26,979 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 20 [2020-07-18 00:49:26,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:26,980 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-07-18 00:49:26,980 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:49:26,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2020-07-18 00:49:27,012 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:27,012 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-18 00:49:27,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-18 00:49:27,013 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:27,013 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] [2020-07-18 00:49:27,014 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:49:27,014 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:27,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:27,014 INFO L82 PathProgramCache]: Analyzing trace with hash 2065885280, now seen corresponding path program 1 times [2020-07-18 00:49:27,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:27,015 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [770929000] [2020-07-18 00:49:27,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:27,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:27,083 INFO L280 TraceCheckUtils]: 0: Hoare triple {568#true} assume true; {568#true} is VALID [2020-07-18 00:49:27,083 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {568#true} {568#true} #74#return; {568#true} is VALID [2020-07-18 00:49:27,083 INFO L263 TraceCheckUtils]: 0: Hoare triple {568#true} call ULTIMATE.init(); {568#true} is VALID [2020-07-18 00:49:27,084 INFO L280 TraceCheckUtils]: 1: Hoare triple {568#true} assume true; {568#true} is VALID [2020-07-18 00:49:27,084 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {568#true} {568#true} #74#return; {568#true} is VALID [2020-07-18 00:49:27,084 INFO L263 TraceCheckUtils]: 3: Hoare triple {568#true} call #t~ret0 := main(); {568#true} is VALID [2020-07-18 00:49:27,085 INFO L280 TraceCheckUtils]: 4: Hoare triple {568#true} havoc ~i~0; {568#true} is VALID [2020-07-18 00:49:27,085 INFO L280 TraceCheckUtils]: 5: Hoare triple {568#true} havoc ~j~0; {568#true} is VALID [2020-07-18 00:49:27,085 INFO L280 TraceCheckUtils]: 6: Hoare triple {568#true} havoc ~k~0; {568#true} is VALID [2020-07-18 00:49:27,086 INFO L280 TraceCheckUtils]: 7: Hoare triple {568#true} ~i~0 := 0; {572#(<= main_~i~0 0)} is VALID [2020-07-18 00:49:27,087 INFO L280 TraceCheckUtils]: 8: Hoare triple {572#(<= main_~i~0 0)} ~k~0 := 9; {572#(<= main_~i~0 0)} is VALID [2020-07-18 00:49:27,088 INFO L280 TraceCheckUtils]: 9: Hoare triple {572#(<= main_~i~0 0)} ~j~0 := -100; {572#(<= main_~i~0 0)} is VALID [2020-07-18 00:49:27,088 INFO L280 TraceCheckUtils]: 10: Hoare triple {572#(<= main_~i~0 0)} assume !!(~i~0 <= 100); {572#(<= main_~i~0 0)} is VALID [2020-07-18 00:49:27,089 INFO L280 TraceCheckUtils]: 11: Hoare triple {572#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {573#(<= main_~i~0 1)} is VALID [2020-07-18 00:49:27,090 INFO L280 TraceCheckUtils]: 12: Hoare triple {573#(<= main_~i~0 1)} assume !!(~j~0 < 20); {573#(<= main_~i~0 1)} is VALID [2020-07-18 00:49:27,091 INFO L280 TraceCheckUtils]: 13: Hoare triple {573#(<= main_~i~0 1)} ~j~0 := ~i~0 + ~j~0; {573#(<= main_~i~0 1)} is VALID [2020-07-18 00:49:27,092 INFO L280 TraceCheckUtils]: 14: Hoare triple {573#(<= main_~i~0 1)} assume !(~j~0 < 20); {573#(<= main_~i~0 1)} is VALID [2020-07-18 00:49:27,092 INFO L280 TraceCheckUtils]: 15: Hoare triple {573#(<= main_~i~0 1)} ~k~0 := 4; {573#(<= main_~i~0 1)} is VALID [2020-07-18 00:49:27,093 INFO L280 TraceCheckUtils]: 16: Hoare triple {573#(<= main_~i~0 1)} assume !(~k~0 <= 3); {573#(<= main_~i~0 1)} is VALID [2020-07-18 00:49:27,094 INFO L280 TraceCheckUtils]: 17: Hoare triple {573#(<= main_~i~0 1)} assume !(~i~0 <= 100); {569#false} is VALID [2020-07-18 00:49:27,094 INFO L263 TraceCheckUtils]: 18: Hoare triple {569#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {569#false} is VALID [2020-07-18 00:49:27,095 INFO L280 TraceCheckUtils]: 19: Hoare triple {569#false} ~cond := #in~cond; {569#false} is VALID [2020-07-18 00:49:27,095 INFO L280 TraceCheckUtils]: 20: Hoare triple {569#false} assume 0 == ~cond; {569#false} is VALID [2020-07-18 00:49:27,095 INFO L280 TraceCheckUtils]: 21: Hoare triple {569#false} assume !false; {569#false} is VALID [2020-07-18 00:49:27,096 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 00:49:27,100 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:27,101 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [770929000] [2020-07-18 00:49:27,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:27,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 00:49:27,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002021305] [2020-07-18 00:49:27,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-18 00:49:27,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:27,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 00:49:27,127 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:27,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 00:49:27,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:27,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 00:49:27,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:49:27,128 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 4 states. [2020-07-18 00:49:27,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:27,228 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2020-07-18 00:49:27,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 00:49:27,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-18 00:49:27,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:27,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:49:27,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2020-07-18 00:49:27,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:49:27,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2020-07-18 00:49:27,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 40 transitions. [2020-07-18 00:49:27,286 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:27,288 INFO L225 Difference]: With dead ends: 37 [2020-07-18 00:49:27,288 INFO L226 Difference]: Without dead ends: 32 [2020-07-18 00:49:27,289 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:49:27,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-18 00:49:27,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2020-07-18 00:49:27,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:27,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2020-07-18 00:49:27,317 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2020-07-18 00:49:27,317 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2020-07-18 00:49:27,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:27,320 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-07-18 00:49:27,320 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-18 00:49:27,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:27,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:27,321 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2020-07-18 00:49:27,321 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2020-07-18 00:49:27,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:27,324 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-07-18 00:49:27,325 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-18 00:49:27,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:27,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:27,326 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:27,326 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:27,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-18 00:49:27,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2020-07-18 00:49:27,328 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 22 [2020-07-18 00:49:27,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:27,328 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-07-18 00:49:27,329 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 00:49:27,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 35 transitions. [2020-07-18 00:49:27,378 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:27,379 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-18 00:49:27,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-18 00:49:27,380 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:27,380 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:49:27,380 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 00:49:27,381 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:27,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:27,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1729554991, now seen corresponding path program 2 times [2020-07-18 00:49:27,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:27,382 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [962899460] [2020-07-18 00:49:27,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:29,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:29,629 INFO L280 TraceCheckUtils]: 0: Hoare triple {776#true} assume true; {776#true} is VALID [2020-07-18 00:49:29,630 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {776#true} {776#true} #74#return; {776#true} is VALID [2020-07-18 00:49:29,630 INFO L263 TraceCheckUtils]: 0: Hoare triple {776#true} call ULTIMATE.init(); {776#true} is VALID [2020-07-18 00:49:29,630 INFO L280 TraceCheckUtils]: 1: Hoare triple {776#true} assume true; {776#true} is VALID [2020-07-18 00:49:29,631 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {776#true} {776#true} #74#return; {776#true} is VALID [2020-07-18 00:49:29,631 INFO L263 TraceCheckUtils]: 3: Hoare triple {776#true} call #t~ret0 := main(); {776#true} is VALID [2020-07-18 00:49:29,631 INFO L280 TraceCheckUtils]: 4: Hoare triple {776#true} havoc ~i~0; {776#true} is VALID [2020-07-18 00:49:29,631 INFO L280 TraceCheckUtils]: 5: Hoare triple {776#true} havoc ~j~0; {776#true} is VALID [2020-07-18 00:49:29,632 INFO L280 TraceCheckUtils]: 6: Hoare triple {776#true} havoc ~k~0; {776#true} is VALID [2020-07-18 00:49:29,632 INFO L280 TraceCheckUtils]: 7: Hoare triple {776#true} ~i~0 := 0; {776#true} is VALID [2020-07-18 00:49:29,632 INFO L280 TraceCheckUtils]: 8: Hoare triple {776#true} ~k~0 := 9; {776#true} is VALID [2020-07-18 00:49:29,633 INFO L280 TraceCheckUtils]: 9: Hoare triple {776#true} ~j~0 := -100; {780#(<= (+ main_~j~0 100) 0)} is VALID [2020-07-18 00:49:29,634 INFO L280 TraceCheckUtils]: 10: Hoare triple {780#(<= (+ main_~j~0 100) 0)} assume !!(~i~0 <= 100); {780#(<= (+ main_~j~0 100) 0)} is VALID [2020-07-18 00:49:29,635 INFO L280 TraceCheckUtils]: 11: Hoare triple {780#(<= (+ main_~j~0 100) 0)} ~i~0 := 1 + ~i~0; {780#(<= (+ main_~j~0 100) 0)} is VALID [2020-07-18 00:49:29,636 INFO L280 TraceCheckUtils]: 12: Hoare triple {780#(<= (+ main_~j~0 100) 0)} assume !!(~j~0 < 20); {780#(<= (+ main_~j~0 100) 0)} is VALID [2020-07-18 00:49:29,637 INFO L280 TraceCheckUtils]: 13: Hoare triple {780#(<= (+ main_~j~0 100) 0)} ~j~0 := ~i~0 + ~j~0; {781#(<= (+ main_~j~0 100) main_~i~0)} is VALID [2020-07-18 00:49:29,638 INFO L280 TraceCheckUtils]: 14: Hoare triple {781#(<= (+ main_~j~0 100) main_~i~0)} assume !(~j~0 < 20); {782#(<= 120 main_~i~0)} is VALID [2020-07-18 00:49:29,639 INFO L280 TraceCheckUtils]: 15: Hoare triple {782#(<= 120 main_~i~0)} ~k~0 := 4; {782#(<= 120 main_~i~0)} is VALID [2020-07-18 00:49:29,639 INFO L280 TraceCheckUtils]: 16: Hoare triple {782#(<= 120 main_~i~0)} assume !(~k~0 <= 3); {782#(<= 120 main_~i~0)} is VALID [2020-07-18 00:49:29,640 INFO L280 TraceCheckUtils]: 17: Hoare triple {782#(<= 120 main_~i~0)} assume !!(~i~0 <= 100); {777#false} is VALID [2020-07-18 00:49:29,641 INFO L280 TraceCheckUtils]: 18: Hoare triple {777#false} ~i~0 := 1 + ~i~0; {777#false} is VALID [2020-07-18 00:49:29,641 INFO L280 TraceCheckUtils]: 19: Hoare triple {777#false} assume !(~j~0 < 20); {777#false} is VALID [2020-07-18 00:49:29,641 INFO L280 TraceCheckUtils]: 20: Hoare triple {777#false} ~k~0 := 4; {777#false} is VALID [2020-07-18 00:49:29,641 INFO L280 TraceCheckUtils]: 21: Hoare triple {777#false} assume !(~k~0 <= 3); {777#false} is VALID [2020-07-18 00:49:29,642 INFO L280 TraceCheckUtils]: 22: Hoare triple {777#false} assume !(~i~0 <= 100); {777#false} is VALID [2020-07-18 00:49:29,642 INFO L263 TraceCheckUtils]: 23: Hoare triple {777#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {777#false} is VALID [2020-07-18 00:49:29,642 INFO L280 TraceCheckUtils]: 24: Hoare triple {777#false} ~cond := #in~cond; {777#false} is VALID [2020-07-18 00:49:29,643 INFO L280 TraceCheckUtils]: 25: Hoare triple {777#false} assume 0 == ~cond; {777#false} is VALID [2020-07-18 00:49:29,643 INFO L280 TraceCheckUtils]: 26: Hoare triple {777#false} assume !false; {777#false} is VALID [2020-07-18 00:49:29,644 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 00:49:29,647 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:29,648 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [962899460] [2020-07-18 00:49:29,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:29,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:49:29,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460257583] [2020-07-18 00:49:29,649 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-18 00:49:29,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:29,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:49:29,678 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:29,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:49:29,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:29,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:49:29,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:49:29,680 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 5 states. [2020-07-18 00:49:29,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:29,843 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-07-18 00:49:29,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 00:49:29,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-18 00:49:29,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:29,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:49:29,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2020-07-18 00:49:29,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:49:29,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2020-07-18 00:49:29,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2020-07-18 00:49:29,898 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:29,900 INFO L225 Difference]: With dead ends: 50 [2020-07-18 00:49:29,900 INFO L226 Difference]: Without dead ends: 34 [2020-07-18 00:49:29,901 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:49:29,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-18 00:49:29,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2020-07-18 00:49:29,928 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:29,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2020-07-18 00:49:29,928 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2020-07-18 00:49:29,929 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2020-07-18 00:49:29,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:29,931 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2020-07-18 00:49:29,931 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2020-07-18 00:49:29,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:29,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:29,932 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2020-07-18 00:49:29,932 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2020-07-18 00:49:29,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:29,934 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2020-07-18 00:49:29,934 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2020-07-18 00:49:29,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:29,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:29,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:29,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:29,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-18 00:49:29,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2020-07-18 00:49:29,937 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 27 [2020-07-18 00:49:29,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:29,938 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2020-07-18 00:49:29,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:49:29,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 37 transitions. [2020-07-18 00:49:29,986 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:29,987 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-18 00:49:29,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-18 00:49:29,988 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:29,988 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:49:29,989 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 00:49:29,989 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:29,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:29,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1385563474, now seen corresponding path program 3 times [2020-07-18 00:49:29,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:29,990 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2110334761] [2020-07-18 00:49:29,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:32,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:32,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:32,275 INFO L280 TraceCheckUtils]: 0: Hoare triple {1021#true} assume true; {1021#true} is VALID [2020-07-18 00:49:32,276 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1021#true} {1021#true} #74#return; {1021#true} is VALID [2020-07-18 00:49:32,276 INFO L263 TraceCheckUtils]: 0: Hoare triple {1021#true} call ULTIMATE.init(); {1021#true} is VALID [2020-07-18 00:49:32,276 INFO L280 TraceCheckUtils]: 1: Hoare triple {1021#true} assume true; {1021#true} is VALID [2020-07-18 00:49:32,277 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1021#true} {1021#true} #74#return; {1021#true} is VALID [2020-07-18 00:49:32,277 INFO L263 TraceCheckUtils]: 3: Hoare triple {1021#true} call #t~ret0 := main(); {1021#true} is VALID [2020-07-18 00:49:32,277 INFO L280 TraceCheckUtils]: 4: Hoare triple {1021#true} havoc ~i~0; {1021#true} is VALID [2020-07-18 00:49:32,278 INFO L280 TraceCheckUtils]: 5: Hoare triple {1021#true} havoc ~j~0; {1021#true} is VALID [2020-07-18 00:49:32,278 INFO L280 TraceCheckUtils]: 6: Hoare triple {1021#true} havoc ~k~0; {1021#true} is VALID [2020-07-18 00:49:32,279 INFO L280 TraceCheckUtils]: 7: Hoare triple {1021#true} ~i~0 := 0; {1025#(<= main_~i~0 0)} is VALID [2020-07-18 00:49:32,280 INFO L280 TraceCheckUtils]: 8: Hoare triple {1025#(<= main_~i~0 0)} ~k~0 := 9; {1025#(<= main_~i~0 0)} is VALID [2020-07-18 00:49:32,281 INFO L280 TraceCheckUtils]: 9: Hoare triple {1025#(<= main_~i~0 0)} ~j~0 := -100; {1026#(<= (+ (* 2 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-18 00:49:32,282 INFO L280 TraceCheckUtils]: 10: Hoare triple {1026#(<= (+ (* 2 main_~i~0) main_~j~0 100) 0)} assume !!(~i~0 <= 100); {1026#(<= (+ (* 2 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-18 00:49:32,283 INFO L280 TraceCheckUtils]: 11: Hoare triple {1026#(<= (+ (* 2 main_~i~0) main_~j~0 100) 0)} ~i~0 := 1 + ~i~0; {1027#(<= (+ (* 2 main_~i~0) main_~j~0 98) 0)} is VALID [2020-07-18 00:49:32,284 INFO L280 TraceCheckUtils]: 12: Hoare triple {1027#(<= (+ (* 2 main_~i~0) main_~j~0 98) 0)} assume !!(~j~0 < 20); {1027#(<= (+ (* 2 main_~i~0) main_~j~0 98) 0)} is VALID [2020-07-18 00:49:32,285 INFO L280 TraceCheckUtils]: 13: Hoare triple {1027#(<= (+ (* 2 main_~i~0) main_~j~0 98) 0)} ~j~0 := ~i~0 + ~j~0; {1028#(<= (+ main_~i~0 main_~j~0 98) 0)} is VALID [2020-07-18 00:49:32,286 INFO L280 TraceCheckUtils]: 14: Hoare triple {1028#(<= (+ main_~i~0 main_~j~0 98) 0)} assume !!(~j~0 < 20); {1028#(<= (+ main_~i~0 main_~j~0 98) 0)} is VALID [2020-07-18 00:49:32,287 INFO L280 TraceCheckUtils]: 15: Hoare triple {1028#(<= (+ main_~i~0 main_~j~0 98) 0)} ~j~0 := ~i~0 + ~j~0; {1029#(<= (+ main_~j~0 98) 0)} is VALID [2020-07-18 00:49:32,288 INFO L280 TraceCheckUtils]: 16: Hoare triple {1029#(<= (+ main_~j~0 98) 0)} assume !(~j~0 < 20); {1022#false} is VALID [2020-07-18 00:49:32,288 INFO L280 TraceCheckUtils]: 17: Hoare triple {1022#false} ~k~0 := 4; {1022#false} is VALID [2020-07-18 00:49:32,288 INFO L280 TraceCheckUtils]: 18: Hoare triple {1022#false} assume !(~k~0 <= 3); {1022#false} is VALID [2020-07-18 00:49:32,289 INFO L280 TraceCheckUtils]: 19: Hoare triple {1022#false} assume !!(~i~0 <= 100); {1022#false} is VALID [2020-07-18 00:49:32,289 INFO L280 TraceCheckUtils]: 20: Hoare triple {1022#false} ~i~0 := 1 + ~i~0; {1022#false} is VALID [2020-07-18 00:49:32,289 INFO L280 TraceCheckUtils]: 21: Hoare triple {1022#false} assume !(~j~0 < 20); {1022#false} is VALID [2020-07-18 00:49:32,289 INFO L280 TraceCheckUtils]: 22: Hoare triple {1022#false} ~k~0 := 4; {1022#false} is VALID [2020-07-18 00:49:32,290 INFO L280 TraceCheckUtils]: 23: Hoare triple {1022#false} assume !(~k~0 <= 3); {1022#false} is VALID [2020-07-18 00:49:32,290 INFO L280 TraceCheckUtils]: 24: Hoare triple {1022#false} assume !(~i~0 <= 100); {1022#false} is VALID [2020-07-18 00:49:32,290 INFO L263 TraceCheckUtils]: 25: Hoare triple {1022#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {1022#false} is VALID [2020-07-18 00:49:32,290 INFO L280 TraceCheckUtils]: 26: Hoare triple {1022#false} ~cond := #in~cond; {1022#false} is VALID [2020-07-18 00:49:32,291 INFO L280 TraceCheckUtils]: 27: Hoare triple {1022#false} assume 0 == ~cond; {1022#false} is VALID [2020-07-18 00:49:32,291 INFO L280 TraceCheckUtils]: 28: Hoare triple {1022#false} assume !false; {1022#false} is VALID [2020-07-18 00:49:32,292 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 00:49:32,296 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:32,296 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2110334761] [2020-07-18 00:49:32,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:32,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-18 00:49:32,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595523433] [2020-07-18 00:49:32,297 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2020-07-18 00:49:32,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:32,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-18 00:49:32,346 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:32,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-18 00:49:32,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:32,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-18 00:49:32,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-18 00:49:32,347 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 7 states. [2020-07-18 00:49:32,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:32,583 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2020-07-18 00:49:32,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-18 00:49:32,583 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2020-07-18 00:49:32,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:32,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 00:49:32,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2020-07-18 00:49:32,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 00:49:32,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2020-07-18 00:49:32,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2020-07-18 00:49:32,649 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:32,651 INFO L225 Difference]: With dead ends: 52 [2020-07-18 00:49:32,651 INFO L226 Difference]: Without dead ends: 36 [2020-07-18 00:49:32,652 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-07-18 00:49:32,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-18 00:49:32,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2020-07-18 00:49:32,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:32,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2020-07-18 00:49:32,687 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2020-07-18 00:49:32,688 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2020-07-18 00:49:32,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:32,689 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-07-18 00:49:32,690 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2020-07-18 00:49:32,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:32,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:32,691 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2020-07-18 00:49:32,691 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2020-07-18 00:49:32,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:32,693 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-07-18 00:49:32,694 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2020-07-18 00:49:32,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:32,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:32,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:32,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:32,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-18 00:49:32,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2020-07-18 00:49:32,698 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 29 [2020-07-18 00:49:32,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:32,698 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2020-07-18 00:49:32,698 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-18 00:49:32,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 39 transitions. [2020-07-18 00:49:32,748 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:32,748 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-18 00:49:32,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-18 00:49:32,749 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:32,751 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:49:32,751 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 00:49:32,752 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:32,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:32,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1422203027, now seen corresponding path program 4 times [2020-07-18 00:49:32,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:32,753 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2136555369] [2020-07-18 00:49:32,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:32,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:32,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:32,879 INFO L280 TraceCheckUtils]: 0: Hoare triple {1284#true} assume true; {1284#true} is VALID [2020-07-18 00:49:32,880 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1284#true} {1284#true} #74#return; {1284#true} is VALID [2020-07-18 00:49:32,880 INFO L263 TraceCheckUtils]: 0: Hoare triple {1284#true} call ULTIMATE.init(); {1284#true} is VALID [2020-07-18 00:49:32,880 INFO L280 TraceCheckUtils]: 1: Hoare triple {1284#true} assume true; {1284#true} is VALID [2020-07-18 00:49:32,880 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1284#true} {1284#true} #74#return; {1284#true} is VALID [2020-07-18 00:49:32,880 INFO L263 TraceCheckUtils]: 3: Hoare triple {1284#true} call #t~ret0 := main(); {1284#true} is VALID [2020-07-18 00:49:32,881 INFO L280 TraceCheckUtils]: 4: Hoare triple {1284#true} havoc ~i~0; {1284#true} is VALID [2020-07-18 00:49:32,881 INFO L280 TraceCheckUtils]: 5: Hoare triple {1284#true} havoc ~j~0; {1284#true} is VALID [2020-07-18 00:49:32,881 INFO L280 TraceCheckUtils]: 6: Hoare triple {1284#true} havoc ~k~0; {1284#true} is VALID [2020-07-18 00:49:32,882 INFO L280 TraceCheckUtils]: 7: Hoare triple {1284#true} ~i~0 := 0; {1288#(<= main_~i~0 0)} is VALID [2020-07-18 00:49:32,882 INFO L280 TraceCheckUtils]: 8: Hoare triple {1288#(<= main_~i~0 0)} ~k~0 := 9; {1288#(<= main_~i~0 0)} is VALID [2020-07-18 00:49:32,883 INFO L280 TraceCheckUtils]: 9: Hoare triple {1288#(<= main_~i~0 0)} ~j~0 := -100; {1289#(<= (+ (* 3 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-18 00:49:32,883 INFO L280 TraceCheckUtils]: 10: Hoare triple {1289#(<= (+ (* 3 main_~i~0) main_~j~0 100) 0)} assume !!(~i~0 <= 100); {1289#(<= (+ (* 3 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-18 00:49:32,884 INFO L280 TraceCheckUtils]: 11: Hoare triple {1289#(<= (+ (* 3 main_~i~0) main_~j~0 100) 0)} ~i~0 := 1 + ~i~0; {1290#(<= (+ (* 3 main_~i~0) main_~j~0 97) 0)} is VALID [2020-07-18 00:49:32,884 INFO L280 TraceCheckUtils]: 12: Hoare triple {1290#(<= (+ (* 3 main_~i~0) main_~j~0 97) 0)} assume !!(~j~0 < 20); {1290#(<= (+ (* 3 main_~i~0) main_~j~0 97) 0)} is VALID [2020-07-18 00:49:32,885 INFO L280 TraceCheckUtils]: 13: Hoare triple {1290#(<= (+ (* 3 main_~i~0) main_~j~0 97) 0)} ~j~0 := ~i~0 + ~j~0; {1291#(<= (+ (* 2 main_~i~0) main_~j~0 97) 0)} is VALID [2020-07-18 00:49:32,885 INFO L280 TraceCheckUtils]: 14: Hoare triple {1291#(<= (+ (* 2 main_~i~0) main_~j~0 97) 0)} assume !!(~j~0 < 20); {1291#(<= (+ (* 2 main_~i~0) main_~j~0 97) 0)} is VALID [2020-07-18 00:49:32,886 INFO L280 TraceCheckUtils]: 15: Hoare triple {1291#(<= (+ (* 2 main_~i~0) main_~j~0 97) 0)} ~j~0 := ~i~0 + ~j~0; {1292#(<= (+ main_~i~0 main_~j~0 97) 0)} is VALID [2020-07-18 00:49:32,888 INFO L280 TraceCheckUtils]: 16: Hoare triple {1292#(<= (+ main_~i~0 main_~j~0 97) 0)} assume !!(~j~0 < 20); {1292#(<= (+ main_~i~0 main_~j~0 97) 0)} is VALID [2020-07-18 00:49:32,891 INFO L280 TraceCheckUtils]: 17: Hoare triple {1292#(<= (+ main_~i~0 main_~j~0 97) 0)} ~j~0 := ~i~0 + ~j~0; {1293#(<= (+ main_~j~0 97) 0)} is VALID [2020-07-18 00:49:32,893 INFO L280 TraceCheckUtils]: 18: Hoare triple {1293#(<= (+ main_~j~0 97) 0)} assume !(~j~0 < 20); {1285#false} is VALID [2020-07-18 00:49:32,893 INFO L280 TraceCheckUtils]: 19: Hoare triple {1285#false} ~k~0 := 4; {1285#false} is VALID [2020-07-18 00:49:32,893 INFO L280 TraceCheckUtils]: 20: Hoare triple {1285#false} assume !(~k~0 <= 3); {1285#false} is VALID [2020-07-18 00:49:32,893 INFO L280 TraceCheckUtils]: 21: Hoare triple {1285#false} assume !!(~i~0 <= 100); {1285#false} is VALID [2020-07-18 00:49:32,894 INFO L280 TraceCheckUtils]: 22: Hoare triple {1285#false} ~i~0 := 1 + ~i~0; {1285#false} is VALID [2020-07-18 00:49:32,894 INFO L280 TraceCheckUtils]: 23: Hoare triple {1285#false} assume !(~j~0 < 20); {1285#false} is VALID [2020-07-18 00:49:32,894 INFO L280 TraceCheckUtils]: 24: Hoare triple {1285#false} ~k~0 := 4; {1285#false} is VALID [2020-07-18 00:49:32,894 INFO L280 TraceCheckUtils]: 25: Hoare triple {1285#false} assume !(~k~0 <= 3); {1285#false} is VALID [2020-07-18 00:49:32,895 INFO L280 TraceCheckUtils]: 26: Hoare triple {1285#false} assume !(~i~0 <= 100); {1285#false} is VALID [2020-07-18 00:49:32,895 INFO L263 TraceCheckUtils]: 27: Hoare triple {1285#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {1285#false} is VALID [2020-07-18 00:49:32,895 INFO L280 TraceCheckUtils]: 28: Hoare triple {1285#false} ~cond := #in~cond; {1285#false} is VALID [2020-07-18 00:49:32,895 INFO L280 TraceCheckUtils]: 29: Hoare triple {1285#false} assume 0 == ~cond; {1285#false} is VALID [2020-07-18 00:49:32,896 INFO L280 TraceCheckUtils]: 30: Hoare triple {1285#false} assume !false; {1285#false} is VALID [2020-07-18 00:49:32,897 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 00:49:32,902 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:32,902 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2136555369] [2020-07-18 00:49:32,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:32,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-18 00:49:32,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533351892] [2020-07-18 00:49:32,904 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2020-07-18 00:49:32,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:32,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-18 00:49:32,932 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:32,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-18 00:49:32,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:32,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-18 00:49:32,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-18 00:49:32,934 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 8 states. [2020-07-18 00:49:33,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:33,261 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2020-07-18 00:49:33,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-18 00:49:33,261 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2020-07-18 00:49:33,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:33,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 00:49:33,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2020-07-18 00:49:33,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 00:49:33,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2020-07-18 00:49:33,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 49 transitions. [2020-07-18 00:49:33,310 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:33,311 INFO L225 Difference]: With dead ends: 54 [2020-07-18 00:49:33,311 INFO L226 Difference]: Without dead ends: 38 [2020-07-18 00:49:33,313 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-07-18 00:49:33,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-18 00:49:33,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2020-07-18 00:49:33,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:33,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 37 states. [2020-07-18 00:49:33,361 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 37 states. [2020-07-18 00:49:33,361 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 37 states. [2020-07-18 00:49:33,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:33,363 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2020-07-18 00:49:33,363 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-07-18 00:49:33,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:33,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:33,364 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 38 states. [2020-07-18 00:49:33,364 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 38 states. [2020-07-18 00:49:33,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:33,366 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2020-07-18 00:49:33,367 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-07-18 00:49:33,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:33,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:33,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:33,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:33,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-18 00:49:33,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-07-18 00:49:33,371 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 31 [2020-07-18 00:49:33,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:33,371 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-07-18 00:49:33,371 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-18 00:49:33,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 41 transitions. [2020-07-18 00:49:33,413 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:33,413 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-07-18 00:49:33,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-18 00:49:33,414 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:33,414 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:49:33,414 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-18 00:49:33,415 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:33,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:33,415 INFO L82 PathProgramCache]: Analyzing trace with hash 2021892204, now seen corresponding path program 5 times [2020-07-18 00:49:33,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:33,417 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2072509598] [2020-07-18 00:49:33,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:35,718 INFO L280 TraceCheckUtils]: 0: Hoare triple {1562#true} assume true; {1562#true} is VALID [2020-07-18 00:49:35,718 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1562#true} {1562#true} #74#return; {1562#true} is VALID [2020-07-18 00:49:35,718 INFO L263 TraceCheckUtils]: 0: Hoare triple {1562#true} call ULTIMATE.init(); {1562#true} is VALID [2020-07-18 00:49:35,719 INFO L280 TraceCheckUtils]: 1: Hoare triple {1562#true} assume true; {1562#true} is VALID [2020-07-18 00:49:35,719 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1562#true} {1562#true} #74#return; {1562#true} is VALID [2020-07-18 00:49:35,719 INFO L263 TraceCheckUtils]: 3: Hoare triple {1562#true} call #t~ret0 := main(); {1562#true} is VALID [2020-07-18 00:49:35,719 INFO L280 TraceCheckUtils]: 4: Hoare triple {1562#true} havoc ~i~0; {1562#true} is VALID [2020-07-18 00:49:35,720 INFO L280 TraceCheckUtils]: 5: Hoare triple {1562#true} havoc ~j~0; {1562#true} is VALID [2020-07-18 00:49:35,720 INFO L280 TraceCheckUtils]: 6: Hoare triple {1562#true} havoc ~k~0; {1562#true} is VALID [2020-07-18 00:49:35,721 INFO L280 TraceCheckUtils]: 7: Hoare triple {1562#true} ~i~0 := 0; {1566#(<= main_~i~0 0)} is VALID [2020-07-18 00:49:35,721 INFO L280 TraceCheckUtils]: 8: Hoare triple {1566#(<= main_~i~0 0)} ~k~0 := 9; {1566#(<= main_~i~0 0)} is VALID [2020-07-18 00:49:35,722 INFO L280 TraceCheckUtils]: 9: Hoare triple {1566#(<= main_~i~0 0)} ~j~0 := -100; {1567#(<= (+ (* 4 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-18 00:49:35,722 INFO L280 TraceCheckUtils]: 10: Hoare triple {1567#(<= (+ (* 4 main_~i~0) main_~j~0 100) 0)} assume !!(~i~0 <= 100); {1567#(<= (+ (* 4 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-18 00:49:35,723 INFO L280 TraceCheckUtils]: 11: Hoare triple {1567#(<= (+ (* 4 main_~i~0) main_~j~0 100) 0)} ~i~0 := 1 + ~i~0; {1568#(<= (+ (* 4 main_~i~0) main_~j~0 96) 0)} is VALID [2020-07-18 00:49:35,724 INFO L280 TraceCheckUtils]: 12: Hoare triple {1568#(<= (+ (* 4 main_~i~0) main_~j~0 96) 0)} assume !!(~j~0 < 20); {1568#(<= (+ (* 4 main_~i~0) main_~j~0 96) 0)} is VALID [2020-07-18 00:49:35,724 INFO L280 TraceCheckUtils]: 13: Hoare triple {1568#(<= (+ (* 4 main_~i~0) main_~j~0 96) 0)} ~j~0 := ~i~0 + ~j~0; {1569#(<= (+ (* 3 main_~i~0) main_~j~0 96) 0)} is VALID [2020-07-18 00:49:35,725 INFO L280 TraceCheckUtils]: 14: Hoare triple {1569#(<= (+ (* 3 main_~i~0) main_~j~0 96) 0)} assume !!(~j~0 < 20); {1569#(<= (+ (* 3 main_~i~0) main_~j~0 96) 0)} is VALID [2020-07-18 00:49:35,725 INFO L280 TraceCheckUtils]: 15: Hoare triple {1569#(<= (+ (* 3 main_~i~0) main_~j~0 96) 0)} ~j~0 := ~i~0 + ~j~0; {1570#(<= (+ (* 2 main_~i~0) main_~j~0 96) 0)} is VALID [2020-07-18 00:49:35,726 INFO L280 TraceCheckUtils]: 16: Hoare triple {1570#(<= (+ (* 2 main_~i~0) main_~j~0 96) 0)} assume !!(~j~0 < 20); {1570#(<= (+ (* 2 main_~i~0) main_~j~0 96) 0)} is VALID [2020-07-18 00:49:35,726 INFO L280 TraceCheckUtils]: 17: Hoare triple {1570#(<= (+ (* 2 main_~i~0) main_~j~0 96) 0)} ~j~0 := ~i~0 + ~j~0; {1571#(<= (+ main_~i~0 main_~j~0 96) 0)} is VALID [2020-07-18 00:49:35,727 INFO L280 TraceCheckUtils]: 18: Hoare triple {1571#(<= (+ main_~i~0 main_~j~0 96) 0)} assume !!(~j~0 < 20); {1571#(<= (+ main_~i~0 main_~j~0 96) 0)} is VALID [2020-07-18 00:49:35,727 INFO L280 TraceCheckUtils]: 19: Hoare triple {1571#(<= (+ main_~i~0 main_~j~0 96) 0)} ~j~0 := ~i~0 + ~j~0; {1572#(<= (+ main_~j~0 96) 0)} is VALID [2020-07-18 00:49:35,728 INFO L280 TraceCheckUtils]: 20: Hoare triple {1572#(<= (+ main_~j~0 96) 0)} assume !(~j~0 < 20); {1563#false} is VALID [2020-07-18 00:49:35,728 INFO L280 TraceCheckUtils]: 21: Hoare triple {1563#false} ~k~0 := 4; {1563#false} is VALID [2020-07-18 00:49:35,728 INFO L280 TraceCheckUtils]: 22: Hoare triple {1563#false} assume !(~k~0 <= 3); {1563#false} is VALID [2020-07-18 00:49:35,729 INFO L280 TraceCheckUtils]: 23: Hoare triple {1563#false} assume !!(~i~0 <= 100); {1563#false} is VALID [2020-07-18 00:49:35,729 INFO L280 TraceCheckUtils]: 24: Hoare triple {1563#false} ~i~0 := 1 + ~i~0; {1563#false} is VALID [2020-07-18 00:49:35,729 INFO L280 TraceCheckUtils]: 25: Hoare triple {1563#false} assume !(~j~0 < 20); {1563#false} is VALID [2020-07-18 00:49:35,729 INFO L280 TraceCheckUtils]: 26: Hoare triple {1563#false} ~k~0 := 4; {1563#false} is VALID [2020-07-18 00:49:35,730 INFO L280 TraceCheckUtils]: 27: Hoare triple {1563#false} assume !(~k~0 <= 3); {1563#false} is VALID [2020-07-18 00:49:35,730 INFO L280 TraceCheckUtils]: 28: Hoare triple {1563#false} assume !(~i~0 <= 100); {1563#false} is VALID [2020-07-18 00:49:35,730 INFO L263 TraceCheckUtils]: 29: Hoare triple {1563#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {1563#false} is VALID [2020-07-18 00:49:35,730 INFO L280 TraceCheckUtils]: 30: Hoare triple {1563#false} ~cond := #in~cond; {1563#false} is VALID [2020-07-18 00:49:35,731 INFO L280 TraceCheckUtils]: 31: Hoare triple {1563#false} assume 0 == ~cond; {1563#false} is VALID [2020-07-18 00:49:35,731 INFO L280 TraceCheckUtils]: 32: Hoare triple {1563#false} assume !false; {1563#false} is VALID [2020-07-18 00:49:35,733 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 00:49:35,742 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:35,743 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2072509598] [2020-07-18 00:49:35,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:35,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-18 00:49:35,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844337360] [2020-07-18 00:49:35,744 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2020-07-18 00:49:35,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:35,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-18 00:49:35,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:35,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-18 00:49:35,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:35,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-18 00:49:35,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-18 00:49:35,776 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 9 states. [2020-07-18 00:49:36,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:36,156 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2020-07-18 00:49:36,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-18 00:49:36,156 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2020-07-18 00:49:36,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:36,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 00:49:36,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2020-07-18 00:49:36,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 00:49:36,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2020-07-18 00:49:36,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 51 transitions. [2020-07-18 00:49:36,226 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:36,228 INFO L225 Difference]: With dead ends: 56 [2020-07-18 00:49:36,228 INFO L226 Difference]: Without dead ends: 40 [2020-07-18 00:49:36,229 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2020-07-18 00:49:36,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-18 00:49:36,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2020-07-18 00:49:36,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:36,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2020-07-18 00:49:36,315 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2020-07-18 00:49:36,315 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2020-07-18 00:49:36,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:36,317 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-18 00:49:36,317 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-18 00:49:36,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:36,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:36,318 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2020-07-18 00:49:36,318 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2020-07-18 00:49:36,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:36,320 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-18 00:49:36,320 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-18 00:49:36,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:36,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:36,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:36,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:36,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-18 00:49:36,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-07-18 00:49:36,322 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 33 [2020-07-18 00:49:36,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:36,322 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-07-18 00:49:36,323 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-18 00:49:36,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 43 transitions. [2020-07-18 00:49:36,375 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:36,376 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-07-18 00:49:36,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-18 00:49:36,376 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:36,376 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:49:36,376 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-18 00:49:36,377 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:36,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:36,377 INFO L82 PathProgramCache]: Analyzing trace with hash 377623979, now seen corresponding path program 6 times [2020-07-18 00:49:36,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:36,377 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [206517798] [2020-07-18 00:49:36,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:36,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:36,526 INFO L280 TraceCheckUtils]: 0: Hoare triple {1855#true} assume true; {1855#true} is VALID [2020-07-18 00:49:36,526 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1855#true} {1855#true} #74#return; {1855#true} is VALID [2020-07-18 00:49:36,527 INFO L263 TraceCheckUtils]: 0: Hoare triple {1855#true} call ULTIMATE.init(); {1855#true} is VALID [2020-07-18 00:49:36,527 INFO L280 TraceCheckUtils]: 1: Hoare triple {1855#true} assume true; {1855#true} is VALID [2020-07-18 00:49:36,527 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1855#true} {1855#true} #74#return; {1855#true} is VALID [2020-07-18 00:49:36,527 INFO L263 TraceCheckUtils]: 3: Hoare triple {1855#true} call #t~ret0 := main(); {1855#true} is VALID [2020-07-18 00:49:36,528 INFO L280 TraceCheckUtils]: 4: Hoare triple {1855#true} havoc ~i~0; {1855#true} is VALID [2020-07-18 00:49:36,528 INFO L280 TraceCheckUtils]: 5: Hoare triple {1855#true} havoc ~j~0; {1855#true} is VALID [2020-07-18 00:49:36,528 INFO L280 TraceCheckUtils]: 6: Hoare triple {1855#true} havoc ~k~0; {1855#true} is VALID [2020-07-18 00:49:36,529 INFO L280 TraceCheckUtils]: 7: Hoare triple {1855#true} ~i~0 := 0; {1859#(<= main_~i~0 0)} is VALID [2020-07-18 00:49:36,529 INFO L280 TraceCheckUtils]: 8: Hoare triple {1859#(<= main_~i~0 0)} ~k~0 := 9; {1859#(<= main_~i~0 0)} is VALID [2020-07-18 00:49:36,530 INFO L280 TraceCheckUtils]: 9: Hoare triple {1859#(<= main_~i~0 0)} ~j~0 := -100; {1860#(<= (+ (* 5 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-18 00:49:36,530 INFO L280 TraceCheckUtils]: 10: Hoare triple {1860#(<= (+ (* 5 main_~i~0) main_~j~0 100) 0)} assume !!(~i~0 <= 100); {1860#(<= (+ (* 5 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-18 00:49:36,531 INFO L280 TraceCheckUtils]: 11: Hoare triple {1860#(<= (+ (* 5 main_~i~0) main_~j~0 100) 0)} ~i~0 := 1 + ~i~0; {1861#(<= (+ (* 5 main_~i~0) main_~j~0 95) 0)} is VALID [2020-07-18 00:49:36,532 INFO L280 TraceCheckUtils]: 12: Hoare triple {1861#(<= (+ (* 5 main_~i~0) main_~j~0 95) 0)} assume !!(~j~0 < 20); {1861#(<= (+ (* 5 main_~i~0) main_~j~0 95) 0)} is VALID [2020-07-18 00:49:36,532 INFO L280 TraceCheckUtils]: 13: Hoare triple {1861#(<= (+ (* 5 main_~i~0) main_~j~0 95) 0)} ~j~0 := ~i~0 + ~j~0; {1862#(<= (+ (* 4 main_~i~0) main_~j~0 95) 0)} is VALID [2020-07-18 00:49:36,533 INFO L280 TraceCheckUtils]: 14: Hoare triple {1862#(<= (+ (* 4 main_~i~0) main_~j~0 95) 0)} assume !!(~j~0 < 20); {1862#(<= (+ (* 4 main_~i~0) main_~j~0 95) 0)} is VALID [2020-07-18 00:49:36,533 INFO L280 TraceCheckUtils]: 15: Hoare triple {1862#(<= (+ (* 4 main_~i~0) main_~j~0 95) 0)} ~j~0 := ~i~0 + ~j~0; {1863#(<= (+ (* 3 main_~i~0) main_~j~0 95) 0)} is VALID [2020-07-18 00:49:36,534 INFO L280 TraceCheckUtils]: 16: Hoare triple {1863#(<= (+ (* 3 main_~i~0) main_~j~0 95) 0)} assume !!(~j~0 < 20); {1863#(<= (+ (* 3 main_~i~0) main_~j~0 95) 0)} is VALID [2020-07-18 00:49:36,535 INFO L280 TraceCheckUtils]: 17: Hoare triple {1863#(<= (+ (* 3 main_~i~0) main_~j~0 95) 0)} ~j~0 := ~i~0 + ~j~0; {1864#(<= (+ (* 2 main_~i~0) main_~j~0 95) 0)} is VALID [2020-07-18 00:49:36,535 INFO L280 TraceCheckUtils]: 18: Hoare triple {1864#(<= (+ (* 2 main_~i~0) main_~j~0 95) 0)} assume !!(~j~0 < 20); {1864#(<= (+ (* 2 main_~i~0) main_~j~0 95) 0)} is VALID [2020-07-18 00:49:36,536 INFO L280 TraceCheckUtils]: 19: Hoare triple {1864#(<= (+ (* 2 main_~i~0) main_~j~0 95) 0)} ~j~0 := ~i~0 + ~j~0; {1865#(<= (+ main_~i~0 main_~j~0 95) 0)} is VALID [2020-07-18 00:49:36,536 INFO L280 TraceCheckUtils]: 20: Hoare triple {1865#(<= (+ main_~i~0 main_~j~0 95) 0)} assume !!(~j~0 < 20); {1865#(<= (+ main_~i~0 main_~j~0 95) 0)} is VALID [2020-07-18 00:49:36,537 INFO L280 TraceCheckUtils]: 21: Hoare triple {1865#(<= (+ main_~i~0 main_~j~0 95) 0)} ~j~0 := ~i~0 + ~j~0; {1866#(<= (+ main_~j~0 95) 0)} is VALID [2020-07-18 00:49:36,537 INFO L280 TraceCheckUtils]: 22: Hoare triple {1866#(<= (+ main_~j~0 95) 0)} assume !(~j~0 < 20); {1856#false} is VALID [2020-07-18 00:49:36,537 INFO L280 TraceCheckUtils]: 23: Hoare triple {1856#false} ~k~0 := 4; {1856#false} is VALID [2020-07-18 00:49:36,538 INFO L280 TraceCheckUtils]: 24: Hoare triple {1856#false} assume !(~k~0 <= 3); {1856#false} is VALID [2020-07-18 00:49:36,538 INFO L280 TraceCheckUtils]: 25: Hoare triple {1856#false} assume !!(~i~0 <= 100); {1856#false} is VALID [2020-07-18 00:49:36,538 INFO L280 TraceCheckUtils]: 26: Hoare triple {1856#false} ~i~0 := 1 + ~i~0; {1856#false} is VALID [2020-07-18 00:49:36,538 INFO L280 TraceCheckUtils]: 27: Hoare triple {1856#false} assume !(~j~0 < 20); {1856#false} is VALID [2020-07-18 00:49:36,538 INFO L280 TraceCheckUtils]: 28: Hoare triple {1856#false} ~k~0 := 4; {1856#false} is VALID [2020-07-18 00:49:36,539 INFO L280 TraceCheckUtils]: 29: Hoare triple {1856#false} assume !(~k~0 <= 3); {1856#false} is VALID [2020-07-18 00:49:36,539 INFO L280 TraceCheckUtils]: 30: Hoare triple {1856#false} assume !(~i~0 <= 100); {1856#false} is VALID [2020-07-18 00:49:36,539 INFO L263 TraceCheckUtils]: 31: Hoare triple {1856#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {1856#false} is VALID [2020-07-18 00:49:36,539 INFO L280 TraceCheckUtils]: 32: Hoare triple {1856#false} ~cond := #in~cond; {1856#false} is VALID [2020-07-18 00:49:36,539 INFO L280 TraceCheckUtils]: 33: Hoare triple {1856#false} assume 0 == ~cond; {1856#false} is VALID [2020-07-18 00:49:36,540 INFO L280 TraceCheckUtils]: 34: Hoare triple {1856#false} assume !false; {1856#false} is VALID [2020-07-18 00:49:36,541 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 00:49:36,550 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:36,550 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [206517798] [2020-07-18 00:49:36,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:36,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-18 00:49:36,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35024606] [2020-07-18 00:49:36,551 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2020-07-18 00:49:36,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:36,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-18 00:49:36,586 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:36,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-18 00:49:36,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:36,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-18 00:49:36,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-18 00:49:36,587 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 10 states. [2020-07-18 00:49:37,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:37,039 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2020-07-18 00:49:37,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-18 00:49:37,040 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2020-07-18 00:49:37,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:37,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-18 00:49:37,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2020-07-18 00:49:37,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-18 00:49:37,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2020-07-18 00:49:37,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 53 transitions. [2020-07-18 00:49:37,110 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:37,111 INFO L225 Difference]: With dead ends: 58 [2020-07-18 00:49:37,112 INFO L226 Difference]: Without dead ends: 42 [2020-07-18 00:49:37,113 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2020-07-18 00:49:37,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-18 00:49:37,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2020-07-18 00:49:37,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:37,186 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 41 states. [2020-07-18 00:49:37,186 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 41 states. [2020-07-18 00:49:37,187 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 41 states. [2020-07-18 00:49:37,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:37,189 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2020-07-18 00:49:37,190 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2020-07-18 00:49:37,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:37,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:37,191 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 42 states. [2020-07-18 00:49:37,191 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 42 states. [2020-07-18 00:49:37,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:37,192 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2020-07-18 00:49:37,192 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2020-07-18 00:49:37,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:37,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:37,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:37,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:37,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-18 00:49:37,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2020-07-18 00:49:37,196 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 35 [2020-07-18 00:49:37,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:37,196 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2020-07-18 00:49:37,196 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-18 00:49:37,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 45 transitions. [2020-07-18 00:49:37,253 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:37,254 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2020-07-18 00:49:37,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-18 00:49:37,265 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:37,265 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:49:37,265 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-18 00:49:37,266 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:37,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:37,266 INFO L82 PathProgramCache]: Analyzing trace with hash 783824682, now seen corresponding path program 7 times [2020-07-18 00:49:37,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:37,267 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2030510384] [2020-07-18 00:49:37,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:37,446 INFO L280 TraceCheckUtils]: 0: Hoare triple {2163#true} assume true; {2163#true} is VALID [2020-07-18 00:49:37,446 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2163#true} {2163#true} #74#return; {2163#true} is VALID [2020-07-18 00:49:37,446 INFO L263 TraceCheckUtils]: 0: Hoare triple {2163#true} call ULTIMATE.init(); {2163#true} is VALID [2020-07-18 00:49:37,446 INFO L280 TraceCheckUtils]: 1: Hoare triple {2163#true} assume true; {2163#true} is VALID [2020-07-18 00:49:37,447 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2163#true} {2163#true} #74#return; {2163#true} is VALID [2020-07-18 00:49:37,447 INFO L263 TraceCheckUtils]: 3: Hoare triple {2163#true} call #t~ret0 := main(); {2163#true} is VALID [2020-07-18 00:49:37,447 INFO L280 TraceCheckUtils]: 4: Hoare triple {2163#true} havoc ~i~0; {2163#true} is VALID [2020-07-18 00:49:37,447 INFO L280 TraceCheckUtils]: 5: Hoare triple {2163#true} havoc ~j~0; {2163#true} is VALID [2020-07-18 00:49:37,447 INFO L280 TraceCheckUtils]: 6: Hoare triple {2163#true} havoc ~k~0; {2163#true} is VALID [2020-07-18 00:49:37,453 INFO L280 TraceCheckUtils]: 7: Hoare triple {2163#true} ~i~0 := 0; {2167#(<= main_~i~0 0)} is VALID [2020-07-18 00:49:37,455 INFO L280 TraceCheckUtils]: 8: Hoare triple {2167#(<= main_~i~0 0)} ~k~0 := 9; {2167#(<= main_~i~0 0)} is VALID [2020-07-18 00:49:37,457 INFO L280 TraceCheckUtils]: 9: Hoare triple {2167#(<= main_~i~0 0)} ~j~0 := -100; {2168#(<= (+ (* 6 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-18 00:49:37,457 INFO L280 TraceCheckUtils]: 10: Hoare triple {2168#(<= (+ (* 6 main_~i~0) main_~j~0 100) 0)} assume !!(~i~0 <= 100); {2168#(<= (+ (* 6 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-18 00:49:37,458 INFO L280 TraceCheckUtils]: 11: Hoare triple {2168#(<= (+ (* 6 main_~i~0) main_~j~0 100) 0)} ~i~0 := 1 + ~i~0; {2169#(<= (+ (* 6 main_~i~0) main_~j~0 94) 0)} is VALID [2020-07-18 00:49:37,459 INFO L280 TraceCheckUtils]: 12: Hoare triple {2169#(<= (+ (* 6 main_~i~0) main_~j~0 94) 0)} assume !!(~j~0 < 20); {2169#(<= (+ (* 6 main_~i~0) main_~j~0 94) 0)} is VALID [2020-07-18 00:49:37,460 INFO L280 TraceCheckUtils]: 13: Hoare triple {2169#(<= (+ (* 6 main_~i~0) main_~j~0 94) 0)} ~j~0 := ~i~0 + ~j~0; {2170#(<= (+ (* 5 main_~i~0) main_~j~0 94) 0)} is VALID [2020-07-18 00:49:37,461 INFO L280 TraceCheckUtils]: 14: Hoare triple {2170#(<= (+ (* 5 main_~i~0) main_~j~0 94) 0)} assume !!(~j~0 < 20); {2170#(<= (+ (* 5 main_~i~0) main_~j~0 94) 0)} is VALID [2020-07-18 00:49:37,462 INFO L280 TraceCheckUtils]: 15: Hoare triple {2170#(<= (+ (* 5 main_~i~0) main_~j~0 94) 0)} ~j~0 := ~i~0 + ~j~0; {2171#(<= (+ (* 4 main_~i~0) main_~j~0 94) 0)} is VALID [2020-07-18 00:49:37,463 INFO L280 TraceCheckUtils]: 16: Hoare triple {2171#(<= (+ (* 4 main_~i~0) main_~j~0 94) 0)} assume !!(~j~0 < 20); {2171#(<= (+ (* 4 main_~i~0) main_~j~0 94) 0)} is VALID [2020-07-18 00:49:37,463 INFO L280 TraceCheckUtils]: 17: Hoare triple {2171#(<= (+ (* 4 main_~i~0) main_~j~0 94) 0)} ~j~0 := ~i~0 + ~j~0; {2172#(<= (+ (* 3 main_~i~0) main_~j~0 94) 0)} is VALID [2020-07-18 00:49:37,464 INFO L280 TraceCheckUtils]: 18: Hoare triple {2172#(<= (+ (* 3 main_~i~0) main_~j~0 94) 0)} assume !!(~j~0 < 20); {2172#(<= (+ (* 3 main_~i~0) main_~j~0 94) 0)} is VALID [2020-07-18 00:49:37,464 INFO L280 TraceCheckUtils]: 19: Hoare triple {2172#(<= (+ (* 3 main_~i~0) main_~j~0 94) 0)} ~j~0 := ~i~0 + ~j~0; {2173#(<= (+ (* 2 main_~i~0) main_~j~0 94) 0)} is VALID [2020-07-18 00:49:37,465 INFO L280 TraceCheckUtils]: 20: Hoare triple {2173#(<= (+ (* 2 main_~i~0) main_~j~0 94) 0)} assume !!(~j~0 < 20); {2173#(<= (+ (* 2 main_~i~0) main_~j~0 94) 0)} is VALID [2020-07-18 00:49:37,466 INFO L280 TraceCheckUtils]: 21: Hoare triple {2173#(<= (+ (* 2 main_~i~0) main_~j~0 94) 0)} ~j~0 := ~i~0 + ~j~0; {2174#(<= (+ main_~i~0 main_~j~0 94) 0)} is VALID [2020-07-18 00:49:37,466 INFO L280 TraceCheckUtils]: 22: Hoare triple {2174#(<= (+ main_~i~0 main_~j~0 94) 0)} assume !!(~j~0 < 20); {2174#(<= (+ main_~i~0 main_~j~0 94) 0)} is VALID [2020-07-18 00:49:37,467 INFO L280 TraceCheckUtils]: 23: Hoare triple {2174#(<= (+ main_~i~0 main_~j~0 94) 0)} ~j~0 := ~i~0 + ~j~0; {2175#(<= (+ main_~j~0 94) 0)} is VALID [2020-07-18 00:49:37,467 INFO L280 TraceCheckUtils]: 24: Hoare triple {2175#(<= (+ main_~j~0 94) 0)} assume !(~j~0 < 20); {2164#false} is VALID [2020-07-18 00:49:37,467 INFO L280 TraceCheckUtils]: 25: Hoare triple {2164#false} ~k~0 := 4; {2164#false} is VALID [2020-07-18 00:49:37,467 INFO L280 TraceCheckUtils]: 26: Hoare triple {2164#false} assume !(~k~0 <= 3); {2164#false} is VALID [2020-07-18 00:49:37,468 INFO L280 TraceCheckUtils]: 27: Hoare triple {2164#false} assume !!(~i~0 <= 100); {2164#false} is VALID [2020-07-18 00:49:37,468 INFO L280 TraceCheckUtils]: 28: Hoare triple {2164#false} ~i~0 := 1 + ~i~0; {2164#false} is VALID [2020-07-18 00:49:37,468 INFO L280 TraceCheckUtils]: 29: Hoare triple {2164#false} assume !(~j~0 < 20); {2164#false} is VALID [2020-07-18 00:49:37,468 INFO L280 TraceCheckUtils]: 30: Hoare triple {2164#false} ~k~0 := 4; {2164#false} is VALID [2020-07-18 00:49:37,468 INFO L280 TraceCheckUtils]: 31: Hoare triple {2164#false} assume !(~k~0 <= 3); {2164#false} is VALID [2020-07-18 00:49:37,469 INFO L280 TraceCheckUtils]: 32: Hoare triple {2164#false} assume !(~i~0 <= 100); {2164#false} is VALID [2020-07-18 00:49:37,469 INFO L263 TraceCheckUtils]: 33: Hoare triple {2164#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {2164#false} is VALID [2020-07-18 00:49:37,469 INFO L280 TraceCheckUtils]: 34: Hoare triple {2164#false} ~cond := #in~cond; {2164#false} is VALID [2020-07-18 00:49:37,469 INFO L280 TraceCheckUtils]: 35: Hoare triple {2164#false} assume 0 == ~cond; {2164#false} is VALID [2020-07-18 00:49:37,470 INFO L280 TraceCheckUtils]: 36: Hoare triple {2164#false} assume !false; {2164#false} is VALID [2020-07-18 00:49:37,472 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 00:49:37,474 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:37,475 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2030510384] [2020-07-18 00:49:37,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:37,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-18 00:49:37,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706361441] [2020-07-18 00:49:37,476 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-07-18 00:49:37,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:37,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-18 00:49:37,517 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:37,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-18 00:49:37,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:37,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-18 00:49:37,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-07-18 00:49:37,519 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 11 states. [2020-07-18 00:49:38,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:38,013 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2020-07-18 00:49:38,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-18 00:49:38,013 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-07-18 00:49:38,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:38,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 00:49:38,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 55 transitions. [2020-07-18 00:49:38,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 00:49:38,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 55 transitions. [2020-07-18 00:49:38,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 55 transitions. [2020-07-18 00:49:38,079 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 00:49:38,080 INFO L225 Difference]: With dead ends: 60 [2020-07-18 00:49:38,080 INFO L226 Difference]: Without dead ends: 44 [2020-07-18 00:49:38,081 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2020-07-18 00:49:38,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-18 00:49:38,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2020-07-18 00:49:38,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:38,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 43 states. [2020-07-18 00:49:38,154 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 43 states. [2020-07-18 00:49:38,154 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 43 states. [2020-07-18 00:49:38,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:38,156 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2020-07-18 00:49:38,156 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2020-07-18 00:49:38,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:38,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:38,157 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 44 states. [2020-07-18 00:49:38,157 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 44 states. [2020-07-18 00:49:38,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:38,158 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2020-07-18 00:49:38,159 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2020-07-18 00:49:38,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:38,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:38,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:38,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:38,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-18 00:49:38,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2020-07-18 00:49:38,161 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 37 [2020-07-18 00:49:38,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:38,161 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2020-07-18 00:49:38,161 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-18 00:49:38,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 47 transitions. [2020-07-18 00:49:38,222 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:38,223 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2020-07-18 00:49:38,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-18 00:49:38,224 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:38,224 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:49:38,224 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-18 00:49:38,224 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:38,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:38,225 INFO L82 PathProgramCache]: Analyzing trace with hash 300676329, now seen corresponding path program 8 times [2020-07-18 00:49:38,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:38,225 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [905196927] [2020-07-18 00:49:38,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:38,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:38,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:38,454 INFO L280 TraceCheckUtils]: 0: Hoare triple {2486#true} assume true; {2486#true} is VALID [2020-07-18 00:49:38,454 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2486#true} {2486#true} #74#return; {2486#true} is VALID [2020-07-18 00:49:38,454 INFO L263 TraceCheckUtils]: 0: Hoare triple {2486#true} call ULTIMATE.init(); {2486#true} is VALID [2020-07-18 00:49:38,455 INFO L280 TraceCheckUtils]: 1: Hoare triple {2486#true} assume true; {2486#true} is VALID [2020-07-18 00:49:38,455 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2486#true} {2486#true} #74#return; {2486#true} is VALID [2020-07-18 00:49:38,455 INFO L263 TraceCheckUtils]: 3: Hoare triple {2486#true} call #t~ret0 := main(); {2486#true} is VALID [2020-07-18 00:49:38,455 INFO L280 TraceCheckUtils]: 4: Hoare triple {2486#true} havoc ~i~0; {2486#true} is VALID [2020-07-18 00:49:38,455 INFO L280 TraceCheckUtils]: 5: Hoare triple {2486#true} havoc ~j~0; {2486#true} is VALID [2020-07-18 00:49:38,456 INFO L280 TraceCheckUtils]: 6: Hoare triple {2486#true} havoc ~k~0; {2486#true} is VALID [2020-07-18 00:49:38,456 INFO L280 TraceCheckUtils]: 7: Hoare triple {2486#true} ~i~0 := 0; {2490#(<= main_~i~0 0)} is VALID [2020-07-18 00:49:38,456 INFO L280 TraceCheckUtils]: 8: Hoare triple {2490#(<= main_~i~0 0)} ~k~0 := 9; {2490#(<= main_~i~0 0)} is VALID [2020-07-18 00:49:38,457 INFO L280 TraceCheckUtils]: 9: Hoare triple {2490#(<= main_~i~0 0)} ~j~0 := -100; {2491#(<= (+ (* 7 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-18 00:49:38,457 INFO L280 TraceCheckUtils]: 10: Hoare triple {2491#(<= (+ (* 7 main_~i~0) main_~j~0 100) 0)} assume !!(~i~0 <= 100); {2491#(<= (+ (* 7 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-18 00:49:38,458 INFO L280 TraceCheckUtils]: 11: Hoare triple {2491#(<= (+ (* 7 main_~i~0) main_~j~0 100) 0)} ~i~0 := 1 + ~i~0; {2492#(<= (+ (* 7 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-18 00:49:38,458 INFO L280 TraceCheckUtils]: 12: Hoare triple {2492#(<= (+ (* 7 main_~i~0) main_~j~0 93) 0)} assume !!(~j~0 < 20); {2492#(<= (+ (* 7 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-18 00:49:38,459 INFO L280 TraceCheckUtils]: 13: Hoare triple {2492#(<= (+ (* 7 main_~i~0) main_~j~0 93) 0)} ~j~0 := ~i~0 + ~j~0; {2493#(<= (+ (* 6 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-18 00:49:38,459 INFO L280 TraceCheckUtils]: 14: Hoare triple {2493#(<= (+ (* 6 main_~i~0) main_~j~0 93) 0)} assume !!(~j~0 < 20); {2493#(<= (+ (* 6 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-18 00:49:38,460 INFO L280 TraceCheckUtils]: 15: Hoare triple {2493#(<= (+ (* 6 main_~i~0) main_~j~0 93) 0)} ~j~0 := ~i~0 + ~j~0; {2494#(<= (+ (* 5 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-18 00:49:38,461 INFO L280 TraceCheckUtils]: 16: Hoare triple {2494#(<= (+ (* 5 main_~i~0) main_~j~0 93) 0)} assume !!(~j~0 < 20); {2494#(<= (+ (* 5 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-18 00:49:38,461 INFO L280 TraceCheckUtils]: 17: Hoare triple {2494#(<= (+ (* 5 main_~i~0) main_~j~0 93) 0)} ~j~0 := ~i~0 + ~j~0; {2495#(<= (+ (* 4 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-18 00:49:38,462 INFO L280 TraceCheckUtils]: 18: Hoare triple {2495#(<= (+ (* 4 main_~i~0) main_~j~0 93) 0)} assume !!(~j~0 < 20); {2495#(<= (+ (* 4 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-18 00:49:38,462 INFO L280 TraceCheckUtils]: 19: Hoare triple {2495#(<= (+ (* 4 main_~i~0) main_~j~0 93) 0)} ~j~0 := ~i~0 + ~j~0; {2496#(<= (+ (* 3 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-18 00:49:38,463 INFO L280 TraceCheckUtils]: 20: Hoare triple {2496#(<= (+ (* 3 main_~i~0) main_~j~0 93) 0)} assume !!(~j~0 < 20); {2496#(<= (+ (* 3 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-18 00:49:38,468 INFO L280 TraceCheckUtils]: 21: Hoare triple {2496#(<= (+ (* 3 main_~i~0) main_~j~0 93) 0)} ~j~0 := ~i~0 + ~j~0; {2497#(<= (+ (* 2 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-18 00:49:38,468 INFO L280 TraceCheckUtils]: 22: Hoare triple {2497#(<= (+ (* 2 main_~i~0) main_~j~0 93) 0)} assume !!(~j~0 < 20); {2497#(<= (+ (* 2 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-18 00:49:38,469 INFO L280 TraceCheckUtils]: 23: Hoare triple {2497#(<= (+ (* 2 main_~i~0) main_~j~0 93) 0)} ~j~0 := ~i~0 + ~j~0; {2498#(<= (+ main_~i~0 main_~j~0 93) 0)} is VALID [2020-07-18 00:49:38,469 INFO L280 TraceCheckUtils]: 24: Hoare triple {2498#(<= (+ main_~i~0 main_~j~0 93) 0)} assume !!(~j~0 < 20); {2498#(<= (+ main_~i~0 main_~j~0 93) 0)} is VALID [2020-07-18 00:49:38,470 INFO L280 TraceCheckUtils]: 25: Hoare triple {2498#(<= (+ main_~i~0 main_~j~0 93) 0)} ~j~0 := ~i~0 + ~j~0; {2499#(<= (+ main_~j~0 93) 0)} is VALID [2020-07-18 00:49:38,472 INFO L280 TraceCheckUtils]: 26: Hoare triple {2499#(<= (+ main_~j~0 93) 0)} assume !(~j~0 < 20); {2487#false} is VALID [2020-07-18 00:49:38,472 INFO L280 TraceCheckUtils]: 27: Hoare triple {2487#false} ~k~0 := 4; {2487#false} is VALID [2020-07-18 00:49:38,472 INFO L280 TraceCheckUtils]: 28: Hoare triple {2487#false} assume !(~k~0 <= 3); {2487#false} is VALID [2020-07-18 00:49:38,472 INFO L280 TraceCheckUtils]: 29: Hoare triple {2487#false} assume !!(~i~0 <= 100); {2487#false} is VALID [2020-07-18 00:49:38,472 INFO L280 TraceCheckUtils]: 30: Hoare triple {2487#false} ~i~0 := 1 + ~i~0; {2487#false} is VALID [2020-07-18 00:49:38,472 INFO L280 TraceCheckUtils]: 31: Hoare triple {2487#false} assume !(~j~0 < 20); {2487#false} is VALID [2020-07-18 00:49:38,473 INFO L280 TraceCheckUtils]: 32: Hoare triple {2487#false} ~k~0 := 4; {2487#false} is VALID [2020-07-18 00:49:38,473 INFO L280 TraceCheckUtils]: 33: Hoare triple {2487#false} assume !(~k~0 <= 3); {2487#false} is VALID [2020-07-18 00:49:38,473 INFO L280 TraceCheckUtils]: 34: Hoare triple {2487#false} assume !(~i~0 <= 100); {2487#false} is VALID [2020-07-18 00:49:38,474 INFO L263 TraceCheckUtils]: 35: Hoare triple {2487#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {2487#false} is VALID [2020-07-18 00:49:38,474 INFO L280 TraceCheckUtils]: 36: Hoare triple {2487#false} ~cond := #in~cond; {2487#false} is VALID [2020-07-18 00:49:38,474 INFO L280 TraceCheckUtils]: 37: Hoare triple {2487#false} assume 0 == ~cond; {2487#false} is VALID [2020-07-18 00:49:38,474 INFO L280 TraceCheckUtils]: 38: Hoare triple {2487#false} assume !false; {2487#false} is VALID [2020-07-18 00:49:38,476 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 00:49:38,478 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:38,478 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [905196927] [2020-07-18 00:49:38,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:38,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-18 00:49:38,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059423103] [2020-07-18 00:49:38,479 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2020-07-18 00:49:38,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:38,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-18 00:49:38,525 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:38,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-18 00:49:38,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:38,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-18 00:49:38,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-07-18 00:49:38,526 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 12 states. [2020-07-18 00:49:39,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:39,139 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2020-07-18 00:49:39,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-18 00:49:39,139 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2020-07-18 00:49:39,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:39,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-18 00:49:39,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2020-07-18 00:49:39,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-18 00:49:39,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2020-07-18 00:49:39,143 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 57 transitions. [2020-07-18 00:49:39,203 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 00:49:39,204 INFO L225 Difference]: With dead ends: 62 [2020-07-18 00:49:39,205 INFO L226 Difference]: Without dead ends: 46 [2020-07-18 00:49:39,205 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2020-07-18 00:49:39,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-18 00:49:39,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2020-07-18 00:49:39,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:39,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 45 states. [2020-07-18 00:49:39,295 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 45 states. [2020-07-18 00:49:39,295 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 45 states. [2020-07-18 00:49:39,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:39,297 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2020-07-18 00:49:39,297 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2020-07-18 00:49:39,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:39,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:39,297 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 46 states. [2020-07-18 00:49:39,298 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 46 states. [2020-07-18 00:49:39,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:39,299 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2020-07-18 00:49:39,299 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2020-07-18 00:49:39,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:39,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:39,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:39,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:39,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-18 00:49:39,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2020-07-18 00:49:39,301 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 39 [2020-07-18 00:49:39,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:39,301 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2020-07-18 00:49:39,301 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-18 00:49:39,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 49 transitions. [2020-07-18 00:49:39,372 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:39,372 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2020-07-18 00:49:39,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-18 00:49:39,380 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:39,380 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:49:39,380 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-18 00:49:39,380 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:39,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:39,381 INFO L82 PathProgramCache]: Analyzing trace with hash -148422936, now seen corresponding path program 9 times [2020-07-18 00:49:39,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:39,381 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [611800422] [2020-07-18 00:49:39,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:39,616 INFO L280 TraceCheckUtils]: 0: Hoare triple {2824#true} assume true; {2824#true} is VALID [2020-07-18 00:49:39,616 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2824#true} {2824#true} #74#return; {2824#true} is VALID [2020-07-18 00:49:39,616 INFO L263 TraceCheckUtils]: 0: Hoare triple {2824#true} call ULTIMATE.init(); {2824#true} is VALID [2020-07-18 00:49:39,617 INFO L280 TraceCheckUtils]: 1: Hoare triple {2824#true} assume true; {2824#true} is VALID [2020-07-18 00:49:39,617 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2824#true} {2824#true} #74#return; {2824#true} is VALID [2020-07-18 00:49:39,617 INFO L263 TraceCheckUtils]: 3: Hoare triple {2824#true} call #t~ret0 := main(); {2824#true} is VALID [2020-07-18 00:49:39,617 INFO L280 TraceCheckUtils]: 4: Hoare triple {2824#true} havoc ~i~0; {2824#true} is VALID [2020-07-18 00:49:39,617 INFO L280 TraceCheckUtils]: 5: Hoare triple {2824#true} havoc ~j~0; {2824#true} is VALID [2020-07-18 00:49:39,617 INFO L280 TraceCheckUtils]: 6: Hoare triple {2824#true} havoc ~k~0; {2824#true} is VALID [2020-07-18 00:49:39,618 INFO L280 TraceCheckUtils]: 7: Hoare triple {2824#true} ~i~0 := 0; {2828#(<= main_~i~0 0)} is VALID [2020-07-18 00:49:39,618 INFO L280 TraceCheckUtils]: 8: Hoare triple {2828#(<= main_~i~0 0)} ~k~0 := 9; {2828#(<= main_~i~0 0)} is VALID [2020-07-18 00:49:39,619 INFO L280 TraceCheckUtils]: 9: Hoare triple {2828#(<= main_~i~0 0)} ~j~0 := -100; {2829#(<= (+ (* 8 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-18 00:49:39,619 INFO L280 TraceCheckUtils]: 10: Hoare triple {2829#(<= (+ (* 8 main_~i~0) main_~j~0 100) 0)} assume !!(~i~0 <= 100); {2829#(<= (+ (* 8 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-18 00:49:39,620 INFO L280 TraceCheckUtils]: 11: Hoare triple {2829#(<= (+ (* 8 main_~i~0) main_~j~0 100) 0)} ~i~0 := 1 + ~i~0; {2830#(<= (+ (* 8 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-18 00:49:39,621 INFO L280 TraceCheckUtils]: 12: Hoare triple {2830#(<= (+ (* 8 main_~i~0) main_~j~0 92) 0)} assume !!(~j~0 < 20); {2830#(<= (+ (* 8 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-18 00:49:39,621 INFO L280 TraceCheckUtils]: 13: Hoare triple {2830#(<= (+ (* 8 main_~i~0) main_~j~0 92) 0)} ~j~0 := ~i~0 + ~j~0; {2831#(<= (+ (* 7 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-18 00:49:39,622 INFO L280 TraceCheckUtils]: 14: Hoare triple {2831#(<= (+ (* 7 main_~i~0) main_~j~0 92) 0)} assume !!(~j~0 < 20); {2831#(<= (+ (* 7 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-18 00:49:39,622 INFO L280 TraceCheckUtils]: 15: Hoare triple {2831#(<= (+ (* 7 main_~i~0) main_~j~0 92) 0)} ~j~0 := ~i~0 + ~j~0; {2832#(<= (+ (* 6 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-18 00:49:39,623 INFO L280 TraceCheckUtils]: 16: Hoare triple {2832#(<= (+ (* 6 main_~i~0) main_~j~0 92) 0)} assume !!(~j~0 < 20); {2832#(<= (+ (* 6 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-18 00:49:39,623 INFO L280 TraceCheckUtils]: 17: Hoare triple {2832#(<= (+ (* 6 main_~i~0) main_~j~0 92) 0)} ~j~0 := ~i~0 + ~j~0; {2833#(<= (+ (* 5 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-18 00:49:39,624 INFO L280 TraceCheckUtils]: 18: Hoare triple {2833#(<= (+ (* 5 main_~i~0) main_~j~0 92) 0)} assume !!(~j~0 < 20); {2833#(<= (+ (* 5 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-18 00:49:39,625 INFO L280 TraceCheckUtils]: 19: Hoare triple {2833#(<= (+ (* 5 main_~i~0) main_~j~0 92) 0)} ~j~0 := ~i~0 + ~j~0; {2834#(<= (+ (* 4 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-18 00:49:39,625 INFO L280 TraceCheckUtils]: 20: Hoare triple {2834#(<= (+ (* 4 main_~i~0) main_~j~0 92) 0)} assume !!(~j~0 < 20); {2834#(<= (+ (* 4 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-18 00:49:39,626 INFO L280 TraceCheckUtils]: 21: Hoare triple {2834#(<= (+ (* 4 main_~i~0) main_~j~0 92) 0)} ~j~0 := ~i~0 + ~j~0; {2835#(<= (+ (* 3 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-18 00:49:39,627 INFO L280 TraceCheckUtils]: 22: Hoare triple {2835#(<= (+ (* 3 main_~i~0) main_~j~0 92) 0)} assume !!(~j~0 < 20); {2835#(<= (+ (* 3 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-18 00:49:39,628 INFO L280 TraceCheckUtils]: 23: Hoare triple {2835#(<= (+ (* 3 main_~i~0) main_~j~0 92) 0)} ~j~0 := ~i~0 + ~j~0; {2836#(<= (+ (* 2 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-18 00:49:39,628 INFO L280 TraceCheckUtils]: 24: Hoare triple {2836#(<= (+ (* 2 main_~i~0) main_~j~0 92) 0)} assume !!(~j~0 < 20); {2836#(<= (+ (* 2 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-18 00:49:39,629 INFO L280 TraceCheckUtils]: 25: Hoare triple {2836#(<= (+ (* 2 main_~i~0) main_~j~0 92) 0)} ~j~0 := ~i~0 + ~j~0; {2837#(<= (+ main_~i~0 main_~j~0 92) 0)} is VALID [2020-07-18 00:49:39,629 INFO L280 TraceCheckUtils]: 26: Hoare triple {2837#(<= (+ main_~i~0 main_~j~0 92) 0)} assume !!(~j~0 < 20); {2837#(<= (+ main_~i~0 main_~j~0 92) 0)} is VALID [2020-07-18 00:49:39,630 INFO L280 TraceCheckUtils]: 27: Hoare triple {2837#(<= (+ main_~i~0 main_~j~0 92) 0)} ~j~0 := ~i~0 + ~j~0; {2838#(<= (+ main_~j~0 92) 0)} is VALID [2020-07-18 00:49:39,631 INFO L280 TraceCheckUtils]: 28: Hoare triple {2838#(<= (+ main_~j~0 92) 0)} assume !(~j~0 < 20); {2825#false} is VALID [2020-07-18 00:49:39,631 INFO L280 TraceCheckUtils]: 29: Hoare triple {2825#false} ~k~0 := 4; {2825#false} is VALID [2020-07-18 00:49:39,631 INFO L280 TraceCheckUtils]: 30: Hoare triple {2825#false} assume !(~k~0 <= 3); {2825#false} is VALID [2020-07-18 00:49:39,632 INFO L280 TraceCheckUtils]: 31: Hoare triple {2825#false} assume !!(~i~0 <= 100); {2825#false} is VALID [2020-07-18 00:49:39,632 INFO L280 TraceCheckUtils]: 32: Hoare triple {2825#false} ~i~0 := 1 + ~i~0; {2825#false} is VALID [2020-07-18 00:49:39,632 INFO L280 TraceCheckUtils]: 33: Hoare triple {2825#false} assume !(~j~0 < 20); {2825#false} is VALID [2020-07-18 00:49:39,632 INFO L280 TraceCheckUtils]: 34: Hoare triple {2825#false} ~k~0 := 4; {2825#false} is VALID [2020-07-18 00:49:39,633 INFO L280 TraceCheckUtils]: 35: Hoare triple {2825#false} assume !(~k~0 <= 3); {2825#false} is VALID [2020-07-18 00:49:39,633 INFO L280 TraceCheckUtils]: 36: Hoare triple {2825#false} assume !(~i~0 <= 100); {2825#false} is VALID [2020-07-18 00:49:39,633 INFO L263 TraceCheckUtils]: 37: Hoare triple {2825#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {2825#false} is VALID [2020-07-18 00:49:39,633 INFO L280 TraceCheckUtils]: 38: Hoare triple {2825#false} ~cond := #in~cond; {2825#false} is VALID [2020-07-18 00:49:39,634 INFO L280 TraceCheckUtils]: 39: Hoare triple {2825#false} assume 0 == ~cond; {2825#false} is VALID [2020-07-18 00:49:39,634 INFO L280 TraceCheckUtils]: 40: Hoare triple {2825#false} assume !false; {2825#false} is VALID [2020-07-18 00:49:39,636 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 00:49:39,638 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:39,638 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [611800422] [2020-07-18 00:49:39,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:39,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-18 00:49:39,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40353060] [2020-07-18 00:49:39,639 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2020-07-18 00:49:39,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:39,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-18 00:49:39,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:39,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-18 00:49:39,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:39,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-18 00:49:39,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2020-07-18 00:49:39,685 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 13 states. [2020-07-18 00:49:40,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:40,355 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2020-07-18 00:49:40,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-18 00:49:40,355 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2020-07-18 00:49:40,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:40,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-18 00:49:40,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 59 transitions. [2020-07-18 00:49:40,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-18 00:49:40,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 59 transitions. [2020-07-18 00:49:40,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 59 transitions. [2020-07-18 00:49:40,435 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 00:49:40,436 INFO L225 Difference]: With dead ends: 64 [2020-07-18 00:49:40,437 INFO L226 Difference]: Without dead ends: 48 [2020-07-18 00:49:40,437 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2020-07-18 00:49:40,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-18 00:49:40,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2020-07-18 00:49:40,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:40,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 47 states. [2020-07-18 00:49:40,579 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 47 states. [2020-07-18 00:49:40,579 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 47 states. [2020-07-18 00:49:40,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:40,581 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2020-07-18 00:49:40,581 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2020-07-18 00:49:40,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:40,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:40,581 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 48 states. [2020-07-18 00:49:40,581 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 48 states. [2020-07-18 00:49:40,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:40,582 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2020-07-18 00:49:40,582 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2020-07-18 00:49:40,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:40,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:40,583 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:40,583 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:40,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-18 00:49:40,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2020-07-18 00:49:40,584 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 41 [2020-07-18 00:49:40,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:40,584 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2020-07-18 00:49:40,584 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-18 00:49:40,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 51 transitions. [2020-07-18 00:49:40,666 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:40,667 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2020-07-18 00:49:40,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-18 00:49:40,667 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:40,668 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:49:40,668 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-18 00:49:40,668 INFO L427 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:40,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:40,669 INFO L82 PathProgramCache]: Analyzing trace with hash 2058880295, now seen corresponding path program 10 times [2020-07-18 00:49:40,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:40,669 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [450577978] [2020-07-18 00:49:40,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:40,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:40,780 INFO L280 TraceCheckUtils]: 0: Hoare triple {3177#true} assume true; {3177#true} is VALID [2020-07-18 00:49:40,780 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3177#true} {3177#true} #74#return; {3177#true} is VALID [2020-07-18 00:49:40,780 INFO L263 TraceCheckUtils]: 0: Hoare triple {3177#true} call ULTIMATE.init(); {3177#true} is VALID [2020-07-18 00:49:40,781 INFO L280 TraceCheckUtils]: 1: Hoare triple {3177#true} assume true; {3177#true} is VALID [2020-07-18 00:49:40,781 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3177#true} {3177#true} #74#return; {3177#true} is VALID [2020-07-18 00:49:40,781 INFO L263 TraceCheckUtils]: 3: Hoare triple {3177#true} call #t~ret0 := main(); {3177#true} is VALID [2020-07-18 00:49:40,781 INFO L280 TraceCheckUtils]: 4: Hoare triple {3177#true} havoc ~i~0; {3177#true} is VALID [2020-07-18 00:49:40,782 INFO L280 TraceCheckUtils]: 5: Hoare triple {3177#true} havoc ~j~0; {3177#true} is VALID [2020-07-18 00:49:40,782 INFO L280 TraceCheckUtils]: 6: Hoare triple {3177#true} havoc ~k~0; {3177#true} is VALID [2020-07-18 00:49:40,783 INFO L280 TraceCheckUtils]: 7: Hoare triple {3177#true} ~i~0 := 0; {3181#(<= main_~i~0 0)} is VALID [2020-07-18 00:49:40,783 INFO L280 TraceCheckUtils]: 8: Hoare triple {3181#(<= main_~i~0 0)} ~k~0 := 9; {3181#(<= main_~i~0 0)} is VALID [2020-07-18 00:49:40,784 INFO L280 TraceCheckUtils]: 9: Hoare triple {3181#(<= main_~i~0 0)} ~j~0 := -100; {3181#(<= main_~i~0 0)} is VALID [2020-07-18 00:49:40,785 INFO L280 TraceCheckUtils]: 10: Hoare triple {3181#(<= main_~i~0 0)} assume !!(~i~0 <= 100); {3181#(<= main_~i~0 0)} is VALID [2020-07-18 00:49:40,785 INFO L280 TraceCheckUtils]: 11: Hoare triple {3181#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {3182#(<= main_~i~0 1)} is VALID [2020-07-18 00:49:40,786 INFO L280 TraceCheckUtils]: 12: Hoare triple {3182#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3182#(<= main_~i~0 1)} is VALID [2020-07-18 00:49:40,787 INFO L280 TraceCheckUtils]: 13: Hoare triple {3182#(<= main_~i~0 1)} ~j~0 := ~i~0 + ~j~0; {3182#(<= main_~i~0 1)} is VALID [2020-07-18 00:49:40,788 INFO L280 TraceCheckUtils]: 14: Hoare triple {3182#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3182#(<= main_~i~0 1)} is VALID [2020-07-18 00:49:40,788 INFO L280 TraceCheckUtils]: 15: Hoare triple {3182#(<= main_~i~0 1)} ~j~0 := ~i~0 + ~j~0; {3182#(<= main_~i~0 1)} is VALID [2020-07-18 00:49:40,790 INFO L280 TraceCheckUtils]: 16: Hoare triple {3182#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3182#(<= main_~i~0 1)} is VALID [2020-07-18 00:49:40,790 INFO L280 TraceCheckUtils]: 17: Hoare triple {3182#(<= main_~i~0 1)} ~j~0 := ~i~0 + ~j~0; {3182#(<= main_~i~0 1)} is VALID [2020-07-18 00:49:40,793 INFO L280 TraceCheckUtils]: 18: Hoare triple {3182#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3182#(<= main_~i~0 1)} is VALID [2020-07-18 00:49:40,794 INFO L280 TraceCheckUtils]: 19: Hoare triple {3182#(<= main_~i~0 1)} ~j~0 := ~i~0 + ~j~0; {3182#(<= main_~i~0 1)} is VALID [2020-07-18 00:49:40,800 INFO L280 TraceCheckUtils]: 20: Hoare triple {3182#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3182#(<= main_~i~0 1)} is VALID [2020-07-18 00:49:40,800 INFO L280 TraceCheckUtils]: 21: Hoare triple {3182#(<= main_~i~0 1)} ~j~0 := ~i~0 + ~j~0; {3182#(<= main_~i~0 1)} is VALID [2020-07-18 00:49:40,801 INFO L280 TraceCheckUtils]: 22: Hoare triple {3182#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3182#(<= main_~i~0 1)} is VALID [2020-07-18 00:49:40,801 INFO L280 TraceCheckUtils]: 23: Hoare triple {3182#(<= main_~i~0 1)} ~j~0 := ~i~0 + ~j~0; {3182#(<= main_~i~0 1)} is VALID [2020-07-18 00:49:40,802 INFO L280 TraceCheckUtils]: 24: Hoare triple {3182#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3182#(<= main_~i~0 1)} is VALID [2020-07-18 00:49:40,802 INFO L280 TraceCheckUtils]: 25: Hoare triple {3182#(<= main_~i~0 1)} ~j~0 := ~i~0 + ~j~0; {3182#(<= main_~i~0 1)} is VALID [2020-07-18 00:49:40,803 INFO L280 TraceCheckUtils]: 26: Hoare triple {3182#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3182#(<= main_~i~0 1)} is VALID [2020-07-18 00:49:40,803 INFO L280 TraceCheckUtils]: 27: Hoare triple {3182#(<= main_~i~0 1)} ~j~0 := ~i~0 + ~j~0; {3182#(<= main_~i~0 1)} is VALID [2020-07-18 00:49:40,804 INFO L280 TraceCheckUtils]: 28: Hoare triple {3182#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3182#(<= main_~i~0 1)} is VALID [2020-07-18 00:49:40,804 INFO L280 TraceCheckUtils]: 29: Hoare triple {3182#(<= main_~i~0 1)} ~j~0 := ~i~0 + ~j~0; {3182#(<= main_~i~0 1)} is VALID [2020-07-18 00:49:40,805 INFO L280 TraceCheckUtils]: 30: Hoare triple {3182#(<= main_~i~0 1)} assume !(~j~0 < 20); {3182#(<= main_~i~0 1)} is VALID [2020-07-18 00:49:40,805 INFO L280 TraceCheckUtils]: 31: Hoare triple {3182#(<= main_~i~0 1)} ~k~0 := 4; {3182#(<= main_~i~0 1)} is VALID [2020-07-18 00:49:40,806 INFO L280 TraceCheckUtils]: 32: Hoare triple {3182#(<= main_~i~0 1)} assume !(~k~0 <= 3); {3182#(<= main_~i~0 1)} is VALID [2020-07-18 00:49:40,806 INFO L280 TraceCheckUtils]: 33: Hoare triple {3182#(<= main_~i~0 1)} assume !!(~i~0 <= 100); {3182#(<= main_~i~0 1)} is VALID [2020-07-18 00:49:40,807 INFO L280 TraceCheckUtils]: 34: Hoare triple {3182#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {3183#(<= main_~i~0 2)} is VALID [2020-07-18 00:49:40,808 INFO L280 TraceCheckUtils]: 35: Hoare triple {3183#(<= main_~i~0 2)} assume !(~j~0 < 20); {3183#(<= main_~i~0 2)} is VALID [2020-07-18 00:49:40,808 INFO L280 TraceCheckUtils]: 36: Hoare triple {3183#(<= main_~i~0 2)} ~k~0 := 4; {3183#(<= main_~i~0 2)} is VALID [2020-07-18 00:49:40,809 INFO L280 TraceCheckUtils]: 37: Hoare triple {3183#(<= main_~i~0 2)} assume !(~k~0 <= 3); {3183#(<= main_~i~0 2)} is VALID [2020-07-18 00:49:40,809 INFO L280 TraceCheckUtils]: 38: Hoare triple {3183#(<= main_~i~0 2)} assume !(~i~0 <= 100); {3178#false} is VALID [2020-07-18 00:49:40,810 INFO L263 TraceCheckUtils]: 39: Hoare triple {3178#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {3178#false} is VALID [2020-07-18 00:49:40,810 INFO L280 TraceCheckUtils]: 40: Hoare triple {3178#false} ~cond := #in~cond; {3178#false} is VALID [2020-07-18 00:49:40,810 INFO L280 TraceCheckUtils]: 41: Hoare triple {3178#false} assume 0 == ~cond; {3178#false} is VALID [2020-07-18 00:49:40,810 INFO L280 TraceCheckUtils]: 42: Hoare triple {3178#false} assume !false; {3178#false} is VALID [2020-07-18 00:49:40,812 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 00:49:40,821 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:40,822 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [450577978] [2020-07-18 00:49:40,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:40,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:49:40,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564551742] [2020-07-18 00:49:40,822 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2020-07-18 00:49:40,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:40,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:49:40,857 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:40,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:49:40,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:40,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:49:40,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:49:40,858 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2020-07-18 00:49:41,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:41,037 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2020-07-18 00:49:41,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 00:49:41,037 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2020-07-18 00:49:41,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:41,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:49:41,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2020-07-18 00:49:41,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:49:41,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2020-07-18 00:49:41,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 49 transitions. [2020-07-18 00:49:41,094 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:41,095 INFO L225 Difference]: With dead ends: 60 [2020-07-18 00:49:41,095 INFO L226 Difference]: Without dead ends: 55 [2020-07-18 00:49:41,096 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:49:41,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-18 00:49:41,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2020-07-18 00:49:41,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:41,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 54 states. [2020-07-18 00:49:41,214 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 54 states. [2020-07-18 00:49:41,214 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 54 states. [2020-07-18 00:49:41,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:41,216 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2020-07-18 00:49:41,216 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2020-07-18 00:49:41,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:41,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:41,216 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 55 states. [2020-07-18 00:49:41,217 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 55 states. [2020-07-18 00:49:41,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:41,218 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2020-07-18 00:49:41,218 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2020-07-18 00:49:41,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:41,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:41,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:41,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:41,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-18 00:49:41,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2020-07-18 00:49:41,220 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 43 [2020-07-18 00:49:41,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:41,221 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2020-07-18 00:49:41,221 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:49:41,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states and 60 transitions. [2020-07-18 00:49:41,298 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 00:49:41,298 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2020-07-18 00:49:41,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-18 00:49:41,298 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:41,299 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:49:41,299 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-18 00:49:41,299 INFO L427 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:41,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:41,299 INFO L82 PathProgramCache]: Analyzing trace with hash -135810616, now seen corresponding path program 11 times [2020-07-18 00:49:41,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:41,300 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [234565188] [2020-07-18 00:49:41,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:41,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:41,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:41,473 INFO L280 TraceCheckUtils]: 0: Hoare triple {3524#true} assume true; {3524#true} is VALID [2020-07-18 00:49:41,473 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3524#true} {3524#true} #74#return; {3524#true} is VALID [2020-07-18 00:49:41,474 INFO L263 TraceCheckUtils]: 0: Hoare triple {3524#true} call ULTIMATE.init(); {3524#true} is VALID [2020-07-18 00:49:41,474 INFO L280 TraceCheckUtils]: 1: Hoare triple {3524#true} assume true; {3524#true} is VALID [2020-07-18 00:49:41,474 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3524#true} {3524#true} #74#return; {3524#true} is VALID [2020-07-18 00:49:41,474 INFO L263 TraceCheckUtils]: 3: Hoare triple {3524#true} call #t~ret0 := main(); {3524#true} is VALID [2020-07-18 00:49:41,474 INFO L280 TraceCheckUtils]: 4: Hoare triple {3524#true} havoc ~i~0; {3524#true} is VALID [2020-07-18 00:49:41,475 INFO L280 TraceCheckUtils]: 5: Hoare triple {3524#true} havoc ~j~0; {3524#true} is VALID [2020-07-18 00:49:41,475 INFO L280 TraceCheckUtils]: 6: Hoare triple {3524#true} havoc ~k~0; {3524#true} is VALID [2020-07-18 00:49:41,475 INFO L280 TraceCheckUtils]: 7: Hoare triple {3524#true} ~i~0 := 0; {3524#true} is VALID [2020-07-18 00:49:41,475 INFO L280 TraceCheckUtils]: 8: Hoare triple {3524#true} ~k~0 := 9; {3524#true} is VALID [2020-07-18 00:49:41,476 INFO L280 TraceCheckUtils]: 9: Hoare triple {3524#true} ~j~0 := -100; {3524#true} is VALID [2020-07-18 00:49:41,476 INFO L280 TraceCheckUtils]: 10: Hoare triple {3524#true} assume !!(~i~0 <= 100); {3524#true} is VALID [2020-07-18 00:49:41,476 INFO L280 TraceCheckUtils]: 11: Hoare triple {3524#true} ~i~0 := 1 + ~i~0; {3524#true} is VALID [2020-07-18 00:49:41,476 INFO L280 TraceCheckUtils]: 12: Hoare triple {3524#true} assume !!(~j~0 < 20); {3524#true} is VALID [2020-07-18 00:49:41,476 INFO L280 TraceCheckUtils]: 13: Hoare triple {3524#true} ~j~0 := ~i~0 + ~j~0; {3524#true} is VALID [2020-07-18 00:49:41,477 INFO L280 TraceCheckUtils]: 14: Hoare triple {3524#true} assume !!(~j~0 < 20); {3524#true} is VALID [2020-07-18 00:49:41,477 INFO L280 TraceCheckUtils]: 15: Hoare triple {3524#true} ~j~0 := ~i~0 + ~j~0; {3524#true} is VALID [2020-07-18 00:49:41,477 INFO L280 TraceCheckUtils]: 16: Hoare triple {3524#true} assume !!(~j~0 < 20); {3524#true} is VALID [2020-07-18 00:49:41,477 INFO L280 TraceCheckUtils]: 17: Hoare triple {3524#true} ~j~0 := ~i~0 + ~j~0; {3524#true} is VALID [2020-07-18 00:49:41,477 INFO L280 TraceCheckUtils]: 18: Hoare triple {3524#true} assume !!(~j~0 < 20); {3524#true} is VALID [2020-07-18 00:49:41,478 INFO L280 TraceCheckUtils]: 19: Hoare triple {3524#true} ~j~0 := ~i~0 + ~j~0; {3524#true} is VALID [2020-07-18 00:49:41,478 INFO L280 TraceCheckUtils]: 20: Hoare triple {3524#true} assume !!(~j~0 < 20); {3524#true} is VALID [2020-07-18 00:49:41,478 INFO L280 TraceCheckUtils]: 21: Hoare triple {3524#true} ~j~0 := ~i~0 + ~j~0; {3524#true} is VALID [2020-07-18 00:49:41,478 INFO L280 TraceCheckUtils]: 22: Hoare triple {3524#true} assume !!(~j~0 < 20); {3524#true} is VALID [2020-07-18 00:49:41,478 INFO L280 TraceCheckUtils]: 23: Hoare triple {3524#true} ~j~0 := ~i~0 + ~j~0; {3524#true} is VALID [2020-07-18 00:49:41,479 INFO L280 TraceCheckUtils]: 24: Hoare triple {3524#true} assume !!(~j~0 < 20); {3524#true} is VALID [2020-07-18 00:49:41,479 INFO L280 TraceCheckUtils]: 25: Hoare triple {3524#true} ~j~0 := ~i~0 + ~j~0; {3524#true} is VALID [2020-07-18 00:49:41,480 INFO L280 TraceCheckUtils]: 26: Hoare triple {3524#true} assume !!(~j~0 < 20); {3524#true} is VALID [2020-07-18 00:49:41,480 INFO L280 TraceCheckUtils]: 27: Hoare triple {3524#true} ~j~0 := ~i~0 + ~j~0; {3524#true} is VALID [2020-07-18 00:49:41,480 INFO L280 TraceCheckUtils]: 28: Hoare triple {3524#true} assume !!(~j~0 < 20); {3524#true} is VALID [2020-07-18 00:49:41,480 INFO L280 TraceCheckUtils]: 29: Hoare triple {3524#true} ~j~0 := ~i~0 + ~j~0; {3524#true} is VALID [2020-07-18 00:49:41,480 INFO L280 TraceCheckUtils]: 30: Hoare triple {3524#true} assume !(~j~0 < 20); {3524#true} is VALID [2020-07-18 00:49:41,481 INFO L280 TraceCheckUtils]: 31: Hoare triple {3524#true} ~k~0 := 4; {3524#true} is VALID [2020-07-18 00:49:41,481 INFO L280 TraceCheckUtils]: 32: Hoare triple {3524#true} assume !(~k~0 <= 3); {3524#true} is VALID [2020-07-18 00:49:41,481 INFO L280 TraceCheckUtils]: 33: Hoare triple {3524#true} assume !!(~i~0 <= 100); {3524#true} is VALID [2020-07-18 00:49:41,481 INFO L280 TraceCheckUtils]: 34: Hoare triple {3524#true} ~i~0 := 1 + ~i~0; {3524#true} is VALID [2020-07-18 00:49:41,482 INFO L280 TraceCheckUtils]: 35: Hoare triple {3524#true} assume !(~j~0 < 20); {3524#true} is VALID [2020-07-18 00:49:41,482 INFO L280 TraceCheckUtils]: 36: Hoare triple {3524#true} ~k~0 := 4; {3524#true} is VALID [2020-07-18 00:49:41,482 INFO L280 TraceCheckUtils]: 37: Hoare triple {3524#true} assume !(~k~0 <= 3); {3524#true} is VALID [2020-07-18 00:49:41,482 INFO L280 TraceCheckUtils]: 38: Hoare triple {3524#true} assume !!(~i~0 <= 100); {3524#true} is VALID [2020-07-18 00:49:41,482 INFO L280 TraceCheckUtils]: 39: Hoare triple {3524#true} ~i~0 := 1 + ~i~0; {3524#true} is VALID [2020-07-18 00:49:41,483 INFO L280 TraceCheckUtils]: 40: Hoare triple {3524#true} assume !(~j~0 < 20); {3524#true} is VALID [2020-07-18 00:49:41,486 INFO L280 TraceCheckUtils]: 41: Hoare triple {3524#true} ~k~0 := 4; {3528#(= 4 main_~k~0)} is VALID [2020-07-18 00:49:41,487 INFO L280 TraceCheckUtils]: 42: Hoare triple {3528#(= 4 main_~k~0)} assume !(~k~0 <= 3); {3528#(= 4 main_~k~0)} is VALID [2020-07-18 00:49:41,488 INFO L280 TraceCheckUtils]: 43: Hoare triple {3528#(= 4 main_~k~0)} assume !(~i~0 <= 100); {3528#(= 4 main_~k~0)} is VALID [2020-07-18 00:49:41,489 INFO L263 TraceCheckUtils]: 44: Hoare triple {3528#(= 4 main_~k~0)} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {3529#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:49:41,489 INFO L280 TraceCheckUtils]: 45: Hoare triple {3529#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {3530#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:49:41,490 INFO L280 TraceCheckUtils]: 46: Hoare triple {3530#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {3525#false} is VALID [2020-07-18 00:49:41,490 INFO L280 TraceCheckUtils]: 47: Hoare triple {3525#false} assume !false; {3525#false} is VALID [2020-07-18 00:49:41,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:49:41,492 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:41,493 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [234565188] [2020-07-18 00:49:41,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:41,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:49:41,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635316484] [2020-07-18 00:49:41,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2020-07-18 00:49:41,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:41,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:49:41,524 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:41,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:49:41,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:41,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:49:41,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:49:41,526 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 5 states. [2020-07-18 00:49:41,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:41,796 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2020-07-18 00:49:41,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 00:49:41,796 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2020-07-18 00:49:41,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:41,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:49:41,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2020-07-18 00:49:41,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:49:41,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2020-07-18 00:49:41,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2020-07-18 00:49:41,852 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:41,852 INFO L225 Difference]: With dead ends: 71 [2020-07-18 00:49:41,852 INFO L226 Difference]: Without dead ends: 0 [2020-07-18 00:49:41,854 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:49:41,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-18 00:49:41,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-18 00:49:41,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:41,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-18 00:49:41,855 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 00:49:41,855 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 00:49:41,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:41,860 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 00:49:41,860 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:49:41,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:41,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:41,861 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 00:49:41,861 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 00:49:41,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:41,861 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 00:49:41,862 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:49:41,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:41,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:41,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:41,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:41,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-18 00:49:41,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-18 00:49:41,863 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2020-07-18 00:49:41,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:41,864 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-18 00:49:41,864 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:49:41,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-18 00:49:41,864 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 00:49:41,865 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:49:41,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:41,865 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-18 00:49:41,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-18 00:49:42,272 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-18 00:49:42,272 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-18 00:49:42,272 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-18 00:49:42,272 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 00:49:42,272 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-18 00:49:42,272 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-18 00:49:42,273 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-18 00:49:42,273 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-18 00:49:42,273 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-18 00:49:42,273 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-18 00:49:42,273 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-18 00:49:42,273 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: false [2020-07-18 00:49:42,273 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 30) the Hoare annotation is: true [2020-07-18 00:49:42,273 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (or (= 4 main_~k~0) (<= main_~i~0 1)) [2020-07-18 00:49:42,273 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (or (and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0)) (= 4 main_~k~0)) [2020-07-18 00:49:42,274 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (<= main_~i~0 0) [2020-07-18 00:49:42,274 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-18 00:49:42,274 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 30) the Hoare annotation is: true [2020-07-18 00:49:42,274 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 30) the Hoare annotation is: true [2020-07-18 00:49:42,275 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-07-18 00:49:42,275 INFO L264 CegarLoopResult]: At program point L24-2(lines 24 26) the Hoare annotation is: (= 4 main_~k~0) [2020-07-18 00:49:42,275 INFO L264 CegarLoopResult]: At program point L24-3(lines 18 27) the Hoare annotation is: (or (and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0)) (= 4 main_~k~0)) [2020-07-18 00:49:42,275 INFO L264 CegarLoopResult]: At program point L20-2(lines 20 22) the Hoare annotation is: (or (= 4 main_~k~0) (<= main_~i~0 1)) [2020-07-18 00:49:42,275 INFO L264 CegarLoopResult]: At program point L20-3(lines 20 22) the Hoare annotation is: (or (= 4 main_~k~0) (<= main_~i~0 1)) [2020-07-18 00:49:42,275 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (<= main_~i~0 0) [2020-07-18 00:49:42,275 INFO L264 CegarLoopResult]: At program point L18-2(lines 18 27) the Hoare annotation is: (= 4 main_~k~0) [2020-07-18 00:49:42,275 INFO L271 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-07-18 00:49:42,275 INFO L271 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: true [2020-07-18 00:49:42,276 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-18 00:49:42,276 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: true [2020-07-18 00:49:42,276 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-18 00:49:42,276 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-18 00:49:42,276 INFO L271 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: true [2020-07-18 00:49:42,276 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-18 00:49:42,280 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-18 00:49:42,281 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-18 00:49:42,281 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-18 00:49:42,282 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-18 00:49:42,282 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-18 00:49:42,287 INFO L163 areAnnotationChecker]: CFG has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 00:49:42,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 12:49:42 BoogieIcfgContainer [2020-07-18 00:49:42,299 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 00:49:42,303 INFO L168 Benchmark]: Toolchain (without parser) took 19836.78 ms. Allocated memory was 135.3 MB in the beginning and 332.4 MB in the end (delta: 197.1 MB). Free memory was 100.6 MB in the beginning and 211.8 MB in the end (delta: -111.2 MB). Peak memory consumption was 86.0 MB. Max. memory is 7.1 GB. [2020-07-18 00:49:42,303 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 135.3 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-18 00:49:42,304 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.22 ms. Allocated memory is still 135.3 MB. Free memory was 100.2 MB in the beginning and 90.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-18 00:49:42,304 INFO L168 Benchmark]: Boogie Preprocessor took 191.12 ms. Allocated memory was 135.3 MB in the beginning and 202.9 MB in the end (delta: 67.6 MB). Free memory was 90.2 MB in the beginning and 182.6 MB in the end (delta: -92.4 MB). Peak memory consumption was 15.5 MB. Max. memory is 7.1 GB. [2020-07-18 00:49:42,305 INFO L168 Benchmark]: RCFGBuilder took 324.14 ms. Allocated memory is still 202.9 MB. Free memory was 182.6 MB in the beginning and 164.4 MB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. [2020-07-18 00:49:42,306 INFO L168 Benchmark]: TraceAbstraction took 19038.79 ms. Allocated memory was 202.9 MB in the beginning and 332.4 MB in the end (delta: 129.5 MB). Free memory was 163.6 MB in the beginning and 211.8 MB in the end (delta: -48.1 MB). Peak memory consumption was 81.4 MB. Max. memory is 7.1 GB. [2020-07-18 00:49:42,308 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.19 ms. Allocated memory is still 135.3 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 271.22 ms. Allocated memory is still 135.3 MB. Free memory was 100.2 MB in the beginning and 90.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 191.12 ms. Allocated memory was 135.3 MB in the beginning and 202.9 MB in the end (delta: 67.6 MB). Free memory was 90.2 MB in the beginning and 182.6 MB in the end (delta: -92.4 MB). Peak memory consumption was 15.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 324.14 ms. Allocated memory is still 202.9 MB. Free memory was 182.6 MB in the beginning and 164.4 MB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19038.79 ms. Allocated memory was 202.9 MB in the beginning and 332.4 MB in the end (delta: 129.5 MB). Free memory was 163.6 MB in the beginning and 211.8 MB in the end (delta: -48.1 MB). Peak memory consumption was 81.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: 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: 24]: Loop Invariant Derived loop invariant: 4 == k - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 4 == k || i <= 1 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (i <= 0 && j + 100 <= 0) || 4 == k - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 18.5s, OverallIterations: 14, TraceHistogramMax: 9, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 301 SDtfs, 135 SDslu, 1038 SDs, 0 SdLazy, 554 SolverSat, 82 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 290 GetRequests, 163 SyntacticMatches, 12 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 12 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 113 PreInvPairs, 187 NumberOfFragments, 90 HoareAnnotationTreeSize, 113 FomulaSimplifications, 5869 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 29 FomulaSimplificationsInter, 226 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...