/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-lit/cggmp2005b.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 06:38:32,216 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 06:38:32,219 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 06:38:32,237 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 06:38:32,237 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 06:38:32,239 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 06:38:32,241 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 06:38:32,250 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 06:38:32,254 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 06:38:32,256 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 06:38:32,258 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 06:38:32,260 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 06:38:32,260 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 06:38:32,262 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 06:38:32,264 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 06:38:32,265 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 06:38:32,266 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 06:38:32,267 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 06:38:32,268 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 06:38:32,273 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 06:38:32,277 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 06:38:32,280 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 06:38:32,281 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 06:38:32,282 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 06:38:32,284 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 06:38:32,284 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 06:38:32,284 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 06:38:32,287 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 06:38:32,287 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 06:38:32,288 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 06:38:32,288 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 06:38:32,289 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 06:38:32,290 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 06:38:32,291 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 06:38:32,292 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 06:38:32,292 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 06:38:32,292 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 06:38:32,293 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 06:38:32,293 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 06:38:32,294 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 06:38:32,295 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 06:38:32,296 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 06:38:32,313 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 06:38:32,314 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 06:38:32,315 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 06:38:32,315 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 06:38:32,320 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 06:38:32,321 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 06:38:32,321 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 06:38:32,321 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 06:38:32,321 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 06:38:32,321 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 06:38:32,321 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 06:38:32,322 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 06:38:32,322 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 06:38:32,322 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 06:38:32,323 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 06:38:32,324 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 06:38:32,324 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 06:38:32,324 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 06:38:32,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 06:38:32,324 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 06:38:32,325 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 06:38:32,325 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 06:38:32,325 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-18 06:38:32,642 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 06:38:32,655 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 06:38:32,658 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 06:38:32,659 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 06:38:32,660 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 06:38:32,660 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 06:38:32,730 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fba0fa3a/85a7b5a343f041adba7b6e91c8512d3f/FLAG906a1f47f [2020-07-18 06:38:33,156 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 06:38:33,156 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005b.i [2020-07-18 06:38:33,161 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fba0fa3a/85a7b5a343f041adba7b6e91c8512d3f/FLAG906a1f47f [2020-07-18 06:38:33,543 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fba0fa3a/85a7b5a343f041adba7b6e91c8512d3f [2020-07-18 06:38:33,551 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 06:38:33,554 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 06:38:33,555 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 06:38:33,555 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 06:38:33,559 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 06:38:33,560 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 06:38:33" (1/1) ... [2020-07-18 06:38:33,563 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14b18115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:33, skipping insertion in model container [2020-07-18 06:38:33,564 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 06:38:33" (1/1) ... [2020-07-18 06:38:33,571 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 06:38:33,590 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 06:38:33,741 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 06:38:33,746 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 06:38:33,765 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 06:38:33,780 INFO L208 MainTranslator]: Completed translation [2020-07-18 06:38:33,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:33 WrapperNode [2020-07-18 06:38:33,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 06:38:33,782 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 06:38:33,782 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 06:38:33,782 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 06:38:33,796 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:33" (1/1) ... [2020-07-18 06:38:33,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:33" (1/1) ... [2020-07-18 06:38:33,801 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:33" (1/1) ... [2020-07-18 06:38:33,802 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:33" (1/1) ... [2020-07-18 06:38:33,807 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:33" (1/1) ... [2020-07-18 06:38:33,813 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:33" (1/1) ... [2020-07-18 06:38:33,814 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:33" (1/1) ... [2020-07-18 06:38:33,816 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 06:38:33,816 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 06:38:33,816 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 06:38:33,817 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 06:38:33,818 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:33" (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 06:38:33,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 06:38:33,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 06:38:33,976 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-18 06:38:33,977 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 06:38:33,977 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 06:38:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 06:38:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 06:38:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-18 06:38:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 06:38:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 06:38:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 06:38:33,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 06:38:33,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 06:38:34,226 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 06:38:34,227 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-18 06:38:34,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 06:38:34 BoogieIcfgContainer [2020-07-18 06:38:34,233 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 06:38:34,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 06:38:34,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 06:38:34,239 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 06:38:34,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 06:38:33" (1/3) ... [2020-07-18 06:38:34,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e6edad6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 06:38:34, skipping insertion in model container [2020-07-18 06:38:34,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:38:33" (2/3) ... [2020-07-18 06:38:34,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e6edad6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 06:38:34, skipping insertion in model container [2020-07-18 06:38:34,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 06:38:34" (3/3) ... [2020-07-18 06:38:34,243 INFO L109 eAbstractionObserver]: Analyzing ICFG cggmp2005b.i [2020-07-18 06:38:34,255 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 06:38:34,264 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 06:38:34,282 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 06:38:34,307 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 06:38:34,308 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 06:38:34,308 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-18 06:38:34,308 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 06:38:34,308 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 06:38:34,308 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 06:38:34,309 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 06:38:34,309 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 06:38:34,326 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2020-07-18 06:38:34,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-18 06:38:34,356 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:38:34,358 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:38:34,358 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:38:34,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:38:34,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1930258608, now seen corresponding path program 1 times [2020-07-18 06:38:34,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:38:34,386 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1034723979] [2020-07-18 06:38:34,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:38:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:34,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:34,513 INFO L280 TraceCheckUtils]: 0: Hoare triple {32#true} assume true; {32#true} is VALID [2020-07-18 06:38:34,514 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {32#true} {32#true} #74#return; {32#true} is VALID [2020-07-18 06:38:34,516 INFO L263 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2020-07-18 06:38:34,516 INFO L280 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2020-07-18 06:38:34,517 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #74#return; {32#true} is VALID [2020-07-18 06:38:34,517 INFO L263 TraceCheckUtils]: 3: Hoare triple {32#true} call #t~ret0 := main(); {32#true} is VALID [2020-07-18 06:38:34,517 INFO L280 TraceCheckUtils]: 4: Hoare triple {32#true} havoc ~i~0; {32#true} is VALID [2020-07-18 06:38:34,518 INFO L280 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~j~0; {32#true} is VALID [2020-07-18 06:38:34,518 INFO L280 TraceCheckUtils]: 6: Hoare triple {32#true} havoc ~k~0; {32#true} is VALID [2020-07-18 06:38:34,519 INFO L280 TraceCheckUtils]: 7: Hoare triple {32#true} ~i~0 := 0; {32#true} is VALID [2020-07-18 06:38:34,519 INFO L280 TraceCheckUtils]: 8: Hoare triple {32#true} ~k~0 := 9; {32#true} is VALID [2020-07-18 06:38:34,519 INFO L280 TraceCheckUtils]: 9: Hoare triple {32#true} ~j~0 := -100; {32#true} is VALID [2020-07-18 06:38:34,521 INFO L280 TraceCheckUtils]: 10: Hoare triple {32#true} assume !true; {33#false} is VALID [2020-07-18 06:38:34,521 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 06:38:34,522 INFO L280 TraceCheckUtils]: 12: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2020-07-18 06:38:34,522 INFO L280 TraceCheckUtils]: 13: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2020-07-18 06:38:34,523 INFO L280 TraceCheckUtils]: 14: Hoare triple {33#false} assume !false; {33#false} is VALID [2020-07-18 06:38:34,524 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 06:38:34,525 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1034723979] [2020-07-18 06:38:34,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 06:38:34,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-18 06:38:34,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131534289] [2020-07-18 06:38:34,539 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2020-07-18 06:38:34,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:38:34,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-18 06:38:34,594 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 06:38:34,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-18 06:38:34,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:38:34,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-18 06:38:34,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-18 06:38:34,610 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2020-07-18 06:38:34,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:34,706 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2020-07-18 06:38:34,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-18 06:38:34,706 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2020-07-18 06:38:34,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:38:34,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-18 06:38:34,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 61 transitions. [2020-07-18 06:38:34,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-18 06:38:34,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 61 transitions. [2020-07-18 06:38:34,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 61 transitions. [2020-07-18 06:38:34,824 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 06:38:34,836 INFO L225 Difference]: With dead ends: 48 [2020-07-18 06:38:34,836 INFO L226 Difference]: Without dead ends: 22 [2020-07-18 06:38:34,840 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 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 06:38:34,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-18 06:38:34,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-18 06:38:34,893 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:38:34,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2020-07-18 06:38:34,894 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-18 06:38:34,894 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-18 06:38:34,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:34,899 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2020-07-18 06:38:34,899 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2020-07-18 06:38:34,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:34,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:34,900 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-18 06:38:34,900 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-18 06:38:34,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:34,905 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2020-07-18 06:38:34,905 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2020-07-18 06:38:34,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:34,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:34,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:38:34,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:38:34,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-18 06:38:34,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2020-07-18 06:38:34,911 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2020-07-18 06:38:34,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:38:34,912 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-07-18 06:38:34,912 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-18 06:38:34,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 24 transitions. [2020-07-18 06:38:34,945 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 06:38:34,946 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2020-07-18 06:38:34,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-18 06:38:34,947 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:38:34,947 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:38:34,947 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 06:38:34,948 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:38:34,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:38:34,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1900705936, now seen corresponding path program 1 times [2020-07-18 06:38:34,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:38:34,949 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1324107912] [2020-07-18 06:38:34,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:38:34,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:35,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:35,008 INFO L280 TraceCheckUtils]: 0: Hoare triple {222#true} assume true; {222#true} is VALID [2020-07-18 06:38:35,009 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {222#true} {222#true} #74#return; {222#true} is VALID [2020-07-18 06:38:35,009 INFO L263 TraceCheckUtils]: 0: Hoare triple {222#true} call ULTIMATE.init(); {222#true} is VALID [2020-07-18 06:38:35,009 INFO L280 TraceCheckUtils]: 1: Hoare triple {222#true} assume true; {222#true} is VALID [2020-07-18 06:38:35,010 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {222#true} {222#true} #74#return; {222#true} is VALID [2020-07-18 06:38:35,010 INFO L263 TraceCheckUtils]: 3: Hoare triple {222#true} call #t~ret0 := main(); {222#true} is VALID [2020-07-18 06:38:35,011 INFO L280 TraceCheckUtils]: 4: Hoare triple {222#true} havoc ~i~0; {222#true} is VALID [2020-07-18 06:38:35,011 INFO L280 TraceCheckUtils]: 5: Hoare triple {222#true} havoc ~j~0; {222#true} is VALID [2020-07-18 06:38:35,011 INFO L280 TraceCheckUtils]: 6: Hoare triple {222#true} havoc ~k~0; {222#true} is VALID [2020-07-18 06:38:35,013 INFO L280 TraceCheckUtils]: 7: Hoare triple {222#true} ~i~0 := 0; {226#(<= main_~i~0 0)} is VALID [2020-07-18 06:38:35,014 INFO L280 TraceCheckUtils]: 8: Hoare triple {226#(<= main_~i~0 0)} ~k~0 := 9; {226#(<= main_~i~0 0)} is VALID [2020-07-18 06:38:35,014 INFO L280 TraceCheckUtils]: 9: Hoare triple {226#(<= main_~i~0 0)} ~j~0 := -100; {226#(<= main_~i~0 0)} is VALID [2020-07-18 06:38:35,016 INFO L280 TraceCheckUtils]: 10: Hoare triple {226#(<= main_~i~0 0)} assume !(~i~0 <= 100); {223#false} is VALID [2020-07-18 06:38:35,016 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 06:38:35,016 INFO L280 TraceCheckUtils]: 12: Hoare triple {223#false} ~cond := #in~cond; {223#false} is VALID [2020-07-18 06:38:35,017 INFO L280 TraceCheckUtils]: 13: Hoare triple {223#false} assume 0 == ~cond; {223#false} is VALID [2020-07-18 06:38:35,017 INFO L280 TraceCheckUtils]: 14: Hoare triple {223#false} assume !false; {223#false} is VALID [2020-07-18 06:38:35,019 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 06:38:35,019 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1324107912] [2020-07-18 06:38:35,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 06:38:35,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 06:38:35,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810809187] [2020-07-18 06:38:35,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-18 06:38:35,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:38:35,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 06:38:35,045 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 06:38:35,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 06:38:35,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:38:35,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 06:38:35,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 06:38:35,047 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2020-07-18 06:38:35,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:35,124 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-18 06:38:35,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 06:38:35,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-18 06:38:35,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:38:35,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 06:38:35,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2020-07-18 06:38:35,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 06:38:35,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2020-07-18 06:38:35,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 31 transitions. [2020-07-18 06:38:35,189 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 06:38:35,191 INFO L225 Difference]: With dead ends: 29 [2020-07-18 06:38:35,191 INFO L226 Difference]: Without dead ends: 24 [2020-07-18 06:38:35,193 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 06:38:35,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-18 06:38:35,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2020-07-18 06:38:35,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:38:35,212 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2020-07-18 06:38:35,212 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2020-07-18 06:38:35,212 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2020-07-18 06:38:35,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:35,215 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-18 06:38:35,215 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-18 06:38:35,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:35,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:35,216 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2020-07-18 06:38:35,216 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2020-07-18 06:38:35,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:35,218 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-18 06:38:35,219 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-18 06:38:35,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:35,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:35,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:38:35,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:38:35,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-18 06:38:35,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2020-07-18 06:38:35,222 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2020-07-18 06:38:35,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:38:35,222 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2020-07-18 06:38:35,222 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 06:38:35,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 25 transitions. [2020-07-18 06:38:35,257 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 06:38:35,257 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-18 06:38:35,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-18 06:38:35,258 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:38:35,258 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 06:38:35,259 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 06:38:35,259 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:38:35,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:38:35,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1024587775, now seen corresponding path program 1 times [2020-07-18 06:38:35,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:38:35,260 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1085044378] [2020-07-18 06:38:35,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:38:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:35,312 INFO L280 TraceCheckUtils]: 0: Hoare triple {381#true} assume true; {381#true} is VALID [2020-07-18 06:38:35,313 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {381#true} {381#true} #74#return; {381#true} is VALID [2020-07-18 06:38:35,313 INFO L263 TraceCheckUtils]: 0: Hoare triple {381#true} call ULTIMATE.init(); {381#true} is VALID [2020-07-18 06:38:35,313 INFO L280 TraceCheckUtils]: 1: Hoare triple {381#true} assume true; {381#true} is VALID [2020-07-18 06:38:35,314 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {381#true} {381#true} #74#return; {381#true} is VALID [2020-07-18 06:38:35,314 INFO L263 TraceCheckUtils]: 3: Hoare triple {381#true} call #t~ret0 := main(); {381#true} is VALID [2020-07-18 06:38:35,314 INFO L280 TraceCheckUtils]: 4: Hoare triple {381#true} havoc ~i~0; {381#true} is VALID [2020-07-18 06:38:35,315 INFO L280 TraceCheckUtils]: 5: Hoare triple {381#true} havoc ~j~0; {381#true} is VALID [2020-07-18 06:38:35,315 INFO L280 TraceCheckUtils]: 6: Hoare triple {381#true} havoc ~k~0; {381#true} is VALID [2020-07-18 06:38:35,315 INFO L280 TraceCheckUtils]: 7: Hoare triple {381#true} ~i~0 := 0; {381#true} is VALID [2020-07-18 06:38:35,316 INFO L280 TraceCheckUtils]: 8: Hoare triple {381#true} ~k~0 := 9; {381#true} is VALID [2020-07-18 06:38:35,318 INFO L280 TraceCheckUtils]: 9: Hoare triple {381#true} ~j~0 := -100; {385#(<= (+ main_~j~0 100) 0)} is VALID [2020-07-18 06:38:35,320 INFO L280 TraceCheckUtils]: 10: Hoare triple {385#(<= (+ main_~j~0 100) 0)} assume !!(~i~0 <= 100); {385#(<= (+ main_~j~0 100) 0)} is VALID [2020-07-18 06:38:35,321 INFO L280 TraceCheckUtils]: 11: Hoare triple {385#(<= (+ main_~j~0 100) 0)} ~i~0 := 1 + ~i~0; {385#(<= (+ main_~j~0 100) 0)} is VALID [2020-07-18 06:38:35,322 INFO L280 TraceCheckUtils]: 12: Hoare triple {385#(<= (+ main_~j~0 100) 0)} assume !(~j~0 < 20); {382#false} is VALID [2020-07-18 06:38:35,322 INFO L280 TraceCheckUtils]: 13: Hoare triple {382#false} ~k~0 := 4; {382#false} is VALID [2020-07-18 06:38:35,323 INFO L280 TraceCheckUtils]: 14: Hoare triple {382#false} assume !(~k~0 <= 3); {382#false} is VALID [2020-07-18 06:38:35,323 INFO L280 TraceCheckUtils]: 15: Hoare triple {382#false} assume !(~i~0 <= 100); {382#false} is VALID [2020-07-18 06:38:35,323 INFO L263 TraceCheckUtils]: 16: Hoare triple {382#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {382#false} is VALID [2020-07-18 06:38:35,324 INFO L280 TraceCheckUtils]: 17: Hoare triple {382#false} ~cond := #in~cond; {382#false} is VALID [2020-07-18 06:38:35,324 INFO L280 TraceCheckUtils]: 18: Hoare triple {382#false} assume 0 == ~cond; {382#false} is VALID [2020-07-18 06:38:35,327 INFO L280 TraceCheckUtils]: 19: Hoare triple {382#false} assume !false; {382#false} is VALID [2020-07-18 06:38:35,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:38:35,330 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1085044378] [2020-07-18 06:38:35,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 06:38:35,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 06:38:35,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67633581] [2020-07-18 06:38:35,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-18 06:38:35,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:38:35,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 06:38:35,361 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 06:38:35,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 06:38:35,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:38:35,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 06:38:35,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 06:38:35,362 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 3 states. [2020-07-18 06:38:35,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:35,458 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2020-07-18 06:38:35,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 06:38:35,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-18 06:38:35,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:38:35,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 06:38:35,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2020-07-18 06:38:35,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 06:38:35,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2020-07-18 06:38:35,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 43 transitions. [2020-07-18 06:38:35,519 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 06:38:35,521 INFO L225 Difference]: With dead ends: 38 [2020-07-18 06:38:35,521 INFO L226 Difference]: Without dead ends: 26 [2020-07-18 06:38:35,522 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 06:38:35,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-18 06:38:35,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-07-18 06:38:35,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:38:35,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 25 states. [2020-07-18 06:38:35,542 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 25 states. [2020-07-18 06:38:35,543 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 25 states. [2020-07-18 06:38:35,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:35,545 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-18 06:38:35,545 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-18 06:38:35,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:35,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:35,546 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 26 states. [2020-07-18 06:38:35,546 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 26 states. [2020-07-18 06:38:35,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:35,548 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-18 06:38:35,548 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-18 06:38:35,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:35,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:35,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:38:35,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:38:35,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-18 06:38:35,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2020-07-18 06:38:35,551 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 20 [2020-07-18 06:38:35,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:38:35,552 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-07-18 06:38:35,552 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 06:38:35,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2020-07-18 06:38:35,586 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 06:38:35,586 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-18 06:38:35,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-18 06:38:35,587 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:38:35,587 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 06:38:35,588 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 06:38:35,588 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:38:35,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:38:35,588 INFO L82 PathProgramCache]: Analyzing trace with hash 2065885280, now seen corresponding path program 1 times [2020-07-18 06:38:35,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:38:35,589 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [591873] [2020-07-18 06:38:35,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:38:35,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:35,647 INFO L280 TraceCheckUtils]: 0: Hoare triple {566#true} assume true; {566#true} is VALID [2020-07-18 06:38:35,648 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {566#true} {566#true} #74#return; {566#true} is VALID [2020-07-18 06:38:35,648 INFO L263 TraceCheckUtils]: 0: Hoare triple {566#true} call ULTIMATE.init(); {566#true} is VALID [2020-07-18 06:38:35,648 INFO L280 TraceCheckUtils]: 1: Hoare triple {566#true} assume true; {566#true} is VALID [2020-07-18 06:38:35,649 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {566#true} {566#true} #74#return; {566#true} is VALID [2020-07-18 06:38:35,649 INFO L263 TraceCheckUtils]: 3: Hoare triple {566#true} call #t~ret0 := main(); {566#true} is VALID [2020-07-18 06:38:35,651 INFO L280 TraceCheckUtils]: 4: Hoare triple {566#true} havoc ~i~0; {566#true} is VALID [2020-07-18 06:38:35,651 INFO L280 TraceCheckUtils]: 5: Hoare triple {566#true} havoc ~j~0; {566#true} is VALID [2020-07-18 06:38:35,651 INFO L280 TraceCheckUtils]: 6: Hoare triple {566#true} havoc ~k~0; {566#true} is VALID [2020-07-18 06:38:35,653 INFO L280 TraceCheckUtils]: 7: Hoare triple {566#true} ~i~0 := 0; {570#(<= main_~i~0 0)} is VALID [2020-07-18 06:38:35,653 INFO L280 TraceCheckUtils]: 8: Hoare triple {570#(<= main_~i~0 0)} ~k~0 := 9; {570#(<= main_~i~0 0)} is VALID [2020-07-18 06:38:35,654 INFO L280 TraceCheckUtils]: 9: Hoare triple {570#(<= main_~i~0 0)} ~j~0 := -100; {570#(<= main_~i~0 0)} is VALID [2020-07-18 06:38:35,655 INFO L280 TraceCheckUtils]: 10: Hoare triple {570#(<= main_~i~0 0)} assume !!(~i~0 <= 100); {570#(<= main_~i~0 0)} is VALID [2020-07-18 06:38:35,656 INFO L280 TraceCheckUtils]: 11: Hoare triple {570#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {571#(<= main_~i~0 1)} is VALID [2020-07-18 06:38:35,657 INFO L280 TraceCheckUtils]: 12: Hoare triple {571#(<= main_~i~0 1)} assume !!(~j~0 < 20); {571#(<= main_~i~0 1)} is VALID [2020-07-18 06:38:35,657 INFO L280 TraceCheckUtils]: 13: Hoare triple {571#(<= main_~i~0 1)} ~j~0 := ~i~0 + ~j~0; {571#(<= main_~i~0 1)} is VALID [2020-07-18 06:38:35,659 INFO L280 TraceCheckUtils]: 14: Hoare triple {571#(<= main_~i~0 1)} assume !(~j~0 < 20); {571#(<= main_~i~0 1)} is VALID [2020-07-18 06:38:35,660 INFO L280 TraceCheckUtils]: 15: Hoare triple {571#(<= main_~i~0 1)} ~k~0 := 4; {571#(<= main_~i~0 1)} is VALID [2020-07-18 06:38:35,660 INFO L280 TraceCheckUtils]: 16: Hoare triple {571#(<= main_~i~0 1)} assume !(~k~0 <= 3); {571#(<= main_~i~0 1)} is VALID [2020-07-18 06:38:35,662 INFO L280 TraceCheckUtils]: 17: Hoare triple {571#(<= main_~i~0 1)} assume !(~i~0 <= 100); {567#false} is VALID [2020-07-18 06:38:35,662 INFO L263 TraceCheckUtils]: 18: Hoare triple {567#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {567#false} is VALID [2020-07-18 06:38:35,662 INFO L280 TraceCheckUtils]: 19: Hoare triple {567#false} ~cond := #in~cond; {567#false} is VALID [2020-07-18 06:38:35,662 INFO L280 TraceCheckUtils]: 20: Hoare triple {567#false} assume 0 == ~cond; {567#false} is VALID [2020-07-18 06:38:35,663 INFO L280 TraceCheckUtils]: 21: Hoare triple {567#false} assume !false; {567#false} is VALID [2020-07-18 06:38:35,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-18 06:38:35,664 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [591873] [2020-07-18 06:38:35,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:38:35,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-07-18 06:38:35,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372174767] [2020-07-18 06:38:35,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-18 06:38:35,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:38:35,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 06:38:35,692 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 06:38:35,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 06:38:35,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:38:35,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 06:38:35,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-18 06:38:35,693 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 4 states. [2020-07-18 06:38:35,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:35,800 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2020-07-18 06:38:35,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 06:38:35,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-18 06:38:35,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:38:35,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 06:38:35,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2020-07-18 06:38:35,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 06:38:35,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2020-07-18 06:38:35,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 40 transitions. [2020-07-18 06:38:35,853 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 06:38:35,855 INFO L225 Difference]: With dead ends: 37 [2020-07-18 06:38:35,855 INFO L226 Difference]: Without dead ends: 32 [2020-07-18 06:38:35,856 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 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 06:38:35,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-18 06:38:35,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2020-07-18 06:38:35,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:38:35,894 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2020-07-18 06:38:35,894 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2020-07-18 06:38:35,895 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2020-07-18 06:38:35,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:35,900 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-07-18 06:38:35,901 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-18 06:38:35,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:35,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:35,902 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2020-07-18 06:38:35,902 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2020-07-18 06:38:35,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:35,906 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-07-18 06:38:35,906 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-18 06:38:35,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:35,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:35,909 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:38:35,909 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:38:35,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-18 06:38:35,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2020-07-18 06:38:35,913 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 22 [2020-07-18 06:38:35,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:38:35,914 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-07-18 06:38:35,915 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 06:38:35,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 35 transitions. [2020-07-18 06:38:35,970 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 06:38:35,970 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-18 06:38:35,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-18 06:38:35,973 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:38:35,973 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 06:38:35,974 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 06:38:35,974 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:38:35,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:38:35,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1729554991, now seen corresponding path program 2 times [2020-07-18 06:38:35,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:38:35,975 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [107224279] [2020-07-18 06:38:35,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:38:35,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:36,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:36,055 INFO L280 TraceCheckUtils]: 0: Hoare triple {774#true} assume true; {774#true} is VALID [2020-07-18 06:38:36,055 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {774#true} {774#true} #74#return; {774#true} is VALID [2020-07-18 06:38:36,056 INFO L263 TraceCheckUtils]: 0: Hoare triple {774#true} call ULTIMATE.init(); {774#true} is VALID [2020-07-18 06:38:36,056 INFO L280 TraceCheckUtils]: 1: Hoare triple {774#true} assume true; {774#true} is VALID [2020-07-18 06:38:36,056 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {774#true} {774#true} #74#return; {774#true} is VALID [2020-07-18 06:38:36,057 INFO L263 TraceCheckUtils]: 3: Hoare triple {774#true} call #t~ret0 := main(); {774#true} is VALID [2020-07-18 06:38:36,057 INFO L280 TraceCheckUtils]: 4: Hoare triple {774#true} havoc ~i~0; {774#true} is VALID [2020-07-18 06:38:36,057 INFO L280 TraceCheckUtils]: 5: Hoare triple {774#true} havoc ~j~0; {774#true} is VALID [2020-07-18 06:38:36,058 INFO L280 TraceCheckUtils]: 6: Hoare triple {774#true} havoc ~k~0; {774#true} is VALID [2020-07-18 06:38:36,058 INFO L280 TraceCheckUtils]: 7: Hoare triple {774#true} ~i~0 := 0; {774#true} is VALID [2020-07-18 06:38:36,058 INFO L280 TraceCheckUtils]: 8: Hoare triple {774#true} ~k~0 := 9; {774#true} is VALID [2020-07-18 06:38:36,059 INFO L280 TraceCheckUtils]: 9: Hoare triple {774#true} ~j~0 := -100; {778#(<= (+ main_~j~0 100) 0)} is VALID [2020-07-18 06:38:36,060 INFO L280 TraceCheckUtils]: 10: Hoare triple {778#(<= (+ main_~j~0 100) 0)} assume !!(~i~0 <= 100); {778#(<= (+ main_~j~0 100) 0)} is VALID [2020-07-18 06:38:36,061 INFO L280 TraceCheckUtils]: 11: Hoare triple {778#(<= (+ main_~j~0 100) 0)} ~i~0 := 1 + ~i~0; {778#(<= (+ main_~j~0 100) 0)} is VALID [2020-07-18 06:38:36,062 INFO L280 TraceCheckUtils]: 12: Hoare triple {778#(<= (+ main_~j~0 100) 0)} assume !!(~j~0 < 20); {778#(<= (+ main_~j~0 100) 0)} is VALID [2020-07-18 06:38:36,063 INFO L280 TraceCheckUtils]: 13: Hoare triple {778#(<= (+ main_~j~0 100) 0)} ~j~0 := ~i~0 + ~j~0; {779#(<= (+ main_~j~0 100) main_~i~0)} is VALID [2020-07-18 06:38:36,064 INFO L280 TraceCheckUtils]: 14: Hoare triple {779#(<= (+ main_~j~0 100) main_~i~0)} assume !(~j~0 < 20); {780#(<= 120 main_~i~0)} is VALID [2020-07-18 06:38:36,065 INFO L280 TraceCheckUtils]: 15: Hoare triple {780#(<= 120 main_~i~0)} ~k~0 := 4; {780#(<= 120 main_~i~0)} is VALID [2020-07-18 06:38:36,066 INFO L280 TraceCheckUtils]: 16: Hoare triple {780#(<= 120 main_~i~0)} assume !(~k~0 <= 3); {780#(<= 120 main_~i~0)} is VALID [2020-07-18 06:38:36,067 INFO L280 TraceCheckUtils]: 17: Hoare triple {780#(<= 120 main_~i~0)} assume !!(~i~0 <= 100); {775#false} is VALID [2020-07-18 06:38:36,067 INFO L280 TraceCheckUtils]: 18: Hoare triple {775#false} ~i~0 := 1 + ~i~0; {775#false} is VALID [2020-07-18 06:38:36,068 INFO L280 TraceCheckUtils]: 19: Hoare triple {775#false} assume !(~j~0 < 20); {775#false} is VALID [2020-07-18 06:38:36,068 INFO L280 TraceCheckUtils]: 20: Hoare triple {775#false} ~k~0 := 4; {775#false} is VALID [2020-07-18 06:38:36,068 INFO L280 TraceCheckUtils]: 21: Hoare triple {775#false} assume !(~k~0 <= 3); {775#false} is VALID [2020-07-18 06:38:36,069 INFO L280 TraceCheckUtils]: 22: Hoare triple {775#false} assume !(~i~0 <= 100); {775#false} is VALID [2020-07-18 06:38:36,069 INFO L263 TraceCheckUtils]: 23: Hoare triple {775#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {775#false} is VALID [2020-07-18 06:38:36,069 INFO L280 TraceCheckUtils]: 24: Hoare triple {775#false} ~cond := #in~cond; {775#false} is VALID [2020-07-18 06:38:36,070 INFO L280 TraceCheckUtils]: 25: Hoare triple {775#false} assume 0 == ~cond; {775#false} is VALID [2020-07-18 06:38:36,070 INFO L280 TraceCheckUtils]: 26: Hoare triple {775#false} assume !false; {775#false} is VALID [2020-07-18 06:38:36,072 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:38:36,072 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [107224279] [2020-07-18 06:38:36,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:38:36,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-07-18 06:38:36,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784244231] [2020-07-18 06:38:36,074 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-18 06:38:36,074 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:38:36,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 06:38:36,110 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 06:38:36,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 06:38:36,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:38:36,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 06:38:36,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 06:38:36,111 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 5 states. [2020-07-18 06:38:36,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:36,294 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-07-18 06:38:36,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 06:38:36,294 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-18 06:38:36,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:38:36,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 06:38:36,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2020-07-18 06:38:36,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 06:38:36,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2020-07-18 06:38:36,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2020-07-18 06:38:36,350 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 06:38:36,351 INFO L225 Difference]: With dead ends: 50 [2020-07-18 06:38:36,352 INFO L226 Difference]: Without dead ends: 34 [2020-07-18 06:38:36,352 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 06:38:36,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-18 06:38:36,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2020-07-18 06:38:36,380 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:38:36,380 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2020-07-18 06:38:36,380 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2020-07-18 06:38:36,380 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2020-07-18 06:38:36,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:36,383 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2020-07-18 06:38:36,383 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2020-07-18 06:38:36,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:36,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:36,384 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2020-07-18 06:38:36,384 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2020-07-18 06:38:36,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:36,386 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2020-07-18 06:38:36,386 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2020-07-18 06:38:36,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:36,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:36,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:38:36,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:38:36,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-18 06:38:36,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2020-07-18 06:38:36,389 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 27 [2020-07-18 06:38:36,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:38:36,389 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2020-07-18 06:38:36,390 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 06:38:36,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 37 transitions. [2020-07-18 06:38:36,429 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 06:38:36,429 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-18 06:38:36,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-18 06:38:36,430 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:38:36,431 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 06:38:36,431 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 06:38:36,431 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:38:36,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:38:36,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1385563474, now seen corresponding path program 3 times [2020-07-18 06:38:36,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:38:36,432 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1673815092] [2020-07-18 06:38:36,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:38:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:36,515 INFO L280 TraceCheckUtils]: 0: Hoare triple {1019#true} assume true; {1019#true} is VALID [2020-07-18 06:38:36,515 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1019#true} {1019#true} #74#return; {1019#true} is VALID [2020-07-18 06:38:36,515 INFO L263 TraceCheckUtils]: 0: Hoare triple {1019#true} call ULTIMATE.init(); {1019#true} is VALID [2020-07-18 06:38:36,516 INFO L280 TraceCheckUtils]: 1: Hoare triple {1019#true} assume true; {1019#true} is VALID [2020-07-18 06:38:36,516 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1019#true} {1019#true} #74#return; {1019#true} is VALID [2020-07-18 06:38:36,516 INFO L263 TraceCheckUtils]: 3: Hoare triple {1019#true} call #t~ret0 := main(); {1019#true} is VALID [2020-07-18 06:38:36,516 INFO L280 TraceCheckUtils]: 4: Hoare triple {1019#true} havoc ~i~0; {1019#true} is VALID [2020-07-18 06:38:36,517 INFO L280 TraceCheckUtils]: 5: Hoare triple {1019#true} havoc ~j~0; {1019#true} is VALID [2020-07-18 06:38:36,517 INFO L280 TraceCheckUtils]: 6: Hoare triple {1019#true} havoc ~k~0; {1019#true} is VALID [2020-07-18 06:38:36,518 INFO L280 TraceCheckUtils]: 7: Hoare triple {1019#true} ~i~0 := 0; {1023#(<= main_~i~0 0)} is VALID [2020-07-18 06:38:36,518 INFO L280 TraceCheckUtils]: 8: Hoare triple {1023#(<= main_~i~0 0)} ~k~0 := 9; {1023#(<= main_~i~0 0)} is VALID [2020-07-18 06:38:36,519 INFO L280 TraceCheckUtils]: 9: Hoare triple {1023#(<= main_~i~0 0)} ~j~0 := -100; {1024#(<= (+ (* 2 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-18 06:38:36,520 INFO L280 TraceCheckUtils]: 10: Hoare triple {1024#(<= (+ (* 2 main_~i~0) main_~j~0 100) 0)} assume !!(~i~0 <= 100); {1024#(<= (+ (* 2 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-18 06:38:36,521 INFO L280 TraceCheckUtils]: 11: Hoare triple {1024#(<= (+ (* 2 main_~i~0) main_~j~0 100) 0)} ~i~0 := 1 + ~i~0; {1025#(<= (+ (* 2 main_~i~0) main_~j~0 98) 0)} is VALID [2020-07-18 06:38:36,521 INFO L280 TraceCheckUtils]: 12: Hoare triple {1025#(<= (+ (* 2 main_~i~0) main_~j~0 98) 0)} assume !!(~j~0 < 20); {1025#(<= (+ (* 2 main_~i~0) main_~j~0 98) 0)} is VALID [2020-07-18 06:38:36,522 INFO L280 TraceCheckUtils]: 13: Hoare triple {1025#(<= (+ (* 2 main_~i~0) main_~j~0 98) 0)} ~j~0 := ~i~0 + ~j~0; {1026#(<= (+ main_~i~0 main_~j~0 98) 0)} is VALID [2020-07-18 06:38:36,523 INFO L280 TraceCheckUtils]: 14: Hoare triple {1026#(<= (+ main_~i~0 main_~j~0 98) 0)} assume !!(~j~0 < 20); {1026#(<= (+ main_~i~0 main_~j~0 98) 0)} is VALID [2020-07-18 06:38:36,524 INFO L280 TraceCheckUtils]: 15: Hoare triple {1026#(<= (+ main_~i~0 main_~j~0 98) 0)} ~j~0 := ~i~0 + ~j~0; {1027#(<= (+ main_~j~0 98) 0)} is VALID [2020-07-18 06:38:36,525 INFO L280 TraceCheckUtils]: 16: Hoare triple {1027#(<= (+ main_~j~0 98) 0)} assume !(~j~0 < 20); {1020#false} is VALID [2020-07-18 06:38:36,525 INFO L280 TraceCheckUtils]: 17: Hoare triple {1020#false} ~k~0 := 4; {1020#false} is VALID [2020-07-18 06:38:36,525 INFO L280 TraceCheckUtils]: 18: Hoare triple {1020#false} assume !(~k~0 <= 3); {1020#false} is VALID [2020-07-18 06:38:36,525 INFO L280 TraceCheckUtils]: 19: Hoare triple {1020#false} assume !!(~i~0 <= 100); {1020#false} is VALID [2020-07-18 06:38:36,526 INFO L280 TraceCheckUtils]: 20: Hoare triple {1020#false} ~i~0 := 1 + ~i~0; {1020#false} is VALID [2020-07-18 06:38:36,526 INFO L280 TraceCheckUtils]: 21: Hoare triple {1020#false} assume !(~j~0 < 20); {1020#false} is VALID [2020-07-18 06:38:36,526 INFO L280 TraceCheckUtils]: 22: Hoare triple {1020#false} ~k~0 := 4; {1020#false} is VALID [2020-07-18 06:38:36,526 INFO L280 TraceCheckUtils]: 23: Hoare triple {1020#false} assume !(~k~0 <= 3); {1020#false} is VALID [2020-07-18 06:38:36,527 INFO L280 TraceCheckUtils]: 24: Hoare triple {1020#false} assume !(~i~0 <= 100); {1020#false} is VALID [2020-07-18 06:38:36,527 INFO L263 TraceCheckUtils]: 25: Hoare triple {1020#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {1020#false} is VALID [2020-07-18 06:38:36,527 INFO L280 TraceCheckUtils]: 26: Hoare triple {1020#false} ~cond := #in~cond; {1020#false} is VALID [2020-07-18 06:38:36,527 INFO L280 TraceCheckUtils]: 27: Hoare triple {1020#false} assume 0 == ~cond; {1020#false} is VALID [2020-07-18 06:38:36,527 INFO L280 TraceCheckUtils]: 28: Hoare triple {1020#false} assume !false; {1020#false} is VALID [2020-07-18 06:38:36,529 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-18 06:38:36,530 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1673815092] [2020-07-18 06:38:36,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:38:36,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-18 06:38:36,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956002291] [2020-07-18 06:38:36,531 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2020-07-18 06:38:36,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:38:36,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-18 06:38:36,564 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 06:38:36,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-18 06:38:36,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:38:36,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-18 06:38:36,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-18 06:38:36,565 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 7 states. [2020-07-18 06:38:36,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:36,811 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2020-07-18 06:38:36,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-18 06:38:36,812 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2020-07-18 06:38:36,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:38:36,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 06:38:36,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2020-07-18 06:38:36,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 06:38:36,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2020-07-18 06:38:36,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2020-07-18 06:38:36,862 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 06:38:36,864 INFO L225 Difference]: With dead ends: 52 [2020-07-18 06:38:36,864 INFO L226 Difference]: Without dead ends: 36 [2020-07-18 06:38:36,865 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 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 06:38:36,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-18 06:38:36,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2020-07-18 06:38:36,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:38:36,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2020-07-18 06:38:36,911 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2020-07-18 06:38:36,911 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2020-07-18 06:38:36,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:36,914 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-07-18 06:38:36,914 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2020-07-18 06:38:36,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:36,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:36,915 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2020-07-18 06:38:36,915 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2020-07-18 06:38:36,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:36,917 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-07-18 06:38:36,917 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2020-07-18 06:38:36,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:36,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:36,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:38:36,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:38:36,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-18 06:38:36,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2020-07-18 06:38:36,920 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 29 [2020-07-18 06:38:36,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:38:36,920 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2020-07-18 06:38:36,920 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-18 06:38:36,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 39 transitions. [2020-07-18 06:38:36,973 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 06:38:36,973 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-18 06:38:36,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-18 06:38:36,974 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:38:36,974 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 06:38:36,975 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 06:38:36,975 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:38:36,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:38:36,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1422203027, now seen corresponding path program 4 times [2020-07-18 06:38:36,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:38:36,978 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [176615215] [2020-07-18 06:38:36,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:38:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:37,110 INFO L280 TraceCheckUtils]: 0: Hoare triple {1282#true} assume true; {1282#true} is VALID [2020-07-18 06:38:37,111 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1282#true} {1282#true} #74#return; {1282#true} is VALID [2020-07-18 06:38:37,111 INFO L263 TraceCheckUtils]: 0: Hoare triple {1282#true} call ULTIMATE.init(); {1282#true} is VALID [2020-07-18 06:38:37,111 INFO L280 TraceCheckUtils]: 1: Hoare triple {1282#true} assume true; {1282#true} is VALID [2020-07-18 06:38:37,112 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1282#true} {1282#true} #74#return; {1282#true} is VALID [2020-07-18 06:38:37,112 INFO L263 TraceCheckUtils]: 3: Hoare triple {1282#true} call #t~ret0 := main(); {1282#true} is VALID [2020-07-18 06:38:37,112 INFO L280 TraceCheckUtils]: 4: Hoare triple {1282#true} havoc ~i~0; {1282#true} is VALID [2020-07-18 06:38:37,112 INFO L280 TraceCheckUtils]: 5: Hoare triple {1282#true} havoc ~j~0; {1282#true} is VALID [2020-07-18 06:38:37,113 INFO L280 TraceCheckUtils]: 6: Hoare triple {1282#true} havoc ~k~0; {1282#true} is VALID [2020-07-18 06:38:37,113 INFO L280 TraceCheckUtils]: 7: Hoare triple {1282#true} ~i~0 := 0; {1286#(<= main_~i~0 0)} is VALID [2020-07-18 06:38:37,114 INFO L280 TraceCheckUtils]: 8: Hoare triple {1286#(<= main_~i~0 0)} ~k~0 := 9; {1286#(<= main_~i~0 0)} is VALID [2020-07-18 06:38:37,115 INFO L280 TraceCheckUtils]: 9: Hoare triple {1286#(<= main_~i~0 0)} ~j~0 := -100; {1287#(<= (+ (* 3 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-18 06:38:37,115 INFO L280 TraceCheckUtils]: 10: Hoare triple {1287#(<= (+ (* 3 main_~i~0) main_~j~0 100) 0)} assume !!(~i~0 <= 100); {1287#(<= (+ (* 3 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-18 06:38:37,116 INFO L280 TraceCheckUtils]: 11: Hoare triple {1287#(<= (+ (* 3 main_~i~0) main_~j~0 100) 0)} ~i~0 := 1 + ~i~0; {1288#(<= (+ (* 3 main_~i~0) main_~j~0 97) 0)} is VALID [2020-07-18 06:38:37,117 INFO L280 TraceCheckUtils]: 12: Hoare triple {1288#(<= (+ (* 3 main_~i~0) main_~j~0 97) 0)} assume !!(~j~0 < 20); {1288#(<= (+ (* 3 main_~i~0) main_~j~0 97) 0)} is VALID [2020-07-18 06:38:37,118 INFO L280 TraceCheckUtils]: 13: Hoare triple {1288#(<= (+ (* 3 main_~i~0) main_~j~0 97) 0)} ~j~0 := ~i~0 + ~j~0; {1289#(<= (+ (* 2 main_~i~0) main_~j~0 97) 0)} is VALID [2020-07-18 06:38:37,118 INFO L280 TraceCheckUtils]: 14: Hoare triple {1289#(<= (+ (* 2 main_~i~0) main_~j~0 97) 0)} assume !!(~j~0 < 20); {1289#(<= (+ (* 2 main_~i~0) main_~j~0 97) 0)} is VALID [2020-07-18 06:38:37,119 INFO L280 TraceCheckUtils]: 15: Hoare triple {1289#(<= (+ (* 2 main_~i~0) main_~j~0 97) 0)} ~j~0 := ~i~0 + ~j~0; {1290#(<= (+ main_~i~0 main_~j~0 97) 0)} is VALID [2020-07-18 06:38:37,120 INFO L280 TraceCheckUtils]: 16: Hoare triple {1290#(<= (+ main_~i~0 main_~j~0 97) 0)} assume !!(~j~0 < 20); {1290#(<= (+ main_~i~0 main_~j~0 97) 0)} is VALID [2020-07-18 06:38:37,121 INFO L280 TraceCheckUtils]: 17: Hoare triple {1290#(<= (+ main_~i~0 main_~j~0 97) 0)} ~j~0 := ~i~0 + ~j~0; {1291#(<= (+ main_~j~0 97) 0)} is VALID [2020-07-18 06:38:37,121 INFO L280 TraceCheckUtils]: 18: Hoare triple {1291#(<= (+ main_~j~0 97) 0)} assume !(~j~0 < 20); {1283#false} is VALID [2020-07-18 06:38:37,122 INFO L280 TraceCheckUtils]: 19: Hoare triple {1283#false} ~k~0 := 4; {1283#false} is VALID [2020-07-18 06:38:37,122 INFO L280 TraceCheckUtils]: 20: Hoare triple {1283#false} assume !(~k~0 <= 3); {1283#false} is VALID [2020-07-18 06:38:37,122 INFO L280 TraceCheckUtils]: 21: Hoare triple {1283#false} assume !!(~i~0 <= 100); {1283#false} is VALID [2020-07-18 06:38:37,122 INFO L280 TraceCheckUtils]: 22: Hoare triple {1283#false} ~i~0 := 1 + ~i~0; {1283#false} is VALID [2020-07-18 06:38:37,122 INFO L280 TraceCheckUtils]: 23: Hoare triple {1283#false} assume !(~j~0 < 20); {1283#false} is VALID [2020-07-18 06:38:37,123 INFO L280 TraceCheckUtils]: 24: Hoare triple {1283#false} ~k~0 := 4; {1283#false} is VALID [2020-07-18 06:38:37,123 INFO L280 TraceCheckUtils]: 25: Hoare triple {1283#false} assume !(~k~0 <= 3); {1283#false} is VALID [2020-07-18 06:38:37,123 INFO L280 TraceCheckUtils]: 26: Hoare triple {1283#false} assume !(~i~0 <= 100); {1283#false} is VALID [2020-07-18 06:38:37,123 INFO L263 TraceCheckUtils]: 27: Hoare triple {1283#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {1283#false} is VALID [2020-07-18 06:38:37,124 INFO L280 TraceCheckUtils]: 28: Hoare triple {1283#false} ~cond := #in~cond; {1283#false} is VALID [2020-07-18 06:38:37,124 INFO L280 TraceCheckUtils]: 29: Hoare triple {1283#false} assume 0 == ~cond; {1283#false} is VALID [2020-07-18 06:38:37,124 INFO L280 TraceCheckUtils]: 30: Hoare triple {1283#false} assume !false; {1283#false} is VALID [2020-07-18 06:38:37,126 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-18 06:38:37,127 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [176615215] [2020-07-18 06:38:37,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:38:37,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-18 06:38:37,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045179438] [2020-07-18 06:38:37,129 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2020-07-18 06:38:37,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:38:37,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-18 06:38:37,163 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 06:38:37,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-18 06:38:37,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:38:37,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-18 06:38:37,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-18 06:38:37,165 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 8 states. [2020-07-18 06:38:37,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:37,494 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2020-07-18 06:38:37,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-18 06:38:37,494 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2020-07-18 06:38:37,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:38:37,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 06:38:37,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2020-07-18 06:38:37,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 06:38:37,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2020-07-18 06:38:37,498 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 49 transitions. [2020-07-18 06:38:37,550 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 06:38:37,552 INFO L225 Difference]: With dead ends: 54 [2020-07-18 06:38:37,552 INFO L226 Difference]: Without dead ends: 38 [2020-07-18 06:38:37,553 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 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 06:38:37,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-18 06:38:37,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2020-07-18 06:38:37,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:38:37,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 37 states. [2020-07-18 06:38:37,611 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 37 states. [2020-07-18 06:38:37,612 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 37 states. [2020-07-18 06:38:37,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:37,614 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2020-07-18 06:38:37,614 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-07-18 06:38:37,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:37,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:37,615 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 38 states. [2020-07-18 06:38:37,615 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 38 states. [2020-07-18 06:38:37,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:37,617 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2020-07-18 06:38:37,617 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-07-18 06:38:37,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:37,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:37,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:38:37,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:38:37,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-18 06:38:37,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-07-18 06:38:37,620 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 31 [2020-07-18 06:38:37,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:38:37,621 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-07-18 06:38:37,621 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-18 06:38:37,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 41 transitions. [2020-07-18 06:38:37,669 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 06:38:37,669 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-07-18 06:38:37,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-18 06:38:37,670 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:38:37,670 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 06:38:37,671 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-18 06:38:37,671 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:38:37,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:38:37,671 INFO L82 PathProgramCache]: Analyzing trace with hash 2021892204, now seen corresponding path program 5 times [2020-07-18 06:38:37,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:38:37,672 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [275209648] [2020-07-18 06:38:37,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:38:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:37,770 INFO L280 TraceCheckUtils]: 0: Hoare triple {1560#true} assume true; {1560#true} is VALID [2020-07-18 06:38:37,770 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1560#true} {1560#true} #74#return; {1560#true} is VALID [2020-07-18 06:38:37,780 INFO L263 TraceCheckUtils]: 0: Hoare triple {1560#true} call ULTIMATE.init(); {1560#true} is VALID [2020-07-18 06:38:37,781 INFO L280 TraceCheckUtils]: 1: Hoare triple {1560#true} assume true; {1560#true} is VALID [2020-07-18 06:38:37,782 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1560#true} {1560#true} #74#return; {1560#true} is VALID [2020-07-18 06:38:37,782 INFO L263 TraceCheckUtils]: 3: Hoare triple {1560#true} call #t~ret0 := main(); {1560#true} is VALID [2020-07-18 06:38:37,782 INFO L280 TraceCheckUtils]: 4: Hoare triple {1560#true} havoc ~i~0; {1560#true} is VALID [2020-07-18 06:38:37,782 INFO L280 TraceCheckUtils]: 5: Hoare triple {1560#true} havoc ~j~0; {1560#true} is VALID [2020-07-18 06:38:37,782 INFO L280 TraceCheckUtils]: 6: Hoare triple {1560#true} havoc ~k~0; {1560#true} is VALID [2020-07-18 06:38:37,783 INFO L280 TraceCheckUtils]: 7: Hoare triple {1560#true} ~i~0 := 0; {1564#(<= main_~i~0 0)} is VALID [2020-07-18 06:38:37,784 INFO L280 TraceCheckUtils]: 8: Hoare triple {1564#(<= main_~i~0 0)} ~k~0 := 9; {1564#(<= main_~i~0 0)} is VALID [2020-07-18 06:38:37,785 INFO L280 TraceCheckUtils]: 9: Hoare triple {1564#(<= main_~i~0 0)} ~j~0 := -100; {1565#(<= (+ (* 4 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-18 06:38:37,785 INFO L280 TraceCheckUtils]: 10: Hoare triple {1565#(<= (+ (* 4 main_~i~0) main_~j~0 100) 0)} assume !!(~i~0 <= 100); {1565#(<= (+ (* 4 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-18 06:38:37,786 INFO L280 TraceCheckUtils]: 11: Hoare triple {1565#(<= (+ (* 4 main_~i~0) main_~j~0 100) 0)} ~i~0 := 1 + ~i~0; {1566#(<= (+ (* 4 main_~i~0) main_~j~0 96) 0)} is VALID [2020-07-18 06:38:37,787 INFO L280 TraceCheckUtils]: 12: Hoare triple {1566#(<= (+ (* 4 main_~i~0) main_~j~0 96) 0)} assume !!(~j~0 < 20); {1566#(<= (+ (* 4 main_~i~0) main_~j~0 96) 0)} is VALID [2020-07-18 06:38:37,788 INFO L280 TraceCheckUtils]: 13: Hoare triple {1566#(<= (+ (* 4 main_~i~0) main_~j~0 96) 0)} ~j~0 := ~i~0 + ~j~0; {1567#(<= (+ (* 3 main_~i~0) main_~j~0 96) 0)} is VALID [2020-07-18 06:38:37,789 INFO L280 TraceCheckUtils]: 14: Hoare triple {1567#(<= (+ (* 3 main_~i~0) main_~j~0 96) 0)} assume !!(~j~0 < 20); {1567#(<= (+ (* 3 main_~i~0) main_~j~0 96) 0)} is VALID [2020-07-18 06:38:37,791 INFO L280 TraceCheckUtils]: 15: Hoare triple {1567#(<= (+ (* 3 main_~i~0) main_~j~0 96) 0)} ~j~0 := ~i~0 + ~j~0; {1568#(<= (+ (* 2 main_~i~0) main_~j~0 96) 0)} is VALID [2020-07-18 06:38:37,791 INFO L280 TraceCheckUtils]: 16: Hoare triple {1568#(<= (+ (* 2 main_~i~0) main_~j~0 96) 0)} assume !!(~j~0 < 20); {1568#(<= (+ (* 2 main_~i~0) main_~j~0 96) 0)} is VALID [2020-07-18 06:38:37,794 INFO L280 TraceCheckUtils]: 17: Hoare triple {1568#(<= (+ (* 2 main_~i~0) main_~j~0 96) 0)} ~j~0 := ~i~0 + ~j~0; {1569#(<= (+ main_~i~0 main_~j~0 96) 0)} is VALID [2020-07-18 06:38:37,798 INFO L280 TraceCheckUtils]: 18: Hoare triple {1569#(<= (+ main_~i~0 main_~j~0 96) 0)} assume !!(~j~0 < 20); {1569#(<= (+ main_~i~0 main_~j~0 96) 0)} is VALID [2020-07-18 06:38:37,799 INFO L280 TraceCheckUtils]: 19: Hoare triple {1569#(<= (+ main_~i~0 main_~j~0 96) 0)} ~j~0 := ~i~0 + ~j~0; {1570#(<= (+ main_~j~0 96) 0)} is VALID [2020-07-18 06:38:37,800 INFO L280 TraceCheckUtils]: 20: Hoare triple {1570#(<= (+ main_~j~0 96) 0)} assume !(~j~0 < 20); {1561#false} is VALID [2020-07-18 06:38:37,800 INFO L280 TraceCheckUtils]: 21: Hoare triple {1561#false} ~k~0 := 4; {1561#false} is VALID [2020-07-18 06:38:37,800 INFO L280 TraceCheckUtils]: 22: Hoare triple {1561#false} assume !(~k~0 <= 3); {1561#false} is VALID [2020-07-18 06:38:37,801 INFO L280 TraceCheckUtils]: 23: Hoare triple {1561#false} assume !!(~i~0 <= 100); {1561#false} is VALID [2020-07-18 06:38:37,801 INFO L280 TraceCheckUtils]: 24: Hoare triple {1561#false} ~i~0 := 1 + ~i~0; {1561#false} is VALID [2020-07-18 06:38:37,801 INFO L280 TraceCheckUtils]: 25: Hoare triple {1561#false} assume !(~j~0 < 20); {1561#false} is VALID [2020-07-18 06:38:37,801 INFO L280 TraceCheckUtils]: 26: Hoare triple {1561#false} ~k~0 := 4; {1561#false} is VALID [2020-07-18 06:38:37,802 INFO L280 TraceCheckUtils]: 27: Hoare triple {1561#false} assume !(~k~0 <= 3); {1561#false} is VALID [2020-07-18 06:38:37,802 INFO L280 TraceCheckUtils]: 28: Hoare triple {1561#false} assume !(~i~0 <= 100); {1561#false} is VALID [2020-07-18 06:38:37,802 INFO L263 TraceCheckUtils]: 29: Hoare triple {1561#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {1561#false} is VALID [2020-07-18 06:38:37,802 INFO L280 TraceCheckUtils]: 30: Hoare triple {1561#false} ~cond := #in~cond; {1561#false} is VALID [2020-07-18 06:38:37,803 INFO L280 TraceCheckUtils]: 31: Hoare triple {1561#false} assume 0 == ~cond; {1561#false} is VALID [2020-07-18 06:38:37,803 INFO L280 TraceCheckUtils]: 32: Hoare triple {1561#false} assume !false; {1561#false} is VALID [2020-07-18 06:38:37,805 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-18 06:38:37,805 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [275209648] [2020-07-18 06:38:37,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:38:37,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-18 06:38:37,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673877691] [2020-07-18 06:38:37,806 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2020-07-18 06:38:37,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:38:37,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-18 06:38:37,837 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 06:38:37,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-18 06:38:37,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:38:37,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-18 06:38:37,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-18 06:38:37,839 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 9 states. [2020-07-18 06:38:38,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:38,251 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2020-07-18 06:38:38,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-18 06:38:38,252 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2020-07-18 06:38:38,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:38:38,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 06:38:38,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2020-07-18 06:38:38,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 06:38:38,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2020-07-18 06:38:38,255 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 51 transitions. [2020-07-18 06:38:38,302 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 06:38:38,303 INFO L225 Difference]: With dead ends: 56 [2020-07-18 06:38:38,303 INFO L226 Difference]: Without dead ends: 40 [2020-07-18 06:38:38,304 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 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 06:38:38,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-18 06:38:38,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2020-07-18 06:38:38,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:38:38,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2020-07-18 06:38:38,364 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2020-07-18 06:38:38,364 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2020-07-18 06:38:38,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:38,368 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-18 06:38:38,368 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-18 06:38:38,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:38,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:38,369 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2020-07-18 06:38:38,369 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2020-07-18 06:38:38,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:38,371 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-18 06:38:38,371 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-18 06:38:38,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:38,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:38,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:38:38,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:38:38,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-18 06:38:38,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-07-18 06:38:38,377 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 33 [2020-07-18 06:38:38,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:38:38,378 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-07-18 06:38:38,378 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-18 06:38:38,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 43 transitions. [2020-07-18 06:38:38,421 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 06:38:38,421 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-07-18 06:38:38,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-18 06:38:38,422 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:38:38,422 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 06:38:38,422 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-18 06:38:38,422 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:38:38,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:38:38,423 INFO L82 PathProgramCache]: Analyzing trace with hash 377623979, now seen corresponding path program 6 times [2020-07-18 06:38:38,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:38:38,423 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1138103892] [2020-07-18 06:38:38,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:38:38,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:38,590 INFO L280 TraceCheckUtils]: 0: Hoare triple {1853#true} assume true; {1853#true} is VALID [2020-07-18 06:38:38,591 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1853#true} {1853#true} #74#return; {1853#true} is VALID [2020-07-18 06:38:38,591 INFO L263 TraceCheckUtils]: 0: Hoare triple {1853#true} call ULTIMATE.init(); {1853#true} is VALID [2020-07-18 06:38:38,592 INFO L280 TraceCheckUtils]: 1: Hoare triple {1853#true} assume true; {1853#true} is VALID [2020-07-18 06:38:38,592 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1853#true} {1853#true} #74#return; {1853#true} is VALID [2020-07-18 06:38:38,592 INFO L263 TraceCheckUtils]: 3: Hoare triple {1853#true} call #t~ret0 := main(); {1853#true} is VALID [2020-07-18 06:38:38,592 INFO L280 TraceCheckUtils]: 4: Hoare triple {1853#true} havoc ~i~0; {1853#true} is VALID [2020-07-18 06:38:38,592 INFO L280 TraceCheckUtils]: 5: Hoare triple {1853#true} havoc ~j~0; {1853#true} is VALID [2020-07-18 06:38:38,593 INFO L280 TraceCheckUtils]: 6: Hoare triple {1853#true} havoc ~k~0; {1853#true} is VALID [2020-07-18 06:38:38,593 INFO L280 TraceCheckUtils]: 7: Hoare triple {1853#true} ~i~0 := 0; {1857#(<= main_~i~0 0)} is VALID [2020-07-18 06:38:38,594 INFO L280 TraceCheckUtils]: 8: Hoare triple {1857#(<= main_~i~0 0)} ~k~0 := 9; {1857#(<= main_~i~0 0)} is VALID [2020-07-18 06:38:38,595 INFO L280 TraceCheckUtils]: 9: Hoare triple {1857#(<= main_~i~0 0)} ~j~0 := -100; {1858#(<= (+ (* 5 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-18 06:38:38,595 INFO L280 TraceCheckUtils]: 10: Hoare triple {1858#(<= (+ (* 5 main_~i~0) main_~j~0 100) 0)} assume !!(~i~0 <= 100); {1858#(<= (+ (* 5 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-18 06:38:38,596 INFO L280 TraceCheckUtils]: 11: Hoare triple {1858#(<= (+ (* 5 main_~i~0) main_~j~0 100) 0)} ~i~0 := 1 + ~i~0; {1859#(<= (+ (* 5 main_~i~0) main_~j~0 95) 0)} is VALID [2020-07-18 06:38:38,599 INFO L280 TraceCheckUtils]: 12: Hoare triple {1859#(<= (+ (* 5 main_~i~0) main_~j~0 95) 0)} assume !!(~j~0 < 20); {1859#(<= (+ (* 5 main_~i~0) main_~j~0 95) 0)} is VALID [2020-07-18 06:38:38,600 INFO L280 TraceCheckUtils]: 13: Hoare triple {1859#(<= (+ (* 5 main_~i~0) main_~j~0 95) 0)} ~j~0 := ~i~0 + ~j~0; {1860#(<= (+ (* 4 main_~i~0) main_~j~0 95) 0)} is VALID [2020-07-18 06:38:38,601 INFO L280 TraceCheckUtils]: 14: Hoare triple {1860#(<= (+ (* 4 main_~i~0) main_~j~0 95) 0)} assume !!(~j~0 < 20); {1860#(<= (+ (* 4 main_~i~0) main_~j~0 95) 0)} is VALID [2020-07-18 06:38:38,602 INFO L280 TraceCheckUtils]: 15: Hoare triple {1860#(<= (+ (* 4 main_~i~0) main_~j~0 95) 0)} ~j~0 := ~i~0 + ~j~0; {1861#(<= (+ (* 3 main_~i~0) main_~j~0 95) 0)} is VALID [2020-07-18 06:38:38,603 INFO L280 TraceCheckUtils]: 16: Hoare triple {1861#(<= (+ (* 3 main_~i~0) main_~j~0 95) 0)} assume !!(~j~0 < 20); {1861#(<= (+ (* 3 main_~i~0) main_~j~0 95) 0)} is VALID [2020-07-18 06:38:38,604 INFO L280 TraceCheckUtils]: 17: Hoare triple {1861#(<= (+ (* 3 main_~i~0) main_~j~0 95) 0)} ~j~0 := ~i~0 + ~j~0; {1862#(<= (+ (* 2 main_~i~0) main_~j~0 95) 0)} is VALID [2020-07-18 06:38:38,604 INFO L280 TraceCheckUtils]: 18: Hoare triple {1862#(<= (+ (* 2 main_~i~0) main_~j~0 95) 0)} assume !!(~j~0 < 20); {1862#(<= (+ (* 2 main_~i~0) main_~j~0 95) 0)} is VALID [2020-07-18 06:38:38,605 INFO L280 TraceCheckUtils]: 19: Hoare triple {1862#(<= (+ (* 2 main_~i~0) main_~j~0 95) 0)} ~j~0 := ~i~0 + ~j~0; {1863#(<= (+ main_~i~0 main_~j~0 95) 0)} is VALID [2020-07-18 06:38:38,606 INFO L280 TraceCheckUtils]: 20: Hoare triple {1863#(<= (+ main_~i~0 main_~j~0 95) 0)} assume !!(~j~0 < 20); {1863#(<= (+ main_~i~0 main_~j~0 95) 0)} is VALID [2020-07-18 06:38:38,607 INFO L280 TraceCheckUtils]: 21: Hoare triple {1863#(<= (+ main_~i~0 main_~j~0 95) 0)} ~j~0 := ~i~0 + ~j~0; {1864#(<= (+ main_~j~0 95) 0)} is VALID [2020-07-18 06:38:38,607 INFO L280 TraceCheckUtils]: 22: Hoare triple {1864#(<= (+ main_~j~0 95) 0)} assume !(~j~0 < 20); {1854#false} is VALID [2020-07-18 06:38:38,608 INFO L280 TraceCheckUtils]: 23: Hoare triple {1854#false} ~k~0 := 4; {1854#false} is VALID [2020-07-18 06:38:38,608 INFO L280 TraceCheckUtils]: 24: Hoare triple {1854#false} assume !(~k~0 <= 3); {1854#false} is VALID [2020-07-18 06:38:38,608 INFO L280 TraceCheckUtils]: 25: Hoare triple {1854#false} assume !!(~i~0 <= 100); {1854#false} is VALID [2020-07-18 06:38:38,608 INFO L280 TraceCheckUtils]: 26: Hoare triple {1854#false} ~i~0 := 1 + ~i~0; {1854#false} is VALID [2020-07-18 06:38:38,609 INFO L280 TraceCheckUtils]: 27: Hoare triple {1854#false} assume !(~j~0 < 20); {1854#false} is VALID [2020-07-18 06:38:38,609 INFO L280 TraceCheckUtils]: 28: Hoare triple {1854#false} ~k~0 := 4; {1854#false} is VALID [2020-07-18 06:38:38,609 INFO L280 TraceCheckUtils]: 29: Hoare triple {1854#false} assume !(~k~0 <= 3); {1854#false} is VALID [2020-07-18 06:38:38,609 INFO L280 TraceCheckUtils]: 30: Hoare triple {1854#false} assume !(~i~0 <= 100); {1854#false} is VALID [2020-07-18 06:38:38,609 INFO L263 TraceCheckUtils]: 31: Hoare triple {1854#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {1854#false} is VALID [2020-07-18 06:38:38,610 INFO L280 TraceCheckUtils]: 32: Hoare triple {1854#false} ~cond := #in~cond; {1854#false} is VALID [2020-07-18 06:38:38,610 INFO L280 TraceCheckUtils]: 33: Hoare triple {1854#false} assume 0 == ~cond; {1854#false} is VALID [2020-07-18 06:38:38,610 INFO L280 TraceCheckUtils]: 34: Hoare triple {1854#false} assume !false; {1854#false} is VALID [2020-07-18 06:38:38,612 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-18 06:38:38,612 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1138103892] [2020-07-18 06:38:38,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:38:38,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-18 06:38:38,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329586278] [2020-07-18 06:38:38,613 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2020-07-18 06:38:38,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:38:38,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-18 06:38:38,653 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 06:38:38,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-18 06:38:38,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:38:38,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-18 06:38:38,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-18 06:38:38,655 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 10 states. [2020-07-18 06:38:39,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:39,103 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2020-07-18 06:38:39,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-18 06:38:39,103 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2020-07-18 06:38:39,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:38:39,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-18 06:38:39,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2020-07-18 06:38:39,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-18 06:38:39,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2020-07-18 06:38:39,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 53 transitions. [2020-07-18 06:38:39,172 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 06:38:39,174 INFO L225 Difference]: With dead ends: 58 [2020-07-18 06:38:39,174 INFO L226 Difference]: Without dead ends: 42 [2020-07-18 06:38:39,176 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 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 06:38:39,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-18 06:38:39,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2020-07-18 06:38:39,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:38:39,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 41 states. [2020-07-18 06:38:39,247 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 41 states. [2020-07-18 06:38:39,247 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 41 states. [2020-07-18 06:38:39,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:39,250 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2020-07-18 06:38:39,250 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2020-07-18 06:38:39,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:39,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:39,251 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 42 states. [2020-07-18 06:38:39,251 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 42 states. [2020-07-18 06:38:39,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:39,252 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2020-07-18 06:38:39,252 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2020-07-18 06:38:39,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:39,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:39,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:38:39,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:38:39,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-18 06:38:39,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2020-07-18 06:38:39,254 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 35 [2020-07-18 06:38:39,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:38:39,255 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2020-07-18 06:38:39,255 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-18 06:38:39,255 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 45 transitions. [2020-07-18 06:38:39,313 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 06:38:39,313 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2020-07-18 06:38:39,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-18 06:38:39,314 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:38:39,314 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 06:38:39,314 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-18 06:38:39,314 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:38:39,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:38:39,315 INFO L82 PathProgramCache]: Analyzing trace with hash 783824682, now seen corresponding path program 7 times [2020-07-18 06:38:39,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:38:39,315 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1533792915] [2020-07-18 06:38:39,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:38:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:39,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:39,469 INFO L280 TraceCheckUtils]: 0: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-18 06:38:39,470 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2161#true} {2161#true} #74#return; {2161#true} is VALID [2020-07-18 06:38:39,470 INFO L263 TraceCheckUtils]: 0: Hoare triple {2161#true} call ULTIMATE.init(); {2161#true} is VALID [2020-07-18 06:38:39,470 INFO L280 TraceCheckUtils]: 1: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-18 06:38:39,470 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2161#true} {2161#true} #74#return; {2161#true} is VALID [2020-07-18 06:38:39,471 INFO L263 TraceCheckUtils]: 3: Hoare triple {2161#true} call #t~ret0 := main(); {2161#true} is VALID [2020-07-18 06:38:39,471 INFO L280 TraceCheckUtils]: 4: Hoare triple {2161#true} havoc ~i~0; {2161#true} is VALID [2020-07-18 06:38:39,471 INFO L280 TraceCheckUtils]: 5: Hoare triple {2161#true} havoc ~j~0; {2161#true} is VALID [2020-07-18 06:38:39,471 INFO L280 TraceCheckUtils]: 6: Hoare triple {2161#true} havoc ~k~0; {2161#true} is VALID [2020-07-18 06:38:39,475 INFO L280 TraceCheckUtils]: 7: Hoare triple {2161#true} ~i~0 := 0; {2165#(<= main_~i~0 0)} is VALID [2020-07-18 06:38:39,479 INFO L280 TraceCheckUtils]: 8: Hoare triple {2165#(<= main_~i~0 0)} ~k~0 := 9; {2165#(<= main_~i~0 0)} is VALID [2020-07-18 06:38:39,481 INFO L280 TraceCheckUtils]: 9: Hoare triple {2165#(<= main_~i~0 0)} ~j~0 := -100; {2166#(<= (+ (* 6 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-18 06:38:39,481 INFO L280 TraceCheckUtils]: 10: Hoare triple {2166#(<= (+ (* 6 main_~i~0) main_~j~0 100) 0)} assume !!(~i~0 <= 100); {2166#(<= (+ (* 6 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-18 06:38:39,482 INFO L280 TraceCheckUtils]: 11: Hoare triple {2166#(<= (+ (* 6 main_~i~0) main_~j~0 100) 0)} ~i~0 := 1 + ~i~0; {2167#(<= (+ (* 6 main_~i~0) main_~j~0 94) 0)} is VALID [2020-07-18 06:38:39,482 INFO L280 TraceCheckUtils]: 12: Hoare triple {2167#(<= (+ (* 6 main_~i~0) main_~j~0 94) 0)} assume !!(~j~0 < 20); {2167#(<= (+ (* 6 main_~i~0) main_~j~0 94) 0)} is VALID [2020-07-18 06:38:39,483 INFO L280 TraceCheckUtils]: 13: Hoare triple {2167#(<= (+ (* 6 main_~i~0) main_~j~0 94) 0)} ~j~0 := ~i~0 + ~j~0; {2168#(<= (+ (* 5 main_~i~0) main_~j~0 94) 0)} is VALID [2020-07-18 06:38:39,484 INFO L280 TraceCheckUtils]: 14: Hoare triple {2168#(<= (+ (* 5 main_~i~0) main_~j~0 94) 0)} assume !!(~j~0 < 20); {2168#(<= (+ (* 5 main_~i~0) main_~j~0 94) 0)} is VALID [2020-07-18 06:38:39,484 INFO L280 TraceCheckUtils]: 15: Hoare triple {2168#(<= (+ (* 5 main_~i~0) main_~j~0 94) 0)} ~j~0 := ~i~0 + ~j~0; {2169#(<= (+ (* 4 main_~i~0) main_~j~0 94) 0)} is VALID [2020-07-18 06:38:39,485 INFO L280 TraceCheckUtils]: 16: Hoare triple {2169#(<= (+ (* 4 main_~i~0) main_~j~0 94) 0)} assume !!(~j~0 < 20); {2169#(<= (+ (* 4 main_~i~0) main_~j~0 94) 0)} is VALID [2020-07-18 06:38:39,486 INFO L280 TraceCheckUtils]: 17: Hoare triple {2169#(<= (+ (* 4 main_~i~0) main_~j~0 94) 0)} ~j~0 := ~i~0 + ~j~0; {2170#(<= (+ (* 3 main_~i~0) main_~j~0 94) 0)} is VALID [2020-07-18 06:38:39,486 INFO L280 TraceCheckUtils]: 18: Hoare triple {2170#(<= (+ (* 3 main_~i~0) main_~j~0 94) 0)} assume !!(~j~0 < 20); {2170#(<= (+ (* 3 main_~i~0) main_~j~0 94) 0)} is VALID [2020-07-18 06:38:39,488 INFO L280 TraceCheckUtils]: 19: Hoare triple {2170#(<= (+ (* 3 main_~i~0) main_~j~0 94) 0)} ~j~0 := ~i~0 + ~j~0; {2171#(<= (+ (* 2 main_~i~0) main_~j~0 94) 0)} is VALID [2020-07-18 06:38:39,492 INFO L280 TraceCheckUtils]: 20: Hoare triple {2171#(<= (+ (* 2 main_~i~0) main_~j~0 94) 0)} assume !!(~j~0 < 20); {2171#(<= (+ (* 2 main_~i~0) main_~j~0 94) 0)} is VALID [2020-07-18 06:38:39,493 INFO L280 TraceCheckUtils]: 21: Hoare triple {2171#(<= (+ (* 2 main_~i~0) main_~j~0 94) 0)} ~j~0 := ~i~0 + ~j~0; {2172#(<= (+ main_~i~0 main_~j~0 94) 0)} is VALID [2020-07-18 06:38:39,494 INFO L280 TraceCheckUtils]: 22: Hoare triple {2172#(<= (+ main_~i~0 main_~j~0 94) 0)} assume !!(~j~0 < 20); {2172#(<= (+ main_~i~0 main_~j~0 94) 0)} is VALID [2020-07-18 06:38:39,494 INFO L280 TraceCheckUtils]: 23: Hoare triple {2172#(<= (+ main_~i~0 main_~j~0 94) 0)} ~j~0 := ~i~0 + ~j~0; {2173#(<= (+ main_~j~0 94) 0)} is VALID [2020-07-18 06:38:39,495 INFO L280 TraceCheckUtils]: 24: Hoare triple {2173#(<= (+ main_~j~0 94) 0)} assume !(~j~0 < 20); {2162#false} is VALID [2020-07-18 06:38:39,495 INFO L280 TraceCheckUtils]: 25: Hoare triple {2162#false} ~k~0 := 4; {2162#false} is VALID [2020-07-18 06:38:39,495 INFO L280 TraceCheckUtils]: 26: Hoare triple {2162#false} assume !(~k~0 <= 3); {2162#false} is VALID [2020-07-18 06:38:39,496 INFO L280 TraceCheckUtils]: 27: Hoare triple {2162#false} assume !!(~i~0 <= 100); {2162#false} is VALID [2020-07-18 06:38:39,496 INFO L280 TraceCheckUtils]: 28: Hoare triple {2162#false} ~i~0 := 1 + ~i~0; {2162#false} is VALID [2020-07-18 06:38:39,496 INFO L280 TraceCheckUtils]: 29: Hoare triple {2162#false} assume !(~j~0 < 20); {2162#false} is VALID [2020-07-18 06:38:39,496 INFO L280 TraceCheckUtils]: 30: Hoare triple {2162#false} ~k~0 := 4; {2162#false} is VALID [2020-07-18 06:38:39,497 INFO L280 TraceCheckUtils]: 31: Hoare triple {2162#false} assume !(~k~0 <= 3); {2162#false} is VALID [2020-07-18 06:38:39,497 INFO L280 TraceCheckUtils]: 32: Hoare triple {2162#false} assume !(~i~0 <= 100); {2162#false} is VALID [2020-07-18 06:38:39,497 INFO L263 TraceCheckUtils]: 33: Hoare triple {2162#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {2162#false} is VALID [2020-07-18 06:38:39,500 INFO L280 TraceCheckUtils]: 34: Hoare triple {2162#false} ~cond := #in~cond; {2162#false} is VALID [2020-07-18 06:38:39,501 INFO L280 TraceCheckUtils]: 35: Hoare triple {2162#false} assume 0 == ~cond; {2162#false} is VALID [2020-07-18 06:38:39,501 INFO L280 TraceCheckUtils]: 36: Hoare triple {2162#false} assume !false; {2162#false} is VALID [2020-07-18 06:38:39,503 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 10 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-18 06:38:39,503 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1533792915] [2020-07-18 06:38:39,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:38:39,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-18 06:38:39,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990011274] [2020-07-18 06:38:39,507 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-07-18 06:38:39,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:38:39,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-18 06:38:39,541 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 06:38:39,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-18 06:38:39,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:38:39,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-18 06:38:39,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-07-18 06:38:39,542 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 11 states. [2020-07-18 06:38:40,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:40,073 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2020-07-18 06:38:40,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-18 06:38:40,073 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-07-18 06:38:40,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:38:40,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 06:38:40,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 55 transitions. [2020-07-18 06:38:40,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 06:38:40,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 55 transitions. [2020-07-18 06:38:40,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 55 transitions. [2020-07-18 06:38:40,128 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 06:38:40,130 INFO L225 Difference]: With dead ends: 60 [2020-07-18 06:38:40,130 INFO L226 Difference]: Without dead ends: 44 [2020-07-18 06:38:40,130 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 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 06:38:40,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-18 06:38:40,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2020-07-18 06:38:40,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:38:40,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 43 states. [2020-07-18 06:38:40,227 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 43 states. [2020-07-18 06:38:40,227 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 43 states. [2020-07-18 06:38:40,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:40,229 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2020-07-18 06:38:40,229 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2020-07-18 06:38:40,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:40,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:40,229 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 44 states. [2020-07-18 06:38:40,230 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 44 states. [2020-07-18 06:38:40,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:40,231 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2020-07-18 06:38:40,231 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2020-07-18 06:38:40,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:40,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:40,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:38:40,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:38:40,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-18 06:38:40,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2020-07-18 06:38:40,234 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 37 [2020-07-18 06:38:40,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:38:40,235 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2020-07-18 06:38:40,235 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-18 06:38:40,235 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 47 transitions. [2020-07-18 06:38:40,297 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 06:38:40,297 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2020-07-18 06:38:40,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-18 06:38:40,298 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:38:40,298 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 06:38:40,298 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-18 06:38:40,298 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:38:40,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:38:40,299 INFO L82 PathProgramCache]: Analyzing trace with hash 300676329, now seen corresponding path program 8 times [2020-07-18 06:38:40,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:38:40,299 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1618503660] [2020-07-18 06:38:40,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:38:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:40,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:40,468 INFO L280 TraceCheckUtils]: 0: Hoare triple {2484#true} assume true; {2484#true} is VALID [2020-07-18 06:38:40,468 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2484#true} {2484#true} #74#return; {2484#true} is VALID [2020-07-18 06:38:40,469 INFO L263 TraceCheckUtils]: 0: Hoare triple {2484#true} call ULTIMATE.init(); {2484#true} is VALID [2020-07-18 06:38:40,469 INFO L280 TraceCheckUtils]: 1: Hoare triple {2484#true} assume true; {2484#true} is VALID [2020-07-18 06:38:40,469 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2484#true} {2484#true} #74#return; {2484#true} is VALID [2020-07-18 06:38:40,469 INFO L263 TraceCheckUtils]: 3: Hoare triple {2484#true} call #t~ret0 := main(); {2484#true} is VALID [2020-07-18 06:38:40,469 INFO L280 TraceCheckUtils]: 4: Hoare triple {2484#true} havoc ~i~0; {2484#true} is VALID [2020-07-18 06:38:40,470 INFO L280 TraceCheckUtils]: 5: Hoare triple {2484#true} havoc ~j~0; {2484#true} is VALID [2020-07-18 06:38:40,470 INFO L280 TraceCheckUtils]: 6: Hoare triple {2484#true} havoc ~k~0; {2484#true} is VALID [2020-07-18 06:38:40,470 INFO L280 TraceCheckUtils]: 7: Hoare triple {2484#true} ~i~0 := 0; {2488#(<= main_~i~0 0)} is VALID [2020-07-18 06:38:40,471 INFO L280 TraceCheckUtils]: 8: Hoare triple {2488#(<= main_~i~0 0)} ~k~0 := 9; {2488#(<= main_~i~0 0)} is VALID [2020-07-18 06:38:40,472 INFO L280 TraceCheckUtils]: 9: Hoare triple {2488#(<= main_~i~0 0)} ~j~0 := -100; {2489#(<= (+ (* 7 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-18 06:38:40,472 INFO L280 TraceCheckUtils]: 10: Hoare triple {2489#(<= (+ (* 7 main_~i~0) main_~j~0 100) 0)} assume !!(~i~0 <= 100); {2489#(<= (+ (* 7 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-18 06:38:40,473 INFO L280 TraceCheckUtils]: 11: Hoare triple {2489#(<= (+ (* 7 main_~i~0) main_~j~0 100) 0)} ~i~0 := 1 + ~i~0; {2490#(<= (+ (* 7 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-18 06:38:40,474 INFO L280 TraceCheckUtils]: 12: Hoare triple {2490#(<= (+ (* 7 main_~i~0) main_~j~0 93) 0)} assume !!(~j~0 < 20); {2490#(<= (+ (* 7 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-18 06:38:40,474 INFO L280 TraceCheckUtils]: 13: Hoare triple {2490#(<= (+ (* 7 main_~i~0) main_~j~0 93) 0)} ~j~0 := ~i~0 + ~j~0; {2491#(<= (+ (* 6 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-18 06:38:40,475 INFO L280 TraceCheckUtils]: 14: Hoare triple {2491#(<= (+ (* 6 main_~i~0) main_~j~0 93) 0)} assume !!(~j~0 < 20); {2491#(<= (+ (* 6 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-18 06:38:40,476 INFO L280 TraceCheckUtils]: 15: Hoare triple {2491#(<= (+ (* 6 main_~i~0) main_~j~0 93) 0)} ~j~0 := ~i~0 + ~j~0; {2492#(<= (+ (* 5 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-18 06:38:40,476 INFO L280 TraceCheckUtils]: 16: Hoare triple {2492#(<= (+ (* 5 main_~i~0) main_~j~0 93) 0)} assume !!(~j~0 < 20); {2492#(<= (+ (* 5 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-18 06:38:40,477 INFO L280 TraceCheckUtils]: 17: Hoare triple {2492#(<= (+ (* 5 main_~i~0) main_~j~0 93) 0)} ~j~0 := ~i~0 + ~j~0; {2493#(<= (+ (* 4 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-18 06:38:40,478 INFO L280 TraceCheckUtils]: 18: Hoare triple {2493#(<= (+ (* 4 main_~i~0) main_~j~0 93) 0)} assume !!(~j~0 < 20); {2493#(<= (+ (* 4 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-18 06:38:40,479 INFO L280 TraceCheckUtils]: 19: Hoare triple {2493#(<= (+ (* 4 main_~i~0) main_~j~0 93) 0)} ~j~0 := ~i~0 + ~j~0; {2494#(<= (+ (* 3 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-18 06:38:40,479 INFO L280 TraceCheckUtils]: 20: Hoare triple {2494#(<= (+ (* 3 main_~i~0) main_~j~0 93) 0)} assume !!(~j~0 < 20); {2494#(<= (+ (* 3 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-18 06:38:40,480 INFO L280 TraceCheckUtils]: 21: Hoare triple {2494#(<= (+ (* 3 main_~i~0) main_~j~0 93) 0)} ~j~0 := ~i~0 + ~j~0; {2495#(<= (+ (* 2 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-18 06:38:40,481 INFO L280 TraceCheckUtils]: 22: Hoare triple {2495#(<= (+ (* 2 main_~i~0) main_~j~0 93) 0)} assume !!(~j~0 < 20); {2495#(<= (+ (* 2 main_~i~0) main_~j~0 93) 0)} is VALID [2020-07-18 06:38:40,481 INFO L280 TraceCheckUtils]: 23: Hoare triple {2495#(<= (+ (* 2 main_~i~0) main_~j~0 93) 0)} ~j~0 := ~i~0 + ~j~0; {2496#(<= (+ main_~i~0 main_~j~0 93) 0)} is VALID [2020-07-18 06:38:40,483 INFO L280 TraceCheckUtils]: 24: Hoare triple {2496#(<= (+ main_~i~0 main_~j~0 93) 0)} assume !!(~j~0 < 20); {2496#(<= (+ main_~i~0 main_~j~0 93) 0)} is VALID [2020-07-18 06:38:40,484 INFO L280 TraceCheckUtils]: 25: Hoare triple {2496#(<= (+ main_~i~0 main_~j~0 93) 0)} ~j~0 := ~i~0 + ~j~0; {2497#(<= (+ main_~j~0 93) 0)} is VALID [2020-07-18 06:38:40,485 INFO L280 TraceCheckUtils]: 26: Hoare triple {2497#(<= (+ main_~j~0 93) 0)} assume !(~j~0 < 20); {2485#false} is VALID [2020-07-18 06:38:40,485 INFO L280 TraceCheckUtils]: 27: Hoare triple {2485#false} ~k~0 := 4; {2485#false} is VALID [2020-07-18 06:38:40,485 INFO L280 TraceCheckUtils]: 28: Hoare triple {2485#false} assume !(~k~0 <= 3); {2485#false} is VALID [2020-07-18 06:38:40,485 INFO L280 TraceCheckUtils]: 29: Hoare triple {2485#false} assume !!(~i~0 <= 100); {2485#false} is VALID [2020-07-18 06:38:40,485 INFO L280 TraceCheckUtils]: 30: Hoare triple {2485#false} ~i~0 := 1 + ~i~0; {2485#false} is VALID [2020-07-18 06:38:40,485 INFO L280 TraceCheckUtils]: 31: Hoare triple {2485#false} assume !(~j~0 < 20); {2485#false} is VALID [2020-07-18 06:38:40,486 INFO L280 TraceCheckUtils]: 32: Hoare triple {2485#false} ~k~0 := 4; {2485#false} is VALID [2020-07-18 06:38:40,486 INFO L280 TraceCheckUtils]: 33: Hoare triple {2485#false} assume !(~k~0 <= 3); {2485#false} is VALID [2020-07-18 06:38:40,486 INFO L280 TraceCheckUtils]: 34: Hoare triple {2485#false} assume !(~i~0 <= 100); {2485#false} is VALID [2020-07-18 06:38:40,486 INFO L263 TraceCheckUtils]: 35: Hoare triple {2485#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {2485#false} is VALID [2020-07-18 06:38:40,486 INFO L280 TraceCheckUtils]: 36: Hoare triple {2485#false} ~cond := #in~cond; {2485#false} is VALID [2020-07-18 06:38:40,487 INFO L280 TraceCheckUtils]: 37: Hoare triple {2485#false} assume 0 == ~cond; {2485#false} is VALID [2020-07-18 06:38:40,487 INFO L280 TraceCheckUtils]: 38: Hoare triple {2485#false} assume !false; {2485#false} is VALID [2020-07-18 06:38:40,489 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 11 proven. 49 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-18 06:38:40,490 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1618503660] [2020-07-18 06:38:40,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:38:40,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-07-18 06:38:40,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747328842] [2020-07-18 06:38:40,491 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2020-07-18 06:38:40,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:38:40,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-18 06:38:40,532 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 06:38:40,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-18 06:38:40,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:38:40,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-18 06:38:40,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-07-18 06:38:40,533 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 12 states. [2020-07-18 06:38:41,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:41,154 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2020-07-18 06:38:41,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-18 06:38:41,154 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2020-07-18 06:38:41,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:38:41,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-18 06:38:41,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2020-07-18 06:38:41,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-18 06:38:41,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2020-07-18 06:38:41,157 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 57 transitions. [2020-07-18 06:38:41,224 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 06:38:41,225 INFO L225 Difference]: With dead ends: 62 [2020-07-18 06:38:41,225 INFO L226 Difference]: Without dead ends: 46 [2020-07-18 06:38:41,226 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 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 06:38:41,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-18 06:38:41,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2020-07-18 06:38:41,312 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:38:41,312 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 45 states. [2020-07-18 06:38:41,312 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 45 states. [2020-07-18 06:38:41,312 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 45 states. [2020-07-18 06:38:41,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:41,314 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2020-07-18 06:38:41,314 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2020-07-18 06:38:41,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:41,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:41,315 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 46 states. [2020-07-18 06:38:41,315 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 46 states. [2020-07-18 06:38:41,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:41,316 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2020-07-18 06:38:41,316 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2020-07-18 06:38:41,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:41,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:41,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:38:41,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:38:41,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-18 06:38:41,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2020-07-18 06:38:41,318 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 39 [2020-07-18 06:38:41,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:38:41,318 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2020-07-18 06:38:41,319 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-18 06:38:41,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 49 transitions. [2020-07-18 06:38:41,387 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 06:38:41,387 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2020-07-18 06:38:41,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-18 06:38:41,388 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:38:41,388 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 06:38:41,388 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-18 06:38:41,389 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:38:41,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:38:41,389 INFO L82 PathProgramCache]: Analyzing trace with hash -148422936, now seen corresponding path program 9 times [2020-07-18 06:38:41,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:38:41,389 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [606986222] [2020-07-18 06:38:41,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:38:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:41,607 INFO L280 TraceCheckUtils]: 0: Hoare triple {2822#true} assume true; {2822#true} is VALID [2020-07-18 06:38:41,608 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2822#true} {2822#true} #74#return; {2822#true} is VALID [2020-07-18 06:38:41,608 INFO L263 TraceCheckUtils]: 0: Hoare triple {2822#true} call ULTIMATE.init(); {2822#true} is VALID [2020-07-18 06:38:41,608 INFO L280 TraceCheckUtils]: 1: Hoare triple {2822#true} assume true; {2822#true} is VALID [2020-07-18 06:38:41,608 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2822#true} {2822#true} #74#return; {2822#true} is VALID [2020-07-18 06:38:41,609 INFO L263 TraceCheckUtils]: 3: Hoare triple {2822#true} call #t~ret0 := main(); {2822#true} is VALID [2020-07-18 06:38:41,609 INFO L280 TraceCheckUtils]: 4: Hoare triple {2822#true} havoc ~i~0; {2822#true} is VALID [2020-07-18 06:38:41,609 INFO L280 TraceCheckUtils]: 5: Hoare triple {2822#true} havoc ~j~0; {2822#true} is VALID [2020-07-18 06:38:41,610 INFO L280 TraceCheckUtils]: 6: Hoare triple {2822#true} havoc ~k~0; {2822#true} is VALID [2020-07-18 06:38:41,611 INFO L280 TraceCheckUtils]: 7: Hoare triple {2822#true} ~i~0 := 0; {2826#(<= main_~i~0 0)} is VALID [2020-07-18 06:38:41,611 INFO L280 TraceCheckUtils]: 8: Hoare triple {2826#(<= main_~i~0 0)} ~k~0 := 9; {2826#(<= main_~i~0 0)} is VALID [2020-07-18 06:38:41,612 INFO L280 TraceCheckUtils]: 9: Hoare triple {2826#(<= main_~i~0 0)} ~j~0 := -100; {2827#(<= (+ (* 8 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-18 06:38:41,613 INFO L280 TraceCheckUtils]: 10: Hoare triple {2827#(<= (+ (* 8 main_~i~0) main_~j~0 100) 0)} assume !!(~i~0 <= 100); {2827#(<= (+ (* 8 main_~i~0) main_~j~0 100) 0)} is VALID [2020-07-18 06:38:41,614 INFO L280 TraceCheckUtils]: 11: Hoare triple {2827#(<= (+ (* 8 main_~i~0) main_~j~0 100) 0)} ~i~0 := 1 + ~i~0; {2828#(<= (+ (* 8 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-18 06:38:41,615 INFO L280 TraceCheckUtils]: 12: Hoare triple {2828#(<= (+ (* 8 main_~i~0) main_~j~0 92) 0)} assume !!(~j~0 < 20); {2828#(<= (+ (* 8 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-18 06:38:41,624 INFO L280 TraceCheckUtils]: 13: Hoare triple {2828#(<= (+ (* 8 main_~i~0) main_~j~0 92) 0)} ~j~0 := ~i~0 + ~j~0; {2829#(<= (+ (* 7 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-18 06:38:41,625 INFO L280 TraceCheckUtils]: 14: Hoare triple {2829#(<= (+ (* 7 main_~i~0) main_~j~0 92) 0)} assume !!(~j~0 < 20); {2829#(<= (+ (* 7 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-18 06:38:41,626 INFO L280 TraceCheckUtils]: 15: Hoare triple {2829#(<= (+ (* 7 main_~i~0) main_~j~0 92) 0)} ~j~0 := ~i~0 + ~j~0; {2830#(<= (+ (* 6 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-18 06:38:41,627 INFO L280 TraceCheckUtils]: 16: Hoare triple {2830#(<= (+ (* 6 main_~i~0) main_~j~0 92) 0)} assume !!(~j~0 < 20); {2830#(<= (+ (* 6 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-18 06:38:41,627 INFO L280 TraceCheckUtils]: 17: Hoare triple {2830#(<= (+ (* 6 main_~i~0) main_~j~0 92) 0)} ~j~0 := ~i~0 + ~j~0; {2831#(<= (+ (* 5 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-18 06:38:41,628 INFO L280 TraceCheckUtils]: 18: Hoare triple {2831#(<= (+ (* 5 main_~i~0) main_~j~0 92) 0)} assume !!(~j~0 < 20); {2831#(<= (+ (* 5 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-18 06:38:41,629 INFO L280 TraceCheckUtils]: 19: Hoare triple {2831#(<= (+ (* 5 main_~i~0) main_~j~0 92) 0)} ~j~0 := ~i~0 + ~j~0; {2832#(<= (+ (* 4 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-18 06:38:41,629 INFO L280 TraceCheckUtils]: 20: Hoare triple {2832#(<= (+ (* 4 main_~i~0) main_~j~0 92) 0)} assume !!(~j~0 < 20); {2832#(<= (+ (* 4 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-18 06:38:41,630 INFO L280 TraceCheckUtils]: 21: Hoare triple {2832#(<= (+ (* 4 main_~i~0) main_~j~0 92) 0)} ~j~0 := ~i~0 + ~j~0; {2833#(<= (+ (* 3 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-18 06:38:41,631 INFO L280 TraceCheckUtils]: 22: Hoare triple {2833#(<= (+ (* 3 main_~i~0) main_~j~0 92) 0)} assume !!(~j~0 < 20); {2833#(<= (+ (* 3 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-18 06:38:41,631 INFO L280 TraceCheckUtils]: 23: Hoare triple {2833#(<= (+ (* 3 main_~i~0) main_~j~0 92) 0)} ~j~0 := ~i~0 + ~j~0; {2834#(<= (+ (* 2 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-18 06:38:41,632 INFO L280 TraceCheckUtils]: 24: Hoare triple {2834#(<= (+ (* 2 main_~i~0) main_~j~0 92) 0)} assume !!(~j~0 < 20); {2834#(<= (+ (* 2 main_~i~0) main_~j~0 92) 0)} is VALID [2020-07-18 06:38:41,633 INFO L280 TraceCheckUtils]: 25: Hoare triple {2834#(<= (+ (* 2 main_~i~0) main_~j~0 92) 0)} ~j~0 := ~i~0 + ~j~0; {2835#(<= (+ main_~i~0 main_~j~0 92) 0)} is VALID [2020-07-18 06:38:41,634 INFO L280 TraceCheckUtils]: 26: Hoare triple {2835#(<= (+ main_~i~0 main_~j~0 92) 0)} assume !!(~j~0 < 20); {2835#(<= (+ main_~i~0 main_~j~0 92) 0)} is VALID [2020-07-18 06:38:41,635 INFO L280 TraceCheckUtils]: 27: Hoare triple {2835#(<= (+ main_~i~0 main_~j~0 92) 0)} ~j~0 := ~i~0 + ~j~0; {2836#(<= (+ main_~j~0 92) 0)} is VALID [2020-07-18 06:38:41,636 INFO L280 TraceCheckUtils]: 28: Hoare triple {2836#(<= (+ main_~j~0 92) 0)} assume !(~j~0 < 20); {2823#false} is VALID [2020-07-18 06:38:41,636 INFO L280 TraceCheckUtils]: 29: Hoare triple {2823#false} ~k~0 := 4; {2823#false} is VALID [2020-07-18 06:38:41,636 INFO L280 TraceCheckUtils]: 30: Hoare triple {2823#false} assume !(~k~0 <= 3); {2823#false} is VALID [2020-07-18 06:38:41,637 INFO L280 TraceCheckUtils]: 31: Hoare triple {2823#false} assume !!(~i~0 <= 100); {2823#false} is VALID [2020-07-18 06:38:41,637 INFO L280 TraceCheckUtils]: 32: Hoare triple {2823#false} ~i~0 := 1 + ~i~0; {2823#false} is VALID [2020-07-18 06:38:41,637 INFO L280 TraceCheckUtils]: 33: Hoare triple {2823#false} assume !(~j~0 < 20); {2823#false} is VALID [2020-07-18 06:38:41,637 INFO L280 TraceCheckUtils]: 34: Hoare triple {2823#false} ~k~0 := 4; {2823#false} is VALID [2020-07-18 06:38:41,638 INFO L280 TraceCheckUtils]: 35: Hoare triple {2823#false} assume !(~k~0 <= 3); {2823#false} is VALID [2020-07-18 06:38:41,638 INFO L280 TraceCheckUtils]: 36: Hoare triple {2823#false} assume !(~i~0 <= 100); {2823#false} is VALID [2020-07-18 06:38:41,638 INFO L263 TraceCheckUtils]: 37: Hoare triple {2823#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {2823#false} is VALID [2020-07-18 06:38:41,639 INFO L280 TraceCheckUtils]: 38: Hoare triple {2823#false} ~cond := #in~cond; {2823#false} is VALID [2020-07-18 06:38:41,639 INFO L280 TraceCheckUtils]: 39: Hoare triple {2823#false} assume 0 == ~cond; {2823#false} is VALID [2020-07-18 06:38:41,639 INFO L280 TraceCheckUtils]: 40: Hoare triple {2823#false} assume !false; {2823#false} is VALID [2020-07-18 06:38:41,644 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 12 proven. 64 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-18 06:38:41,645 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [606986222] [2020-07-18 06:38:41,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:38:41,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-18 06:38:41,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556617908] [2020-07-18 06:38:41,646 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2020-07-18 06:38:41,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:38:41,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-18 06:38:41,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 06:38:41,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-18 06:38:41,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:38:41,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-18 06:38:41,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2020-07-18 06:38:41,686 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 13 states. [2020-07-18 06:38:42,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:42,360 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2020-07-18 06:38:42,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-18 06:38:42,360 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2020-07-18 06:38:42,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:38:42,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-18 06:38:42,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 59 transitions. [2020-07-18 06:38:42,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-18 06:38:42,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 59 transitions. [2020-07-18 06:38:42,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 59 transitions. [2020-07-18 06:38:42,445 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 06:38:42,446 INFO L225 Difference]: With dead ends: 64 [2020-07-18 06:38:42,447 INFO L226 Difference]: Without dead ends: 48 [2020-07-18 06:38:42,447 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 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 06:38:42,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-18 06:38:42,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2020-07-18 06:38:42,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:38:42,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 47 states. [2020-07-18 06:38:42,551 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 47 states. [2020-07-18 06:38:42,551 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 47 states. [2020-07-18 06:38:42,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:42,553 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2020-07-18 06:38:42,553 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2020-07-18 06:38:42,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:42,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:42,553 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 48 states. [2020-07-18 06:38:42,553 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 48 states. [2020-07-18 06:38:42,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:42,555 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2020-07-18 06:38:42,555 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2020-07-18 06:38:42,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:42,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:42,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:38:42,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:38:42,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-18 06:38:42,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2020-07-18 06:38:42,557 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 41 [2020-07-18 06:38:42,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:38:42,557 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2020-07-18 06:38:42,557 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-18 06:38:42,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 51 transitions. [2020-07-18 06:38:42,632 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 06:38:42,633 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2020-07-18 06:38:42,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-18 06:38:42,633 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:38:42,634 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 06:38:42,634 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-18 06:38:42,634 INFO L427 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:38:42,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:38:42,635 INFO L82 PathProgramCache]: Analyzing trace with hash 2058880295, now seen corresponding path program 10 times [2020-07-18 06:38:42,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:38:42,635 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1344337643] [2020-07-18 06:38:42,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:38:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:42,702 INFO L280 TraceCheckUtils]: 0: Hoare triple {3175#true} assume true; {3175#true} is VALID [2020-07-18 06:38:42,702 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3175#true} {3175#true} #74#return; {3175#true} is VALID [2020-07-18 06:38:42,702 INFO L263 TraceCheckUtils]: 0: Hoare triple {3175#true} call ULTIMATE.init(); {3175#true} is VALID [2020-07-18 06:38:42,703 INFO L280 TraceCheckUtils]: 1: Hoare triple {3175#true} assume true; {3175#true} is VALID [2020-07-18 06:38:42,703 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3175#true} {3175#true} #74#return; {3175#true} is VALID [2020-07-18 06:38:42,703 INFO L263 TraceCheckUtils]: 3: Hoare triple {3175#true} call #t~ret0 := main(); {3175#true} is VALID [2020-07-18 06:38:42,703 INFO L280 TraceCheckUtils]: 4: Hoare triple {3175#true} havoc ~i~0; {3175#true} is VALID [2020-07-18 06:38:42,703 INFO L280 TraceCheckUtils]: 5: Hoare triple {3175#true} havoc ~j~0; {3175#true} is VALID [2020-07-18 06:38:42,703 INFO L280 TraceCheckUtils]: 6: Hoare triple {3175#true} havoc ~k~0; {3175#true} is VALID [2020-07-18 06:38:42,704 INFO L280 TraceCheckUtils]: 7: Hoare triple {3175#true} ~i~0 := 0; {3179#(<= main_~i~0 0)} is VALID [2020-07-18 06:38:42,704 INFO L280 TraceCheckUtils]: 8: Hoare triple {3179#(<= main_~i~0 0)} ~k~0 := 9; {3179#(<= main_~i~0 0)} is VALID [2020-07-18 06:38:42,705 INFO L280 TraceCheckUtils]: 9: Hoare triple {3179#(<= main_~i~0 0)} ~j~0 := -100; {3179#(<= main_~i~0 0)} is VALID [2020-07-18 06:38:42,706 INFO L280 TraceCheckUtils]: 10: Hoare triple {3179#(<= main_~i~0 0)} assume !!(~i~0 <= 100); {3179#(<= main_~i~0 0)} is VALID [2020-07-18 06:38:42,707 INFO L280 TraceCheckUtils]: 11: Hoare triple {3179#(<= main_~i~0 0)} ~i~0 := 1 + ~i~0; {3180#(<= main_~i~0 1)} is VALID [2020-07-18 06:38:42,710 INFO L280 TraceCheckUtils]: 12: Hoare triple {3180#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3180#(<= main_~i~0 1)} is VALID [2020-07-18 06:38:42,710 INFO L280 TraceCheckUtils]: 13: Hoare triple {3180#(<= main_~i~0 1)} ~j~0 := ~i~0 + ~j~0; {3180#(<= main_~i~0 1)} is VALID [2020-07-18 06:38:42,712 INFO L280 TraceCheckUtils]: 14: Hoare triple {3180#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3180#(<= main_~i~0 1)} is VALID [2020-07-18 06:38:42,713 INFO L280 TraceCheckUtils]: 15: Hoare triple {3180#(<= main_~i~0 1)} ~j~0 := ~i~0 + ~j~0; {3180#(<= main_~i~0 1)} is VALID [2020-07-18 06:38:42,713 INFO L280 TraceCheckUtils]: 16: Hoare triple {3180#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3180#(<= main_~i~0 1)} is VALID [2020-07-18 06:38:42,714 INFO L280 TraceCheckUtils]: 17: Hoare triple {3180#(<= main_~i~0 1)} ~j~0 := ~i~0 + ~j~0; {3180#(<= main_~i~0 1)} is VALID [2020-07-18 06:38:42,714 INFO L280 TraceCheckUtils]: 18: Hoare triple {3180#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3180#(<= main_~i~0 1)} is VALID [2020-07-18 06:38:42,714 INFO L280 TraceCheckUtils]: 19: Hoare triple {3180#(<= main_~i~0 1)} ~j~0 := ~i~0 + ~j~0; {3180#(<= main_~i~0 1)} is VALID [2020-07-18 06:38:42,715 INFO L280 TraceCheckUtils]: 20: Hoare triple {3180#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3180#(<= main_~i~0 1)} is VALID [2020-07-18 06:38:42,715 INFO L280 TraceCheckUtils]: 21: Hoare triple {3180#(<= main_~i~0 1)} ~j~0 := ~i~0 + ~j~0; {3180#(<= main_~i~0 1)} is VALID [2020-07-18 06:38:42,715 INFO L280 TraceCheckUtils]: 22: Hoare triple {3180#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3180#(<= main_~i~0 1)} is VALID [2020-07-18 06:38:42,716 INFO L280 TraceCheckUtils]: 23: Hoare triple {3180#(<= main_~i~0 1)} ~j~0 := ~i~0 + ~j~0; {3180#(<= main_~i~0 1)} is VALID [2020-07-18 06:38:42,716 INFO L280 TraceCheckUtils]: 24: Hoare triple {3180#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3180#(<= main_~i~0 1)} is VALID [2020-07-18 06:38:42,717 INFO L280 TraceCheckUtils]: 25: Hoare triple {3180#(<= main_~i~0 1)} ~j~0 := ~i~0 + ~j~0; {3180#(<= main_~i~0 1)} is VALID [2020-07-18 06:38:42,717 INFO L280 TraceCheckUtils]: 26: Hoare triple {3180#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3180#(<= main_~i~0 1)} is VALID [2020-07-18 06:38:42,717 INFO L280 TraceCheckUtils]: 27: Hoare triple {3180#(<= main_~i~0 1)} ~j~0 := ~i~0 + ~j~0; {3180#(<= main_~i~0 1)} is VALID [2020-07-18 06:38:42,718 INFO L280 TraceCheckUtils]: 28: Hoare triple {3180#(<= main_~i~0 1)} assume !!(~j~0 < 20); {3180#(<= main_~i~0 1)} is VALID [2020-07-18 06:38:42,718 INFO L280 TraceCheckUtils]: 29: Hoare triple {3180#(<= main_~i~0 1)} ~j~0 := ~i~0 + ~j~0; {3180#(<= main_~i~0 1)} is VALID [2020-07-18 06:38:42,718 INFO L280 TraceCheckUtils]: 30: Hoare triple {3180#(<= main_~i~0 1)} assume !(~j~0 < 20); {3180#(<= main_~i~0 1)} is VALID [2020-07-18 06:38:42,719 INFO L280 TraceCheckUtils]: 31: Hoare triple {3180#(<= main_~i~0 1)} ~k~0 := 4; {3180#(<= main_~i~0 1)} is VALID [2020-07-18 06:38:42,719 INFO L280 TraceCheckUtils]: 32: Hoare triple {3180#(<= main_~i~0 1)} assume !(~k~0 <= 3); {3180#(<= main_~i~0 1)} is VALID [2020-07-18 06:38:42,720 INFO L280 TraceCheckUtils]: 33: Hoare triple {3180#(<= main_~i~0 1)} assume !!(~i~0 <= 100); {3180#(<= main_~i~0 1)} is VALID [2020-07-18 06:38:42,720 INFO L280 TraceCheckUtils]: 34: Hoare triple {3180#(<= main_~i~0 1)} ~i~0 := 1 + ~i~0; {3181#(<= main_~i~0 2)} is VALID [2020-07-18 06:38:42,723 INFO L280 TraceCheckUtils]: 35: Hoare triple {3181#(<= main_~i~0 2)} assume !(~j~0 < 20); {3181#(<= main_~i~0 2)} is VALID [2020-07-18 06:38:42,730 INFO L280 TraceCheckUtils]: 36: Hoare triple {3181#(<= main_~i~0 2)} ~k~0 := 4; {3181#(<= main_~i~0 2)} is VALID [2020-07-18 06:38:42,731 INFO L280 TraceCheckUtils]: 37: Hoare triple {3181#(<= main_~i~0 2)} assume !(~k~0 <= 3); {3181#(<= main_~i~0 2)} is VALID [2020-07-18 06:38:42,734 INFO L280 TraceCheckUtils]: 38: Hoare triple {3181#(<= main_~i~0 2)} assume !(~i~0 <= 100); {3176#false} is VALID [2020-07-18 06:38:42,735 INFO L263 TraceCheckUtils]: 39: Hoare triple {3176#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {3176#false} is VALID [2020-07-18 06:38:42,735 INFO L280 TraceCheckUtils]: 40: Hoare triple {3176#false} ~cond := #in~cond; {3176#false} is VALID [2020-07-18 06:38:42,735 INFO L280 TraceCheckUtils]: 41: Hoare triple {3176#false} assume 0 == ~cond; {3176#false} is VALID [2020-07-18 06:38:42,735 INFO L280 TraceCheckUtils]: 42: Hoare triple {3176#false} assume !false; {3176#false} is VALID [2020-07-18 06:38:42,737 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2020-07-18 06:38:42,737 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1344337643] [2020-07-18 06:38:42,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:38:42,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-07-18 06:38:42,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325844253] [2020-07-18 06:38:42,738 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2020-07-18 06:38:42,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:38:42,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 06:38:42,764 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 06:38:42,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 06:38:42,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:38:42,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 06:38:42,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-18 06:38:42,766 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2020-07-18 06:38:42,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:42,957 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2020-07-18 06:38:42,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 06:38:42,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2020-07-18 06:38:42,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:38:42,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 06:38:42,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2020-07-18 06:38:42,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 06:38:42,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2020-07-18 06:38:42,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 49 transitions. [2020-07-18 06:38:43,029 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 06:38:43,030 INFO L225 Difference]: With dead ends: 60 [2020-07-18 06:38:43,030 INFO L226 Difference]: Without dead ends: 55 [2020-07-18 06:38:43,031 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 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 06:38:43,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-18 06:38:43,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2020-07-18 06:38:43,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:38:43,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 54 states. [2020-07-18 06:38:43,150 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 54 states. [2020-07-18 06:38:43,150 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 54 states. [2020-07-18 06:38:43,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:43,152 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2020-07-18 06:38:43,152 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2020-07-18 06:38:43,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:43,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:43,153 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 55 states. [2020-07-18 06:38:43,153 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 55 states. [2020-07-18 06:38:43,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:43,154 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2020-07-18 06:38:43,154 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2020-07-18 06:38:43,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:43,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:43,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:38:43,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:38:43,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-18 06:38:43,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2020-07-18 06:38:43,156 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 43 [2020-07-18 06:38:43,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:38:43,156 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2020-07-18 06:38:43,156 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 06:38:43,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states and 60 transitions. [2020-07-18 06:38:43,239 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 06:38:43,239 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2020-07-18 06:38:43,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-18 06:38:43,240 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:38:43,240 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 06:38:43,240 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-18 06:38:43,240 INFO L427 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:38:43,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:38:43,241 INFO L82 PathProgramCache]: Analyzing trace with hash -135810616, now seen corresponding path program 11 times [2020-07-18 06:38:43,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:38:43,241 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [264291822] [2020-07-18 06:38:43,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:38:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:43,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:38:43,313 INFO L280 TraceCheckUtils]: 0: Hoare triple {3522#true} assume true; {3522#true} is VALID [2020-07-18 06:38:43,313 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3522#true} {3522#true} #74#return; {3522#true} is VALID [2020-07-18 06:38:43,313 INFO L263 TraceCheckUtils]: 0: Hoare triple {3522#true} call ULTIMATE.init(); {3522#true} is VALID [2020-07-18 06:38:43,314 INFO L280 TraceCheckUtils]: 1: Hoare triple {3522#true} assume true; {3522#true} is VALID [2020-07-18 06:38:43,314 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3522#true} {3522#true} #74#return; {3522#true} is VALID [2020-07-18 06:38:43,314 INFO L263 TraceCheckUtils]: 3: Hoare triple {3522#true} call #t~ret0 := main(); {3522#true} is VALID [2020-07-18 06:38:43,314 INFO L280 TraceCheckUtils]: 4: Hoare triple {3522#true} havoc ~i~0; {3522#true} is VALID [2020-07-18 06:38:43,314 INFO L280 TraceCheckUtils]: 5: Hoare triple {3522#true} havoc ~j~0; {3522#true} is VALID [2020-07-18 06:38:43,315 INFO L280 TraceCheckUtils]: 6: Hoare triple {3522#true} havoc ~k~0; {3522#true} is VALID [2020-07-18 06:38:43,315 INFO L280 TraceCheckUtils]: 7: Hoare triple {3522#true} ~i~0 := 0; {3522#true} is VALID [2020-07-18 06:38:43,315 INFO L280 TraceCheckUtils]: 8: Hoare triple {3522#true} ~k~0 := 9; {3522#true} is VALID [2020-07-18 06:38:43,315 INFO L280 TraceCheckUtils]: 9: Hoare triple {3522#true} ~j~0 := -100; {3522#true} is VALID [2020-07-18 06:38:43,315 INFO L280 TraceCheckUtils]: 10: Hoare triple {3522#true} assume !!(~i~0 <= 100); {3522#true} is VALID [2020-07-18 06:38:43,316 INFO L280 TraceCheckUtils]: 11: Hoare triple {3522#true} ~i~0 := 1 + ~i~0; {3522#true} is VALID [2020-07-18 06:38:43,316 INFO L280 TraceCheckUtils]: 12: Hoare triple {3522#true} assume !!(~j~0 < 20); {3522#true} is VALID [2020-07-18 06:38:43,316 INFO L280 TraceCheckUtils]: 13: Hoare triple {3522#true} ~j~0 := ~i~0 + ~j~0; {3522#true} is VALID [2020-07-18 06:38:43,316 INFO L280 TraceCheckUtils]: 14: Hoare triple {3522#true} assume !!(~j~0 < 20); {3522#true} is VALID [2020-07-18 06:38:43,316 INFO L280 TraceCheckUtils]: 15: Hoare triple {3522#true} ~j~0 := ~i~0 + ~j~0; {3522#true} is VALID [2020-07-18 06:38:43,316 INFO L280 TraceCheckUtils]: 16: Hoare triple {3522#true} assume !!(~j~0 < 20); {3522#true} is VALID [2020-07-18 06:38:43,317 INFO L280 TraceCheckUtils]: 17: Hoare triple {3522#true} ~j~0 := ~i~0 + ~j~0; {3522#true} is VALID [2020-07-18 06:38:43,317 INFO L280 TraceCheckUtils]: 18: Hoare triple {3522#true} assume !!(~j~0 < 20); {3522#true} is VALID [2020-07-18 06:38:43,317 INFO L280 TraceCheckUtils]: 19: Hoare triple {3522#true} ~j~0 := ~i~0 + ~j~0; {3522#true} is VALID [2020-07-18 06:38:43,317 INFO L280 TraceCheckUtils]: 20: Hoare triple {3522#true} assume !!(~j~0 < 20); {3522#true} is VALID [2020-07-18 06:38:43,317 INFO L280 TraceCheckUtils]: 21: Hoare triple {3522#true} ~j~0 := ~i~0 + ~j~0; {3522#true} is VALID [2020-07-18 06:38:43,318 INFO L280 TraceCheckUtils]: 22: Hoare triple {3522#true} assume !!(~j~0 < 20); {3522#true} is VALID [2020-07-18 06:38:43,318 INFO L280 TraceCheckUtils]: 23: Hoare triple {3522#true} ~j~0 := ~i~0 + ~j~0; {3522#true} is VALID [2020-07-18 06:38:43,318 INFO L280 TraceCheckUtils]: 24: Hoare triple {3522#true} assume !!(~j~0 < 20); {3522#true} is VALID [2020-07-18 06:38:43,318 INFO L280 TraceCheckUtils]: 25: Hoare triple {3522#true} ~j~0 := ~i~0 + ~j~0; {3522#true} is VALID [2020-07-18 06:38:43,318 INFO L280 TraceCheckUtils]: 26: Hoare triple {3522#true} assume !!(~j~0 < 20); {3522#true} is VALID [2020-07-18 06:38:43,318 INFO L280 TraceCheckUtils]: 27: Hoare triple {3522#true} ~j~0 := ~i~0 + ~j~0; {3522#true} is VALID [2020-07-18 06:38:43,319 INFO L280 TraceCheckUtils]: 28: Hoare triple {3522#true} assume !!(~j~0 < 20); {3522#true} is VALID [2020-07-18 06:38:43,319 INFO L280 TraceCheckUtils]: 29: Hoare triple {3522#true} ~j~0 := ~i~0 + ~j~0; {3522#true} is VALID [2020-07-18 06:38:43,319 INFO L280 TraceCheckUtils]: 30: Hoare triple {3522#true} assume !(~j~0 < 20); {3522#true} is VALID [2020-07-18 06:38:43,319 INFO L280 TraceCheckUtils]: 31: Hoare triple {3522#true} ~k~0 := 4; {3522#true} is VALID [2020-07-18 06:38:43,319 INFO L280 TraceCheckUtils]: 32: Hoare triple {3522#true} assume !(~k~0 <= 3); {3522#true} is VALID [2020-07-18 06:38:43,319 INFO L280 TraceCheckUtils]: 33: Hoare triple {3522#true} assume !!(~i~0 <= 100); {3522#true} is VALID [2020-07-18 06:38:43,320 INFO L280 TraceCheckUtils]: 34: Hoare triple {3522#true} ~i~0 := 1 + ~i~0; {3522#true} is VALID [2020-07-18 06:38:43,320 INFO L280 TraceCheckUtils]: 35: Hoare triple {3522#true} assume !(~j~0 < 20); {3522#true} is VALID [2020-07-18 06:38:43,320 INFO L280 TraceCheckUtils]: 36: Hoare triple {3522#true} ~k~0 := 4; {3522#true} is VALID [2020-07-18 06:38:43,320 INFO L280 TraceCheckUtils]: 37: Hoare triple {3522#true} assume !(~k~0 <= 3); {3522#true} is VALID [2020-07-18 06:38:43,320 INFO L280 TraceCheckUtils]: 38: Hoare triple {3522#true} assume !!(~i~0 <= 100); {3522#true} is VALID [2020-07-18 06:38:43,320 INFO L280 TraceCheckUtils]: 39: Hoare triple {3522#true} ~i~0 := 1 + ~i~0; {3522#true} is VALID [2020-07-18 06:38:43,321 INFO L280 TraceCheckUtils]: 40: Hoare triple {3522#true} assume !(~j~0 < 20); {3522#true} is VALID [2020-07-18 06:38:43,321 INFO L280 TraceCheckUtils]: 41: Hoare triple {3522#true} ~k~0 := 4; {3526#(= 4 main_~k~0)} is VALID [2020-07-18 06:38:43,322 INFO L280 TraceCheckUtils]: 42: Hoare triple {3526#(= 4 main_~k~0)} assume !(~k~0 <= 3); {3526#(= 4 main_~k~0)} is VALID [2020-07-18 06:38:43,322 INFO L280 TraceCheckUtils]: 43: Hoare triple {3526#(= 4 main_~k~0)} assume !(~i~0 <= 100); {3526#(= 4 main_~k~0)} is VALID [2020-07-18 06:38:43,323 INFO L263 TraceCheckUtils]: 44: Hoare triple {3526#(= 4 main_~k~0)} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {3527#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 06:38:43,324 INFO L280 TraceCheckUtils]: 45: Hoare triple {3527#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {3528#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 06:38:43,324 INFO L280 TraceCheckUtils]: 46: Hoare triple {3528#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {3523#false} is VALID [2020-07-18 06:38:43,324 INFO L280 TraceCheckUtils]: 47: Hoare triple {3523#false} assume !false; {3523#false} is VALID [2020-07-18 06:38:43,326 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2020-07-18 06:38:43,326 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [264291822] [2020-07-18 06:38:43,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 06:38:43,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 06:38:43,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967737180] [2020-07-18 06:38:43,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2020-07-18 06:38:43,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:38:43,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 06:38:43,364 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 06:38:43,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 06:38:43,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:38:43,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 06:38:43,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 06:38:43,366 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 5 states. [2020-07-18 06:38:43,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:43,581 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2020-07-18 06:38:43,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 06:38:43,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2020-07-18 06:38:43,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:38:43,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 06:38:43,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2020-07-18 06:38:43,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 06:38:43,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2020-07-18 06:38:43,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2020-07-18 06:38:43,626 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 06:38:43,627 INFO L225 Difference]: With dead ends: 71 [2020-07-18 06:38:43,627 INFO L226 Difference]: Without dead ends: 0 [2020-07-18 06:38:43,628 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 06:38:43,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-18 06:38:43,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-18 06:38:43,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:38:43,629 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-18 06:38:43,629 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 06:38:43,629 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 06:38:43,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:43,631 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 06:38:43,631 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 06:38:43,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:43,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:43,632 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 06:38:43,632 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 06:38:43,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:38:43,632 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 06:38:43,632 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 06:38:43,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:43,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:38:43,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:38:43,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:38:43,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-18 06:38:43,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-18 06:38:43,634 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2020-07-18 06:38:43,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:38:43,634 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-18 06:38:43,634 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 06:38:43,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-18 06:38:43,635 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 06:38:43,635 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 06:38:43,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:38:43,635 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-18 06:38:43,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-18 06:38:44,049 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-18 06:38:44,050 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-18 06:38:44,050 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-18 06:38:44,050 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 06:38:44,050 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-18 06:38:44,050 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-18 06:38:44,050 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-18 06:38:44,050 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-18 06:38:44,051 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-18 06:38:44,051 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-18 06:38:44,051 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-18 06:38:44,051 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: false [2020-07-18 06:38:44,051 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 30) the Hoare annotation is: true [2020-07-18 06:38:44,051 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 06:38:44,051 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 06:38:44,052 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (<= main_~i~0 0) [2020-07-18 06:38:44,052 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-18 06:38:44,052 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 30) the Hoare annotation is: true [2020-07-18 06:38:44,052 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 30) the Hoare annotation is: true [2020-07-18 06:38:44,052 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-07-18 06:38:44,053 INFO L264 CegarLoopResult]: At program point L24-2(lines 24 26) the Hoare annotation is: (= 4 main_~k~0) [2020-07-18 06:38:44,053 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 06:38:44,053 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 06:38:44,053 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 06:38:44,053 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (<= main_~i~0 0) [2020-07-18 06:38:44,053 INFO L264 CegarLoopResult]: At program point L18-2(lines 18 27) the Hoare annotation is: (= 4 main_~k~0) [2020-07-18 06:38:44,054 INFO L271 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-07-18 06:38:44,055 INFO L271 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: true [2020-07-18 06:38:44,055 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-18 06:38:44,055 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: true [2020-07-18 06:38:44,055 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-18 06:38:44,056 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 06:38:44,056 INFO L271 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: true [2020-07-18 06:38:44,056 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-18 06:38:44,061 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-18 06:38:44,064 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-18 06:38:44,064 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-18 06:38:44,065 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-18 06:38:44,065 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-18 06:38:44,073 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 06:38:44,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 06:38:44 BoogieIcfgContainer [2020-07-18 06:38:44,097 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 06:38:44,101 INFO L168 Benchmark]: Toolchain (without parser) took 10547.07 ms. Allocated memory was 145.2 MB in the beginning and 327.2 MB in the end (delta: 181.9 MB). Free memory was 103.7 MB in the beginning and 123.4 MB in the end (delta: -19.7 MB). Peak memory consumption was 162.2 MB. Max. memory is 7.1 GB. [2020-07-18 06:38:44,102 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 145.2 MB. Free memory is still 121.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-18 06:38:44,102 INFO L168 Benchmark]: CACSL2BoogieTranslator took 226.69 ms. Allocated memory is still 145.2 MB. Free memory was 103.3 MB in the beginning and 93.7 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-18 06:38:44,103 INFO L168 Benchmark]: Boogie Preprocessor took 33.99 ms. Allocated memory is still 145.2 MB. Free memory was 93.7 MB in the beginning and 92.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-07-18 06:38:44,109 INFO L168 Benchmark]: RCFGBuilder took 417.29 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 92.4 MB in the beginning and 165.0 MB in the end (delta: -72.6 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-18 06:38:44,110 INFO L168 Benchmark]: TraceAbstraction took 9861.97 ms. Allocated memory was 203.4 MB in the beginning and 327.2 MB in the end (delta: 123.7 MB). Free memory was 165.0 MB in the beginning and 123.4 MB in the end (delta: 41.6 MB). Peak memory consumption was 165.3 MB. Max. memory is 7.1 GB. [2020-07-18 06:38:44,121 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.16 ms. Allocated memory is still 145.2 MB. Free memory is still 121.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 226.69 ms. Allocated memory is still 145.2 MB. Free memory was 103.3 MB in the beginning and 93.7 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.99 ms. Allocated memory is still 145.2 MB. Free memory was 93.7 MB in the beginning and 92.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 417.29 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 92.4 MB in the beginning and 165.0 MB in the end (delta: -72.6 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9861.97 ms. Allocated memory was 203.4 MB in the beginning and 327.2 MB in the end (delta: 123.7 MB). Free memory was 165.0 MB in the beginning and 123.4 MB in the end (delta: 41.6 MB). Peak memory consumption was 165.3 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: 9.3s, OverallIterations: 14, TraceHistogramMax: 9, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 302 SDtfs, 133 SDslu, 1052 SDs, 0 SdLazy, 556 SolverSat, 80 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 169 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 113 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, 5866 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 29 FomulaSimplificationsInter, 223 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 435 NumberOfCodeBlocks, 435 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 421 ConstructedInterpolants, 0 QuantifiedInterpolants, 40351 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 291/513 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...