/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-new/half.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 23:41:08,301 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 23:41:08,304 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 23:41:08,321 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 23:41:08,322 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 23:41:08,324 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 23:41:08,325 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 23:41:08,338 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 23:41:08,341 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 23:41:08,341 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 23:41:08,343 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 23:41:08,345 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 23:41:08,346 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 23:41:08,349 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 23:41:08,350 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 23:41:08,351 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 23:41:08,352 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 23:41:08,353 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 23:41:08,354 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 23:41:08,356 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 23:41:08,358 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 23:41:08,359 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 23:41:08,360 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 23:41:08,360 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 23:41:08,363 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 23:41:08,363 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 23:41:08,363 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 23:41:08,364 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 23:41:08,364 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 23:41:08,365 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 23:41:08,365 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 23:41:08,366 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 23:41:08,367 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 23:41:08,367 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 23:41:08,368 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 23:41:08,368 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 23:41:08,369 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 23:41:08,369 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 23:41:08,370 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 23:41:08,370 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 23:41:08,371 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 23:41:08,372 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 23:41:08,381 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 23:41:08,381 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 23:41:08,382 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 23:41:08,382 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 23:41:08,383 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 23:41:08,383 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 23:41:08,383 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 23:41:08,383 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 23:41:08,383 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 23:41:08,384 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 23:41:08,384 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 23:41:08,384 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 23:41:08,384 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 23:41:08,384 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 23:41:08,385 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 23:41:08,385 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 23:41:08,385 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 23:41:08,385 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 23:41:08,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 23:41:08,386 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 23:41:08,386 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 23:41:08,386 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 23:41:08,386 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-08 23:41:08,653 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 23:41:08,673 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 23:41:08,676 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 23:41:08,678 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 23:41:08,678 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 23:41:08,679 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/half.i [2020-07-08 23:41:08,747 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8755d8da/efbefaca2caf449a9aaf6f42389744de/FLAG5c8fa84d0 [2020-07-08 23:41:09,248 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 23:41:09,249 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/half.i [2020-07-08 23:41:09,256 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8755d8da/efbefaca2caf449a9aaf6f42389744de/FLAG5c8fa84d0 [2020-07-08 23:41:09,670 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8755d8da/efbefaca2caf449a9aaf6f42389744de [2020-07-08 23:41:09,681 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 23:41:09,683 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 23:41:09,684 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 23:41:09,684 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 23:41:09,688 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 23:41:09,689 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:41:09" (1/1) ... [2020-07-08 23:41:09,692 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b754fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:41:09, skipping insertion in model container [2020-07-08 23:41:09,693 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:41:09" (1/1) ... [2020-07-08 23:41:09,701 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 23:41:09,716 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 23:41:09,876 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:41:09,881 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 23:41:09,900 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:41:09,915 INFO L208 MainTranslator]: Completed translation [2020-07-08 23:41:09,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:41:09 WrapperNode [2020-07-08 23:41:09,916 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 23:41:09,917 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 23:41:09,917 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 23:41:09,917 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 23:41:09,928 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:41:09" (1/1) ... [2020-07-08 23:41:09,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:41:09" (1/1) ... [2020-07-08 23:41:09,933 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:41:09" (1/1) ... [2020-07-08 23:41:09,933 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:41:09" (1/1) ... [2020-07-08 23:41:10,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:41:09" (1/1) ... [2020-07-08 23:41:10,031 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:41:09" (1/1) ... [2020-07-08 23:41:10,032 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:41:09" (1/1) ... [2020-07-08 23:41:10,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 23:41:10,034 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 23:41:10,034 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 23:41:10,034 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 23:41:10,035 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:41:09" (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-08 23:41:10,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 23:41:10,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 23:41:10,102 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 23:41:10,102 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 23:41:10,102 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 23:41:10,102 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 23:41:10,103 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 23:41:10,103 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 23:41:10,103 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 23:41:10,103 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 23:41:10,103 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 23:41:10,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 23:41:10,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 23:41:10,402 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 23:41:10,403 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-08 23:41:10,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:41:10 BoogieIcfgContainer [2020-07-08 23:41:10,411 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 23:41:10,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 23:41:10,420 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 23:41:10,428 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 23:41:10,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 11:41:09" (1/3) ... [2020-07-08 23:41:10,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c51356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:41:10, skipping insertion in model container [2020-07-08 23:41:10,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:41:09" (2/3) ... [2020-07-08 23:41:10,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c51356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:41:10, skipping insertion in model container [2020-07-08 23:41:10,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:41:10" (3/3) ... [2020-07-08 23:41:10,443 INFO L109 eAbstractionObserver]: Analyzing ICFG half.i [2020-07-08 23:41:10,465 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 23:41:10,474 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 23:41:10,501 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 23:41:10,527 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 23:41:10,527 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 23:41:10,527 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 23:41:10,528 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 23:41:10,528 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 23:41:10,528 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 23:41:10,528 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 23:41:10,528 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 23:41:10,541 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2020-07-08 23:41:10,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-08 23:41:10,553 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:41:10,554 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:41:10,554 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:41:10,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:41:10,560 INFO L82 PathProgramCache]: Analyzing trace with hash 789700725, now seen corresponding path program 1 times [2020-07-08 23:41:10,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:41:10,568 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1186273616] [2020-07-08 23:41:10,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:41:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:41:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:41:10,713 INFO L280 TraceCheckUtils]: 0: Hoare triple {35#true} assume true; {35#true} is VALID [2020-07-08 23:41:10,714 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {35#true} {35#true} #62#return; {35#true} is VALID [2020-07-08 23:41:10,716 INFO L263 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {35#true} is VALID [2020-07-08 23:41:10,716 INFO L280 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2020-07-08 23:41:10,716 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #62#return; {35#true} is VALID [2020-07-08 23:41:10,717 INFO L263 TraceCheckUtils]: 3: Hoare triple {35#true} call #t~ret3 := main(); {35#true} is VALID [2020-07-08 23:41:10,717 INFO L280 TraceCheckUtils]: 4: Hoare triple {35#true} ~i~0 := 0; {35#true} is VALID [2020-07-08 23:41:10,717 INFO L280 TraceCheckUtils]: 5: Hoare triple {35#true} ~n~0 := 0; {35#true} is VALID [2020-07-08 23:41:10,718 INFO L280 TraceCheckUtils]: 6: Hoare triple {35#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {35#true} is VALID [2020-07-08 23:41:10,718 INFO L280 TraceCheckUtils]: 7: Hoare triple {35#true} ~k~0 := #t~nondet0; {35#true} is VALID [2020-07-08 23:41:10,718 INFO L280 TraceCheckUtils]: 8: Hoare triple {35#true} havoc #t~nondet0; {35#true} is VALID [2020-07-08 23:41:10,719 INFO L280 TraceCheckUtils]: 9: Hoare triple {35#true} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000); {35#true} is VALID [2020-07-08 23:41:10,719 INFO L280 TraceCheckUtils]: 10: Hoare triple {35#true} ~i~0 := 0; {35#true} is VALID [2020-07-08 23:41:10,728 INFO L280 TraceCheckUtils]: 11: Hoare triple {35#true} assume !true; {36#false} is VALID [2020-07-08 23:41:10,728 INFO L263 TraceCheckUtils]: 12: Hoare triple {36#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {36#false} is VALID [2020-07-08 23:41:10,729 INFO L280 TraceCheckUtils]: 13: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2020-07-08 23:41:10,729 INFO L280 TraceCheckUtils]: 14: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2020-07-08 23:41:10,729 INFO L280 TraceCheckUtils]: 15: Hoare triple {36#false} assume !false; {36#false} is VALID [2020-07-08 23:41:10,734 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-08 23:41:10,736 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1186273616] [2020-07-08 23:41:10,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:41:10,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-08 23:41:10,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108317980] [2020-07-08 23:41:10,748 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2020-07-08 23:41:10,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:41:10,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-08 23:41:10,810 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:41:10,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-08 23:41:10,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:41:10,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-08 23:41:10,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-08 23:41:10,822 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2020-07-08 23:41:10,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:10,934 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2020-07-08 23:41:10,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-08 23:41:10,934 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2020-07-08 23:41:10,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:41:10,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 23:41:10,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2020-07-08 23:41:10,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 23:41:10,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2020-07-08 23:41:10,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 49 transitions. [2020-07-08 23:41:11,089 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:41:11,102 INFO L225 Difference]: With dead ends: 44 [2020-07-08 23:41:11,102 INFO L226 Difference]: Without dead ends: 24 [2020-07-08 23:41:11,106 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-08 23:41:11,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-08 23:41:11,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-08 23:41:11,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:41:11,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2020-07-08 23:41:11,158 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-08 23:41:11,159 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-08 23:41:11,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:11,163 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-08 23:41:11,163 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-08 23:41:11,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:41:11,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:41:11,164 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-08 23:41:11,164 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-08 23:41:11,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:11,168 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-08 23:41:11,169 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-08 23:41:11,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:41:11,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:41:11,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:41:11,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:41:11,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-08 23:41:11,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2020-07-08 23:41:11,174 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 16 [2020-07-08 23:41:11,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:41:11,174 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-07-08 23:41:11,175 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-08 23:41:11,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 25 transitions. [2020-07-08 23:41:11,211 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-08 23:41:11,211 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-08 23:41:11,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-08 23:41:11,212 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:41:11,212 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:41:11,213 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 23:41:11,213 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:41:11,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:41:11,213 INFO L82 PathProgramCache]: Analyzing trace with hash 774924389, now seen corresponding path program 1 times [2020-07-08 23:41:11,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:41:11,214 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1641109921] [2020-07-08 23:41:11,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:41:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:41:11,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:41:11,539 INFO L280 TraceCheckUtils]: 0: Hoare triple {225#true} assume true; {225#true} is VALID [2020-07-08 23:41:11,539 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {225#true} {225#true} #62#return; {225#true} is VALID [2020-07-08 23:41:11,540 INFO L263 TraceCheckUtils]: 0: Hoare triple {225#true} call ULTIMATE.init(); {225#true} is VALID [2020-07-08 23:41:11,540 INFO L280 TraceCheckUtils]: 1: Hoare triple {225#true} assume true; {225#true} is VALID [2020-07-08 23:41:11,540 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {225#true} {225#true} #62#return; {225#true} is VALID [2020-07-08 23:41:11,540 INFO L263 TraceCheckUtils]: 3: Hoare triple {225#true} call #t~ret3 := main(); {225#true} is VALID [2020-07-08 23:41:11,541 INFO L280 TraceCheckUtils]: 4: Hoare triple {225#true} ~i~0 := 0; {225#true} is VALID [2020-07-08 23:41:11,542 INFO L280 TraceCheckUtils]: 5: Hoare triple {225#true} ~n~0 := 0; {229#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-08 23:41:11,543 INFO L280 TraceCheckUtils]: 6: Hoare triple {229#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {229#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-08 23:41:11,544 INFO L280 TraceCheckUtils]: 7: Hoare triple {229#(and (<= 0 main_~n~0) (<= main_~n~0 0))} ~k~0 := #t~nondet0; {230#(and (or (<= 0 main_~n~0) (< main_~k~0 (+ main_~n~0 1))) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} is VALID [2020-07-08 23:41:11,546 INFO L280 TraceCheckUtils]: 8: Hoare triple {230#(and (or (<= 0 main_~n~0) (< main_~k~0 (+ main_~n~0 1))) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} havoc #t~nondet0; {230#(and (or (<= 0 main_~n~0) (< main_~k~0 (+ main_~n~0 1))) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} is VALID [2020-07-08 23:41:11,547 INFO L280 TraceCheckUtils]: 9: Hoare triple {230#(and (or (<= 0 main_~n~0) (< main_~k~0 (+ main_~n~0 1))) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000); {230#(and (or (<= 0 main_~n~0) (< main_~k~0 (+ main_~n~0 1))) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} is VALID [2020-07-08 23:41:11,548 INFO L280 TraceCheckUtils]: 10: Hoare triple {230#(and (or (<= 0 main_~n~0) (< main_~k~0 (+ main_~n~0 1))) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} ~i~0 := 0; {231#(and (or (< main_~k~0 (+ main_~n~0 1)) (<= main_~i~0 (* 2 main_~n~0))) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} is VALID [2020-07-08 23:41:11,549 INFO L280 TraceCheckUtils]: 11: Hoare triple {231#(and (or (< main_~k~0 (+ main_~n~0 1)) (<= main_~i~0 (* 2 main_~n~0))) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} assume !(~i~0 < 2 * ~k~0); {232#(and (<= main_~k~0 main_~n~0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} is VALID [2020-07-08 23:41:11,551 INFO L263 TraceCheckUtils]: 12: Hoare triple {232#(and (<= main_~k~0 main_~n~0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {233#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 23:41:11,552 INFO L280 TraceCheckUtils]: 13: Hoare triple {233#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {234#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 23:41:11,553 INFO L280 TraceCheckUtils]: 14: Hoare triple {234#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {226#false} is VALID [2020-07-08 23:41:11,553 INFO L280 TraceCheckUtils]: 15: Hoare triple {226#false} assume !false; {226#false} is VALID [2020-07-08 23:41:11,556 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-08 23:41:11,557 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1641109921] [2020-07-08 23:41:11,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:41:11,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-08 23:41:11,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98327796] [2020-07-08 23:41:11,559 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-07-08 23:41:11,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:41:11,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 23:41:11,582 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:41:11,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 23:41:11,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:41:11,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 23:41:11,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-08 23:41:11,583 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2020-07-08 23:41:11,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:11,937 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2020-07-08 23:41:11,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 23:41:11,937 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-07-08 23:41:11,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:41:11,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 23:41:11,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2020-07-08 23:41:11,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 23:41:11,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2020-07-08 23:41:11,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2020-07-08 23:41:12,001 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:41:12,004 INFO L225 Difference]: With dead ends: 43 [2020-07-08 23:41:12,004 INFO L226 Difference]: Without dead ends: 38 [2020-07-08 23:41:12,006 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-07-08 23:41:12,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-08 23:41:12,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 25. [2020-07-08 23:41:12,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:41:12,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 25 states. [2020-07-08 23:41:12,030 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 25 states. [2020-07-08 23:41:12,030 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 25 states. [2020-07-08 23:41:12,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:12,034 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2020-07-08 23:41:12,034 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-07-08 23:41:12,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:41:12,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:41:12,035 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 38 states. [2020-07-08 23:41:12,035 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 38 states. [2020-07-08 23:41:12,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:12,039 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2020-07-08 23:41:12,039 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-07-08 23:41:12,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:41:12,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:41:12,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:41:12,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:41:12,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-08 23:41:12,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2020-07-08 23:41:12,043 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 16 [2020-07-08 23:41:12,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:41:12,043 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-07-08 23:41:12,043 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 23:41:12,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 26 transitions. [2020-07-08 23:41:12,074 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:41:12,074 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-08 23:41:12,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-08 23:41:12,075 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:41:12,075 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] [2020-07-08 23:41:12,076 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 23:41:12,076 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:41:12,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:41:12,076 INFO L82 PathProgramCache]: Analyzing trace with hash 775379929, now seen corresponding path program 1 times [2020-07-08 23:41:12,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:41:12,077 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1287267131] [2020-07-08 23:41:12,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:41:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:41:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:41:12,500 INFO L280 TraceCheckUtils]: 0: Hoare triple {455#true} assume true; {455#true} is VALID [2020-07-08 23:41:12,500 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {455#true} {455#true} #62#return; {455#true} is VALID [2020-07-08 23:41:12,500 INFO L263 TraceCheckUtils]: 0: Hoare triple {455#true} call ULTIMATE.init(); {455#true} is VALID [2020-07-08 23:41:12,501 INFO L280 TraceCheckUtils]: 1: Hoare triple {455#true} assume true; {455#true} is VALID [2020-07-08 23:41:12,501 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {455#true} {455#true} #62#return; {455#true} is VALID [2020-07-08 23:41:12,501 INFO L263 TraceCheckUtils]: 3: Hoare triple {455#true} call #t~ret3 := main(); {455#true} is VALID [2020-07-08 23:41:12,501 INFO L280 TraceCheckUtils]: 4: Hoare triple {455#true} ~i~0 := 0; {455#true} is VALID [2020-07-08 23:41:12,502 INFO L280 TraceCheckUtils]: 5: Hoare triple {455#true} ~n~0 := 0; {459#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-08 23:41:12,506 INFO L280 TraceCheckUtils]: 6: Hoare triple {459#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {459#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-08 23:41:12,508 INFO L280 TraceCheckUtils]: 7: Hoare triple {459#(and (<= 0 main_~n~0) (<= main_~n~0 0))} ~k~0 := #t~nondet0; {460#(and (or (<= 0 main_~n~0) (< main_~k~0 (+ main_~n~0 1))) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} is VALID [2020-07-08 23:41:12,509 INFO L280 TraceCheckUtils]: 8: Hoare triple {460#(and (or (<= 0 main_~n~0) (< main_~k~0 (+ main_~n~0 1))) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} havoc #t~nondet0; {460#(and (or (<= 0 main_~n~0) (< main_~k~0 (+ main_~n~0 1))) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} is VALID [2020-07-08 23:41:12,511 INFO L280 TraceCheckUtils]: 9: Hoare triple {460#(and (or (<= 0 main_~n~0) (< main_~k~0 (+ main_~n~0 1))) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000); {460#(and (or (<= 0 main_~n~0) (< main_~k~0 (+ main_~n~0 1))) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} is VALID [2020-07-08 23:41:12,513 INFO L280 TraceCheckUtils]: 10: Hoare triple {460#(and (or (<= 0 main_~n~0) (< main_~k~0 (+ main_~n~0 1))) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} ~i~0 := 0; {461#(and (or (< main_~k~0 (+ main_~n~0 1)) (<= main_~i~0 (* 2 main_~n~0))) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} is VALID [2020-07-08 23:41:12,514 INFO L280 TraceCheckUtils]: 11: Hoare triple {461#(and (or (< main_~k~0 (+ main_~n~0 1)) (<= main_~i~0 (* 2 main_~n~0))) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} assume !!(~i~0 < 2 * ~k~0); {461#(and (or (< main_~k~0 (+ main_~n~0 1)) (<= main_~i~0 (* 2 main_~n~0))) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} is VALID [2020-07-08 23:41:12,519 INFO L280 TraceCheckUtils]: 12: Hoare triple {461#(and (or (< main_~k~0 (+ main_~n~0 1)) (<= main_~i~0 (* 2 main_~n~0))) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {461#(and (or (< main_~k~0 (+ main_~n~0 1)) (<= main_~i~0 (* 2 main_~n~0))) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} is VALID [2020-07-08 23:41:12,520 INFO L280 TraceCheckUtils]: 13: Hoare triple {461#(and (or (< main_~k~0 (+ main_~n~0 1)) (<= main_~i~0 (* 2 main_~n~0))) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} #t~post1 := ~i~0; {462#(and (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)) (or (< main_~k~0 (+ main_~n~0 1)) (<= |main_#t~post1| (* 2 main_~n~0))))} is VALID [2020-07-08 23:41:12,521 INFO L280 TraceCheckUtils]: 14: Hoare triple {462#(and (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)) (or (< main_~k~0 (+ main_~n~0 1)) (<= |main_#t~post1| (* 2 main_~n~0))))} ~i~0 := 1 + #t~post1; {463#(and (or (<= main_~i~0 (+ (* 2 main_~n~0) 1)) (< main_~k~0 (+ main_~n~0 1))) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} is VALID [2020-07-08 23:41:12,522 INFO L280 TraceCheckUtils]: 15: Hoare triple {463#(and (or (<= main_~i~0 (+ (* 2 main_~n~0) 1)) (< main_~k~0 (+ main_~n~0 1))) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} havoc #t~post1; {463#(and (or (<= main_~i~0 (+ (* 2 main_~n~0) 1)) (< main_~k~0 (+ main_~n~0 1))) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} is VALID [2020-07-08 23:41:12,524 INFO L280 TraceCheckUtils]: 16: Hoare triple {463#(and (or (<= main_~i~0 (+ (* 2 main_~n~0) 1)) (< main_~k~0 (+ main_~n~0 1))) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} assume !(~i~0 < 2 * ~k~0); {464#(and (<= main_~k~0 main_~n~0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} is VALID [2020-07-08 23:41:12,525 INFO L263 TraceCheckUtils]: 17: Hoare triple {464#(and (<= main_~k~0 main_~n~0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {465#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 23:41:12,526 INFO L280 TraceCheckUtils]: 18: Hoare triple {465#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {466#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 23:41:12,526 INFO L280 TraceCheckUtils]: 19: Hoare triple {466#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {456#false} is VALID [2020-07-08 23:41:12,526 INFO L280 TraceCheckUtils]: 20: Hoare triple {456#false} assume !false; {456#false} is VALID [2020-07-08 23:41:12,529 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-08 23:41:12,530 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1287267131] [2020-07-08 23:41:12,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:41:12,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-08 23:41:12,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938256679] [2020-07-08 23:41:12,531 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2020-07-08 23:41:12,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:41:12,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-08 23:41:12,557 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:41:12,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-08 23:41:12,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:41:12,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-08 23:41:12,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-08 23:41:12,558 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 10 states. [2020-07-08 23:41:13,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:13,262 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2020-07-08 23:41:13,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 23:41:13,263 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2020-07-08 23:41:13,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:41:13,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 23:41:13,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2020-07-08 23:41:13,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 23:41:13,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2020-07-08 23:41:13,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 53 transitions. [2020-07-08 23:41:13,357 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:41:13,360 INFO L225 Difference]: With dead ends: 48 [2020-07-08 23:41:13,360 INFO L226 Difference]: Without dead ends: 43 [2020-07-08 23:41:13,361 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2020-07-08 23:41:13,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-08 23:41:13,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2020-07-08 23:41:13,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:41:13,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 30 states. [2020-07-08 23:41:13,416 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 30 states. [2020-07-08 23:41:13,416 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 30 states. [2020-07-08 23:41:13,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:13,420 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2020-07-08 23:41:13,420 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2020-07-08 23:41:13,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:41:13,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:41:13,421 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 43 states. [2020-07-08 23:41:13,421 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 43 states. [2020-07-08 23:41:13,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:13,424 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2020-07-08 23:41:13,424 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2020-07-08 23:41:13,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:41:13,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:41:13,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:41:13,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:41:13,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-08 23:41:13,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2020-07-08 23:41:13,428 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 21 [2020-07-08 23:41:13,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:41:13,428 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2020-07-08 23:41:13,428 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-08 23:41:13,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 32 transitions. [2020-07-08 23:41:13,476 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-08 23:41:13,476 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-08 23:41:13,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-08 23:41:13,477 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:41:13,477 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-08 23:41:13,478 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 23:41:13,478 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:41:13,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:41:13,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1973531292, now seen corresponding path program 1 times [2020-07-08 23:41:13,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:41:13,479 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [363567980] [2020-07-08 23:41:13,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:41:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:41:13,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:41:13,650 INFO L280 TraceCheckUtils]: 0: Hoare triple {723#true} assume true; {723#true} is VALID [2020-07-08 23:41:13,651 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {723#true} {723#true} #62#return; {723#true} is VALID [2020-07-08 23:41:13,651 INFO L263 TraceCheckUtils]: 0: Hoare triple {723#true} call ULTIMATE.init(); {723#true} is VALID [2020-07-08 23:41:13,651 INFO L280 TraceCheckUtils]: 1: Hoare triple {723#true} assume true; {723#true} is VALID [2020-07-08 23:41:13,651 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {723#true} {723#true} #62#return; {723#true} is VALID [2020-07-08 23:41:13,652 INFO L263 TraceCheckUtils]: 3: Hoare triple {723#true} call #t~ret3 := main(); {723#true} is VALID [2020-07-08 23:41:13,652 INFO L280 TraceCheckUtils]: 4: Hoare triple {723#true} ~i~0 := 0; {723#true} is VALID [2020-07-08 23:41:13,652 INFO L280 TraceCheckUtils]: 5: Hoare triple {723#true} ~n~0 := 0; {723#true} is VALID [2020-07-08 23:41:13,652 INFO L280 TraceCheckUtils]: 6: Hoare triple {723#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {723#true} is VALID [2020-07-08 23:41:13,653 INFO L280 TraceCheckUtils]: 7: Hoare triple {723#true} ~k~0 := #t~nondet0; {723#true} is VALID [2020-07-08 23:41:13,653 INFO L280 TraceCheckUtils]: 8: Hoare triple {723#true} havoc #t~nondet0; {723#true} is VALID [2020-07-08 23:41:13,653 INFO L280 TraceCheckUtils]: 9: Hoare triple {723#true} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000); {723#true} is VALID [2020-07-08 23:41:13,654 INFO L280 TraceCheckUtils]: 10: Hoare triple {723#true} ~i~0 := 0; {727#(and (or (<= 0 main_~i~0) (< 0 main_~k~0)) (or (<= main_~i~0 0) (<= main_~k~0 0)))} is VALID [2020-07-08 23:41:13,655 INFO L280 TraceCheckUtils]: 11: Hoare triple {727#(and (or (<= 0 main_~i~0) (< 0 main_~k~0)) (or (<= main_~i~0 0) (<= main_~k~0 0)))} assume !!(~i~0 < 2 * ~k~0); {728#(and (<= main_~i~0 0) (< 0 main_~k~0))} is VALID [2020-07-08 23:41:13,656 INFO L280 TraceCheckUtils]: 12: Hoare triple {728#(and (<= main_~i~0 0) (< 0 main_~k~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2); {728#(and (<= main_~i~0 0) (< 0 main_~k~0))} is VALID [2020-07-08 23:41:13,656 INFO L280 TraceCheckUtils]: 13: Hoare triple {728#(and (<= main_~i~0 0) (< 0 main_~k~0))} #t~post2 := ~n~0; {728#(and (<= main_~i~0 0) (< 0 main_~k~0))} is VALID [2020-07-08 23:41:13,657 INFO L280 TraceCheckUtils]: 14: Hoare triple {728#(and (<= main_~i~0 0) (< 0 main_~k~0))} ~n~0 := 1 + #t~post2; {728#(and (<= main_~i~0 0) (< 0 main_~k~0))} is VALID [2020-07-08 23:41:13,657 INFO L280 TraceCheckUtils]: 15: Hoare triple {728#(and (<= main_~i~0 0) (< 0 main_~k~0))} havoc #t~post2; {728#(and (<= main_~i~0 0) (< 0 main_~k~0))} is VALID [2020-07-08 23:41:13,658 INFO L280 TraceCheckUtils]: 16: Hoare triple {728#(and (<= main_~i~0 0) (< 0 main_~k~0))} #t~post1 := ~i~0; {729#(and (<= |main_#t~post1| 0) (< 0 main_~k~0))} is VALID [2020-07-08 23:41:13,659 INFO L280 TraceCheckUtils]: 17: Hoare triple {729#(and (<= |main_#t~post1| 0) (< 0 main_~k~0))} ~i~0 := 1 + #t~post1; {730#(and (< 0 main_~k~0) (<= main_~i~0 1))} is VALID [2020-07-08 23:41:13,659 INFO L280 TraceCheckUtils]: 18: Hoare triple {730#(and (< 0 main_~k~0) (<= main_~i~0 1))} havoc #t~post1; {730#(and (< 0 main_~k~0) (<= main_~i~0 1))} is VALID [2020-07-08 23:41:13,660 INFO L280 TraceCheckUtils]: 19: Hoare triple {730#(and (< 0 main_~k~0) (<= main_~i~0 1))} assume !(~i~0 < 2 * ~k~0); {724#false} is VALID [2020-07-08 23:41:13,660 INFO L263 TraceCheckUtils]: 20: Hoare triple {724#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {724#false} is VALID [2020-07-08 23:41:13,660 INFO L280 TraceCheckUtils]: 21: Hoare triple {724#false} ~cond := #in~cond; {724#false} is VALID [2020-07-08 23:41:13,660 INFO L280 TraceCheckUtils]: 22: Hoare triple {724#false} assume 0 == ~cond; {724#false} is VALID [2020-07-08 23:41:13,661 INFO L280 TraceCheckUtils]: 23: Hoare triple {724#false} assume !false; {724#false} is VALID [2020-07-08 23:41:13,662 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-08 23:41:13,662 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [363567980] [2020-07-08 23:41:13,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:41:13,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-08 23:41:13,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909337404] [2020-07-08 23:41:13,663 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-07-08 23:41:13,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:41:13,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 23:41:13,691 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-08 23:41:13,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 23:41:13,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:41:13,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 23:41:13,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-08 23:41:13,692 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 6 states. [2020-07-08 23:41:13,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:13,934 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2020-07-08 23:41:13,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 23:41:13,934 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-07-08 23:41:13,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:41:13,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 23:41:13,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2020-07-08 23:41:13,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 23:41:13,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2020-07-08 23:41:13,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2020-07-08 23:41:13,992 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:41:13,994 INFO L225 Difference]: With dead ends: 45 [2020-07-08 23:41:13,994 INFO L226 Difference]: Without dead ends: 40 [2020-07-08 23:41:13,995 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-08 23:41:13,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-08 23:41:14,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2020-07-08 23:41:14,048 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:41:14,048 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 34 states. [2020-07-08 23:41:14,048 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 34 states. [2020-07-08 23:41:14,049 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 34 states. [2020-07-08 23:41:14,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:14,051 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2020-07-08 23:41:14,051 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2020-07-08 23:41:14,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:41:14,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:41:14,052 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 40 states. [2020-07-08 23:41:14,052 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 40 states. [2020-07-08 23:41:14,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:14,055 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2020-07-08 23:41:14,055 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2020-07-08 23:41:14,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:41:14,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:41:14,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:41:14,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:41:14,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-08 23:41:14,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2020-07-08 23:41:14,058 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 24 [2020-07-08 23:41:14,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:41:14,059 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2020-07-08 23:41:14,059 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 23:41:14,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 37 transitions. [2020-07-08 23:41:14,107 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:41:14,108 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2020-07-08 23:41:14,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-08 23:41:14,109 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:41:14,109 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:41:14,109 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 23:41:14,109 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:41:14,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:41:14,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1316851483, now seen corresponding path program 2 times [2020-07-08 23:41:14,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:41:14,110 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [443255010] [2020-07-08 23:41:14,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:41:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:41:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:41:14,258 INFO L280 TraceCheckUtils]: 0: Hoare triple {975#true} assume true; {975#true} is VALID [2020-07-08 23:41:14,258 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {975#true} {975#true} #62#return; {975#true} is VALID [2020-07-08 23:41:14,259 INFO L263 TraceCheckUtils]: 0: Hoare triple {975#true} call ULTIMATE.init(); {975#true} is VALID [2020-07-08 23:41:14,259 INFO L280 TraceCheckUtils]: 1: Hoare triple {975#true} assume true; {975#true} is VALID [2020-07-08 23:41:14,259 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {975#true} {975#true} #62#return; {975#true} is VALID [2020-07-08 23:41:14,259 INFO L263 TraceCheckUtils]: 3: Hoare triple {975#true} call #t~ret3 := main(); {975#true} is VALID [2020-07-08 23:41:14,260 INFO L280 TraceCheckUtils]: 4: Hoare triple {975#true} ~i~0 := 0; {975#true} is VALID [2020-07-08 23:41:14,260 INFO L280 TraceCheckUtils]: 5: Hoare triple {975#true} ~n~0 := 0; {975#true} is VALID [2020-07-08 23:41:14,260 INFO L280 TraceCheckUtils]: 6: Hoare triple {975#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {975#true} is VALID [2020-07-08 23:41:14,260 INFO L280 TraceCheckUtils]: 7: Hoare triple {975#true} ~k~0 := #t~nondet0; {975#true} is VALID [2020-07-08 23:41:14,261 INFO L280 TraceCheckUtils]: 8: Hoare triple {975#true} havoc #t~nondet0; {975#true} is VALID [2020-07-08 23:41:14,261 INFO L280 TraceCheckUtils]: 9: Hoare triple {975#true} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000); {975#true} is VALID [2020-07-08 23:41:14,261 INFO L280 TraceCheckUtils]: 10: Hoare triple {975#true} ~i~0 := 0; {979#(and (<= main_~i~0 (* 2 (div main_~i~0 2))) (< 0 (+ (div main_~i~0 2) 1)))} is VALID [2020-07-08 23:41:14,262 INFO L280 TraceCheckUtils]: 11: Hoare triple {979#(and (<= main_~i~0 (* 2 (div main_~i~0 2))) (< 0 (+ (div main_~i~0 2) 1)))} assume !!(~i~0 < 2 * ~k~0); {979#(and (<= main_~i~0 (* 2 (div main_~i~0 2))) (< 0 (+ (div main_~i~0 2) 1)))} is VALID [2020-07-08 23:41:14,263 INFO L280 TraceCheckUtils]: 12: Hoare triple {979#(and (<= main_~i~0 (* 2 (div main_~i~0 2))) (< 0 (+ (div main_~i~0 2) 1)))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {976#false} is VALID [2020-07-08 23:41:14,263 INFO L280 TraceCheckUtils]: 13: Hoare triple {976#false} #t~post1 := ~i~0; {976#false} is VALID [2020-07-08 23:41:14,263 INFO L280 TraceCheckUtils]: 14: Hoare triple {976#false} ~i~0 := 1 + #t~post1; {976#false} is VALID [2020-07-08 23:41:14,263 INFO L280 TraceCheckUtils]: 15: Hoare triple {976#false} havoc #t~post1; {976#false} is VALID [2020-07-08 23:41:14,264 INFO L280 TraceCheckUtils]: 16: Hoare triple {976#false} assume !!(~i~0 < 2 * ~k~0); {976#false} is VALID [2020-07-08 23:41:14,264 INFO L280 TraceCheckUtils]: 17: Hoare triple {976#false} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {976#false} is VALID [2020-07-08 23:41:14,264 INFO L280 TraceCheckUtils]: 18: Hoare triple {976#false} #t~post1 := ~i~0; {976#false} is VALID [2020-07-08 23:41:14,264 INFO L280 TraceCheckUtils]: 19: Hoare triple {976#false} ~i~0 := 1 + #t~post1; {976#false} is VALID [2020-07-08 23:41:14,265 INFO L280 TraceCheckUtils]: 20: Hoare triple {976#false} havoc #t~post1; {976#false} is VALID [2020-07-08 23:41:14,265 INFO L280 TraceCheckUtils]: 21: Hoare triple {976#false} assume !(~i~0 < 2 * ~k~0); {976#false} is VALID [2020-07-08 23:41:14,265 INFO L263 TraceCheckUtils]: 22: Hoare triple {976#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {976#false} is VALID [2020-07-08 23:41:14,265 INFO L280 TraceCheckUtils]: 23: Hoare triple {976#false} ~cond := #in~cond; {976#false} is VALID [2020-07-08 23:41:14,266 INFO L280 TraceCheckUtils]: 24: Hoare triple {976#false} assume 0 == ~cond; {976#false} is VALID [2020-07-08 23:41:14,266 INFO L280 TraceCheckUtils]: 25: Hoare triple {976#false} assume !false; {976#false} is VALID [2020-07-08 23:41:14,267 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-08 23:41:14,267 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [443255010] [2020-07-08 23:41:14,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:41:14,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 23:41:14,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26042695] [2020-07-08 23:41:14,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-08 23:41:14,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:41:14,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 23:41:14,297 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:41:14,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 23:41:14,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:41:14,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 23:41:14,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 23:41:14,298 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 3 states. [2020-07-08 23:41:14,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:14,446 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2020-07-08 23:41:14,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 23:41:14,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-08 23:41:14,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:41:14,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 23:41:14,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2020-07-08 23:41:14,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 23:41:14,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2020-07-08 23:41:14,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2020-07-08 23:41:14,494 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:41:14,496 INFO L225 Difference]: With dead ends: 60 [2020-07-08 23:41:14,496 INFO L226 Difference]: Without dead ends: 39 [2020-07-08 23:41:14,496 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 23:41:14,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-08 23:41:14,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2020-07-08 23:41:14,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:41:14,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 34 states. [2020-07-08 23:41:14,557 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 34 states. [2020-07-08 23:41:14,557 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 34 states. [2020-07-08 23:41:14,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:14,559 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-07-08 23:41:14,559 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-07-08 23:41:14,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:41:14,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:41:14,560 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 39 states. [2020-07-08 23:41:14,561 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 39 states. [2020-07-08 23:41:14,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:14,563 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-07-08 23:41:14,563 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-07-08 23:41:14,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:41:14,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:41:14,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:41:14,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:41:14,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-08 23:41:14,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2020-07-08 23:41:14,570 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 26 [2020-07-08 23:41:14,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:41:14,570 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2020-07-08 23:41:14,570 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 23:41:14,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 36 transitions. [2020-07-08 23:41:14,610 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-08 23:41:14,610 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2020-07-08 23:41:14,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-08 23:41:14,611 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:41:14,611 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:41:14,611 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 23:41:14,611 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:41:14,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:41:14,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1981883390, now seen corresponding path program 1 times [2020-07-08 23:41:14,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:41:14,612 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [783981203] [2020-07-08 23:41:14,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:41:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:41:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:41:15,079 INFO L280 TraceCheckUtils]: 0: Hoare triple {1248#true} assume true; {1248#true} is VALID [2020-07-08 23:41:15,079 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1248#true} {1248#true} #62#return; {1248#true} is VALID [2020-07-08 23:41:15,080 INFO L263 TraceCheckUtils]: 0: Hoare triple {1248#true} call ULTIMATE.init(); {1248#true} is VALID [2020-07-08 23:41:15,080 INFO L280 TraceCheckUtils]: 1: Hoare triple {1248#true} assume true; {1248#true} is VALID [2020-07-08 23:41:15,080 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1248#true} {1248#true} #62#return; {1248#true} is VALID [2020-07-08 23:41:15,081 INFO L263 TraceCheckUtils]: 3: Hoare triple {1248#true} call #t~ret3 := main(); {1248#true} is VALID [2020-07-08 23:41:15,081 INFO L280 TraceCheckUtils]: 4: Hoare triple {1248#true} ~i~0 := 0; {1248#true} is VALID [2020-07-08 23:41:15,081 INFO L280 TraceCheckUtils]: 5: Hoare triple {1248#true} ~n~0 := 0; {1252#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-08 23:41:15,089 INFO L280 TraceCheckUtils]: 6: Hoare triple {1252#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1252#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-08 23:41:15,090 INFO L280 TraceCheckUtils]: 7: Hoare triple {1252#(and (<= 0 main_~n~0) (<= main_~n~0 0))} ~k~0 := #t~nondet0; {1252#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-08 23:41:15,090 INFO L280 TraceCheckUtils]: 8: Hoare triple {1252#(and (<= 0 main_~n~0) (<= main_~n~0 0))} havoc #t~nondet0; {1252#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-08 23:41:15,091 INFO L280 TraceCheckUtils]: 9: Hoare triple {1252#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000); {1252#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-08 23:41:15,092 INFO L280 TraceCheckUtils]: 10: Hoare triple {1252#(and (<= 0 main_~n~0) (<= main_~n~0 0))} ~i~0 := 0; {1253#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-08 23:41:15,093 INFO L280 TraceCheckUtils]: 11: Hoare triple {1253#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {1253#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-08 23:41:15,094 INFO L280 TraceCheckUtils]: 12: Hoare triple {1253#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2); {1253#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-08 23:41:15,096 INFO L280 TraceCheckUtils]: 13: Hoare triple {1253#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} #t~post2 := ~n~0; {1254#(and (<= (* 2 |main_#t~post2|) main_~i~0) (<= main_~i~0 (* 2 |main_#t~post2|)))} is VALID [2020-07-08 23:41:15,097 INFO L280 TraceCheckUtils]: 14: Hoare triple {1254#(and (<= (* 2 |main_#t~post2|) main_~i~0) (<= main_~i~0 (* 2 |main_#t~post2|)))} ~n~0 := 1 + #t~post2; {1255#(and (or (<= (+ main_~i~0 2) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (or (<= (* 2 main_~n~0) (+ main_~i~0 2)) (< main_~n~0 (+ main_~k~0 1))))} is VALID [2020-07-08 23:41:15,097 INFO L280 TraceCheckUtils]: 15: Hoare triple {1255#(and (or (<= (+ main_~i~0 2) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (or (<= (* 2 main_~n~0) (+ main_~i~0 2)) (< main_~n~0 (+ main_~k~0 1))))} havoc #t~post2; {1255#(and (or (<= (+ main_~i~0 2) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (or (<= (* 2 main_~n~0) (+ main_~i~0 2)) (< main_~n~0 (+ main_~k~0 1))))} is VALID [2020-07-08 23:41:15,098 INFO L280 TraceCheckUtils]: 16: Hoare triple {1255#(and (or (<= (+ main_~i~0 2) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (or (<= (* 2 main_~n~0) (+ main_~i~0 2)) (< main_~n~0 (+ main_~k~0 1))))} #t~post1 := ~i~0; {1256#(and (or (<= (+ |main_#t~post1| 2) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (or (<= (* 2 main_~n~0) (+ |main_#t~post1| 2)) (< main_~n~0 (+ main_~k~0 1))))} is VALID [2020-07-08 23:41:15,099 INFO L280 TraceCheckUtils]: 17: Hoare triple {1256#(and (or (<= (+ |main_#t~post1| 2) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (or (<= (* 2 main_~n~0) (+ |main_#t~post1| 2)) (< main_~n~0 (+ main_~k~0 1))))} ~i~0 := 1 + #t~post1; {1257#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (or (<= (* 2 main_~n~0) (+ main_~i~0 1)) (< main_~n~0 (+ main_~k~0 1))))} is VALID [2020-07-08 23:41:15,100 INFO L280 TraceCheckUtils]: 18: Hoare triple {1257#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (or (<= (* 2 main_~n~0) (+ main_~i~0 1)) (< main_~n~0 (+ main_~k~0 1))))} havoc #t~post1; {1257#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (or (<= (* 2 main_~n~0) (+ main_~i~0 1)) (< main_~n~0 (+ main_~k~0 1))))} is VALID [2020-07-08 23:41:15,103 INFO L280 TraceCheckUtils]: 19: Hoare triple {1257#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (or (<= (* 2 main_~n~0) (+ main_~i~0 1)) (< main_~n~0 (+ main_~k~0 1))))} assume !!(~i~0 < 2 * ~k~0); {1258#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2020-07-08 23:41:15,104 INFO L280 TraceCheckUtils]: 20: Hoare triple {1258#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {1258#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2020-07-08 23:41:15,104 INFO L280 TraceCheckUtils]: 21: Hoare triple {1258#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} #t~post1 := ~i~0; {1259#(and (or (<= (+ |main_#t~post1| 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2020-07-08 23:41:15,105 INFO L280 TraceCheckUtils]: 22: Hoare triple {1259#(and (or (<= (+ |main_#t~post1| 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} ~i~0 := 1 + #t~post1; {1260#(and (or (<= main_~i~0 (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2020-07-08 23:41:15,106 INFO L280 TraceCheckUtils]: 23: Hoare triple {1260#(and (or (<= main_~i~0 (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} havoc #t~post1; {1260#(and (or (<= main_~i~0 (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2020-07-08 23:41:15,107 INFO L280 TraceCheckUtils]: 24: Hoare triple {1260#(and (or (<= main_~i~0 (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} assume !(~i~0 < 2 * ~k~0); {1261#(and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} is VALID [2020-07-08 23:41:15,110 INFO L263 TraceCheckUtils]: 25: Hoare triple {1261#(and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {1262#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 23:41:15,110 INFO L280 TraceCheckUtils]: 26: Hoare triple {1262#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1263#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 23:41:15,111 INFO L280 TraceCheckUtils]: 27: Hoare triple {1263#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1249#false} is VALID [2020-07-08 23:41:15,111 INFO L280 TraceCheckUtils]: 28: Hoare triple {1249#false} assume !false; {1249#false} is VALID [2020-07-08 23:41:15,114 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:41:15,115 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [783981203] [2020-07-08 23:41:15,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:41:15,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-07-08 23:41:15,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841574489] [2020-07-08 23:41:15,116 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2020-07-08 23:41:15,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:41:15,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-08 23:41:15,162 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:41:15,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-08 23:41:15,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:41:15,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-08 23:41:15,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2020-07-08 23:41:15,163 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 14 states. [2020-07-08 23:41:16,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:16,166 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2020-07-08 23:41:16,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-08 23:41:16,166 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2020-07-08 23:41:16,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:41:16,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 23:41:16,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 51 transitions. [2020-07-08 23:41:16,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 23:41:16,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 51 transitions. [2020-07-08 23:41:16,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 51 transitions. [2020-07-08 23:41:16,224 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:41:16,225 INFO L225 Difference]: With dead ends: 56 [2020-07-08 23:41:16,225 INFO L226 Difference]: Without dead ends: 51 [2020-07-08 23:41:16,226 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2020-07-08 23:41:16,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-08 23:41:16,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2020-07-08 23:41:16,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:41:16,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 47 states. [2020-07-08 23:41:16,355 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 47 states. [2020-07-08 23:41:16,355 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 47 states. [2020-07-08 23:41:16,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:16,358 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2020-07-08 23:41:16,358 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2020-07-08 23:41:16,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:41:16,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:41:16,359 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 51 states. [2020-07-08 23:41:16,359 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 51 states. [2020-07-08 23:41:16,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:16,362 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2020-07-08 23:41:16,362 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2020-07-08 23:41:16,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:41:16,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:41:16,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:41:16,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:41:16,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-08 23:41:16,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2020-07-08 23:41:16,365 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 29 [2020-07-08 23:41:16,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:41:16,365 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2020-07-08 23:41:16,366 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-08 23:41:16,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 51 transitions. [2020-07-08 23:41:16,434 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:41:16,435 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2020-07-08 23:41:16,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-08 23:41:16,436 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:41:16,436 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:41:16,436 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 23:41:16,436 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:41:16,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:41:16,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1157374763, now seen corresponding path program 2 times [2020-07-08 23:41:16,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:41:16,437 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [349883288] [2020-07-08 23:41:16,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:41:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:41:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:41:16,539 INFO L280 TraceCheckUtils]: 0: Hoare triple {1594#true} assume true; {1594#true} is VALID [2020-07-08 23:41:16,540 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1594#true} {1594#true} #62#return; {1594#true} is VALID [2020-07-08 23:41:16,540 INFO L263 TraceCheckUtils]: 0: Hoare triple {1594#true} call ULTIMATE.init(); {1594#true} is VALID [2020-07-08 23:41:16,540 INFO L280 TraceCheckUtils]: 1: Hoare triple {1594#true} assume true; {1594#true} is VALID [2020-07-08 23:41:16,541 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1594#true} {1594#true} #62#return; {1594#true} is VALID [2020-07-08 23:41:16,541 INFO L263 TraceCheckUtils]: 3: Hoare triple {1594#true} call #t~ret3 := main(); {1594#true} is VALID [2020-07-08 23:41:16,541 INFO L280 TraceCheckUtils]: 4: Hoare triple {1594#true} ~i~0 := 0; {1594#true} is VALID [2020-07-08 23:41:16,542 INFO L280 TraceCheckUtils]: 5: Hoare triple {1594#true} ~n~0 := 0; {1594#true} is VALID [2020-07-08 23:41:16,542 INFO L280 TraceCheckUtils]: 6: Hoare triple {1594#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1594#true} is VALID [2020-07-08 23:41:16,542 INFO L280 TraceCheckUtils]: 7: Hoare triple {1594#true} ~k~0 := #t~nondet0; {1594#true} is VALID [2020-07-08 23:41:16,542 INFO L280 TraceCheckUtils]: 8: Hoare triple {1594#true} havoc #t~nondet0; {1594#true} is VALID [2020-07-08 23:41:16,543 INFO L280 TraceCheckUtils]: 9: Hoare triple {1594#true} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000); {1594#true} is VALID [2020-07-08 23:41:16,544 INFO L280 TraceCheckUtils]: 10: Hoare triple {1594#true} ~i~0 := 0; {1598#(and (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2020-07-08 23:41:16,544 INFO L280 TraceCheckUtils]: 11: Hoare triple {1598#(and (<= main_~i~0 0) (<= 0 main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {1598#(and (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2020-07-08 23:41:16,545 INFO L280 TraceCheckUtils]: 12: Hoare triple {1598#(and (<= main_~i~0 0) (<= 0 main_~i~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2); {1598#(and (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2020-07-08 23:41:16,546 INFO L280 TraceCheckUtils]: 13: Hoare triple {1598#(and (<= main_~i~0 0) (<= 0 main_~i~0))} #t~post2 := ~n~0; {1598#(and (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2020-07-08 23:41:16,547 INFO L280 TraceCheckUtils]: 14: Hoare triple {1598#(and (<= main_~i~0 0) (<= 0 main_~i~0))} ~n~0 := 1 + #t~post2; {1598#(and (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2020-07-08 23:41:16,548 INFO L280 TraceCheckUtils]: 15: Hoare triple {1598#(and (<= main_~i~0 0) (<= 0 main_~i~0))} havoc #t~post2; {1598#(and (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2020-07-08 23:41:16,549 INFO L280 TraceCheckUtils]: 16: Hoare triple {1598#(and (<= main_~i~0 0) (<= 0 main_~i~0))} #t~post1 := ~i~0; {1599#(and (<= |main_#t~post1| 0) (<= 0 |main_#t~post1|))} is VALID [2020-07-08 23:41:16,550 INFO L280 TraceCheckUtils]: 17: Hoare triple {1599#(and (<= |main_#t~post1| 0) (<= 0 |main_#t~post1|))} ~i~0 := 1 + #t~post1; {1600#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-08 23:41:16,550 INFO L280 TraceCheckUtils]: 18: Hoare triple {1600#(and (<= main_~i~0 1) (<= 1 main_~i~0))} havoc #t~post1; {1600#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-08 23:41:16,551 INFO L280 TraceCheckUtils]: 19: Hoare triple {1600#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {1600#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-08 23:41:16,552 INFO L280 TraceCheckUtils]: 20: Hoare triple {1600#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2); {1595#false} is VALID [2020-07-08 23:41:16,553 INFO L280 TraceCheckUtils]: 21: Hoare triple {1595#false} #t~post2 := ~n~0; {1595#false} is VALID [2020-07-08 23:41:16,553 INFO L280 TraceCheckUtils]: 22: Hoare triple {1595#false} ~n~0 := 1 + #t~post2; {1595#false} is VALID [2020-07-08 23:41:16,553 INFO L280 TraceCheckUtils]: 23: Hoare triple {1595#false} havoc #t~post2; {1595#false} is VALID [2020-07-08 23:41:16,553 INFO L280 TraceCheckUtils]: 24: Hoare triple {1595#false} #t~post1 := ~i~0; {1595#false} is VALID [2020-07-08 23:41:16,554 INFO L280 TraceCheckUtils]: 25: Hoare triple {1595#false} ~i~0 := 1 + #t~post1; {1595#false} is VALID [2020-07-08 23:41:16,554 INFO L280 TraceCheckUtils]: 26: Hoare triple {1595#false} havoc #t~post1; {1595#false} is VALID [2020-07-08 23:41:16,554 INFO L280 TraceCheckUtils]: 27: Hoare triple {1595#false} assume !!(~i~0 < 2 * ~k~0); {1595#false} is VALID [2020-07-08 23:41:16,554 INFO L280 TraceCheckUtils]: 28: Hoare triple {1595#false} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {1595#false} is VALID [2020-07-08 23:41:16,555 INFO L280 TraceCheckUtils]: 29: Hoare triple {1595#false} #t~post1 := ~i~0; {1595#false} is VALID [2020-07-08 23:41:16,555 INFO L280 TraceCheckUtils]: 30: Hoare triple {1595#false} ~i~0 := 1 + #t~post1; {1595#false} is VALID [2020-07-08 23:41:16,555 INFO L280 TraceCheckUtils]: 31: Hoare triple {1595#false} havoc #t~post1; {1595#false} is VALID [2020-07-08 23:41:16,556 INFO L280 TraceCheckUtils]: 32: Hoare triple {1595#false} assume !(~i~0 < 2 * ~k~0); {1595#false} is VALID [2020-07-08 23:41:16,556 INFO L263 TraceCheckUtils]: 33: Hoare triple {1595#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {1595#false} is VALID [2020-07-08 23:41:16,556 INFO L280 TraceCheckUtils]: 34: Hoare triple {1595#false} ~cond := #in~cond; {1595#false} is VALID [2020-07-08 23:41:16,556 INFO L280 TraceCheckUtils]: 35: Hoare triple {1595#false} assume 0 == ~cond; {1595#false} is VALID [2020-07-08 23:41:16,557 INFO L280 TraceCheckUtils]: 36: Hoare triple {1595#false} assume !false; {1595#false} is VALID [2020-07-08 23:41:16,558 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-08 23:41:16,559 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [349883288] [2020-07-08 23:41:16,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:41:16,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-07-08 23:41:16,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368637273] [2020-07-08 23:41:16,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2020-07-08 23:41:16,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:41:16,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 23:41:16,593 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-08 23:41:16,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 23:41:16,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:41:16,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 23:41:16,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 23:41:16,594 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2020-07-08 23:41:16,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:16,826 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2020-07-08 23:41:16,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 23:41:16,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2020-07-08 23:41:16,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:41:16,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 23:41:16,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2020-07-08 23:41:16,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 23:41:16,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2020-07-08 23:41:16,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 52 transitions. [2020-07-08 23:41:16,890 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:41:16,892 INFO L225 Difference]: With dead ends: 62 [2020-07-08 23:41:16,893 INFO L226 Difference]: Without dead ends: 41 [2020-07-08 23:41:16,894 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-08 23:41:16,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-08 23:41:16,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2020-07-08 23:41:16,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:41:16,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 39 states. [2020-07-08 23:41:16,979 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 39 states. [2020-07-08 23:41:16,979 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 39 states. [2020-07-08 23:41:16,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:16,981 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2020-07-08 23:41:16,981 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2020-07-08 23:41:16,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:41:16,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:41:16,982 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 41 states. [2020-07-08 23:41:16,982 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 41 states. [2020-07-08 23:41:16,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:16,984 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2020-07-08 23:41:16,984 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2020-07-08 23:41:16,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:41:16,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:41:16,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:41:16,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:41:16,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-08 23:41:16,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2020-07-08 23:41:16,986 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 37 [2020-07-08 23:41:16,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:41:16,987 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2020-07-08 23:41:16,987 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 23:41:16,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 41 transitions. [2020-07-08 23:41:17,042 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-08 23:41:17,042 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-07-08 23:41:17,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-08 23:41:17,043 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:41:17,043 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:41:17,044 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-08 23:41:17,044 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:41:17,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:41:17,044 INFO L82 PathProgramCache]: Analyzing trace with hash -282773191, now seen corresponding path program 3 times [2020-07-08 23:41:17,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:41:17,045 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1259030810] [2020-07-08 23:41:17,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:41:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:41:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:41:17,231 INFO L280 TraceCheckUtils]: 0: Hoare triple {1891#true} assume true; {1891#true} is VALID [2020-07-08 23:41:17,231 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1891#true} {1891#true} #62#return; {1891#true} is VALID [2020-07-08 23:41:17,231 INFO L263 TraceCheckUtils]: 0: Hoare triple {1891#true} call ULTIMATE.init(); {1891#true} is VALID [2020-07-08 23:41:17,232 INFO L280 TraceCheckUtils]: 1: Hoare triple {1891#true} assume true; {1891#true} is VALID [2020-07-08 23:41:17,232 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1891#true} {1891#true} #62#return; {1891#true} is VALID [2020-07-08 23:41:17,232 INFO L263 TraceCheckUtils]: 3: Hoare triple {1891#true} call #t~ret3 := main(); {1891#true} is VALID [2020-07-08 23:41:17,232 INFO L280 TraceCheckUtils]: 4: Hoare triple {1891#true} ~i~0 := 0; {1891#true} is VALID [2020-07-08 23:41:17,232 INFO L280 TraceCheckUtils]: 5: Hoare triple {1891#true} ~n~0 := 0; {1891#true} is VALID [2020-07-08 23:41:17,233 INFO L280 TraceCheckUtils]: 6: Hoare triple {1891#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1891#true} is VALID [2020-07-08 23:41:17,233 INFO L280 TraceCheckUtils]: 7: Hoare triple {1891#true} ~k~0 := #t~nondet0; {1891#true} is VALID [2020-07-08 23:41:17,233 INFO L280 TraceCheckUtils]: 8: Hoare triple {1891#true} havoc #t~nondet0; {1891#true} is VALID [2020-07-08 23:41:17,234 INFO L280 TraceCheckUtils]: 9: Hoare triple {1891#true} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000); {1891#true} is VALID [2020-07-08 23:41:17,237 INFO L280 TraceCheckUtils]: 10: Hoare triple {1891#true} ~i~0 := 0; {1895#(or (<= (+ main_~i~0 4) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ main_~i~0 2)))} is VALID [2020-07-08 23:41:17,238 INFO L280 TraceCheckUtils]: 11: Hoare triple {1895#(or (<= (+ main_~i~0 4) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ main_~i~0 2)))} assume !!(~i~0 < 2 * ~k~0); {1895#(or (<= (+ main_~i~0 4) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ main_~i~0 2)))} is VALID [2020-07-08 23:41:17,239 INFO L280 TraceCheckUtils]: 12: Hoare triple {1895#(or (<= (+ main_~i~0 4) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ main_~i~0 2)))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2); {1895#(or (<= (+ main_~i~0 4) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ main_~i~0 2)))} is VALID [2020-07-08 23:41:17,239 INFO L280 TraceCheckUtils]: 13: Hoare triple {1895#(or (<= (+ main_~i~0 4) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ main_~i~0 2)))} #t~post2 := ~n~0; {1895#(or (<= (+ main_~i~0 4) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ main_~i~0 2)))} is VALID [2020-07-08 23:41:17,240 INFO L280 TraceCheckUtils]: 14: Hoare triple {1895#(or (<= (+ main_~i~0 4) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ main_~i~0 2)))} ~n~0 := 1 + #t~post2; {1895#(or (<= (+ main_~i~0 4) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ main_~i~0 2)))} is VALID [2020-07-08 23:41:17,240 INFO L280 TraceCheckUtils]: 15: Hoare triple {1895#(or (<= (+ main_~i~0 4) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ main_~i~0 2)))} havoc #t~post2; {1895#(or (<= (+ main_~i~0 4) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ main_~i~0 2)))} is VALID [2020-07-08 23:41:17,241 INFO L280 TraceCheckUtils]: 16: Hoare triple {1895#(or (<= (+ main_~i~0 4) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ main_~i~0 2)))} #t~post1 := ~i~0; {1896#(or (<= (* 2 main_~k~0) (+ |main_#t~post1| 2)) (<= (+ |main_#t~post1| 4) (* 2 main_~k~0)))} is VALID [2020-07-08 23:41:17,243 INFO L280 TraceCheckUtils]: 17: Hoare triple {1896#(or (<= (* 2 main_~k~0) (+ |main_#t~post1| 2)) (<= (+ |main_#t~post1| 4) (* 2 main_~k~0)))} ~i~0 := 1 + #t~post1; {1897#(or (<= (* 2 main_~k~0) (+ main_~i~0 1)) (<= (+ main_~i~0 3) (* 2 main_~k~0)))} is VALID [2020-07-08 23:41:17,247 INFO L280 TraceCheckUtils]: 18: Hoare triple {1897#(or (<= (* 2 main_~k~0) (+ main_~i~0 1)) (<= (+ main_~i~0 3) (* 2 main_~k~0)))} havoc #t~post1; {1897#(or (<= (* 2 main_~k~0) (+ main_~i~0 1)) (<= (+ main_~i~0 3) (* 2 main_~k~0)))} is VALID [2020-07-08 23:41:17,247 INFO L280 TraceCheckUtils]: 19: Hoare triple {1897#(or (<= (* 2 main_~k~0) (+ main_~i~0 1)) (<= (+ main_~i~0 3) (* 2 main_~k~0)))} assume !!(~i~0 < 2 * ~k~0); {1897#(or (<= (* 2 main_~k~0) (+ main_~i~0 1)) (<= (+ main_~i~0 3) (* 2 main_~k~0)))} is VALID [2020-07-08 23:41:17,248 INFO L280 TraceCheckUtils]: 20: Hoare triple {1897#(or (<= (* 2 main_~k~0) (+ main_~i~0 1)) (<= (+ main_~i~0 3) (* 2 main_~k~0)))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {1897#(or (<= (* 2 main_~k~0) (+ main_~i~0 1)) (<= (+ main_~i~0 3) (* 2 main_~k~0)))} is VALID [2020-07-08 23:41:17,248 INFO L280 TraceCheckUtils]: 21: Hoare triple {1897#(or (<= (* 2 main_~k~0) (+ main_~i~0 1)) (<= (+ main_~i~0 3) (* 2 main_~k~0)))} #t~post1 := ~i~0; {1898#(or (<= (+ |main_#t~post1| 3) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ |main_#t~post1| 1)))} is VALID [2020-07-08 23:41:17,249 INFO L280 TraceCheckUtils]: 22: Hoare triple {1898#(or (<= (+ |main_#t~post1| 3) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ |main_#t~post1| 1)))} ~i~0 := 1 + #t~post1; {1899#(or (<= (+ main_~i~0 2) (* 2 main_~k~0)) (<= (* 2 main_~k~0) main_~i~0))} is VALID [2020-07-08 23:41:17,250 INFO L280 TraceCheckUtils]: 23: Hoare triple {1899#(or (<= (+ main_~i~0 2) (* 2 main_~k~0)) (<= (* 2 main_~k~0) main_~i~0))} havoc #t~post1; {1899#(or (<= (+ main_~i~0 2) (* 2 main_~k~0)) (<= (* 2 main_~k~0) main_~i~0))} is VALID [2020-07-08 23:41:17,250 INFO L280 TraceCheckUtils]: 24: Hoare triple {1899#(or (<= (+ main_~i~0 2) (* 2 main_~k~0)) (<= (* 2 main_~k~0) main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {1900#(<= (+ main_~i~0 2) (* 2 main_~k~0))} is VALID [2020-07-08 23:41:17,251 INFO L280 TraceCheckUtils]: 25: Hoare triple {1900#(<= (+ main_~i~0 2) (* 2 main_~k~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2); {1900#(<= (+ main_~i~0 2) (* 2 main_~k~0))} is VALID [2020-07-08 23:41:17,251 INFO L280 TraceCheckUtils]: 26: Hoare triple {1900#(<= (+ main_~i~0 2) (* 2 main_~k~0))} #t~post2 := ~n~0; {1900#(<= (+ main_~i~0 2) (* 2 main_~k~0))} is VALID [2020-07-08 23:41:17,252 INFO L280 TraceCheckUtils]: 27: Hoare triple {1900#(<= (+ main_~i~0 2) (* 2 main_~k~0))} ~n~0 := 1 + #t~post2; {1900#(<= (+ main_~i~0 2) (* 2 main_~k~0))} is VALID [2020-07-08 23:41:17,252 INFO L280 TraceCheckUtils]: 28: Hoare triple {1900#(<= (+ main_~i~0 2) (* 2 main_~k~0))} havoc #t~post2; {1900#(<= (+ main_~i~0 2) (* 2 main_~k~0))} is VALID [2020-07-08 23:41:17,253 INFO L280 TraceCheckUtils]: 29: Hoare triple {1900#(<= (+ main_~i~0 2) (* 2 main_~k~0))} #t~post1 := ~i~0; {1901#(<= (+ |main_#t~post1| 2) (* 2 main_~k~0))} is VALID [2020-07-08 23:41:17,254 INFO L280 TraceCheckUtils]: 30: Hoare triple {1901#(<= (+ |main_#t~post1| 2) (* 2 main_~k~0))} ~i~0 := 1 + #t~post1; {1902#(<= (+ main_~i~0 1) (* 2 main_~k~0))} is VALID [2020-07-08 23:41:17,254 INFO L280 TraceCheckUtils]: 31: Hoare triple {1902#(<= (+ main_~i~0 1) (* 2 main_~k~0))} havoc #t~post1; {1902#(<= (+ main_~i~0 1) (* 2 main_~k~0))} is VALID [2020-07-08 23:41:17,255 INFO L280 TraceCheckUtils]: 32: Hoare triple {1902#(<= (+ main_~i~0 1) (* 2 main_~k~0))} assume !(~i~0 < 2 * ~k~0); {1892#false} is VALID [2020-07-08 23:41:17,255 INFO L263 TraceCheckUtils]: 33: Hoare triple {1892#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {1892#false} is VALID [2020-07-08 23:41:17,255 INFO L280 TraceCheckUtils]: 34: Hoare triple {1892#false} ~cond := #in~cond; {1892#false} is VALID [2020-07-08 23:41:17,255 INFO L280 TraceCheckUtils]: 35: Hoare triple {1892#false} assume 0 == ~cond; {1892#false} is VALID [2020-07-08 23:41:17,256 INFO L280 TraceCheckUtils]: 36: Hoare triple {1892#false} assume !false; {1892#false} is VALID [2020-07-08 23:41:17,260 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:41:17,261 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1259030810] [2020-07-08 23:41:17,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:41:17,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-08 23:41:17,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297140590] [2020-07-08 23:41:17,262 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2020-07-08 23:41:17,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:41:17,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-08 23:41:17,316 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:41:17,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-08 23:41:17,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:41:17,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-08 23:41:17,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-08 23:41:17,317 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 10 states. [2020-07-08 23:41:18,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:18,272 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2020-07-08 23:41:18,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-08 23:41:18,273 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2020-07-08 23:41:18,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:41:18,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 23:41:18,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 53 transitions. [2020-07-08 23:41:18,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 23:41:18,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 53 transitions. [2020-07-08 23:41:18,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 53 transitions. [2020-07-08 23:41:18,347 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:41:18,349 INFO L225 Difference]: With dead ends: 65 [2020-07-08 23:41:18,349 INFO L226 Difference]: Without dead ends: 60 [2020-07-08 23:41:18,350 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2020-07-08 23:41:18,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-08 23:41:18,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2020-07-08 23:41:18,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:41:18,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 51 states. [2020-07-08 23:41:18,525 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 51 states. [2020-07-08 23:41:18,525 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 51 states. [2020-07-08 23:41:18,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:18,527 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2020-07-08 23:41:18,528 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2020-07-08 23:41:18,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:41:18,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:41:18,528 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 60 states. [2020-07-08 23:41:18,529 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 60 states. [2020-07-08 23:41:18,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:18,531 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2020-07-08 23:41:18,531 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2020-07-08 23:41:18,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:41:18,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:41:18,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:41:18,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:41:18,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-08 23:41:18,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2020-07-08 23:41:18,534 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 37 [2020-07-08 23:41:18,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:41:18,535 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2020-07-08 23:41:18,535 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-08 23:41:18,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 54 transitions. [2020-07-08 23:41:18,616 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:41:18,617 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2020-07-08 23:41:18,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-08 23:41:18,617 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:41:18,618 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:41:18,618 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-08 23:41:18,618 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:41:18,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:41:18,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1065873285, now seen corresponding path program 4 times [2020-07-08 23:41:18,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:41:18,619 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2121475575] [2020-07-08 23:41:18,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:41:18,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:41:19,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:41:19,230 INFO L280 TraceCheckUtils]: 0: Hoare triple {2286#true} assume true; {2286#true} is VALID [2020-07-08 23:41:19,231 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2286#true} {2286#true} #62#return; {2286#true} is VALID [2020-07-08 23:41:19,231 INFO L263 TraceCheckUtils]: 0: Hoare triple {2286#true} call ULTIMATE.init(); {2286#true} is VALID [2020-07-08 23:41:19,231 INFO L280 TraceCheckUtils]: 1: Hoare triple {2286#true} assume true; {2286#true} is VALID [2020-07-08 23:41:19,231 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2286#true} {2286#true} #62#return; {2286#true} is VALID [2020-07-08 23:41:19,231 INFO L263 TraceCheckUtils]: 3: Hoare triple {2286#true} call #t~ret3 := main(); {2286#true} is VALID [2020-07-08 23:41:19,231 INFO L280 TraceCheckUtils]: 4: Hoare triple {2286#true} ~i~0 := 0; {2286#true} is VALID [2020-07-08 23:41:19,232 INFO L280 TraceCheckUtils]: 5: Hoare triple {2286#true} ~n~0 := 0; {2290#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-08 23:41:19,232 INFO L280 TraceCheckUtils]: 6: Hoare triple {2290#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2290#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-08 23:41:19,239 INFO L280 TraceCheckUtils]: 7: Hoare triple {2290#(and (<= 0 main_~n~0) (<= main_~n~0 0))} ~k~0 := #t~nondet0; {2290#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-08 23:41:19,240 INFO L280 TraceCheckUtils]: 8: Hoare triple {2290#(and (<= 0 main_~n~0) (<= main_~n~0 0))} havoc #t~nondet0; {2290#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-08 23:41:19,241 INFO L280 TraceCheckUtils]: 9: Hoare triple {2290#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000); {2290#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-08 23:41:19,242 INFO L280 TraceCheckUtils]: 10: Hoare triple {2290#(and (<= 0 main_~n~0) (<= main_~n~0 0))} ~i~0 := 0; {2291#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-08 23:41:19,248 INFO L280 TraceCheckUtils]: 11: Hoare triple {2291#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {2291#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-08 23:41:19,249 INFO L280 TraceCheckUtils]: 12: Hoare triple {2291#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2); {2291#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-08 23:41:19,250 INFO L280 TraceCheckUtils]: 13: Hoare triple {2291#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} #t~post2 := ~n~0; {2292#(and (<= (* 2 |main_#t~post2|) main_~i~0) (<= main_~i~0 (* 2 |main_#t~post2|)))} is VALID [2020-07-08 23:41:19,251 INFO L280 TraceCheckUtils]: 14: Hoare triple {2292#(and (<= (* 2 |main_#t~post2|) main_~i~0) (<= main_~i~0 (* 2 |main_#t~post2|)))} ~n~0 := 1 + #t~post2; {2293#(and (<= (* 2 main_~n~0) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* 2 main_~n~0)))} is VALID [2020-07-08 23:41:19,252 INFO L280 TraceCheckUtils]: 15: Hoare triple {2293#(and (<= (* 2 main_~n~0) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* 2 main_~n~0)))} havoc #t~post2; {2293#(and (<= (* 2 main_~n~0) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* 2 main_~n~0)))} is VALID [2020-07-08 23:41:19,252 INFO L280 TraceCheckUtils]: 16: Hoare triple {2293#(and (<= (* 2 main_~n~0) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* 2 main_~n~0)))} #t~post1 := ~i~0; {2294#(and (<= (* 2 main_~n~0) (+ |main_#t~post1| 2)) (<= (+ |main_#t~post1| 2) (* 2 main_~n~0)))} is VALID [2020-07-08 23:41:19,253 INFO L280 TraceCheckUtils]: 17: Hoare triple {2294#(and (<= (* 2 main_~n~0) (+ |main_#t~post1| 2)) (<= (+ |main_#t~post1| 2) (* 2 main_~n~0)))} ~i~0 := 1 + #t~post1; {2295#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} is VALID [2020-07-08 23:41:19,254 INFO L280 TraceCheckUtils]: 18: Hoare triple {2295#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} havoc #t~post1; {2295#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} is VALID [2020-07-08 23:41:19,254 INFO L280 TraceCheckUtils]: 19: Hoare triple {2295#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} assume !!(~i~0 < 2 * ~k~0); {2295#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} is VALID [2020-07-08 23:41:19,255 INFO L280 TraceCheckUtils]: 20: Hoare triple {2295#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {2295#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} is VALID [2020-07-08 23:41:19,255 INFO L280 TraceCheckUtils]: 21: Hoare triple {2295#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} #t~post1 := ~i~0; {2296#(and (<= (+ |main_#t~post1| 1) (* 2 main_~n~0)) (<= (* 2 main_~n~0) (+ |main_#t~post1| 1)))} is VALID [2020-07-08 23:41:19,256 INFO L280 TraceCheckUtils]: 22: Hoare triple {2296#(and (<= (+ |main_#t~post1| 1) (* 2 main_~n~0)) (<= (* 2 main_~n~0) (+ |main_#t~post1| 1)))} ~i~0 := 1 + #t~post1; {2291#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-08 23:41:19,257 INFO L280 TraceCheckUtils]: 23: Hoare triple {2291#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} havoc #t~post1; {2291#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-08 23:41:19,258 INFO L280 TraceCheckUtils]: 24: Hoare triple {2291#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {2291#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-08 23:41:19,260 INFO L280 TraceCheckUtils]: 25: Hoare triple {2291#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2); {2291#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-08 23:41:19,260 INFO L280 TraceCheckUtils]: 26: Hoare triple {2291#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} #t~post2 := ~n~0; {2292#(and (<= (* 2 |main_#t~post2|) main_~i~0) (<= main_~i~0 (* 2 |main_#t~post2|)))} is VALID [2020-07-08 23:41:19,261 INFO L280 TraceCheckUtils]: 27: Hoare triple {2292#(and (<= (* 2 |main_#t~post2|) main_~i~0) (<= main_~i~0 (* 2 |main_#t~post2|)))} ~n~0 := 1 + #t~post2; {2297#(and (or (<= (+ main_~i~0 2) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (or (<= (* 2 main_~n~0) (+ main_~i~0 2)) (< main_~n~0 (+ main_~k~0 1))))} is VALID [2020-07-08 23:41:19,262 INFO L280 TraceCheckUtils]: 28: Hoare triple {2297#(and (or (<= (+ main_~i~0 2) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (or (<= (* 2 main_~n~0) (+ main_~i~0 2)) (< main_~n~0 (+ main_~k~0 1))))} havoc #t~post2; {2297#(and (or (<= (+ main_~i~0 2) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (or (<= (* 2 main_~n~0) (+ main_~i~0 2)) (< main_~n~0 (+ main_~k~0 1))))} is VALID [2020-07-08 23:41:19,264 INFO L280 TraceCheckUtils]: 29: Hoare triple {2297#(and (or (<= (+ main_~i~0 2) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (or (<= (* 2 main_~n~0) (+ main_~i~0 2)) (< main_~n~0 (+ main_~k~0 1))))} #t~post1 := ~i~0; {2298#(and (or (<= (+ |main_#t~post1| 2) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (or (<= (* 2 main_~n~0) (+ |main_#t~post1| 2)) (< main_~n~0 (+ main_~k~0 1))))} is VALID [2020-07-08 23:41:19,267 INFO L280 TraceCheckUtils]: 30: Hoare triple {2298#(and (or (<= (+ |main_#t~post1| 2) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (or (<= (* 2 main_~n~0) (+ |main_#t~post1| 2)) (< main_~n~0 (+ main_~k~0 1))))} ~i~0 := 1 + #t~post1; {2299#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (or (<= (* 2 main_~n~0) (+ main_~i~0 1)) (< main_~n~0 (+ main_~k~0 1))))} is VALID [2020-07-08 23:41:19,271 INFO L280 TraceCheckUtils]: 31: Hoare triple {2299#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (or (<= (* 2 main_~n~0) (+ main_~i~0 1)) (< main_~n~0 (+ main_~k~0 1))))} havoc #t~post1; {2299#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (or (<= (* 2 main_~n~0) (+ main_~i~0 1)) (< main_~n~0 (+ main_~k~0 1))))} is VALID [2020-07-08 23:41:19,273 INFO L280 TraceCheckUtils]: 32: Hoare triple {2299#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (or (<= (* 2 main_~n~0) (+ main_~i~0 1)) (< main_~n~0 (+ main_~k~0 1))))} assume !!(~i~0 < 2 * ~k~0); {2300#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2020-07-08 23:41:19,273 INFO L280 TraceCheckUtils]: 33: Hoare triple {2300#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {2300#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2020-07-08 23:41:19,274 INFO L280 TraceCheckUtils]: 34: Hoare triple {2300#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} #t~post1 := ~i~0; {2301#(and (or (<= (+ |main_#t~post1| 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2020-07-08 23:41:19,275 INFO L280 TraceCheckUtils]: 35: Hoare triple {2301#(and (or (<= (+ |main_#t~post1| 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} ~i~0 := 1 + #t~post1; {2302#(and (or (<= main_~i~0 (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2020-07-08 23:41:19,275 INFO L280 TraceCheckUtils]: 36: Hoare triple {2302#(and (or (<= main_~i~0 (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} havoc #t~post1; {2302#(and (or (<= main_~i~0 (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2020-07-08 23:41:19,276 INFO L280 TraceCheckUtils]: 37: Hoare triple {2302#(and (or (<= main_~i~0 (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} assume !(~i~0 < 2 * ~k~0); {2303#(and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} is VALID [2020-07-08 23:41:19,277 INFO L263 TraceCheckUtils]: 38: Hoare triple {2303#(and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {2304#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 23:41:19,277 INFO L280 TraceCheckUtils]: 39: Hoare triple {2304#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2305#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 23:41:19,277 INFO L280 TraceCheckUtils]: 40: Hoare triple {2305#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2287#false} is VALID [2020-07-08 23:41:19,278 INFO L280 TraceCheckUtils]: 41: Hoare triple {2287#false} assume !false; {2287#false} is VALID [2020-07-08 23:41:19,281 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-08 23:41:19,282 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2121475575] [2020-07-08 23:41:19,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:41:19,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-07-08 23:41:19,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867351624] [2020-07-08 23:41:19,282 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 42 [2020-07-08 23:41:19,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:41:19,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2020-07-08 23:41:19,334 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:41:19,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-08 23:41:19,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:41:19,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-08 23:41:19,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2020-07-08 23:41:19,336 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 18 states. [2020-07-08 23:41:20,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:20,582 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2020-07-08 23:41:20,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-08 23:41:20,582 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 42 [2020-07-08 23:41:20,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:41:20,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-08 23:41:20,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 48 transitions. [2020-07-08 23:41:20,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-08 23:41:20,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 48 transitions. [2020-07-08 23:41:20,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 48 transitions. [2020-07-08 23:41:20,662 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-08 23:41:20,662 INFO L225 Difference]: With dead ends: 71 [2020-07-08 23:41:20,663 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 23:41:20,664 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=129, Invalid=801, Unknown=0, NotChecked=0, Total=930 [2020-07-08 23:41:20,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 23:41:20,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 23:41:20,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:41:20,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 23:41:20,665 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 23:41:20,665 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 23:41:20,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:20,665 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 23:41:20,666 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 23:41:20,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:41:20,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:41:20,666 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 23:41:20,666 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 23:41:20,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:41:20,666 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 23:41:20,667 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 23:41:20,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:41:20,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:41:20,667 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:41:20,667 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:41:20,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 23:41:20,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 23:41:20,668 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2020-07-08 23:41:20,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:41:20,668 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 23:41:20,669 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-08 23:41:20,669 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-08 23:41:20,669 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:41:20,669 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 23:41:20,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:41:20,669 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-08 23:41:20,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 23:41:21,196 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 25 [2020-07-08 23:41:21,541 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 23:41:21,541 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-08 23:41:21,541 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-08 23:41:21,541 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 23:41:21,541 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 23:41:21,541 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-08 23:41:21,541 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-08 23:41:21,541 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-08 23:41:21,542 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-08 23:41:21,542 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-08 23:41:21,542 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-08 23:41:21,542 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 25) the Hoare annotation is: true [2020-07-08 23:41:21,542 INFO L271 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: true [2020-07-08 23:41:21,542 INFO L264 CegarLoopResult]: At program point L19(lines 19 21) the Hoare annotation is: (let ((.cse0 (* 2 main_~n~0))) (or (let ((.cse1 (+ main_~i~0 1))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (<= main_~n~0 main_~k~0))) (and (<= (+ main_~i~0 2) (* 2 main_~k~0)) (<= main_~i~0 .cse0) (<= .cse0 main_~i~0)))) [2020-07-08 23:41:21,543 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (and (<= main_~i~0 0) (<= 0 main_~n~0) (<= main_~n~0 0) (< 0 (+ (div main_~i~0 2) 1))) [2020-07-08 23:41:21,543 INFO L271 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-07-08 23:41:21,543 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (<= main_~i~0 0) (< 0 (+ (div main_~i~0 2) 1))) [2020-07-08 23:41:21,544 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 25) the Hoare annotation is: true [2020-07-08 23:41:21,544 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 25) the Hoare annotation is: true [2020-07-08 23:41:21,544 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (let ((.cse0 (* 2 main_~n~0))) (and (<= (+ main_~i~0 2) (* 2 main_~k~0)) (<= main_~i~0 .cse0) (<= .cse0 main_~i~0))) [2020-07-08 23:41:21,544 INFO L264 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: (let ((.cse0 (* 2 main_~n~0)) (.cse1 (* 2 |main_#t~post2|))) (and (<= (+ main_~i~0 2) (* 2 main_~k~0)) (<= main_~i~0 .cse0) (<= .cse1 main_~i~0) (<= .cse0 main_~i~0) (<= main_~i~0 .cse1))) [2020-07-08 23:41:21,544 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (and (<= main_~i~0 0) (<= 0 main_~n~0) (<= main_~n~0 0) (< 0 (+ (div main_~i~0 2) 1))) [2020-07-08 23:41:21,545 INFO L264 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: (let ((.cse0 (* 2 main_~n~0)) (.cse1 (+ main_~i~0 2)) (.cse2 (* 2 |main_#t~post2|))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (<= .cse1 (* 2 main_~k~0)) (<= .cse2 main_~i~0) (<= main_~i~0 .cse2))) [2020-07-08 23:41:21,545 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (<= main_~i~0 0) (<= 0 main_~n~0) (<= main_~n~0 0) (< 0 (+ (div main_~i~0 2) 1))) [2020-07-08 23:41:21,545 INFO L264 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: (and (<= main_~i~0 0) (<= 0 main_~n~0) (<= main_~n~0 0) (< 0 (+ (div main_~i~0 2) 1))) [2020-07-08 23:41:21,545 INFO L264 CegarLoopResult]: At program point L18-3(lines 18 22) the Hoare annotation is: (let ((.cse0 (* 2 main_~n~0))) (or (let ((.cse1 (+ main_~i~0 2))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (<= .cse1 (* 2 main_~k~0)))) (let ((.cse2 (+ main_~i~0 1))) (and (<= .cse0 .cse2) (<= .cse2 .cse0) (<= main_~n~0 main_~k~0))))) [2020-07-08 23:41:21,545 INFO L264 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: (and (<= main_~i~0 0) (<= 0 main_~n~0) (<= main_~n~0 0) (< 0 (+ (div main_~i~0 2) 1))) [2020-07-08 23:41:21,546 INFO L264 CegarLoopResult]: At program point L18-4(line 18) the Hoare annotation is: (let ((.cse0 (* 2 main_~n~0))) (or (let ((.cse1 (+ main_~i~0 1)) (.cse2 (+ |main_#t~post1| 1))) (and (<= .cse0 .cse1) (<= .cse2 .cse0) (<= .cse1 .cse0) (<= .cse0 .cse2) (<= main_~n~0 main_~k~0))) (let ((.cse3 (+ main_~i~0 2)) (.cse4 (+ |main_#t~post1| 2))) (and (<= .cse0 .cse3) (<= .cse0 .cse4) (<= .cse3 .cse0) (<= .cse3 (* 2 main_~k~0)) (<= .cse4 .cse0))))) [2020-07-08 23:41:21,546 INFO L264 CegarLoopResult]: At program point L18-5(line 18) the Hoare annotation is: (let ((.cse0 (* 2 main_~n~0))) (or (let ((.cse2 (+ |main_#t~post1| 2)) (.cse1 (+ main_~i~0 1))) (and (<= .cse0 .cse1) (<= .cse1 (* 2 main_~k~0)) (<= .cse0 .cse2) (<= .cse2 .cse0) (<= .cse1 .cse0))) (let ((.cse3 (+ |main_#t~post1| 1))) (and (<= .cse3 .cse0) (<= main_~i~0 .cse0) (<= .cse0 main_~i~0) (<= .cse0 .cse3) (<= main_~n~0 main_~k~0))))) [2020-07-08 23:41:21,546 INFO L264 CegarLoopResult]: At program point L18-6(lines 18 22) the Hoare annotation is: (let ((.cse1 (* 2 main_~n~0))) (let ((.cse0 (<= main_~i~0 .cse1))) (or (and (<= main_~n~0 0) .cse0 (< 0 (+ (div main_~i~0 2) 1))) (and .cse0 (<= .cse1 main_~i~0) (<= main_~n~0 main_~k~0)) (let ((.cse2 (+ main_~i~0 1))) (and (<= .cse1 .cse2) (<= .cse2 (* 2 main_~k~0)) (<= .cse2 .cse1)))))) [2020-07-08 23:41:21,546 INFO L264 CegarLoopResult]: At program point L18-7(lines 18 22) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 main_~n~0))) (or (and .cse0 (<= main_~n~0 main_~k~0)) (and (<= 0 main_~n~0) (<= main_~n~0 0) .cse0))) [2020-07-08 23:41:21,546 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-08 23:41:21,547 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: true [2020-07-08 23:41:21,547 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-08 23:41:21,547 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-08 23:41:21,547 INFO L271 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: true [2020-07-08 23:41:21,547 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-08 23:41:21,552 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 23:41:21,555 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 23:41:21,556 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 23:41:21,556 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-08 23:41:21,556 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-08 23:41:21,573 INFO L163 areAnnotationChecker]: CFG has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 23:41:21,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 11:41:21 BoogieIcfgContainer [2020-07-08 23:41:21,590 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 23:41:21,593 INFO L168 Benchmark]: Toolchain (without parser) took 11910.29 ms. Allocated memory was 138.4 MB in the beginning and 339.2 MB in the end (delta: 200.8 MB). Free memory was 103.6 MB in the beginning and 204.8 MB in the end (delta: -101.2 MB). Peak memory consumption was 99.6 MB. Max. memory is 7.1 GB. [2020-07-08 23:41:21,594 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 138.4 MB. Free memory was 121.9 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 23:41:21,595 INFO L168 Benchmark]: CACSL2BoogieTranslator took 232.71 ms. Allocated memory is still 138.4 MB. Free memory was 103.4 MB in the beginning and 93.6 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-08 23:41:21,596 INFO L168 Benchmark]: Boogie Preprocessor took 116.95 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 93.6 MB in the beginning and 180.9 MB in the end (delta: -87.3 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2020-07-08 23:41:21,599 INFO L168 Benchmark]: RCFGBuilder took 377.58 ms. Allocated memory is still 202.4 MB. Free memory was 180.9 MB in the beginning and 162.0 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. [2020-07-08 23:41:21,600 INFO L168 Benchmark]: TraceAbstraction took 11173.40 ms. Allocated memory was 202.4 MB in the beginning and 339.2 MB in the end (delta: 136.8 MB). Free memory was 162.0 MB in the beginning and 204.8 MB in the end (delta: -42.9 MB). Peak memory consumption was 93.9 MB. Max. memory is 7.1 GB. [2020-07-08 23:41:21,606 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.26 ms. Allocated memory is still 138.4 MB. Free memory was 121.9 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 232.71 ms. Allocated memory is still 138.4 MB. Free memory was 103.4 MB in the beginning and 93.6 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 116.95 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 93.6 MB in the beginning and 180.9 MB in the end (delta: -87.3 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 377.58 ms. Allocated memory is still 202.4 MB. Free memory was 180.9 MB in the beginning and 162.0 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11173.40 ms. Allocated memory was 202.4 MB in the beginning and 339.2 MB in the end (delta: 136.8 MB). Free memory was 162.0 MB in the beginning and 204.8 MB in the end (delta: -42.9 MB). Peak memory consumption was 93.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (((n <= 0 && i <= 2 * n) && 0 < i / 2 + 1) || ((i <= 2 * n && 2 * n <= i) && n <= k)) || ((2 * n <= i + 1 && i + 1 <= 2 * k) && i + 1 <= 2 * n) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 10.1s, OverallIterations: 9, TraceHistogramMax: 4, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 190 SDtfs, 171 SDslu, 690 SDs, 0 SdLazy, 717 SolverSat, 60 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 9 MinimizatonAttempts, 52 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 32 LocationsWithAnnotation, 86 PreInvPairs, 139 NumberOfFragments, 485 HoareAnnotationTreeSize, 86 FomulaSimplifications, 1499 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 32 FomulaSimplificationsInter, 765 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 248 NumberOfCodeBlocks, 248 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 239 ConstructedInterpolants, 0 QuantifiedInterpolants, 50291 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 30/95 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...