/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/loops/sum01_bug02.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 06:34:11,097 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 06:34:11,101 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 06:34:11,120 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 06:34:11,121 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 06:34:11,122 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 06:34:11,124 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 06:34:11,134 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 06:34:11,136 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 06:34:11,140 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 06:34:11,141 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 06:34:11,143 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 06:34:11,145 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 06:34:11,148 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 06:34:11,149 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 06:34:11,150 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 06:34:11,151 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 06:34:11,156 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 06:34:11,159 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 06:34:11,161 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 06:34:11,165 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 06:34:11,168 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 06:34:11,169 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 06:34:11,170 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 06:34:11,175 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 06:34:11,175 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 06:34:11,175 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 06:34:11,178 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 06:34:11,179 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 06:34:11,181 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 06:34:11,181 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 06:34:11,182 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 06:34:11,184 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 06:34:11,185 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 06:34:11,189 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 06:34:11,189 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 06:34:11,190 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 06:34:11,190 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 06:34:11,190 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 06:34:11,191 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 06:34:11,192 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 06:34:11,193 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:34:11,210 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 06:34:11,210 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 06:34:11,213 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 06:34:11,213 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 06:34:11,213 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 06:34:11,213 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 06:34:11,214 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 06:34:11,214 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 06:34:11,215 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 06:34:11,215 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 06:34:11,216 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 06:34:11,216 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 06:34:11,217 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 06:34:11,217 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 06:34:11,217 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 06:34:11,218 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 06:34:11,218 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 06:34:11,218 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 06:34:11,218 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 06:34:11,218 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 06:34:11,220 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 06:34:11,220 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 06:34:11,220 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:34:11,541 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 06:34:11,554 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 06:34:11,558 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 06:34:11,559 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 06:34:11,560 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 06:34:11,561 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01_bug02.i [2020-07-18 06:34:11,638 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd7ff0881/9cf3e93765074f369d6702821df568bf/FLAGb71da1b99 [2020-07-18 06:34:12,089 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 06:34:12,090 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02.i [2020-07-18 06:34:12,097 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd7ff0881/9cf3e93765074f369d6702821df568bf/FLAGb71da1b99 [2020-07-18 06:34:12,520 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd7ff0881/9cf3e93765074f369d6702821df568bf [2020-07-18 06:34:12,531 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 06:34:12,534 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 06:34:12,535 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 06:34:12,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 06:34:12,539 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 06:34:12,541 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 06:34:12" (1/1) ... [2020-07-18 06:34:12,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f43b073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:12, skipping insertion in model container [2020-07-18 06:34:12,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 06:34:12" (1/1) ... [2020-07-18 06:34:12,552 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 06:34:12,568 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 06:34:12,741 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 06:34:12,746 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 06:34:12,763 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 06:34:12,779 INFO L208 MainTranslator]: Completed translation [2020-07-18 06:34:12,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:12 WrapperNode [2020-07-18 06:34:12,780 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 06:34:12,781 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 06:34:12,781 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 06:34:12,781 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 06:34:12,794 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:12" (1/1) ... [2020-07-18 06:34:12,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:12" (1/1) ... [2020-07-18 06:34:12,886 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:12" (1/1) ... [2020-07-18 06:34:12,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:12" (1/1) ... [2020-07-18 06:34:12,894 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:12" (1/1) ... [2020-07-18 06:34:12,900 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:12" (1/1) ... [2020-07-18 06:34:12,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:12" (1/1) ... [2020-07-18 06:34:12,903 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 06:34:12,904 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 06:34:12,904 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 06:34:12,904 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 06:34:12,905 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:12" (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:34:12,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 06:34:12,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 06:34:12,976 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 06:34:12,976 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 06:34:12,976 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 06:34:12,976 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 06:34:12,976 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-07-18 06:34:12,976 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 06:34:12,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 06:34:12,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 06:34:13,235 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 06:34:13,235 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-18 06:34:13,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 06:34:13 BoogieIcfgContainer [2020-07-18 06:34:13,240 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 06:34:13,241 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 06:34:13,241 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 06:34:13,246 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 06:34:13,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 06:34:12" (1/3) ... [2020-07-18 06:34:13,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@789640d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 06:34:13, skipping insertion in model container [2020-07-18 06:34:13,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:12" (2/3) ... [2020-07-18 06:34:13,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@789640d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 06:34:13, skipping insertion in model container [2020-07-18 06:34:13,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 06:34:13" (3/3) ... [2020-07-18 06:34:13,251 INFO L109 eAbstractionObserver]: Analyzing ICFG sum01_bug02.i [2020-07-18 06:34:13,266 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 06:34:13,273 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 06:34:13,290 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 06:34:13,313 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 06:34:13,313 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 06:34:13,313 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-18 06:34:13,313 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 06:34:13,314 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 06:34:13,314 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 06:34:13,314 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 06:34:13,314 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 06:34:13,330 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-07-18 06:34:13,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-18 06:34:13,351 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:13,352 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:34:13,353 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:13,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:13,361 INFO L82 PathProgramCache]: Analyzing trace with hash 79158399, now seen corresponding path program 1 times [2020-07-18 06:34:13,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:13,373 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1497406346] [2020-07-18 06:34:13,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:13,550 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#true} assume true; {33#true} is VALID [2020-07-18 06:34:13,551 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {33#true} {33#true} #49#return; {33#true} is VALID [2020-07-18 06:34:13,554 INFO L263 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2020-07-18 06:34:13,555 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2020-07-18 06:34:13,556 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #49#return; {33#true} is VALID [2020-07-18 06:34:13,558 INFO L263 TraceCheckUtils]: 3: Hoare triple {33#true} call #t~ret3 := main(); {33#true} is VALID [2020-07-18 06:34:13,559 INFO L280 TraceCheckUtils]: 4: Hoare triple {33#true} havoc ~i~0; {33#true} is VALID [2020-07-18 06:34:13,559 INFO L280 TraceCheckUtils]: 5: Hoare triple {33#true} ~j~0 := 10; {33#true} is VALID [2020-07-18 06:34:13,560 INFO L280 TraceCheckUtils]: 6: Hoare triple {33#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {33#true} is VALID [2020-07-18 06:34:13,561 INFO L280 TraceCheckUtils]: 7: Hoare triple {33#true} havoc #t~nondet0; {33#true} is VALID [2020-07-18 06:34:13,561 INFO L280 TraceCheckUtils]: 8: Hoare triple {33#true} ~sn~0 := 0; {33#true} is VALID [2020-07-18 06:34:13,561 INFO L280 TraceCheckUtils]: 9: Hoare triple {33#true} ~i~0 := 1; {33#true} is VALID [2020-07-18 06:34:13,564 INFO L280 TraceCheckUtils]: 10: Hoare triple {33#true} assume !true; {34#false} is VALID [2020-07-18 06:34:13,564 INFO L263 TraceCheckUtils]: 11: Hoare triple {34#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {34#false} is VALID [2020-07-18 06:34:13,565 INFO L280 TraceCheckUtils]: 12: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2020-07-18 06:34:13,565 INFO L280 TraceCheckUtils]: 13: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2020-07-18 06:34:13,566 INFO L280 TraceCheckUtils]: 14: Hoare triple {34#false} assume !false; {34#false} is VALID [2020-07-18 06:34:13,568 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:34:13,569 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1497406346] [2020-07-18 06:34:13,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 06:34:13,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-18 06:34:13,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281123221] [2020-07-18 06:34:13,583 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2020-07-18 06:34:13,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:34:13,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-18 06:34:13,633 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:34:13,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-18 06:34:13,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:34:13,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-18 06:34:13,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-18 06:34:13,647 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2020-07-18 06:34:13,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:13,757 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2020-07-18 06:34:13,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-18 06:34:13,757 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2020-07-18 06:34:13,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:34:13,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-18 06:34:13,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2020-07-18 06:34:13,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-18 06:34:13,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2020-07-18 06:34:13,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 45 transitions. [2020-07-18 06:34:13,852 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:34:13,864 INFO L225 Difference]: With dead ends: 41 [2020-07-18 06:34:13,865 INFO L226 Difference]: Without dead ends: 24 [2020-07-18 06:34:13,869 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:34:13,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-18 06:34:13,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-18 06:34:13,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:34:13,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2020-07-18 06:34:13,929 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-18 06:34:13,929 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-18 06:34:13,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:13,934 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-18 06:34:13,934 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-18 06:34:13,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:13,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:13,935 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-18 06:34:13,935 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-18 06:34:13,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:13,940 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-18 06:34:13,940 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-18 06:34:13,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:13,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:13,941 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:34:13,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:34:13,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-18 06:34:13,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2020-07-18 06:34:13,946 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 15 [2020-07-18 06:34:13,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:34:13,947 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-07-18 06:34:13,947 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-18 06:34:13,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 25 transitions. [2020-07-18 06:34:13,986 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:34:13,986 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-18 06:34:13,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-18 06:34:13,987 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:13,987 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:34:13,988 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 06:34:13,988 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:13,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:13,988 INFO L82 PathProgramCache]: Analyzing trace with hash 62535021, now seen corresponding path program 1 times [2020-07-18 06:34:13,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:13,989 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1252332356] [2020-07-18 06:34:13,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:14,092 INFO L280 TraceCheckUtils]: 0: Hoare triple {217#true} assume true; {217#true} is VALID [2020-07-18 06:34:14,093 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {217#true} {217#true} #49#return; {217#true} is VALID [2020-07-18 06:34:14,093 INFO L263 TraceCheckUtils]: 0: Hoare triple {217#true} call ULTIMATE.init(); {217#true} is VALID [2020-07-18 06:34:14,094 INFO L280 TraceCheckUtils]: 1: Hoare triple {217#true} assume true; {217#true} is VALID [2020-07-18 06:34:14,094 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {217#true} {217#true} #49#return; {217#true} is VALID [2020-07-18 06:34:14,094 INFO L263 TraceCheckUtils]: 3: Hoare triple {217#true} call #t~ret3 := main(); {217#true} is VALID [2020-07-18 06:34:14,095 INFO L280 TraceCheckUtils]: 4: Hoare triple {217#true} havoc ~i~0; {217#true} is VALID [2020-07-18 06:34:14,095 INFO L280 TraceCheckUtils]: 5: Hoare triple {217#true} ~j~0 := 10; {217#true} is VALID [2020-07-18 06:34:14,095 INFO L280 TraceCheckUtils]: 6: Hoare triple {217#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {217#true} is VALID [2020-07-18 06:34:14,096 INFO L280 TraceCheckUtils]: 7: Hoare triple {217#true} havoc #t~nondet0; {217#true} is VALID [2020-07-18 06:34:14,097 INFO L280 TraceCheckUtils]: 8: Hoare triple {217#true} ~sn~0 := 0; {221#(= 0 main_~sn~0)} is VALID [2020-07-18 06:34:14,098 INFO L280 TraceCheckUtils]: 9: Hoare triple {221#(= 0 main_~sn~0)} ~i~0 := 1; {221#(= 0 main_~sn~0)} is VALID [2020-07-18 06:34:14,099 INFO L280 TraceCheckUtils]: 10: Hoare triple {221#(= 0 main_~sn~0)} assume !(~i~0 <= ~n~0); {221#(= 0 main_~sn~0)} is VALID [2020-07-18 06:34:14,101 INFO L263 TraceCheckUtils]: 11: Hoare triple {221#(= 0 main_~sn~0)} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {222#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 06:34:14,102 INFO L280 TraceCheckUtils]: 12: Hoare triple {222#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {223#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 06:34:14,103 INFO L280 TraceCheckUtils]: 13: Hoare triple {223#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {218#false} is VALID [2020-07-18 06:34:14,103 INFO L280 TraceCheckUtils]: 14: Hoare triple {218#false} assume !false; {218#false} is VALID [2020-07-18 06:34:14,105 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:34:14,105 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1252332356] [2020-07-18 06:34:14,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 06:34:14,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 06:34:14,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276662822] [2020-07-18 06:34:14,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-18 06:34:14,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:34:14,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 06:34:14,131 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:34:14,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 06:34:14,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:34:14,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 06:34:14,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 06:34:14,132 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 5 states. [2020-07-18 06:34:14,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:14,318 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2020-07-18 06:34:14,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 06:34:14,318 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-18 06:34:14,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:34:14,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 06:34:14,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-18 06:34:14,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 06:34:14,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-18 06:34:14,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2020-07-18 06:34:14,379 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:34:14,381 INFO L225 Difference]: With dead ends: 38 [2020-07-18 06:34:14,381 INFO L226 Difference]: Without dead ends: 33 [2020-07-18 06:34:14,383 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:34:14,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-18 06:34:14,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2020-07-18 06:34:14,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:34:14,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 32 states. [2020-07-18 06:34:14,410 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 32 states. [2020-07-18 06:34:14,410 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 32 states. [2020-07-18 06:34:14,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:14,414 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2020-07-18 06:34:14,414 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2020-07-18 06:34:14,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:14,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:14,415 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 33 states. [2020-07-18 06:34:14,415 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 33 states. [2020-07-18 06:34:14,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:14,418 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2020-07-18 06:34:14,419 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2020-07-18 06:34:14,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:14,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:14,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:34:14,420 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:34:14,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-18 06:34:14,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2020-07-18 06:34:14,423 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 15 [2020-07-18 06:34:14,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:34:14,423 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2020-07-18 06:34:14,423 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 06:34:14,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 34 transitions. [2020-07-18 06:34:14,467 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:14,467 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-18 06:34:14,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-18 06:34:14,468 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:14,468 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:34:14,469 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 06:34:14,469 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:14,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:14,469 INFO L82 PathProgramCache]: Analyzing trace with hash 268436001, now seen corresponding path program 1 times [2020-07-18 06:34:14,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:14,470 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1915214123] [2020-07-18 06:34:14,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:14,880 INFO L280 TraceCheckUtils]: 0: Hoare triple {434#true} assume true; {434#true} is VALID [2020-07-18 06:34:14,880 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {434#true} {434#true} #49#return; {434#true} is VALID [2020-07-18 06:34:14,881 INFO L263 TraceCheckUtils]: 0: Hoare triple {434#true} call ULTIMATE.init(); {434#true} is VALID [2020-07-18 06:34:14,881 INFO L280 TraceCheckUtils]: 1: Hoare triple {434#true} assume true; {434#true} is VALID [2020-07-18 06:34:14,881 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {434#true} {434#true} #49#return; {434#true} is VALID [2020-07-18 06:34:14,882 INFO L263 TraceCheckUtils]: 3: Hoare triple {434#true} call #t~ret3 := main(); {434#true} is VALID [2020-07-18 06:34:14,882 INFO L280 TraceCheckUtils]: 4: Hoare triple {434#true} havoc ~i~0; {434#true} is VALID [2020-07-18 06:34:14,882 INFO L280 TraceCheckUtils]: 5: Hoare triple {434#true} ~j~0 := 10; {434#true} is VALID [2020-07-18 06:34:14,883 INFO L280 TraceCheckUtils]: 6: Hoare triple {434#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {434#true} is VALID [2020-07-18 06:34:14,883 INFO L280 TraceCheckUtils]: 7: Hoare triple {434#true} havoc #t~nondet0; {434#true} is VALID [2020-07-18 06:34:14,884 INFO L280 TraceCheckUtils]: 8: Hoare triple {434#true} ~sn~0 := 0; {438#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-18 06:34:14,886 INFO L280 TraceCheckUtils]: 9: Hoare triple {438#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} ~i~0 := 1; {439#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-18 06:34:14,889 INFO L280 TraceCheckUtils]: 10: Hoare triple {439#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {440#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-18 06:34:14,890 INFO L280 TraceCheckUtils]: 11: Hoare triple {440#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume ~i~0 < ~j~0; {440#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-18 06:34:14,893 INFO L280 TraceCheckUtils]: 12: Hoare triple {440#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} ~sn~0 := 2 + ~sn~0; {441#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} is VALID [2020-07-18 06:34:14,894 INFO L280 TraceCheckUtils]: 13: Hoare triple {441#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} #t~post2 := ~j~0; {441#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} is VALID [2020-07-18 06:34:14,896 INFO L280 TraceCheckUtils]: 14: Hoare triple {441#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} ~j~0 := #t~post2 - 1; {441#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} is VALID [2020-07-18 06:34:14,898 INFO L280 TraceCheckUtils]: 15: Hoare triple {441#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} havoc #t~post2; {441#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} is VALID [2020-07-18 06:34:14,899 INFO L280 TraceCheckUtils]: 16: Hoare triple {441#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} #t~post1 := ~i~0; {442#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 |main_#t~post1|) main_~sn~0)))} is VALID [2020-07-18 06:34:14,901 INFO L280 TraceCheckUtils]: 17: Hoare triple {442#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 |main_#t~post1|) main_~sn~0)))} ~i~0 := 1 + #t~post1; {443#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} is VALID [2020-07-18 06:34:14,902 INFO L280 TraceCheckUtils]: 18: Hoare triple {443#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} havoc #t~post1; {443#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} is VALID [2020-07-18 06:34:14,904 INFO L280 TraceCheckUtils]: 19: Hoare triple {443#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} assume !(~i~0 <= ~n~0); {444#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} is VALID [2020-07-18 06:34:14,906 INFO L263 TraceCheckUtils]: 20: Hoare triple {444#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {445#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 06:34:14,907 INFO L280 TraceCheckUtils]: 21: Hoare triple {445#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {446#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 06:34:14,908 INFO L280 TraceCheckUtils]: 22: Hoare triple {446#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {435#false} is VALID [2020-07-18 06:34:14,908 INFO L280 TraceCheckUtils]: 23: Hoare triple {435#false} assume !false; {435#false} is VALID [2020-07-18 06:34:14,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:34:14,912 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1915214123] [2020-07-18 06:34:14,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:34:14,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-18 06:34:14,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811431072] [2020-07-18 06:34:14,913 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-07-18 06:34:14,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:34:14,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-18 06:34:14,948 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:34:14,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-18 06:34:14,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:34:14,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-18 06:34:14,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-07-18 06:34:14,949 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 11 states. [2020-07-18 06:34:15,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:15,707 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2020-07-18 06:34:15,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-18 06:34:15,707 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-07-18 06:34:15,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:34:15,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 06:34:15,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 64 transitions. [2020-07-18 06:34:15,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 06:34:15,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 64 transitions. [2020-07-18 06:34:15,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 64 transitions. [2020-07-18 06:34:15,812 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:15,816 INFO L225 Difference]: With dead ends: 60 [2020-07-18 06:34:15,816 INFO L226 Difference]: Without dead ends: 55 [2020-07-18 06:34:15,817 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2020-07-18 06:34:15,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-18 06:34:15,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2020-07-18 06:34:15,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:34:15,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 42 states. [2020-07-18 06:34:15,903 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 42 states. [2020-07-18 06:34:15,903 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 42 states. [2020-07-18 06:34:15,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:15,907 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2020-07-18 06:34:15,907 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-07-18 06:34:15,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:15,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:15,909 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 55 states. [2020-07-18 06:34:15,909 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 55 states. [2020-07-18 06:34:15,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:15,913 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2020-07-18 06:34:15,913 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-07-18 06:34:15,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:15,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:15,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:34:15,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:34:15,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-18 06:34:15,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2020-07-18 06:34:15,917 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 24 [2020-07-18 06:34:15,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:34:15,917 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2020-07-18 06:34:15,917 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-18 06:34:15,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 45 transitions. [2020-07-18 06:34:15,986 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:34:15,987 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2020-07-18 06:34:15,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-18 06:34:15,988 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:15,988 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:34:15,988 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 06:34:15,989 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:15,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:15,989 INFO L82 PathProgramCache]: Analyzing trace with hash -635017609, now seen corresponding path program 1 times [2020-07-18 06:34:15,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:15,990 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1037577929] [2020-07-18 06:34:15,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:16,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:16,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:16,137 INFO L280 TraceCheckUtils]: 0: Hoare triple {773#true} assume true; {773#true} is VALID [2020-07-18 06:34:16,138 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {773#true} {773#true} #49#return; {773#true} is VALID [2020-07-18 06:34:16,138 INFO L263 TraceCheckUtils]: 0: Hoare triple {773#true} call ULTIMATE.init(); {773#true} is VALID [2020-07-18 06:34:16,139 INFO L280 TraceCheckUtils]: 1: Hoare triple {773#true} assume true; {773#true} is VALID [2020-07-18 06:34:16,139 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {773#true} {773#true} #49#return; {773#true} is VALID [2020-07-18 06:34:16,139 INFO L263 TraceCheckUtils]: 3: Hoare triple {773#true} call #t~ret3 := main(); {773#true} is VALID [2020-07-18 06:34:16,139 INFO L280 TraceCheckUtils]: 4: Hoare triple {773#true} havoc ~i~0; {773#true} is VALID [2020-07-18 06:34:16,143 INFO L280 TraceCheckUtils]: 5: Hoare triple {773#true} ~j~0 := 10; {777#(<= 10 main_~j~0)} is VALID [2020-07-18 06:34:16,143 INFO L280 TraceCheckUtils]: 6: Hoare triple {777#(<= 10 main_~j~0)} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {777#(<= 10 main_~j~0)} is VALID [2020-07-18 06:34:16,144 INFO L280 TraceCheckUtils]: 7: Hoare triple {777#(<= 10 main_~j~0)} havoc #t~nondet0; {777#(<= 10 main_~j~0)} is VALID [2020-07-18 06:34:16,145 INFO L280 TraceCheckUtils]: 8: Hoare triple {777#(<= 10 main_~j~0)} ~sn~0 := 0; {777#(<= 10 main_~j~0)} is VALID [2020-07-18 06:34:16,146 INFO L280 TraceCheckUtils]: 9: Hoare triple {777#(<= 10 main_~j~0)} ~i~0 := 1; {778#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-18 06:34:16,146 INFO L280 TraceCheckUtils]: 10: Hoare triple {778#(<= (+ main_~i~0 9) main_~j~0)} assume !!(~i~0 <= ~n~0); {778#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-18 06:34:16,147 INFO L280 TraceCheckUtils]: 11: Hoare triple {778#(<= (+ main_~i~0 9) main_~j~0)} assume ~i~0 < ~j~0; {778#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-18 06:34:16,148 INFO L280 TraceCheckUtils]: 12: Hoare triple {778#(<= (+ main_~i~0 9) main_~j~0)} ~sn~0 := 2 + ~sn~0; {778#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-18 06:34:16,149 INFO L280 TraceCheckUtils]: 13: Hoare triple {778#(<= (+ main_~i~0 9) main_~j~0)} #t~post2 := ~j~0; {779#(<= (+ main_~i~0 9) |main_#t~post2|)} is VALID [2020-07-18 06:34:16,150 INFO L280 TraceCheckUtils]: 14: Hoare triple {779#(<= (+ main_~i~0 9) |main_#t~post2|)} ~j~0 := #t~post2 - 1; {780#(<= (+ main_~i~0 8) main_~j~0)} is VALID [2020-07-18 06:34:16,151 INFO L280 TraceCheckUtils]: 15: Hoare triple {780#(<= (+ main_~i~0 8) main_~j~0)} havoc #t~post2; {780#(<= (+ main_~i~0 8) main_~j~0)} is VALID [2020-07-18 06:34:16,152 INFO L280 TraceCheckUtils]: 16: Hoare triple {780#(<= (+ main_~i~0 8) main_~j~0)} #t~post1 := ~i~0; {781#(<= (+ |main_#t~post1| 8) main_~j~0)} is VALID [2020-07-18 06:34:16,153 INFO L280 TraceCheckUtils]: 17: Hoare triple {781#(<= (+ |main_#t~post1| 8) main_~j~0)} ~i~0 := 1 + #t~post1; {782#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-18 06:34:16,154 INFO L280 TraceCheckUtils]: 18: Hoare triple {782#(<= (+ main_~i~0 7) main_~j~0)} havoc #t~post1; {782#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-18 06:34:16,154 INFO L280 TraceCheckUtils]: 19: Hoare triple {782#(<= (+ main_~i~0 7) main_~j~0)} assume !!(~i~0 <= ~n~0); {782#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-18 06:34:16,156 INFO L280 TraceCheckUtils]: 20: Hoare triple {782#(<= (+ main_~i~0 7) main_~j~0)} assume !(~i~0 < ~j~0); {774#false} is VALID [2020-07-18 06:34:16,156 INFO L280 TraceCheckUtils]: 21: Hoare triple {774#false} #t~post2 := ~j~0; {774#false} is VALID [2020-07-18 06:34:16,156 INFO L280 TraceCheckUtils]: 22: Hoare triple {774#false} ~j~0 := #t~post2 - 1; {774#false} is VALID [2020-07-18 06:34:16,156 INFO L280 TraceCheckUtils]: 23: Hoare triple {774#false} havoc #t~post2; {774#false} is VALID [2020-07-18 06:34:16,157 INFO L280 TraceCheckUtils]: 24: Hoare triple {774#false} #t~post1 := ~i~0; {774#false} is VALID [2020-07-18 06:34:16,157 INFO L280 TraceCheckUtils]: 25: Hoare triple {774#false} ~i~0 := 1 + #t~post1; {774#false} is VALID [2020-07-18 06:34:16,157 INFO L280 TraceCheckUtils]: 26: Hoare triple {774#false} havoc #t~post1; {774#false} is VALID [2020-07-18 06:34:16,157 INFO L280 TraceCheckUtils]: 27: Hoare triple {774#false} assume !(~i~0 <= ~n~0); {774#false} is VALID [2020-07-18 06:34:16,158 INFO L263 TraceCheckUtils]: 28: Hoare triple {774#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {774#false} is VALID [2020-07-18 06:34:16,158 INFO L280 TraceCheckUtils]: 29: Hoare triple {774#false} ~cond := #in~cond; {774#false} is VALID [2020-07-18 06:34:16,158 INFO L280 TraceCheckUtils]: 30: Hoare triple {774#false} assume 0 == ~cond; {774#false} is VALID [2020-07-18 06:34:16,159 INFO L280 TraceCheckUtils]: 31: Hoare triple {774#false} assume !false; {774#false} is VALID [2020-07-18 06:34:16,161 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:34:16,162 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1037577929] [2020-07-18 06:34:16,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:34:16,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-18 06:34:16,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786820172] [2020-07-18 06:34:16,164 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2020-07-18 06:34:16,164 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:34:16,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-18 06:34:16,197 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:16,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-18 06:34:16,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:34:16,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-18 06:34:16,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-18 06:34:16,199 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 8 states. [2020-07-18 06:34:16,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:16,585 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2020-07-18 06:34:16,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-18 06:34:16,586 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2020-07-18 06:34:16,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:34:16,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 06:34:16,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 56 transitions. [2020-07-18 06:34:16,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 06:34:16,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 56 transitions. [2020-07-18 06:34:16,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 56 transitions. [2020-07-18 06:34:16,661 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:16,663 INFO L225 Difference]: With dead ends: 60 [2020-07-18 06:34:16,663 INFO L226 Difference]: Without dead ends: 38 [2020-07-18 06:34:16,666 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-07-18 06:34:16,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-18 06:34:16,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2020-07-18 06:34:16,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:34:16,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 35 states. [2020-07-18 06:34:16,714 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 35 states. [2020-07-18 06:34:16,714 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 35 states. [2020-07-18 06:34:16,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:16,717 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2020-07-18 06:34:16,717 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-07-18 06:34:16,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:16,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:16,718 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 38 states. [2020-07-18 06:34:16,718 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 38 states. [2020-07-18 06:34:16,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:16,723 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2020-07-18 06:34:16,723 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-07-18 06:34:16,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:16,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:16,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:34:16,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:34:16,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-18 06:34:16,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2020-07-18 06:34:16,736 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2020-07-18 06:34:16,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:34:16,736 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2020-07-18 06:34:16,737 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-18 06:34:16,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 36 transitions. [2020-07-18 06:34:16,790 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:16,791 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2020-07-18 06:34:16,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-18 06:34:16,792 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:16,792 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 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:34:16,793 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 06:34:16,793 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:16,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:16,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1260601325, now seen corresponding path program 2 times [2020-07-18 06:34:16,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:16,794 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [877939761] [2020-07-18 06:34:16,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:17,216 INFO L280 TraceCheckUtils]: 0: Hoare triple {1061#true} assume true; {1061#true} is VALID [2020-07-18 06:34:17,217 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1061#true} {1061#true} #49#return; {1061#true} is VALID [2020-07-18 06:34:17,217 INFO L263 TraceCheckUtils]: 0: Hoare triple {1061#true} call ULTIMATE.init(); {1061#true} is VALID [2020-07-18 06:34:17,217 INFO L280 TraceCheckUtils]: 1: Hoare triple {1061#true} assume true; {1061#true} is VALID [2020-07-18 06:34:17,217 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1061#true} {1061#true} #49#return; {1061#true} is VALID [2020-07-18 06:34:17,218 INFO L263 TraceCheckUtils]: 3: Hoare triple {1061#true} call #t~ret3 := main(); {1061#true} is VALID [2020-07-18 06:34:17,218 INFO L280 TraceCheckUtils]: 4: Hoare triple {1061#true} havoc ~i~0; {1061#true} is VALID [2020-07-18 06:34:17,218 INFO L280 TraceCheckUtils]: 5: Hoare triple {1061#true} ~j~0 := 10; {1061#true} is VALID [2020-07-18 06:34:17,218 INFO L280 TraceCheckUtils]: 6: Hoare triple {1061#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {1061#true} is VALID [2020-07-18 06:34:17,219 INFO L280 TraceCheckUtils]: 7: Hoare triple {1061#true} havoc #t~nondet0; {1061#true} is VALID [2020-07-18 06:34:17,219 INFO L280 TraceCheckUtils]: 8: Hoare triple {1061#true} ~sn~0 := 0; {1065#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-18 06:34:17,220 INFO L280 TraceCheckUtils]: 9: Hoare triple {1065#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} ~i~0 := 1; {1066#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-18 06:34:17,221 INFO L280 TraceCheckUtils]: 10: Hoare triple {1066#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {1066#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-18 06:34:17,221 INFO L280 TraceCheckUtils]: 11: Hoare triple {1066#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume ~i~0 < ~j~0; {1066#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-18 06:34:17,222 INFO L280 TraceCheckUtils]: 12: Hoare triple {1066#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} ~sn~0 := 2 + ~sn~0; {1067#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} is VALID [2020-07-18 06:34:17,230 INFO L280 TraceCheckUtils]: 13: Hoare triple {1067#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} #t~post2 := ~j~0; {1067#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} is VALID [2020-07-18 06:34:17,238 INFO L280 TraceCheckUtils]: 14: Hoare triple {1067#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} ~j~0 := #t~post2 - 1; {1067#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} is VALID [2020-07-18 06:34:17,240 INFO L280 TraceCheckUtils]: 15: Hoare triple {1067#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} havoc #t~post2; {1067#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} is VALID [2020-07-18 06:34:17,242 INFO L280 TraceCheckUtils]: 16: Hoare triple {1067#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} #t~post1 := ~i~0; {1068#(and (<= main_~sn~0 (* 2 |main_#t~post1|)) (<= (* 2 |main_#t~post1|) main_~sn~0))} is VALID [2020-07-18 06:34:17,243 INFO L280 TraceCheckUtils]: 17: Hoare triple {1068#(and (<= main_~sn~0 (* 2 |main_#t~post1|)) (<= (* 2 |main_#t~post1|) main_~sn~0))} ~i~0 := 1 + #t~post1; {1066#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-18 06:34:17,244 INFO L280 TraceCheckUtils]: 18: Hoare triple {1066#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} havoc #t~post1; {1066#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-18 06:34:17,245 INFO L280 TraceCheckUtils]: 19: Hoare triple {1066#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {1069#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-18 06:34:17,245 INFO L280 TraceCheckUtils]: 20: Hoare triple {1069#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume ~i~0 < ~j~0; {1069#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-18 06:34:17,247 INFO L280 TraceCheckUtils]: 21: Hoare triple {1069#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} ~sn~0 := 2 + ~sn~0; {1070#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} is VALID [2020-07-18 06:34:17,247 INFO L280 TraceCheckUtils]: 22: Hoare triple {1070#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} #t~post2 := ~j~0; {1070#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} is VALID [2020-07-18 06:34:17,248 INFO L280 TraceCheckUtils]: 23: Hoare triple {1070#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} ~j~0 := #t~post2 - 1; {1070#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} is VALID [2020-07-18 06:34:17,249 INFO L280 TraceCheckUtils]: 24: Hoare triple {1070#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} havoc #t~post2; {1070#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} is VALID [2020-07-18 06:34:17,260 INFO L280 TraceCheckUtils]: 25: Hoare triple {1070#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} #t~post1 := ~i~0; {1071#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 |main_#t~post1|) main_~sn~0)))} is VALID [2020-07-18 06:34:17,262 INFO L280 TraceCheckUtils]: 26: Hoare triple {1071#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 |main_#t~post1|) main_~sn~0)))} ~i~0 := 1 + #t~post1; {1072#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} is VALID [2020-07-18 06:34:17,262 INFO L280 TraceCheckUtils]: 27: Hoare triple {1072#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} havoc #t~post1; {1072#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} is VALID [2020-07-18 06:34:17,263 INFO L280 TraceCheckUtils]: 28: Hoare triple {1072#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} assume !(~i~0 <= ~n~0); {1073#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} is VALID [2020-07-18 06:34:17,264 INFO L263 TraceCheckUtils]: 29: Hoare triple {1073#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1074#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 06:34:17,265 INFO L280 TraceCheckUtils]: 30: Hoare triple {1074#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1075#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 06:34:17,266 INFO L280 TraceCheckUtils]: 31: Hoare triple {1075#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1062#false} is VALID [2020-07-18 06:34:17,266 INFO L280 TraceCheckUtils]: 32: Hoare triple {1062#false} assume !false; {1062#false} is VALID [2020-07-18 06:34:17,269 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-18 06:34:17,270 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [877939761] [2020-07-18 06:34:17,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:34:17,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-18 06:34:17,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171770823] [2020-07-18 06:34:17,271 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2020-07-18 06:34:17,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:34:17,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-18 06:34:17,313 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:34:17,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-18 06:34:17,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:34:17,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-18 06:34:17,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-07-18 06:34:17,314 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 13 states. [2020-07-18 06:34:18,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:18,066 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2020-07-18 06:34:18,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-18 06:34:18,066 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2020-07-18 06:34:18,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:34:18,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-18 06:34:18,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 48 transitions. [2020-07-18 06:34:18,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-18 06:34:18,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 48 transitions. [2020-07-18 06:34:18,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 48 transitions. [2020-07-18 06:34:18,124 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:18,126 INFO L225 Difference]: With dead ends: 54 [2020-07-18 06:34:18,126 INFO L226 Difference]: Without dead ends: 49 [2020-07-18 06:34:18,127 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2020-07-18 06:34:18,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-18 06:34:18,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2020-07-18 06:34:18,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:34:18,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 44 states. [2020-07-18 06:34:18,202 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 44 states. [2020-07-18 06:34:18,202 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 44 states. [2020-07-18 06:34:18,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:18,205 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2020-07-18 06:34:18,205 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-07-18 06:34:18,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:18,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:18,206 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 49 states. [2020-07-18 06:34:18,207 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 49 states. [2020-07-18 06:34:18,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:18,213 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2020-07-18 06:34:18,213 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-07-18 06:34:18,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:18,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:18,215 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:34:18,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:34:18,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-18 06:34:18,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2020-07-18 06:34:18,219 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 33 [2020-07-18 06:34:18,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:34:18,221 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2020-07-18 06:34:18,221 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-18 06:34:18,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 46 transitions. [2020-07-18 06:34:18,297 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:18,298 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2020-07-18 06:34:18,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-18 06:34:18,299 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:18,299 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:34:18,299 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 06:34:18,299 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:18,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:18,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1220208573, now seen corresponding path program 2 times [2020-07-18 06:34:18,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:18,300 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1876935761] [2020-07-18 06:34:18,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:18,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:18,541 INFO L280 TraceCheckUtils]: 0: Hoare triple {1390#true} assume true; {1390#true} is VALID [2020-07-18 06:34:18,542 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1390#true} {1390#true} #49#return; {1390#true} is VALID [2020-07-18 06:34:18,542 INFO L263 TraceCheckUtils]: 0: Hoare triple {1390#true} call ULTIMATE.init(); {1390#true} is VALID [2020-07-18 06:34:18,543 INFO L280 TraceCheckUtils]: 1: Hoare triple {1390#true} assume true; {1390#true} is VALID [2020-07-18 06:34:18,543 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1390#true} {1390#true} #49#return; {1390#true} is VALID [2020-07-18 06:34:18,544 INFO L263 TraceCheckUtils]: 3: Hoare triple {1390#true} call #t~ret3 := main(); {1390#true} is VALID [2020-07-18 06:34:18,544 INFO L280 TraceCheckUtils]: 4: Hoare triple {1390#true} havoc ~i~0; {1390#true} is VALID [2020-07-18 06:34:18,545 INFO L280 TraceCheckUtils]: 5: Hoare triple {1390#true} ~j~0 := 10; {1394#(<= 10 main_~j~0)} is VALID [2020-07-18 06:34:18,546 INFO L280 TraceCheckUtils]: 6: Hoare triple {1394#(<= 10 main_~j~0)} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {1394#(<= 10 main_~j~0)} is VALID [2020-07-18 06:34:18,546 INFO L280 TraceCheckUtils]: 7: Hoare triple {1394#(<= 10 main_~j~0)} havoc #t~nondet0; {1394#(<= 10 main_~j~0)} is VALID [2020-07-18 06:34:18,547 INFO L280 TraceCheckUtils]: 8: Hoare triple {1394#(<= 10 main_~j~0)} ~sn~0 := 0; {1394#(<= 10 main_~j~0)} is VALID [2020-07-18 06:34:18,548 INFO L280 TraceCheckUtils]: 9: Hoare triple {1394#(<= 10 main_~j~0)} ~i~0 := 1; {1395#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-18 06:34:18,549 INFO L280 TraceCheckUtils]: 10: Hoare triple {1395#(<= (+ main_~i~0 9) main_~j~0)} assume !!(~i~0 <= ~n~0); {1395#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-18 06:34:18,550 INFO L280 TraceCheckUtils]: 11: Hoare triple {1395#(<= (+ main_~i~0 9) main_~j~0)} assume ~i~0 < ~j~0; {1395#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-18 06:34:18,550 INFO L280 TraceCheckUtils]: 12: Hoare triple {1395#(<= (+ main_~i~0 9) main_~j~0)} ~sn~0 := 2 + ~sn~0; {1395#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-18 06:34:18,551 INFO L280 TraceCheckUtils]: 13: Hoare triple {1395#(<= (+ main_~i~0 9) main_~j~0)} #t~post2 := ~j~0; {1396#(<= (+ main_~i~0 9) |main_#t~post2|)} is VALID [2020-07-18 06:34:18,553 INFO L280 TraceCheckUtils]: 14: Hoare triple {1396#(<= (+ main_~i~0 9) |main_#t~post2|)} ~j~0 := #t~post2 - 1; {1397#(<= (+ main_~i~0 8) main_~j~0)} is VALID [2020-07-18 06:34:18,554 INFO L280 TraceCheckUtils]: 15: Hoare triple {1397#(<= (+ main_~i~0 8) main_~j~0)} havoc #t~post2; {1397#(<= (+ main_~i~0 8) main_~j~0)} is VALID [2020-07-18 06:34:18,555 INFO L280 TraceCheckUtils]: 16: Hoare triple {1397#(<= (+ main_~i~0 8) main_~j~0)} #t~post1 := ~i~0; {1398#(<= (+ |main_#t~post1| 8) main_~j~0)} is VALID [2020-07-18 06:34:18,556 INFO L280 TraceCheckUtils]: 17: Hoare triple {1398#(<= (+ |main_#t~post1| 8) main_~j~0)} ~i~0 := 1 + #t~post1; {1399#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-18 06:34:18,557 INFO L280 TraceCheckUtils]: 18: Hoare triple {1399#(<= (+ main_~i~0 7) main_~j~0)} havoc #t~post1; {1399#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-18 06:34:18,558 INFO L280 TraceCheckUtils]: 19: Hoare triple {1399#(<= (+ main_~i~0 7) main_~j~0)} assume !!(~i~0 <= ~n~0); {1399#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-18 06:34:18,559 INFO L280 TraceCheckUtils]: 20: Hoare triple {1399#(<= (+ main_~i~0 7) main_~j~0)} assume ~i~0 < ~j~0; {1399#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-18 06:34:18,560 INFO L280 TraceCheckUtils]: 21: Hoare triple {1399#(<= (+ main_~i~0 7) main_~j~0)} ~sn~0 := 2 + ~sn~0; {1399#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-18 06:34:18,560 INFO L280 TraceCheckUtils]: 22: Hoare triple {1399#(<= (+ main_~i~0 7) main_~j~0)} #t~post2 := ~j~0; {1400#(<= (+ main_~i~0 7) |main_#t~post2|)} is VALID [2020-07-18 06:34:18,562 INFO L280 TraceCheckUtils]: 23: Hoare triple {1400#(<= (+ main_~i~0 7) |main_#t~post2|)} ~j~0 := #t~post2 - 1; {1401#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2020-07-18 06:34:18,563 INFO L280 TraceCheckUtils]: 24: Hoare triple {1401#(<= (+ main_~i~0 6) main_~j~0)} havoc #t~post2; {1401#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2020-07-18 06:34:18,564 INFO L280 TraceCheckUtils]: 25: Hoare triple {1401#(<= (+ main_~i~0 6) main_~j~0)} #t~post1 := ~i~0; {1402#(<= (+ |main_#t~post1| 6) main_~j~0)} is VALID [2020-07-18 06:34:18,565 INFO L280 TraceCheckUtils]: 26: Hoare triple {1402#(<= (+ |main_#t~post1| 6) main_~j~0)} ~i~0 := 1 + #t~post1; {1403#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-18 06:34:18,566 INFO L280 TraceCheckUtils]: 27: Hoare triple {1403#(<= (+ main_~i~0 5) main_~j~0)} havoc #t~post1; {1403#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-18 06:34:18,567 INFO L280 TraceCheckUtils]: 28: Hoare triple {1403#(<= (+ main_~i~0 5) main_~j~0)} assume !!(~i~0 <= ~n~0); {1403#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-18 06:34:18,568 INFO L280 TraceCheckUtils]: 29: Hoare triple {1403#(<= (+ main_~i~0 5) main_~j~0)} assume !(~i~0 < ~j~0); {1391#false} is VALID [2020-07-18 06:34:18,568 INFO L280 TraceCheckUtils]: 30: Hoare triple {1391#false} #t~post2 := ~j~0; {1391#false} is VALID [2020-07-18 06:34:18,569 INFO L280 TraceCheckUtils]: 31: Hoare triple {1391#false} ~j~0 := #t~post2 - 1; {1391#false} is VALID [2020-07-18 06:34:18,569 INFO L280 TraceCheckUtils]: 32: Hoare triple {1391#false} havoc #t~post2; {1391#false} is VALID [2020-07-18 06:34:18,569 INFO L280 TraceCheckUtils]: 33: Hoare triple {1391#false} #t~post1 := ~i~0; {1391#false} is VALID [2020-07-18 06:34:18,569 INFO L280 TraceCheckUtils]: 34: Hoare triple {1391#false} ~i~0 := 1 + #t~post1; {1391#false} is VALID [2020-07-18 06:34:18,570 INFO L280 TraceCheckUtils]: 35: Hoare triple {1391#false} havoc #t~post1; {1391#false} is VALID [2020-07-18 06:34:18,570 INFO L280 TraceCheckUtils]: 36: Hoare triple {1391#false} assume !(~i~0 <= ~n~0); {1391#false} is VALID [2020-07-18 06:34:18,571 INFO L263 TraceCheckUtils]: 37: Hoare triple {1391#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1391#false} is VALID [2020-07-18 06:34:18,571 INFO L280 TraceCheckUtils]: 38: Hoare triple {1391#false} ~cond := #in~cond; {1391#false} is VALID [2020-07-18 06:34:18,571 INFO L280 TraceCheckUtils]: 39: Hoare triple {1391#false} assume 0 == ~cond; {1391#false} is VALID [2020-07-18 06:34:18,572 INFO L280 TraceCheckUtils]: 40: Hoare triple {1391#false} assume !false; {1391#false} is VALID [2020-07-18 06:34:18,574 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:34:18,575 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1876935761] [2020-07-18 06:34:18,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:34:18,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-07-18 06:34:18,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520336621] [2020-07-18 06:34:18,576 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2020-07-18 06:34:18,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:34:18,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-18 06:34:18,625 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:34:18,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-18 06:34:18,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:34:18,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-18 06:34:18,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-07-18 06:34:18,627 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 12 states. [2020-07-18 06:34:19,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:19,195 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2020-07-18 06:34:19,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-18 06:34:19,196 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2020-07-18 06:34:19,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:34:19,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-18 06:34:19,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 64 transitions. [2020-07-18 06:34:19,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-18 06:34:19,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 64 transitions. [2020-07-18 06:34:19,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 64 transitions. [2020-07-18 06:34:19,274 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:19,276 INFO L225 Difference]: With dead ends: 70 [2020-07-18 06:34:19,277 INFO L226 Difference]: Without dead ends: 56 [2020-07-18 06:34:19,278 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2020-07-18 06:34:19,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-18 06:34:19,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2020-07-18 06:34:19,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:34:19,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 53 states. [2020-07-18 06:34:19,395 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 53 states. [2020-07-18 06:34:19,395 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 53 states. [2020-07-18 06:34:19,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:19,398 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2020-07-18 06:34:19,398 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2020-07-18 06:34:19,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:19,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:19,399 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 56 states. [2020-07-18 06:34:19,399 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 56 states. [2020-07-18 06:34:19,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:19,401 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2020-07-18 06:34:19,401 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2020-07-18 06:34:19,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:19,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:19,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:34:19,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:34:19,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-18 06:34:19,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2020-07-18 06:34:19,405 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 41 [2020-07-18 06:34:19,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:34:19,405 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2020-07-18 06:34:19,405 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-18 06:34:19,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 53 states and 55 transitions. [2020-07-18 06:34:19,474 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:34:19,474 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2020-07-18 06:34:19,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-18 06:34:19,476 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:19,476 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:34:19,476 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 06:34:19,476 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:19,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:19,477 INFO L82 PathProgramCache]: Analyzing trace with hash 765701111, now seen corresponding path program 3 times [2020-07-18 06:34:19,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:19,478 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [101658333] [2020-07-18 06:34:19,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:19,737 INFO L280 TraceCheckUtils]: 0: Hoare triple {1782#true} assume true; {1782#true} is VALID [2020-07-18 06:34:19,738 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1782#true} {1782#true} #49#return; {1782#true} is VALID [2020-07-18 06:34:19,738 INFO L263 TraceCheckUtils]: 0: Hoare triple {1782#true} call ULTIMATE.init(); {1782#true} is VALID [2020-07-18 06:34:19,738 INFO L280 TraceCheckUtils]: 1: Hoare triple {1782#true} assume true; {1782#true} is VALID [2020-07-18 06:34:19,738 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1782#true} {1782#true} #49#return; {1782#true} is VALID [2020-07-18 06:34:19,739 INFO L263 TraceCheckUtils]: 3: Hoare triple {1782#true} call #t~ret3 := main(); {1782#true} is VALID [2020-07-18 06:34:19,739 INFO L280 TraceCheckUtils]: 4: Hoare triple {1782#true} havoc ~i~0; {1782#true} is VALID [2020-07-18 06:34:19,743 INFO L280 TraceCheckUtils]: 5: Hoare triple {1782#true} ~j~0 := 10; {1786#(<= 10 main_~j~0)} is VALID [2020-07-18 06:34:19,744 INFO L280 TraceCheckUtils]: 6: Hoare triple {1786#(<= 10 main_~j~0)} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {1786#(<= 10 main_~j~0)} is VALID [2020-07-18 06:34:19,744 INFO L280 TraceCheckUtils]: 7: Hoare triple {1786#(<= 10 main_~j~0)} havoc #t~nondet0; {1786#(<= 10 main_~j~0)} is VALID [2020-07-18 06:34:19,745 INFO L280 TraceCheckUtils]: 8: Hoare triple {1786#(<= 10 main_~j~0)} ~sn~0 := 0; {1786#(<= 10 main_~j~0)} is VALID [2020-07-18 06:34:19,745 INFO L280 TraceCheckUtils]: 9: Hoare triple {1786#(<= 10 main_~j~0)} ~i~0 := 1; {1787#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-18 06:34:19,746 INFO L280 TraceCheckUtils]: 10: Hoare triple {1787#(<= (+ main_~i~0 9) main_~j~0)} assume !!(~i~0 <= ~n~0); {1787#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-18 06:34:19,746 INFO L280 TraceCheckUtils]: 11: Hoare triple {1787#(<= (+ main_~i~0 9) main_~j~0)} assume ~i~0 < ~j~0; {1787#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-18 06:34:19,746 INFO L280 TraceCheckUtils]: 12: Hoare triple {1787#(<= (+ main_~i~0 9) main_~j~0)} ~sn~0 := 2 + ~sn~0; {1787#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-18 06:34:19,747 INFO L280 TraceCheckUtils]: 13: Hoare triple {1787#(<= (+ main_~i~0 9) main_~j~0)} #t~post2 := ~j~0; {1788#(<= (+ main_~i~0 9) |main_#t~post2|)} is VALID [2020-07-18 06:34:19,748 INFO L280 TraceCheckUtils]: 14: Hoare triple {1788#(<= (+ main_~i~0 9) |main_#t~post2|)} ~j~0 := #t~post2 - 1; {1789#(<= (+ main_~i~0 8) main_~j~0)} is VALID [2020-07-18 06:34:19,748 INFO L280 TraceCheckUtils]: 15: Hoare triple {1789#(<= (+ main_~i~0 8) main_~j~0)} havoc #t~post2; {1789#(<= (+ main_~i~0 8) main_~j~0)} is VALID [2020-07-18 06:34:19,749 INFO L280 TraceCheckUtils]: 16: Hoare triple {1789#(<= (+ main_~i~0 8) main_~j~0)} #t~post1 := ~i~0; {1790#(<= (+ |main_#t~post1| 8) main_~j~0)} is VALID [2020-07-18 06:34:19,749 INFO L280 TraceCheckUtils]: 17: Hoare triple {1790#(<= (+ |main_#t~post1| 8) main_~j~0)} ~i~0 := 1 + #t~post1; {1791#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-18 06:34:19,753 INFO L280 TraceCheckUtils]: 18: Hoare triple {1791#(<= (+ main_~i~0 7) main_~j~0)} havoc #t~post1; {1791#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-18 06:34:19,753 INFO L280 TraceCheckUtils]: 19: Hoare triple {1791#(<= (+ main_~i~0 7) main_~j~0)} assume !!(~i~0 <= ~n~0); {1791#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-18 06:34:19,754 INFO L280 TraceCheckUtils]: 20: Hoare triple {1791#(<= (+ main_~i~0 7) main_~j~0)} assume ~i~0 < ~j~0; {1791#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-18 06:34:19,754 INFO L280 TraceCheckUtils]: 21: Hoare triple {1791#(<= (+ main_~i~0 7) main_~j~0)} ~sn~0 := 2 + ~sn~0; {1791#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-18 06:34:19,755 INFO L280 TraceCheckUtils]: 22: Hoare triple {1791#(<= (+ main_~i~0 7) main_~j~0)} #t~post2 := ~j~0; {1792#(<= (+ main_~i~0 7) |main_#t~post2|)} is VALID [2020-07-18 06:34:19,755 INFO L280 TraceCheckUtils]: 23: Hoare triple {1792#(<= (+ main_~i~0 7) |main_#t~post2|)} ~j~0 := #t~post2 - 1; {1793#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2020-07-18 06:34:19,756 INFO L280 TraceCheckUtils]: 24: Hoare triple {1793#(<= (+ main_~i~0 6) main_~j~0)} havoc #t~post2; {1793#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2020-07-18 06:34:19,756 INFO L280 TraceCheckUtils]: 25: Hoare triple {1793#(<= (+ main_~i~0 6) main_~j~0)} #t~post1 := ~i~0; {1794#(<= (+ |main_#t~post1| 6) main_~j~0)} is VALID [2020-07-18 06:34:19,757 INFO L280 TraceCheckUtils]: 26: Hoare triple {1794#(<= (+ |main_#t~post1| 6) main_~j~0)} ~i~0 := 1 + #t~post1; {1795#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-18 06:34:19,757 INFO L280 TraceCheckUtils]: 27: Hoare triple {1795#(<= (+ main_~i~0 5) main_~j~0)} havoc #t~post1; {1795#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-18 06:34:19,762 INFO L280 TraceCheckUtils]: 28: Hoare triple {1795#(<= (+ main_~i~0 5) main_~j~0)} assume !!(~i~0 <= ~n~0); {1795#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-18 06:34:19,763 INFO L280 TraceCheckUtils]: 29: Hoare triple {1795#(<= (+ main_~i~0 5) main_~j~0)} assume ~i~0 < ~j~0; {1795#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-18 06:34:19,763 INFO L280 TraceCheckUtils]: 30: Hoare triple {1795#(<= (+ main_~i~0 5) main_~j~0)} ~sn~0 := 2 + ~sn~0; {1795#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-18 06:34:19,764 INFO L280 TraceCheckUtils]: 31: Hoare triple {1795#(<= (+ main_~i~0 5) main_~j~0)} #t~post2 := ~j~0; {1796#(<= (+ main_~i~0 5) |main_#t~post2|)} is VALID [2020-07-18 06:34:19,765 INFO L280 TraceCheckUtils]: 32: Hoare triple {1796#(<= (+ main_~i~0 5) |main_#t~post2|)} ~j~0 := #t~post2 - 1; {1797#(<= (+ main_~i~0 4) main_~j~0)} is VALID [2020-07-18 06:34:19,765 INFO L280 TraceCheckUtils]: 33: Hoare triple {1797#(<= (+ main_~i~0 4) main_~j~0)} havoc #t~post2; {1797#(<= (+ main_~i~0 4) main_~j~0)} is VALID [2020-07-18 06:34:19,765 INFO L280 TraceCheckUtils]: 34: Hoare triple {1797#(<= (+ main_~i~0 4) main_~j~0)} #t~post1 := ~i~0; {1798#(<= (+ |main_#t~post1| 4) main_~j~0)} is VALID [2020-07-18 06:34:19,766 INFO L280 TraceCheckUtils]: 35: Hoare triple {1798#(<= (+ |main_#t~post1| 4) main_~j~0)} ~i~0 := 1 + #t~post1; {1799#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2020-07-18 06:34:19,767 INFO L280 TraceCheckUtils]: 36: Hoare triple {1799#(<= (+ main_~i~0 3) main_~j~0)} havoc #t~post1; {1799#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2020-07-18 06:34:19,767 INFO L280 TraceCheckUtils]: 37: Hoare triple {1799#(<= (+ main_~i~0 3) main_~j~0)} assume !!(~i~0 <= ~n~0); {1799#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2020-07-18 06:34:19,773 INFO L280 TraceCheckUtils]: 38: Hoare triple {1799#(<= (+ main_~i~0 3) main_~j~0)} assume !(~i~0 < ~j~0); {1783#false} is VALID [2020-07-18 06:34:19,773 INFO L280 TraceCheckUtils]: 39: Hoare triple {1783#false} #t~post2 := ~j~0; {1783#false} is VALID [2020-07-18 06:34:19,773 INFO L280 TraceCheckUtils]: 40: Hoare triple {1783#false} ~j~0 := #t~post2 - 1; {1783#false} is VALID [2020-07-18 06:34:19,773 INFO L280 TraceCheckUtils]: 41: Hoare triple {1783#false} havoc #t~post2; {1783#false} is VALID [2020-07-18 06:34:19,773 INFO L280 TraceCheckUtils]: 42: Hoare triple {1783#false} #t~post1 := ~i~0; {1783#false} is VALID [2020-07-18 06:34:19,774 INFO L280 TraceCheckUtils]: 43: Hoare triple {1783#false} ~i~0 := 1 + #t~post1; {1783#false} is VALID [2020-07-18 06:34:19,774 INFO L280 TraceCheckUtils]: 44: Hoare triple {1783#false} havoc #t~post1; {1783#false} is VALID [2020-07-18 06:34:19,774 INFO L280 TraceCheckUtils]: 45: Hoare triple {1783#false} assume !(~i~0 <= ~n~0); {1783#false} is VALID [2020-07-18 06:34:19,774 INFO L263 TraceCheckUtils]: 46: Hoare triple {1783#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1783#false} is VALID [2020-07-18 06:34:19,774 INFO L280 TraceCheckUtils]: 47: Hoare triple {1783#false} ~cond := #in~cond; {1783#false} is VALID [2020-07-18 06:34:19,774 INFO L280 TraceCheckUtils]: 48: Hoare triple {1783#false} assume 0 == ~cond; {1783#false} is VALID [2020-07-18 06:34:19,775 INFO L280 TraceCheckUtils]: 49: Hoare triple {1783#false} assume !false; {1783#false} is VALID [2020-07-18 06:34:19,778 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 22 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:34:19,778 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [101658333] [2020-07-18 06:34:19,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:34:19,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-07-18 06:34:19,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801553307] [2020-07-18 06:34:19,779 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2020-07-18 06:34:19,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:34:19,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-18 06:34:19,828 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:34:19,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-18 06:34:19,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:34:19,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-18 06:34:19,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2020-07-18 06:34:19,830 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 16 states. [2020-07-18 06:34:20,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:20,548 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2020-07-18 06:34:20,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-18 06:34:20,548 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2020-07-18 06:34:20,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:34:20,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-18 06:34:20,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 73 transitions. [2020-07-18 06:34:20,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-18 06:34:20,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 73 transitions. [2020-07-18 06:34:20,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 73 transitions. [2020-07-18 06:34:20,629 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:20,632 INFO L225 Difference]: With dead ends: 79 [2020-07-18 06:34:20,632 INFO L226 Difference]: Without dead ends: 65 [2020-07-18 06:34:20,633 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2020-07-18 06:34:20,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-07-18 06:34:20,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2020-07-18 06:34:20,748 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:34:20,748 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 62 states. [2020-07-18 06:34:20,748 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 62 states. [2020-07-18 06:34:20,748 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 62 states. [2020-07-18 06:34:20,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:20,751 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2020-07-18 06:34:20,751 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2020-07-18 06:34:20,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:20,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:20,752 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 65 states. [2020-07-18 06:34:20,752 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 65 states. [2020-07-18 06:34:20,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:20,754 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2020-07-18 06:34:20,754 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2020-07-18 06:34:20,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:20,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:20,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:34:20,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:34:20,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-07-18 06:34:20,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2020-07-18 06:34:20,757 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 50 [2020-07-18 06:34:20,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:34:20,758 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2020-07-18 06:34:20,758 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-18 06:34:20,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 62 states and 64 transitions. [2020-07-18 06:34:20,839 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:20,840 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2020-07-18 06:34:20,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-07-18 06:34:20,841 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:20,841 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:34:20,841 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-18 06:34:20,841 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:20,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:20,842 INFO L82 PathProgramCache]: Analyzing trace with hash -258080061, now seen corresponding path program 4 times [2020-07-18 06:34:20,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:20,842 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [260649778] [2020-07-18 06:34:20,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:21,209 INFO L280 TraceCheckUtils]: 0: Hoare triple {2240#true} assume true; {2240#true} is VALID [2020-07-18 06:34:21,210 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2240#true} {2240#true} #49#return; {2240#true} is VALID [2020-07-18 06:34:21,210 INFO L263 TraceCheckUtils]: 0: Hoare triple {2240#true} call ULTIMATE.init(); {2240#true} is VALID [2020-07-18 06:34:21,210 INFO L280 TraceCheckUtils]: 1: Hoare triple {2240#true} assume true; {2240#true} is VALID [2020-07-18 06:34:21,211 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2240#true} {2240#true} #49#return; {2240#true} is VALID [2020-07-18 06:34:21,211 INFO L263 TraceCheckUtils]: 3: Hoare triple {2240#true} call #t~ret3 := main(); {2240#true} is VALID [2020-07-18 06:34:21,211 INFO L280 TraceCheckUtils]: 4: Hoare triple {2240#true} havoc ~i~0; {2240#true} is VALID [2020-07-18 06:34:21,214 INFO L280 TraceCheckUtils]: 5: Hoare triple {2240#true} ~j~0 := 10; {2244#(<= 10 main_~j~0)} is VALID [2020-07-18 06:34:21,214 INFO L280 TraceCheckUtils]: 6: Hoare triple {2244#(<= 10 main_~j~0)} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {2244#(<= 10 main_~j~0)} is VALID [2020-07-18 06:34:21,215 INFO L280 TraceCheckUtils]: 7: Hoare triple {2244#(<= 10 main_~j~0)} havoc #t~nondet0; {2244#(<= 10 main_~j~0)} is VALID [2020-07-18 06:34:21,215 INFO L280 TraceCheckUtils]: 8: Hoare triple {2244#(<= 10 main_~j~0)} ~sn~0 := 0; {2244#(<= 10 main_~j~0)} is VALID [2020-07-18 06:34:21,216 INFO L280 TraceCheckUtils]: 9: Hoare triple {2244#(<= 10 main_~j~0)} ~i~0 := 1; {2245#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-18 06:34:21,217 INFO L280 TraceCheckUtils]: 10: Hoare triple {2245#(<= (+ main_~i~0 9) main_~j~0)} assume !!(~i~0 <= ~n~0); {2245#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-18 06:34:21,217 INFO L280 TraceCheckUtils]: 11: Hoare triple {2245#(<= (+ main_~i~0 9) main_~j~0)} assume ~i~0 < ~j~0; {2245#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-18 06:34:21,218 INFO L280 TraceCheckUtils]: 12: Hoare triple {2245#(<= (+ main_~i~0 9) main_~j~0)} ~sn~0 := 2 + ~sn~0; {2245#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-18 06:34:21,218 INFO L280 TraceCheckUtils]: 13: Hoare triple {2245#(<= (+ main_~i~0 9) main_~j~0)} #t~post2 := ~j~0; {2246#(<= (+ main_~i~0 9) |main_#t~post2|)} is VALID [2020-07-18 06:34:21,219 INFO L280 TraceCheckUtils]: 14: Hoare triple {2246#(<= (+ main_~i~0 9) |main_#t~post2|)} ~j~0 := #t~post2 - 1; {2247#(<= (+ main_~i~0 8) main_~j~0)} is VALID [2020-07-18 06:34:21,220 INFO L280 TraceCheckUtils]: 15: Hoare triple {2247#(<= (+ main_~i~0 8) main_~j~0)} havoc #t~post2; {2247#(<= (+ main_~i~0 8) main_~j~0)} is VALID [2020-07-18 06:34:21,221 INFO L280 TraceCheckUtils]: 16: Hoare triple {2247#(<= (+ main_~i~0 8) main_~j~0)} #t~post1 := ~i~0; {2248#(<= (+ |main_#t~post1| 8) main_~j~0)} is VALID [2020-07-18 06:34:21,222 INFO L280 TraceCheckUtils]: 17: Hoare triple {2248#(<= (+ |main_#t~post1| 8) main_~j~0)} ~i~0 := 1 + #t~post1; {2249#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-18 06:34:21,222 INFO L280 TraceCheckUtils]: 18: Hoare triple {2249#(<= (+ main_~i~0 7) main_~j~0)} havoc #t~post1; {2249#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-18 06:34:21,223 INFO L280 TraceCheckUtils]: 19: Hoare triple {2249#(<= (+ main_~i~0 7) main_~j~0)} assume !!(~i~0 <= ~n~0); {2249#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-18 06:34:21,223 INFO L280 TraceCheckUtils]: 20: Hoare triple {2249#(<= (+ main_~i~0 7) main_~j~0)} assume ~i~0 < ~j~0; {2249#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-18 06:34:21,224 INFO L280 TraceCheckUtils]: 21: Hoare triple {2249#(<= (+ main_~i~0 7) main_~j~0)} ~sn~0 := 2 + ~sn~0; {2249#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-18 06:34:21,225 INFO L280 TraceCheckUtils]: 22: Hoare triple {2249#(<= (+ main_~i~0 7) main_~j~0)} #t~post2 := ~j~0; {2250#(<= (+ main_~i~0 7) |main_#t~post2|)} is VALID [2020-07-18 06:34:21,227 INFO L280 TraceCheckUtils]: 23: Hoare triple {2250#(<= (+ main_~i~0 7) |main_#t~post2|)} ~j~0 := #t~post2 - 1; {2251#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2020-07-18 06:34:21,228 INFO L280 TraceCheckUtils]: 24: Hoare triple {2251#(<= (+ main_~i~0 6) main_~j~0)} havoc #t~post2; {2251#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2020-07-18 06:34:21,228 INFO L280 TraceCheckUtils]: 25: Hoare triple {2251#(<= (+ main_~i~0 6) main_~j~0)} #t~post1 := ~i~0; {2252#(<= (+ |main_#t~post1| 6) main_~j~0)} is VALID [2020-07-18 06:34:21,229 INFO L280 TraceCheckUtils]: 26: Hoare triple {2252#(<= (+ |main_#t~post1| 6) main_~j~0)} ~i~0 := 1 + #t~post1; {2253#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-18 06:34:21,231 INFO L280 TraceCheckUtils]: 27: Hoare triple {2253#(<= (+ main_~i~0 5) main_~j~0)} havoc #t~post1; {2253#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-18 06:34:21,234 INFO L280 TraceCheckUtils]: 28: Hoare triple {2253#(<= (+ main_~i~0 5) main_~j~0)} assume !!(~i~0 <= ~n~0); {2253#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-18 06:34:21,238 INFO L280 TraceCheckUtils]: 29: Hoare triple {2253#(<= (+ main_~i~0 5) main_~j~0)} assume ~i~0 < ~j~0; {2253#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-18 06:34:21,241 INFO L280 TraceCheckUtils]: 30: Hoare triple {2253#(<= (+ main_~i~0 5) main_~j~0)} ~sn~0 := 2 + ~sn~0; {2253#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-18 06:34:21,241 INFO L280 TraceCheckUtils]: 31: Hoare triple {2253#(<= (+ main_~i~0 5) main_~j~0)} #t~post2 := ~j~0; {2254#(<= (+ main_~i~0 5) |main_#t~post2|)} is VALID [2020-07-18 06:34:21,242 INFO L280 TraceCheckUtils]: 32: Hoare triple {2254#(<= (+ main_~i~0 5) |main_#t~post2|)} ~j~0 := #t~post2 - 1; {2255#(<= (+ main_~i~0 4) main_~j~0)} is VALID [2020-07-18 06:34:21,243 INFO L280 TraceCheckUtils]: 33: Hoare triple {2255#(<= (+ main_~i~0 4) main_~j~0)} havoc #t~post2; {2255#(<= (+ main_~i~0 4) main_~j~0)} is VALID [2020-07-18 06:34:21,244 INFO L280 TraceCheckUtils]: 34: Hoare triple {2255#(<= (+ main_~i~0 4) main_~j~0)} #t~post1 := ~i~0; {2256#(<= (+ |main_#t~post1| 4) main_~j~0)} is VALID [2020-07-18 06:34:21,244 INFO L280 TraceCheckUtils]: 35: Hoare triple {2256#(<= (+ |main_#t~post1| 4) main_~j~0)} ~i~0 := 1 + #t~post1; {2257#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2020-07-18 06:34:21,245 INFO L280 TraceCheckUtils]: 36: Hoare triple {2257#(<= (+ main_~i~0 3) main_~j~0)} havoc #t~post1; {2257#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2020-07-18 06:34:21,246 INFO L280 TraceCheckUtils]: 37: Hoare triple {2257#(<= (+ main_~i~0 3) main_~j~0)} assume !!(~i~0 <= ~n~0); {2257#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2020-07-18 06:34:21,246 INFO L280 TraceCheckUtils]: 38: Hoare triple {2257#(<= (+ main_~i~0 3) main_~j~0)} assume ~i~0 < ~j~0; {2257#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2020-07-18 06:34:21,247 INFO L280 TraceCheckUtils]: 39: Hoare triple {2257#(<= (+ main_~i~0 3) main_~j~0)} ~sn~0 := 2 + ~sn~0; {2257#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2020-07-18 06:34:21,247 INFO L280 TraceCheckUtils]: 40: Hoare triple {2257#(<= (+ main_~i~0 3) main_~j~0)} #t~post2 := ~j~0; {2258#(<= (+ main_~i~0 3) |main_#t~post2|)} is VALID [2020-07-18 06:34:21,248 INFO L280 TraceCheckUtils]: 41: Hoare triple {2258#(<= (+ main_~i~0 3) |main_#t~post2|)} ~j~0 := #t~post2 - 1; {2259#(<= (+ main_~i~0 2) main_~j~0)} is VALID [2020-07-18 06:34:21,249 INFO L280 TraceCheckUtils]: 42: Hoare triple {2259#(<= (+ main_~i~0 2) main_~j~0)} havoc #t~post2; {2259#(<= (+ main_~i~0 2) main_~j~0)} is VALID [2020-07-18 06:34:21,250 INFO L280 TraceCheckUtils]: 43: Hoare triple {2259#(<= (+ main_~i~0 2) main_~j~0)} #t~post1 := ~i~0; {2260#(<= (+ |main_#t~post1| 2) main_~j~0)} is VALID [2020-07-18 06:34:21,250 INFO L280 TraceCheckUtils]: 44: Hoare triple {2260#(<= (+ |main_#t~post1| 2) main_~j~0)} ~i~0 := 1 + #t~post1; {2261#(<= (+ main_~i~0 1) main_~j~0)} is VALID [2020-07-18 06:34:21,251 INFO L280 TraceCheckUtils]: 45: Hoare triple {2261#(<= (+ main_~i~0 1) main_~j~0)} havoc #t~post1; {2261#(<= (+ main_~i~0 1) main_~j~0)} is VALID [2020-07-18 06:34:21,252 INFO L280 TraceCheckUtils]: 46: Hoare triple {2261#(<= (+ main_~i~0 1) main_~j~0)} assume !!(~i~0 <= ~n~0); {2261#(<= (+ main_~i~0 1) main_~j~0)} is VALID [2020-07-18 06:34:21,252 INFO L280 TraceCheckUtils]: 47: Hoare triple {2261#(<= (+ main_~i~0 1) main_~j~0)} assume !(~i~0 < ~j~0); {2241#false} is VALID [2020-07-18 06:34:21,252 INFO L280 TraceCheckUtils]: 48: Hoare triple {2241#false} #t~post2 := ~j~0; {2241#false} is VALID [2020-07-18 06:34:21,253 INFO L280 TraceCheckUtils]: 49: Hoare triple {2241#false} ~j~0 := #t~post2 - 1; {2241#false} is VALID [2020-07-18 06:34:21,253 INFO L280 TraceCheckUtils]: 50: Hoare triple {2241#false} havoc #t~post2; {2241#false} is VALID [2020-07-18 06:34:21,253 INFO L280 TraceCheckUtils]: 51: Hoare triple {2241#false} #t~post1 := ~i~0; {2241#false} is VALID [2020-07-18 06:34:21,253 INFO L280 TraceCheckUtils]: 52: Hoare triple {2241#false} ~i~0 := 1 + #t~post1; {2241#false} is VALID [2020-07-18 06:34:21,254 INFO L280 TraceCheckUtils]: 53: Hoare triple {2241#false} havoc #t~post1; {2241#false} is VALID [2020-07-18 06:34:21,254 INFO L280 TraceCheckUtils]: 54: Hoare triple {2241#false} assume !(~i~0 <= ~n~0); {2241#false} is VALID [2020-07-18 06:34:21,254 INFO L263 TraceCheckUtils]: 55: Hoare triple {2241#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {2241#false} is VALID [2020-07-18 06:34:21,254 INFO L280 TraceCheckUtils]: 56: Hoare triple {2241#false} ~cond := #in~cond; {2241#false} is VALID [2020-07-18 06:34:21,254 INFO L280 TraceCheckUtils]: 57: Hoare triple {2241#false} assume 0 == ~cond; {2241#false} is VALID [2020-07-18 06:34:21,255 INFO L280 TraceCheckUtils]: 58: Hoare triple {2241#false} assume !false; {2241#false} is VALID [2020-07-18 06:34:21,259 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 29 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:34:21,259 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [260649778] [2020-07-18 06:34:21,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:34:21,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-07-18 06:34:21,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722245019] [2020-07-18 06:34:21,262 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 59 [2020-07-18 06:34:21,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:34:21,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2020-07-18 06:34:21,326 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:34:21,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-18 06:34:21,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:34:21,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-18 06:34:21,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2020-07-18 06:34:21,328 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 20 states. [2020-07-18 06:34:22,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:22,340 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2020-07-18 06:34:22,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-07-18 06:34:22,341 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 59 [2020-07-18 06:34:22,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:34:22,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-18 06:34:22,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 81 transitions. [2020-07-18 06:34:22,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-18 06:34:22,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 81 transitions. [2020-07-18 06:34:22,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 81 transitions. [2020-07-18 06:34:22,437 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:22,439 INFO L225 Difference]: With dead ends: 87 [2020-07-18 06:34:22,440 INFO L226 Difference]: Without dead ends: 73 [2020-07-18 06:34:22,441 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=307, Invalid=1025, Unknown=0, NotChecked=0, Total=1332 [2020-07-18 06:34:22,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-18 06:34:22,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2020-07-18 06:34:22,601 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:34:22,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 71 states. [2020-07-18 06:34:22,601 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 71 states. [2020-07-18 06:34:22,601 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 71 states. [2020-07-18 06:34:22,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:22,604 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2020-07-18 06:34:22,604 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2020-07-18 06:34:22,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:22,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:22,605 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 73 states. [2020-07-18 06:34:22,605 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 73 states. [2020-07-18 06:34:22,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:22,608 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2020-07-18 06:34:22,608 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2020-07-18 06:34:22,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:22,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:22,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:34:22,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:34:22,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-07-18 06:34:22,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2020-07-18 06:34:22,611 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 59 [2020-07-18 06:34:22,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:34:22,611 INFO L479 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2020-07-18 06:34:22,611 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-18 06:34:22,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 71 states and 73 transitions. [2020-07-18 06:34:22,717 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:22,718 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2020-07-18 06:34:22,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-07-18 06:34:22,719 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:22,719 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:34:22,719 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-18 06:34:22,719 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:22,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:22,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1030394231, now seen corresponding path program 5 times [2020-07-18 06:34:22,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:22,720 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1334073510] [2020-07-18 06:34:22,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 06:34:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 06:34:22,828 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-18 06:34:22,829 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-18 06:34:22,829 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-18 06:34:22,861 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-18 06:34:22,861 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-18 06:34:22,861 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-18 06:34:22,862 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-18 06:34:22,862 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-18 06:34:22,862 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-18 06:34:22,862 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 06:34:22,862 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 06:34:22,862 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-18 06:34:22,862 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-18 06:34:22,862 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-18 06:34:22,862 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-18 06:34:22,862 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2020-07-18 06:34:22,863 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-18 06:34:22,863 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-18 06:34:22,863 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-18 06:34:22,863 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2020-07-18 06:34:22,863 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-18 06:34:22,863 WARN L170 areAnnotationChecker]: L12-3 has no Hoare annotation [2020-07-18 06:34:22,863 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-18 06:34:22,863 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-18 06:34:22,863 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-18 06:34:22,864 WARN L170 areAnnotationChecker]: L13-6 has no Hoare annotation [2020-07-18 06:34:22,864 WARN L170 areAnnotationChecker]: L13-6 has no Hoare annotation [2020-07-18 06:34:22,864 WARN L170 areAnnotationChecker]: L13-6 has no Hoare annotation [2020-07-18 06:34:22,864 WARN L170 areAnnotationChecker]: L13-7 has no Hoare annotation [2020-07-18 06:34:22,864 WARN L170 areAnnotationChecker]: L13-7 has no Hoare annotation [2020-07-18 06:34:22,864 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-18 06:34:22,864 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-18 06:34:22,864 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-18 06:34:22,864 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2020-07-18 06:34:22,865 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-18 06:34:22,865 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2020-07-18 06:34:22,865 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-18 06:34:22,865 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2020-07-18 06:34:22,865 WARN L170 areAnnotationChecker]: L13-5 has no Hoare annotation [2020-07-18 06:34:22,865 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 06:34:22,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 06:34:22 BoogieIcfgContainer [2020-07-18 06:34:22,868 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 06:34:22,872 INFO L168 Benchmark]: Toolchain (without parser) took 10338.62 ms. Allocated memory was 137.9 MB in the beginning and 318.2 MB in the end (delta: 180.4 MB). Free memory was 102.8 MB in the beginning and 250.8 MB in the end (delta: -148.0 MB). Peak memory consumption was 32.3 MB. Max. memory is 7.1 GB. [2020-07-18 06:34:22,873 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 137.9 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-18 06:34:22,873 INFO L168 Benchmark]: CACSL2BoogieTranslator took 245.11 ms. Allocated memory is still 137.9 MB. Free memory was 102.4 MB in the beginning and 92.8 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:34:22,874 INFO L168 Benchmark]: Boogie Preprocessor took 122.52 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 92.8 MB in the beginning and 181.6 MB in the end (delta: -88.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2020-07-18 06:34:22,875 INFO L168 Benchmark]: RCFGBuilder took 336.22 ms. Allocated memory is still 202.4 MB. Free memory was 180.6 MB in the beginning and 164.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. [2020-07-18 06:34:22,876 INFO L168 Benchmark]: TraceAbstraction took 9627.82 ms. Allocated memory was 202.4 MB in the beginning and 318.2 MB in the end (delta: 115.9 MB). Free memory was 163.8 MB in the beginning and 250.8 MB in the end (delta: -87.0 MB). Peak memory consumption was 28.9 MB. Max. memory is 7.1 GB. [2020-07-18 06:34:22,879 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.20 ms. Allocated memory is still 137.9 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 245.11 ms. Allocated memory is still 137.9 MB. Free memory was 102.4 MB in the beginning and 92.8 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 122.52 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 92.8 MB in the beginning and 181.6 MB in the end (delta: -88.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 336.22 ms. Allocated memory is still 202.4 MB. Free memory was 180.6 MB in the beginning and 164.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9627.82 ms. Allocated memory was 202.4 MB in the beginning and 318.2 MB in the end (delta: 115.9 MB). Free memory was 163.8 MB in the beginning and 250.8 MB in the end (delta: -87.0 MB). Peak memory consumption was 28.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int i, j=10, n=__VERIFIER_nondet_uint(), sn=0; VAL [__VERIFIER_nondet_uint()=6, j=10, n=6] [L12] int i, j=10, n=__VERIFIER_nondet_uint(), sn=0; VAL [j=10, n=0, n=6] [L13] i=1 VAL [i=1, j=10, n=6, n=0] [L13] COND TRUE i<=n VAL [i=1, j=10, n=6, n=0] [L14] COND TRUE i