/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-new/half.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:25:02,298 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:25:02,301 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:25:02,320 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:25:02,321 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:25:02,323 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:25:02,325 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:25:02,335 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:25:02,339 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:25:02,342 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:25:02,344 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:25:02,347 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:25:02,348 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:25:02,349 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:25:02,352 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:25:02,353 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:25:02,355 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:25:02,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:25:02,357 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:25:02,362 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:25:02,368 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:25:02,372 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:25:02,374 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:25:02,374 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:25:02,377 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:25:02,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:25:02,377 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:25:02,380 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:25:02,381 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:25:02,381 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:25:02,382 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:25:02,383 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:25:02,384 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:25:02,385 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:25:02,386 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:25:02,386 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:25:02,387 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:25:02,387 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:25:02,388 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:25:02,388 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:25:02,390 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:25:02,391 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 20:25:02,423 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:25:02,423 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:25:02,424 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:25:02,424 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:25:02,425 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:25:02,425 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:25:02,425 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:25:02,425 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:25:02,425 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:25:02,426 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:25:02,426 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:25:02,426 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:25:02,426 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:25:02,426 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:25:02,426 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:25:02,427 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:25:02,427 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:25:02,427 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:25:02,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:25:02,432 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:25:02,432 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:25:02,433 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:25:02,433 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:25:02,727 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:25:02,741 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:25:02,745 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:25:02,747 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:25:02,748 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:25:02,748 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-10 20:25:02,831 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6f36e7d5/81816a83c19d45aba6f4af6076688f6b/FLAG0dfeafea8 [2020-07-10 20:25:03,331 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:25:03,332 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/half.i [2020-07-10 20:25:03,339 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6f36e7d5/81816a83c19d45aba6f4af6076688f6b/FLAG0dfeafea8 [2020-07-10 20:25:03,709 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6f36e7d5/81816a83c19d45aba6f4af6076688f6b [2020-07-10 20:25:03,720 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:25:03,722 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:25:03,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:25:03,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:25:03,727 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:25:03,729 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:25:03" (1/1) ... [2020-07-10 20:25:03,732 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40de013f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:03, skipping insertion in model container [2020-07-10 20:25:03,732 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:25:03" (1/1) ... [2020-07-10 20:25:03,740 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:25:03,757 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:25:03,935 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:25:03,940 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:25:03,959 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:25:03,975 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:25:03,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:03 WrapperNode [2020-07-10 20:25:03,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:25:03,977 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:25:03,977 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:25:03,977 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:25:03,991 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:03" (1/1) ... [2020-07-10 20:25:03,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:03" (1/1) ... [2020-07-10 20:25:03,997 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:03" (1/1) ... [2020-07-10 20:25:03,998 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:03" (1/1) ... [2020-07-10 20:25:04,098 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:03" (1/1) ... [2020-07-10 20:25:04,106 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:03" (1/1) ... [2020-07-10 20:25:04,107 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:03" (1/1) ... [2020-07-10 20:25:04,109 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:25:04,109 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:25:04,109 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:25:04,110 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:25:04,110 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:03" (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-10 20:25:04,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:25:04,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:25:04,179 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 20:25:04,179 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:25:04,180 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:25:04,180 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:25:04,180 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 20:25:04,180 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 20:25:04,181 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:25:04,181 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:25:04,181 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:25:04,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:25:04,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:25:04,462 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:25:04,462 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 20:25:04,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:25:04 BoogieIcfgContainer [2020-07-10 20:25:04,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:25:04,468 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:25:04,468 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:25:04,471 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:25:04,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:25:03" (1/3) ... [2020-07-10 20:25:04,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21803b16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:25:04, skipping insertion in model container [2020-07-10 20:25:04,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:03" (2/3) ... [2020-07-10 20:25:04,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21803b16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:25:04, skipping insertion in model container [2020-07-10 20:25:04,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:25:04" (3/3) ... [2020-07-10 20:25:04,476 INFO L109 eAbstractionObserver]: Analyzing ICFG half.i [2020-07-10 20:25:04,488 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:25:04,500 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:25:04,521 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:25:04,546 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:25:04,547 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:25:04,547 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:25:04,548 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:25:04,548 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:25:04,548 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:25:04,548 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:25:04,548 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:25:04,567 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2020-07-10 20:25:04,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-10 20:25:04,580 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:25:04,581 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:25:04,581 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:25:04,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:25:04,589 INFO L82 PathProgramCache]: Analyzing trace with hash 789700725, now seen corresponding path program 1 times [2020-07-10 20:25:04,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:25:04,600 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1612629615] [2020-07-10 20:25:04,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:25:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:04,799 INFO L280 TraceCheckUtils]: 0: Hoare triple {35#true} assume true; {35#true} is VALID [2020-07-10 20:25:04,800 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {35#true} {35#true} #62#return; {35#true} is VALID [2020-07-10 20:25:04,802 INFO L263 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {35#true} is VALID [2020-07-10 20:25:04,804 INFO L280 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2020-07-10 20:25:04,804 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #62#return; {35#true} is VALID [2020-07-10 20:25:04,805 INFO L263 TraceCheckUtils]: 3: Hoare triple {35#true} call #t~ret3 := main(); {35#true} is VALID [2020-07-10 20:25:04,805 INFO L280 TraceCheckUtils]: 4: Hoare triple {35#true} ~i~0 := 0; {35#true} is VALID [2020-07-10 20:25:04,806 INFO L280 TraceCheckUtils]: 5: Hoare triple {35#true} ~n~0 := 0; {35#true} is VALID [2020-07-10 20:25:04,807 INFO L280 TraceCheckUtils]: 6: Hoare triple {35#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {35#true} is VALID [2020-07-10 20:25:04,807 INFO L280 TraceCheckUtils]: 7: Hoare triple {35#true} ~k~0 := #t~nondet0; {35#true} is VALID [2020-07-10 20:25:04,808 INFO L280 TraceCheckUtils]: 8: Hoare triple {35#true} havoc #t~nondet0; {35#true} is VALID [2020-07-10 20:25:04,810 INFO L280 TraceCheckUtils]: 9: Hoare triple {35#true} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000); {35#true} is VALID [2020-07-10 20:25:04,810 INFO L280 TraceCheckUtils]: 10: Hoare triple {35#true} ~i~0 := 0; {35#true} is VALID [2020-07-10 20:25:04,813 INFO L280 TraceCheckUtils]: 11: Hoare triple {35#true} assume !true; {36#false} is VALID [2020-07-10 20:25:04,814 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-10 20:25:04,817 INFO L280 TraceCheckUtils]: 13: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2020-07-10 20:25:04,818 INFO L280 TraceCheckUtils]: 14: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2020-07-10 20:25:04,818 INFO L280 TraceCheckUtils]: 15: Hoare triple {36#false} assume !false; {36#false} is VALID [2020-07-10 20:25:04,820 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-10 20:25:04,821 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:25:04,823 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1612629615] [2020-07-10 20:25:04,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:25:04,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-10 20:25:04,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531917545] [2020-07-10 20:25:04,833 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2020-07-10 20:25:04,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:25:04,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-10 20:25:04,883 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-10 20:25:04,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-10 20:25:04,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:25:04,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-10 20:25:04,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 20:25:04,896 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2020-07-10 20:25:05,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:05,006 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2020-07-10 20:25:05,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-10 20:25:05,006 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2020-07-10 20:25:05,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:25:05,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 20:25:05,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2020-07-10 20:25:05,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 20:25:05,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2020-07-10 20:25:05,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 49 transitions. [2020-07-10 20:25:05,144 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-10 20:25:05,157 INFO L225 Difference]: With dead ends: 44 [2020-07-10 20:25:05,157 INFO L226 Difference]: Without dead ends: 24 [2020-07-10 20:25:05,161 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-10 20:25:05,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-10 20:25:05,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-10 20:25:05,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:25:05,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2020-07-10 20:25:05,215 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-10 20:25:05,215 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-10 20:25:05,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:05,219 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-10 20:25:05,220 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-10 20:25:05,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:05,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:05,221 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-10 20:25:05,221 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-10 20:25:05,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:05,225 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-10 20:25:05,225 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-10 20:25:05,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:05,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:05,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:25:05,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:25:05,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-10 20:25:05,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2020-07-10 20:25:05,231 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 16 [2020-07-10 20:25:05,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:25:05,232 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-07-10 20:25:05,232 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-10 20:25:05,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 25 transitions. [2020-07-10 20:25:05,283 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-10 20:25:05,283 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-10 20:25:05,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-10 20:25:05,284 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:25:05,284 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:25:05,285 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:25:05,286 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:25:05,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:25:05,286 INFO L82 PathProgramCache]: Analyzing trace with hash 774924389, now seen corresponding path program 1 times [2020-07-10 20:25:05,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:25:05,287 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1330922952] [2020-07-10 20:25:05,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:25:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:05,523 INFO L280 TraceCheckUtils]: 0: Hoare triple {225#true} assume true; {225#true} is VALID [2020-07-10 20:25:05,523 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {225#true} {225#true} #62#return; {225#true} is VALID [2020-07-10 20:25:05,524 INFO L263 TraceCheckUtils]: 0: Hoare triple {225#true} call ULTIMATE.init(); {225#true} is VALID [2020-07-10 20:25:05,524 INFO L280 TraceCheckUtils]: 1: Hoare triple {225#true} assume true; {225#true} is VALID [2020-07-10 20:25:05,525 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {225#true} {225#true} #62#return; {225#true} is VALID [2020-07-10 20:25:05,525 INFO L263 TraceCheckUtils]: 3: Hoare triple {225#true} call #t~ret3 := main(); {225#true} is VALID [2020-07-10 20:25:05,526 INFO L280 TraceCheckUtils]: 4: Hoare triple {225#true} ~i~0 := 0; {225#true} is VALID [2020-07-10 20:25:05,527 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-10 20:25:05,539 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-10 20:25:05,542 INFO L280 TraceCheckUtils]: 7: Hoare triple {229#(and (<= 0 main_~n~0) (<= main_~n~0 0))} ~k~0 := #t~nondet0; {229#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-10 20:25:05,544 INFO L280 TraceCheckUtils]: 8: Hoare triple {229#(and (<= 0 main_~n~0) (<= main_~n~0 0))} havoc #t~nondet0; {229#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-10 20:25:05,546 INFO L280 TraceCheckUtils]: 9: Hoare triple {229#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000); {229#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-10 20:25:05,547 INFO L280 TraceCheckUtils]: 10: Hoare triple {229#(and (<= 0 main_~n~0) (<= main_~n~0 0))} ~i~0 := 0; {230#(and (<= main_~n~0 0) (<= main_~i~0 (* 2 main_~n~0)))} is VALID [2020-07-10 20:25:05,555 INFO L280 TraceCheckUtils]: 11: Hoare triple {230#(and (<= main_~n~0 0) (<= main_~i~0 (* 2 main_~n~0)))} assume !(~i~0 < 2 * ~k~0); {231#(and (<= main_~k~0 main_~n~0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} is VALID [2020-07-10 20:25:05,557 INFO L263 TraceCheckUtils]: 12: Hoare triple {231#(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)); {232#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:25:05,558 INFO L280 TraceCheckUtils]: 13: Hoare triple {232#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {233#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:25:05,559 INFO L280 TraceCheckUtils]: 14: Hoare triple {233#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {226#false} is VALID [2020-07-10 20:25:05,559 INFO L280 TraceCheckUtils]: 15: Hoare triple {226#false} assume !false; {226#false} is VALID [2020-07-10 20:25:05,562 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-10 20:25:05,563 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:25:05,563 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1330922952] [2020-07-10 20:25:05,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:25:05,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 20:25:05,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396777381] [2020-07-10 20:25:05,565 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-07-10 20:25:05,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:25:05,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 20:25:05,589 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-10 20:25:05,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 20:25:05,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:25:05,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 20:25:05,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-10 20:25:05,591 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 7 states. [2020-07-10 20:25:05,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:05,965 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2020-07-10 20:25:05,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 20:25:05,965 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-07-10 20:25:05,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:25:05,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 20:25:05,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2020-07-10 20:25:05,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 20:25:05,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2020-07-10 20:25:05,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2020-07-10 20:25:06,028 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-10 20:25:06,031 INFO L225 Difference]: With dead ends: 43 [2020-07-10 20:25:06,031 INFO L226 Difference]: Without dead ends: 38 [2020-07-10 20:25:06,033 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-10 20:25:06,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-10 20:25:06,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 25. [2020-07-10 20:25:06,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:25:06,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 25 states. [2020-07-10 20:25:06,059 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 25 states. [2020-07-10 20:25:06,059 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 25 states. [2020-07-10 20:25:06,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:06,063 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2020-07-10 20:25:06,063 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-07-10 20:25:06,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:06,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:06,064 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 38 states. [2020-07-10 20:25:06,064 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 38 states. [2020-07-10 20:25:06,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:06,068 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2020-07-10 20:25:06,068 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-07-10 20:25:06,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:06,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:06,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:25:06,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:25:06,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-10 20:25:06,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2020-07-10 20:25:06,072 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 16 [2020-07-10 20:25:06,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:25:06,072 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-07-10 20:25:06,072 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 20:25:06,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 26 transitions. [2020-07-10 20:25:06,104 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-10 20:25:06,104 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-10 20:25:06,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 20:25:06,105 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:25:06,105 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-10 20:25:06,106 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:25:06,106 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:25:06,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:25:06,107 INFO L82 PathProgramCache]: Analyzing trace with hash 775379929, now seen corresponding path program 1 times [2020-07-10 20:25:06,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:25:06,107 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1635051154] [2020-07-10 20:25:06,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:25:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:06,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:06,412 INFO L280 TraceCheckUtils]: 0: Hoare triple {454#true} assume true; {454#true} is VALID [2020-07-10 20:25:06,412 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {454#true} {454#true} #62#return; {454#true} is VALID [2020-07-10 20:25:06,413 INFO L263 TraceCheckUtils]: 0: Hoare triple {454#true} call ULTIMATE.init(); {454#true} is VALID [2020-07-10 20:25:06,413 INFO L280 TraceCheckUtils]: 1: Hoare triple {454#true} assume true; {454#true} is VALID [2020-07-10 20:25:06,414 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {454#true} {454#true} #62#return; {454#true} is VALID [2020-07-10 20:25:06,414 INFO L263 TraceCheckUtils]: 3: Hoare triple {454#true} call #t~ret3 := main(); {454#true} is VALID [2020-07-10 20:25:06,416 INFO L280 TraceCheckUtils]: 4: Hoare triple {454#true} ~i~0 := 0; {454#true} is VALID [2020-07-10 20:25:06,417 INFO L280 TraceCheckUtils]: 5: Hoare triple {454#true} ~n~0 := 0; {458#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-10 20:25:06,418 INFO L280 TraceCheckUtils]: 6: Hoare triple {458#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {458#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-10 20:25:06,419 INFO L280 TraceCheckUtils]: 7: Hoare triple {458#(and (<= 0 main_~n~0) (<= main_~n~0 0))} ~k~0 := #t~nondet0; {458#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-10 20:25:06,421 INFO L280 TraceCheckUtils]: 8: Hoare triple {458#(and (<= 0 main_~n~0) (<= main_~n~0 0))} havoc #t~nondet0; {458#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-10 20:25:06,422 INFO L280 TraceCheckUtils]: 9: Hoare triple {458#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000); {458#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-10 20:25:06,423 INFO L280 TraceCheckUtils]: 10: Hoare triple {458#(and (<= 0 main_~n~0) (<= main_~n~0 0))} ~i~0 := 0; {459#(and (<= main_~n~0 0) (<= main_~i~0 (* 2 main_~n~0)))} is VALID [2020-07-10 20:25:06,424 INFO L280 TraceCheckUtils]: 11: Hoare triple {459#(and (<= main_~n~0 0) (<= main_~i~0 (* 2 main_~n~0)))} assume !!(~i~0 < 2 * ~k~0); {459#(and (<= main_~n~0 0) (<= main_~i~0 (* 2 main_~n~0)))} is VALID [2020-07-10 20:25:06,429 INFO L280 TraceCheckUtils]: 12: Hoare triple {459#(and (<= main_~n~0 0) (<= main_~i~0 (* 2 main_~n~0)))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {459#(and (<= main_~n~0 0) (<= main_~i~0 (* 2 main_~n~0)))} is VALID [2020-07-10 20:25:06,430 INFO L280 TraceCheckUtils]: 13: Hoare triple {459#(and (<= main_~n~0 0) (<= main_~i~0 (* 2 main_~n~0)))} #t~post1 := ~i~0; {460#(and (<= main_~n~0 0) (<= |main_#t~post1| (* 2 main_~n~0)))} is VALID [2020-07-10 20:25:06,431 INFO L280 TraceCheckUtils]: 14: Hoare triple {460#(and (<= main_~n~0 0) (<= |main_#t~post1| (* 2 main_~n~0)))} ~i~0 := 1 + #t~post1; {461#(and (<= main_~i~0 (+ (* 2 main_~n~0) 1)) (<= main_~n~0 0))} is VALID [2020-07-10 20:25:06,433 INFO L280 TraceCheckUtils]: 15: Hoare triple {461#(and (<= main_~i~0 (+ (* 2 main_~n~0) 1)) (<= main_~n~0 0))} havoc #t~post1; {461#(and (<= main_~i~0 (+ (* 2 main_~n~0) 1)) (<= main_~n~0 0))} is VALID [2020-07-10 20:25:06,434 INFO L280 TraceCheckUtils]: 16: Hoare triple {461#(and (<= main_~i~0 (+ (* 2 main_~n~0) 1)) (<= main_~n~0 0))} assume !(~i~0 < 2 * ~k~0); {462#(and (<= main_~k~0 main_~n~0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} is VALID [2020-07-10 20:25:06,437 INFO L263 TraceCheckUtils]: 17: Hoare triple {462#(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)); {463#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:25:06,438 INFO L280 TraceCheckUtils]: 18: Hoare triple {463#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {464#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:25:06,440 INFO L280 TraceCheckUtils]: 19: Hoare triple {464#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {455#false} is VALID [2020-07-10 20:25:06,440 INFO L280 TraceCheckUtils]: 20: Hoare triple {455#false} assume !false; {455#false} is VALID [2020-07-10 20:25:06,443 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-10 20:25:06,444 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:25:06,444 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1635051154] [2020-07-10 20:25:06,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:25:06,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-10 20:25:06,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767347727] [2020-07-10 20:25:06,447 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-07-10 20:25:06,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:25:06,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 20:25:06,477 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-10 20:25:06,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 20:25:06,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:25:06,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 20:25:06,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-10 20:25:06,481 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 9 states. [2020-07-10 20:25:07,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:07,036 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2020-07-10 20:25:07,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 20:25:07,037 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-07-10 20:25:07,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:25:07,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 20:25:07,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2020-07-10 20:25:07,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 20:25:07,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2020-07-10 20:25:07,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 53 transitions. [2020-07-10 20:25:07,110 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:07,114 INFO L225 Difference]: With dead ends: 48 [2020-07-10 20:25:07,114 INFO L226 Difference]: Without dead ends: 43 [2020-07-10 20:25:07,115 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2020-07-10 20:25:07,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-10 20:25:07,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2020-07-10 20:25:07,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:25:07,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 30 states. [2020-07-10 20:25:07,151 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 30 states. [2020-07-10 20:25:07,151 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 30 states. [2020-07-10 20:25:07,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:07,154 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2020-07-10 20:25:07,155 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2020-07-10 20:25:07,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:07,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:07,158 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 43 states. [2020-07-10 20:25:07,158 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 43 states. [2020-07-10 20:25:07,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:07,162 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2020-07-10 20:25:07,162 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2020-07-10 20:25:07,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:07,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:07,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:25:07,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:25:07,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-10 20:25:07,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2020-07-10 20:25:07,165 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 21 [2020-07-10 20:25:07,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:25:07,166 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2020-07-10 20:25:07,166 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 20:25:07,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 32 transitions. [2020-07-10 20:25:07,201 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-10 20:25:07,202 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-10 20:25:07,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 20:25:07,203 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:25:07,204 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-10 20:25:07,204 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:25:07,204 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:25:07,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:25:07,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1973531292, now seen corresponding path program 1 times [2020-07-10 20:25:07,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:25:07,205 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1430773062] [2020-07-10 20:25:07,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:25:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:07,354 INFO L280 TraceCheckUtils]: 0: Hoare triple {721#true} assume true; {721#true} is VALID [2020-07-10 20:25:07,354 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {721#true} {721#true} #62#return; {721#true} is VALID [2020-07-10 20:25:07,355 INFO L263 TraceCheckUtils]: 0: Hoare triple {721#true} call ULTIMATE.init(); {721#true} is VALID [2020-07-10 20:25:07,355 INFO L280 TraceCheckUtils]: 1: Hoare triple {721#true} assume true; {721#true} is VALID [2020-07-10 20:25:07,355 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {721#true} {721#true} #62#return; {721#true} is VALID [2020-07-10 20:25:07,356 INFO L263 TraceCheckUtils]: 3: Hoare triple {721#true} call #t~ret3 := main(); {721#true} is VALID [2020-07-10 20:25:07,356 INFO L280 TraceCheckUtils]: 4: Hoare triple {721#true} ~i~0 := 0; {721#true} is VALID [2020-07-10 20:25:07,356 INFO L280 TraceCheckUtils]: 5: Hoare triple {721#true} ~n~0 := 0; {721#true} is VALID [2020-07-10 20:25:07,357 INFO L280 TraceCheckUtils]: 6: Hoare triple {721#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {721#true} is VALID [2020-07-10 20:25:07,357 INFO L280 TraceCheckUtils]: 7: Hoare triple {721#true} ~k~0 := #t~nondet0; {721#true} is VALID [2020-07-10 20:25:07,357 INFO L280 TraceCheckUtils]: 8: Hoare triple {721#true} havoc #t~nondet0; {721#true} is VALID [2020-07-10 20:25:07,357 INFO L280 TraceCheckUtils]: 9: Hoare triple {721#true} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000); {721#true} is VALID [2020-07-10 20:25:07,364 INFO L280 TraceCheckUtils]: 10: Hoare triple {721#true} ~i~0 := 0; {725#(and (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2020-07-10 20:25:07,365 INFO L280 TraceCheckUtils]: 11: Hoare triple {725#(and (<= main_~i~0 0) (<= 0 main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {726#(and (<= main_~i~0 0) (< 0 main_~k~0))} is VALID [2020-07-10 20:25:07,365 INFO L280 TraceCheckUtils]: 12: Hoare triple {726#(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); {726#(and (<= main_~i~0 0) (< 0 main_~k~0))} is VALID [2020-07-10 20:25:07,366 INFO L280 TraceCheckUtils]: 13: Hoare triple {726#(and (<= main_~i~0 0) (< 0 main_~k~0))} #t~post2 := ~n~0; {726#(and (<= main_~i~0 0) (< 0 main_~k~0))} is VALID [2020-07-10 20:25:07,367 INFO L280 TraceCheckUtils]: 14: Hoare triple {726#(and (<= main_~i~0 0) (< 0 main_~k~0))} ~n~0 := 1 + #t~post2; {726#(and (<= main_~i~0 0) (< 0 main_~k~0))} is VALID [2020-07-10 20:25:07,368 INFO L280 TraceCheckUtils]: 15: Hoare triple {726#(and (<= main_~i~0 0) (< 0 main_~k~0))} havoc #t~post2; {726#(and (<= main_~i~0 0) (< 0 main_~k~0))} is VALID [2020-07-10 20:25:07,368 INFO L280 TraceCheckUtils]: 16: Hoare triple {726#(and (<= main_~i~0 0) (< 0 main_~k~0))} #t~post1 := ~i~0; {727#(and (<= |main_#t~post1| 0) (< 0 main_~k~0))} is VALID [2020-07-10 20:25:07,369 INFO L280 TraceCheckUtils]: 17: Hoare triple {727#(and (<= |main_#t~post1| 0) (< 0 main_~k~0))} ~i~0 := 1 + #t~post1; {728#(and (< 0 main_~k~0) (<= main_~i~0 1))} is VALID [2020-07-10 20:25:07,370 INFO L280 TraceCheckUtils]: 18: Hoare triple {728#(and (< 0 main_~k~0) (<= main_~i~0 1))} havoc #t~post1; {728#(and (< 0 main_~k~0) (<= main_~i~0 1))} is VALID [2020-07-10 20:25:07,371 INFO L280 TraceCheckUtils]: 19: Hoare triple {728#(and (< 0 main_~k~0) (<= main_~i~0 1))} assume !(~i~0 < 2 * ~k~0); {722#false} is VALID [2020-07-10 20:25:07,371 INFO L263 TraceCheckUtils]: 20: Hoare triple {722#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {722#false} is VALID [2020-07-10 20:25:07,372 INFO L280 TraceCheckUtils]: 21: Hoare triple {722#false} ~cond := #in~cond; {722#false} is VALID [2020-07-10 20:25:07,372 INFO L280 TraceCheckUtils]: 22: Hoare triple {722#false} assume 0 == ~cond; {722#false} is VALID [2020-07-10 20:25:07,372 INFO L280 TraceCheckUtils]: 23: Hoare triple {722#false} assume !false; {722#false} is VALID [2020-07-10 20:25:07,373 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-10 20:25:07,373 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:25:07,374 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1430773062] [2020-07-10 20:25:07,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:25:07,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 20:25:07,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680748772] [2020-07-10 20:25:07,375 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-07-10 20:25:07,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:25:07,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 20:25:07,406 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-10 20:25:07,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 20:25:07,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:25:07,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 20:25:07,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-10 20:25:07,408 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 6 states. [2020-07-10 20:25:07,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:07,749 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2020-07-10 20:25:07,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 20:25:07,749 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-07-10 20:25:07,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:25:07,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 20:25:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 59 transitions. [2020-07-10 20:25:07,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 20:25:07,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 59 transitions. [2020-07-10 20:25:07,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 59 transitions. [2020-07-10 20:25:07,817 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:07,819 INFO L225 Difference]: With dead ends: 58 [2020-07-10 20:25:07,819 INFO L226 Difference]: Without dead ends: 41 [2020-07-10 20:25:07,820 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-07-10 20:25:07,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-10 20:25:07,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2020-07-10 20:25:07,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:25:07,862 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 34 states. [2020-07-10 20:25:07,862 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 34 states. [2020-07-10 20:25:07,862 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 34 states. [2020-07-10 20:25:07,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:07,865 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2020-07-10 20:25:07,865 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2020-07-10 20:25:07,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:07,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:07,866 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 41 states. [2020-07-10 20:25:07,866 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 41 states. [2020-07-10 20:25:07,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:07,868 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2020-07-10 20:25:07,868 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2020-07-10 20:25:07,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:07,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:07,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:25:07,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:25:07,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-10 20:25:07,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2020-07-10 20:25:07,871 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 24 [2020-07-10 20:25:07,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:25:07,872 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2020-07-10 20:25:07,872 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 20:25:07,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 36 transitions. [2020-07-10 20:25:07,919 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-10 20:25:07,920 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2020-07-10 20:25:07,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-10 20:25:07,921 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:25:07,921 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-10 20:25:07,921 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 20:25:07,922 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:25:07,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:25:07,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1981883390, now seen corresponding path program 1 times [2020-07-10 20:25:07,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:25:07,923 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [351242043] [2020-07-10 20:25:07,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:25:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:08,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:08,349 INFO L280 TraceCheckUtils]: 0: Hoare triple {1005#true} assume true; {1005#true} is VALID [2020-07-10 20:25:08,349 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1005#true} {1005#true} #62#return; {1005#true} is VALID [2020-07-10 20:25:08,350 INFO L263 TraceCheckUtils]: 0: Hoare triple {1005#true} call ULTIMATE.init(); {1005#true} is VALID [2020-07-10 20:25:08,350 INFO L280 TraceCheckUtils]: 1: Hoare triple {1005#true} assume true; {1005#true} is VALID [2020-07-10 20:25:08,350 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1005#true} {1005#true} #62#return; {1005#true} is VALID [2020-07-10 20:25:08,350 INFO L263 TraceCheckUtils]: 3: Hoare triple {1005#true} call #t~ret3 := main(); {1005#true} is VALID [2020-07-10 20:25:08,351 INFO L280 TraceCheckUtils]: 4: Hoare triple {1005#true} ~i~0 := 0; {1005#true} is VALID [2020-07-10 20:25:08,351 INFO L280 TraceCheckUtils]: 5: Hoare triple {1005#true} ~n~0 := 0; {1009#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-10 20:25:08,352 INFO L280 TraceCheckUtils]: 6: Hoare triple {1009#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1009#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-10 20:25:08,353 INFO L280 TraceCheckUtils]: 7: Hoare triple {1009#(and (<= 0 main_~n~0) (<= main_~n~0 0))} ~k~0 := #t~nondet0; {1009#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-10 20:25:08,354 INFO L280 TraceCheckUtils]: 8: Hoare triple {1009#(and (<= 0 main_~n~0) (<= main_~n~0 0))} havoc #t~nondet0; {1009#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-10 20:25:08,355 INFO L280 TraceCheckUtils]: 9: Hoare triple {1009#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000); {1009#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-10 20:25:08,362 INFO L280 TraceCheckUtils]: 10: Hoare triple {1009#(and (<= 0 main_~n~0) (<= main_~n~0 0))} ~i~0 := 0; {1010#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-10 20:25:08,363 INFO L280 TraceCheckUtils]: 11: Hoare triple {1010#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {1010#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-10 20:25:08,363 INFO L280 TraceCheckUtils]: 12: Hoare triple {1010#(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); {1010#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-10 20:25:08,364 INFO L280 TraceCheckUtils]: 13: Hoare triple {1010#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} #t~post2 := ~n~0; {1011#(and (<= (* 2 |main_#t~post2|) main_~i~0) (<= main_~i~0 (* 2 |main_#t~post2|)))} is VALID [2020-07-10 20:25:08,365 INFO L280 TraceCheckUtils]: 14: Hoare triple {1011#(and (<= (* 2 |main_#t~post2|) main_~i~0) (<= main_~i~0 (* 2 |main_#t~post2|)))} ~n~0 := 1 + #t~post2; {1012#(and (<= (* 2 main_~n~0) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* 2 main_~n~0)))} is VALID [2020-07-10 20:25:08,365 INFO L280 TraceCheckUtils]: 15: Hoare triple {1012#(and (<= (* 2 main_~n~0) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* 2 main_~n~0)))} havoc #t~post2; {1012#(and (<= (* 2 main_~n~0) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* 2 main_~n~0)))} is VALID [2020-07-10 20:25:08,366 INFO L280 TraceCheckUtils]: 16: Hoare triple {1012#(and (<= (* 2 main_~n~0) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* 2 main_~n~0)))} #t~post1 := ~i~0; {1013#(and (<= (* 2 main_~n~0) (+ |main_#t~post1| 2)) (<= (+ |main_#t~post1| 2) (* 2 main_~n~0)))} is VALID [2020-07-10 20:25:08,374 INFO L280 TraceCheckUtils]: 17: Hoare triple {1013#(and (<= (* 2 main_~n~0) (+ |main_#t~post1| 2)) (<= (+ |main_#t~post1| 2) (* 2 main_~n~0)))} ~i~0 := 1 + #t~post1; {1014#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} is VALID [2020-07-10 20:25:08,376 INFO L280 TraceCheckUtils]: 18: Hoare triple {1014#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} havoc #t~post1; {1014#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} is VALID [2020-07-10 20:25:08,377 INFO L280 TraceCheckUtils]: 19: Hoare triple {1014#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} assume !!(~i~0 < 2 * ~k~0); {1015#(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-10 20:25:08,378 INFO L280 TraceCheckUtils]: 20: Hoare triple {1015#(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)); {1015#(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-10 20:25:08,378 INFO L280 TraceCheckUtils]: 21: Hoare triple {1015#(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; {1016#(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-10 20:25:08,381 INFO L280 TraceCheckUtils]: 22: Hoare triple {1016#(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; {1017#(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-10 20:25:08,382 INFO L280 TraceCheckUtils]: 23: Hoare triple {1017#(and (or (<= main_~i~0 (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} havoc #t~post1; {1017#(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-10 20:25:08,383 INFO L280 TraceCheckUtils]: 24: Hoare triple {1017#(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); {1018#(and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} is VALID [2020-07-10 20:25:08,384 INFO L263 TraceCheckUtils]: 25: Hoare triple {1018#(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)); {1019#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:25:08,384 INFO L280 TraceCheckUtils]: 26: Hoare triple {1019#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1020#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:25:08,385 INFO L280 TraceCheckUtils]: 27: Hoare triple {1020#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1006#false} is VALID [2020-07-10 20:25:08,385 INFO L280 TraceCheckUtils]: 28: Hoare triple {1006#false} assume !false; {1006#false} is VALID [2020-07-10 20:25:08,388 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-10 20:25:08,388 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:25:08,389 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [351242043] [2020-07-10 20:25:08,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:25:08,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-10 20:25:08,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312612428] [2020-07-10 20:25:08,390 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2020-07-10 20:25:08,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:25:08,391 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-10 20:25:08,420 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-10 20:25:08,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-10 20:25:08,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:25:08,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-10 20:25:08,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-07-10 20:25:08,421 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 14 states. [2020-07-10 20:25:09,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:09,444 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2020-07-10 20:25:09,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-10 20:25:09,444 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2020-07-10 20:25:09,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:25:09,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 20:25:09,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 64 transitions. [2020-07-10 20:25:09,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 20:25:09,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 64 transitions. [2020-07-10 20:25:09,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 64 transitions. [2020-07-10 20:25:09,519 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:09,520 INFO L225 Difference]: With dead ends: 67 [2020-07-10 20:25:09,521 INFO L226 Difference]: Without dead ends: 43 [2020-07-10 20:25:09,522 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2020-07-10 20:25:09,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-10 20:25:09,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2020-07-10 20:25:09,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:25:09,583 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 39 states. [2020-07-10 20:25:09,583 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 39 states. [2020-07-10 20:25:09,583 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 39 states. [2020-07-10 20:25:09,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:09,585 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2020-07-10 20:25:09,586 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2020-07-10 20:25:09,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:09,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:09,586 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 43 states. [2020-07-10 20:25:09,587 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 43 states. [2020-07-10 20:25:09,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:09,589 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2020-07-10 20:25:09,589 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2020-07-10 20:25:09,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:09,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:09,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:25:09,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:25:09,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-10 20:25:09,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2020-07-10 20:25:09,592 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 29 [2020-07-10 20:25:09,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:25:09,593 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2020-07-10 20:25:09,593 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-10 20:25:09,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 41 transitions. [2020-07-10 20:25:09,646 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-10 20:25:09,647 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-07-10 20:25:09,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-10 20:25:09,648 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:25:09,648 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-10 20:25:09,648 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 20:25:09,648 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:25:09,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:25:09,649 INFO L82 PathProgramCache]: Analyzing trace with hash -282773191, now seen corresponding path program 2 times [2020-07-10 20:25:09,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:25:09,649 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1033953893] [2020-07-10 20:25:09,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:25:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:09,925 INFO L280 TraceCheckUtils]: 0: Hoare triple {1343#true} assume true; {1343#true} is VALID [2020-07-10 20:25:09,926 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1343#true} {1343#true} #62#return; {1343#true} is VALID [2020-07-10 20:25:09,926 INFO L263 TraceCheckUtils]: 0: Hoare triple {1343#true} call ULTIMATE.init(); {1343#true} is VALID [2020-07-10 20:25:09,927 INFO L280 TraceCheckUtils]: 1: Hoare triple {1343#true} assume true; {1343#true} is VALID [2020-07-10 20:25:09,927 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1343#true} {1343#true} #62#return; {1343#true} is VALID [2020-07-10 20:25:09,927 INFO L263 TraceCheckUtils]: 3: Hoare triple {1343#true} call #t~ret3 := main(); {1343#true} is VALID [2020-07-10 20:25:09,927 INFO L280 TraceCheckUtils]: 4: Hoare triple {1343#true} ~i~0 := 0; {1343#true} is VALID [2020-07-10 20:25:09,928 INFO L280 TraceCheckUtils]: 5: Hoare triple {1343#true} ~n~0 := 0; {1343#true} is VALID [2020-07-10 20:25:09,928 INFO L280 TraceCheckUtils]: 6: Hoare triple {1343#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1343#true} is VALID [2020-07-10 20:25:09,928 INFO L280 TraceCheckUtils]: 7: Hoare triple {1343#true} ~k~0 := #t~nondet0; {1343#true} is VALID [2020-07-10 20:25:09,929 INFO L280 TraceCheckUtils]: 8: Hoare triple {1343#true} havoc #t~nondet0; {1343#true} is VALID [2020-07-10 20:25:09,929 INFO L280 TraceCheckUtils]: 9: Hoare triple {1343#true} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000); {1343#true} is VALID [2020-07-10 20:25:09,930 INFO L280 TraceCheckUtils]: 10: Hoare triple {1343#true} ~i~0 := 0; {1347#(or (<= (+ main_~i~0 4) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ main_~i~0 2)))} is VALID [2020-07-10 20:25:09,931 INFO L280 TraceCheckUtils]: 11: Hoare triple {1347#(or (<= (+ main_~i~0 4) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ main_~i~0 2)))} assume !!(~i~0 < 2 * ~k~0); {1347#(or (<= (+ main_~i~0 4) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ main_~i~0 2)))} is VALID [2020-07-10 20:25:09,931 INFO L280 TraceCheckUtils]: 12: Hoare triple {1347#(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); {1347#(or (<= (+ main_~i~0 4) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ main_~i~0 2)))} is VALID [2020-07-10 20:25:09,932 INFO L280 TraceCheckUtils]: 13: Hoare triple {1347#(or (<= (+ main_~i~0 4) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ main_~i~0 2)))} #t~post2 := ~n~0; {1347#(or (<= (+ main_~i~0 4) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ main_~i~0 2)))} is VALID [2020-07-10 20:25:09,933 INFO L280 TraceCheckUtils]: 14: Hoare triple {1347#(or (<= (+ main_~i~0 4) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ main_~i~0 2)))} ~n~0 := 1 + #t~post2; {1347#(or (<= (+ main_~i~0 4) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ main_~i~0 2)))} is VALID [2020-07-10 20:25:09,933 INFO L280 TraceCheckUtils]: 15: Hoare triple {1347#(or (<= (+ main_~i~0 4) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ main_~i~0 2)))} havoc #t~post2; {1347#(or (<= (+ main_~i~0 4) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ main_~i~0 2)))} is VALID [2020-07-10 20:25:09,934 INFO L280 TraceCheckUtils]: 16: Hoare triple {1347#(or (<= (+ main_~i~0 4) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ main_~i~0 2)))} #t~post1 := ~i~0; {1348#(or (<= (* 2 main_~k~0) (+ |main_#t~post1| 2)) (<= (+ |main_#t~post1| 4) (* 2 main_~k~0)))} is VALID [2020-07-10 20:25:09,936 INFO L280 TraceCheckUtils]: 17: Hoare triple {1348#(or (<= (* 2 main_~k~0) (+ |main_#t~post1| 2)) (<= (+ |main_#t~post1| 4) (* 2 main_~k~0)))} ~i~0 := 1 + #t~post1; {1349#(or (<= (* 2 main_~k~0) (+ main_~i~0 1)) (<= (+ main_~i~0 3) (* 2 main_~k~0)))} is VALID [2020-07-10 20:25:09,937 INFO L280 TraceCheckUtils]: 18: Hoare triple {1349#(or (<= (* 2 main_~k~0) (+ main_~i~0 1)) (<= (+ main_~i~0 3) (* 2 main_~k~0)))} havoc #t~post1; {1349#(or (<= (* 2 main_~k~0) (+ main_~i~0 1)) (<= (+ main_~i~0 3) (* 2 main_~k~0)))} is VALID [2020-07-10 20:25:09,937 INFO L280 TraceCheckUtils]: 19: Hoare triple {1349#(or (<= (* 2 main_~k~0) (+ main_~i~0 1)) (<= (+ main_~i~0 3) (* 2 main_~k~0)))} assume !!(~i~0 < 2 * ~k~0); {1349#(or (<= (* 2 main_~k~0) (+ main_~i~0 1)) (<= (+ main_~i~0 3) (* 2 main_~k~0)))} is VALID [2020-07-10 20:25:09,938 INFO L280 TraceCheckUtils]: 20: Hoare triple {1349#(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)); {1349#(or (<= (* 2 main_~k~0) (+ main_~i~0 1)) (<= (+ main_~i~0 3) (* 2 main_~k~0)))} is VALID [2020-07-10 20:25:09,939 INFO L280 TraceCheckUtils]: 21: Hoare triple {1349#(or (<= (* 2 main_~k~0) (+ main_~i~0 1)) (<= (+ main_~i~0 3) (* 2 main_~k~0)))} #t~post1 := ~i~0; {1350#(or (<= (+ |main_#t~post1| 3) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ |main_#t~post1| 1)))} is VALID [2020-07-10 20:25:09,940 INFO L280 TraceCheckUtils]: 22: Hoare triple {1350#(or (<= (+ |main_#t~post1| 3) (* 2 main_~k~0)) (<= (* 2 main_~k~0) (+ |main_#t~post1| 1)))} ~i~0 := 1 + #t~post1; {1351#(or (<= (+ main_~i~0 2) (* 2 main_~k~0)) (<= (* 2 main_~k~0) main_~i~0))} is VALID [2020-07-10 20:25:09,941 INFO L280 TraceCheckUtils]: 23: Hoare triple {1351#(or (<= (+ main_~i~0 2) (* 2 main_~k~0)) (<= (* 2 main_~k~0) main_~i~0))} havoc #t~post1; {1351#(or (<= (+ main_~i~0 2) (* 2 main_~k~0)) (<= (* 2 main_~k~0) main_~i~0))} is VALID [2020-07-10 20:25:09,941 INFO L280 TraceCheckUtils]: 24: Hoare triple {1351#(or (<= (+ main_~i~0 2) (* 2 main_~k~0)) (<= (* 2 main_~k~0) main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {1352#(<= (+ main_~i~0 2) (* 2 main_~k~0))} is VALID [2020-07-10 20:25:09,942 INFO L280 TraceCheckUtils]: 25: Hoare triple {1352#(<= (+ 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); {1352#(<= (+ main_~i~0 2) (* 2 main_~k~0))} is VALID [2020-07-10 20:25:09,943 INFO L280 TraceCheckUtils]: 26: Hoare triple {1352#(<= (+ main_~i~0 2) (* 2 main_~k~0))} #t~post2 := ~n~0; {1352#(<= (+ main_~i~0 2) (* 2 main_~k~0))} is VALID [2020-07-10 20:25:09,944 INFO L280 TraceCheckUtils]: 27: Hoare triple {1352#(<= (+ main_~i~0 2) (* 2 main_~k~0))} ~n~0 := 1 + #t~post2; {1352#(<= (+ main_~i~0 2) (* 2 main_~k~0))} is VALID [2020-07-10 20:25:09,945 INFO L280 TraceCheckUtils]: 28: Hoare triple {1352#(<= (+ main_~i~0 2) (* 2 main_~k~0))} havoc #t~post2; {1352#(<= (+ main_~i~0 2) (* 2 main_~k~0))} is VALID [2020-07-10 20:25:09,945 INFO L280 TraceCheckUtils]: 29: Hoare triple {1352#(<= (+ main_~i~0 2) (* 2 main_~k~0))} #t~post1 := ~i~0; {1353#(<= (+ |main_#t~post1| 2) (* 2 main_~k~0))} is VALID [2020-07-10 20:25:09,946 INFO L280 TraceCheckUtils]: 30: Hoare triple {1353#(<= (+ |main_#t~post1| 2) (* 2 main_~k~0))} ~i~0 := 1 + #t~post1; {1354#(<= (+ main_~i~0 1) (* 2 main_~k~0))} is VALID [2020-07-10 20:25:09,947 INFO L280 TraceCheckUtils]: 31: Hoare triple {1354#(<= (+ main_~i~0 1) (* 2 main_~k~0))} havoc #t~post1; {1354#(<= (+ main_~i~0 1) (* 2 main_~k~0))} is VALID [2020-07-10 20:25:09,948 INFO L280 TraceCheckUtils]: 32: Hoare triple {1354#(<= (+ main_~i~0 1) (* 2 main_~k~0))} assume !(~i~0 < 2 * ~k~0); {1344#false} is VALID [2020-07-10 20:25:09,948 INFO L263 TraceCheckUtils]: 33: Hoare triple {1344#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {1344#false} is VALID [2020-07-10 20:25:09,949 INFO L280 TraceCheckUtils]: 34: Hoare triple {1344#false} ~cond := #in~cond; {1344#false} is VALID [2020-07-10 20:25:09,949 INFO L280 TraceCheckUtils]: 35: Hoare triple {1344#false} assume 0 == ~cond; {1344#false} is VALID [2020-07-10 20:25:09,949 INFO L280 TraceCheckUtils]: 36: Hoare triple {1344#false} assume !false; {1344#false} is VALID [2020-07-10 20:25:09,954 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-10 20:25:09,954 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:25:09,955 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1033953893] [2020-07-10 20:25:09,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:25:09,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-10 20:25:09,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978249964] [2020-07-10 20:25:09,956 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2020-07-10 20:25:09,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:25:09,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 20:25:09,998 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-10 20:25:09,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 20:25:09,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:25:09,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 20:25:09,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-10 20:25:09,999 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 10 states. [2020-07-10 20:25:10,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:10,966 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2020-07-10 20:25:10,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-10 20:25:10,966 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2020-07-10 20:25:10,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:25:10,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 20:25:10,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 53 transitions. [2020-07-10 20:25:10,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 20:25:10,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 53 transitions. [2020-07-10 20:25:10,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 53 transitions. [2020-07-10 20:25:11,061 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-10 20:25:11,063 INFO L225 Difference]: With dead ends: 65 [2020-07-10 20:25:11,064 INFO L226 Difference]: Without dead ends: 60 [2020-07-10 20:25:11,064 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-10 20:25:11,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-10 20:25:11,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2020-07-10 20:25:11,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:25:11,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 51 states. [2020-07-10 20:25:11,189 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 51 states. [2020-07-10 20:25:11,190 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 51 states. [2020-07-10 20:25:11,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:11,192 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2020-07-10 20:25:11,193 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2020-07-10 20:25:11,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:11,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:11,193 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 60 states. [2020-07-10 20:25:11,193 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 60 states. [2020-07-10 20:25:11,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:11,196 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2020-07-10 20:25:11,196 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2020-07-10 20:25:11,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:11,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:11,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:25:11,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:25:11,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-10 20:25:11,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2020-07-10 20:25:11,199 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 37 [2020-07-10 20:25:11,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:25:11,199 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2020-07-10 20:25:11,199 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 20:25:11,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 54 transitions. [2020-07-10 20:25:11,279 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-10 20:25:11,279 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2020-07-10 20:25:11,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-10 20:25:11,281 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:25:11,281 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-10 20:25:11,281 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 20:25:11,281 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:25:11,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:25:11,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1065873285, now seen corresponding path program 3 times [2020-07-10 20:25:11,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:25:11,282 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1098585811] [2020-07-10 20:25:11,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:25:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:11,754 INFO L280 TraceCheckUtils]: 0: Hoare triple {1738#true} assume true; {1738#true} is VALID [2020-07-10 20:25:11,754 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1738#true} {1738#true} #62#return; {1738#true} is VALID [2020-07-10 20:25:11,754 INFO L263 TraceCheckUtils]: 0: Hoare triple {1738#true} call ULTIMATE.init(); {1738#true} is VALID [2020-07-10 20:25:11,755 INFO L280 TraceCheckUtils]: 1: Hoare triple {1738#true} assume true; {1738#true} is VALID [2020-07-10 20:25:11,755 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1738#true} {1738#true} #62#return; {1738#true} is VALID [2020-07-10 20:25:11,755 INFO L263 TraceCheckUtils]: 3: Hoare triple {1738#true} call #t~ret3 := main(); {1738#true} is VALID [2020-07-10 20:25:11,755 INFO L280 TraceCheckUtils]: 4: Hoare triple {1738#true} ~i~0 := 0; {1738#true} is VALID [2020-07-10 20:25:11,759 INFO L280 TraceCheckUtils]: 5: Hoare triple {1738#true} ~n~0 := 0; {1742#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-10 20:25:11,760 INFO L280 TraceCheckUtils]: 6: Hoare triple {1742#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1742#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-10 20:25:11,760 INFO L280 TraceCheckUtils]: 7: Hoare triple {1742#(and (<= 0 main_~n~0) (<= main_~n~0 0))} ~k~0 := #t~nondet0; {1742#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-10 20:25:11,761 INFO L280 TraceCheckUtils]: 8: Hoare triple {1742#(and (<= 0 main_~n~0) (<= main_~n~0 0))} havoc #t~nondet0; {1742#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-10 20:25:11,761 INFO L280 TraceCheckUtils]: 9: Hoare triple {1742#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000); {1742#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-10 20:25:11,762 INFO L280 TraceCheckUtils]: 10: Hoare triple {1742#(and (<= 0 main_~n~0) (<= main_~n~0 0))} ~i~0 := 0; {1743#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-10 20:25:11,762 INFO L280 TraceCheckUtils]: 11: Hoare triple {1743#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {1743#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-10 20:25:11,763 INFO L280 TraceCheckUtils]: 12: Hoare triple {1743#(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); {1743#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-10 20:25:11,764 INFO L280 TraceCheckUtils]: 13: Hoare triple {1743#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} #t~post2 := ~n~0; {1744#(and (<= (* 2 |main_#t~post2|) main_~i~0) (<= main_~i~0 (* 2 |main_#t~post2|)))} is VALID [2020-07-10 20:25:11,765 INFO L280 TraceCheckUtils]: 14: Hoare triple {1744#(and (<= (* 2 |main_#t~post2|) main_~i~0) (<= main_~i~0 (* 2 |main_#t~post2|)))} ~n~0 := 1 + #t~post2; {1745#(and (<= (* 2 main_~n~0) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* 2 main_~n~0)))} is VALID [2020-07-10 20:25:11,766 INFO L280 TraceCheckUtils]: 15: Hoare triple {1745#(and (<= (* 2 main_~n~0) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* 2 main_~n~0)))} havoc #t~post2; {1745#(and (<= (* 2 main_~n~0) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* 2 main_~n~0)))} is VALID [2020-07-10 20:25:11,767 INFO L280 TraceCheckUtils]: 16: Hoare triple {1745#(and (<= (* 2 main_~n~0) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* 2 main_~n~0)))} #t~post1 := ~i~0; {1746#(and (<= (* 2 main_~n~0) (+ |main_#t~post1| 2)) (<= (+ |main_#t~post1| 2) (* 2 main_~n~0)))} is VALID [2020-07-10 20:25:11,768 INFO L280 TraceCheckUtils]: 17: Hoare triple {1746#(and (<= (* 2 main_~n~0) (+ |main_#t~post1| 2)) (<= (+ |main_#t~post1| 2) (* 2 main_~n~0)))} ~i~0 := 1 + #t~post1; {1747#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} is VALID [2020-07-10 20:25:11,769 INFO L280 TraceCheckUtils]: 18: Hoare triple {1747#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} havoc #t~post1; {1747#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} is VALID [2020-07-10 20:25:11,770 INFO L280 TraceCheckUtils]: 19: Hoare triple {1747#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} assume !!(~i~0 < 2 * ~k~0); {1747#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} is VALID [2020-07-10 20:25:11,772 INFO L280 TraceCheckUtils]: 20: Hoare triple {1747#(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)); {1747#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} is VALID [2020-07-10 20:25:11,773 INFO L280 TraceCheckUtils]: 21: Hoare triple {1747#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} #t~post1 := ~i~0; {1748#(and (<= (+ |main_#t~post1| 1) (* 2 main_~n~0)) (<= (* 2 main_~n~0) (+ |main_#t~post1| 1)))} is VALID [2020-07-10 20:25:11,774 INFO L280 TraceCheckUtils]: 22: Hoare triple {1748#(and (<= (+ |main_#t~post1| 1) (* 2 main_~n~0)) (<= (* 2 main_~n~0) (+ |main_#t~post1| 1)))} ~i~0 := 1 + #t~post1; {1743#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-10 20:25:11,774 INFO L280 TraceCheckUtils]: 23: Hoare triple {1743#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} havoc #t~post1; {1743#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-10 20:25:11,775 INFO L280 TraceCheckUtils]: 24: Hoare triple {1743#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {1743#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-10 20:25:11,775 INFO L280 TraceCheckUtils]: 25: Hoare triple {1743#(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); {1743#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-10 20:25:11,776 INFO L280 TraceCheckUtils]: 26: Hoare triple {1743#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} #t~post2 := ~n~0; {1744#(and (<= (* 2 |main_#t~post2|) main_~i~0) (<= main_~i~0 (* 2 |main_#t~post2|)))} is VALID [2020-07-10 20:25:11,777 INFO L280 TraceCheckUtils]: 27: Hoare triple {1744#(and (<= (* 2 |main_#t~post2|) main_~i~0) (<= main_~i~0 (* 2 |main_#t~post2|)))} ~n~0 := 1 + #t~post2; {1745#(and (<= (* 2 main_~n~0) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* 2 main_~n~0)))} is VALID [2020-07-10 20:25:11,777 INFO L280 TraceCheckUtils]: 28: Hoare triple {1745#(and (<= (* 2 main_~n~0) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* 2 main_~n~0)))} havoc #t~post2; {1745#(and (<= (* 2 main_~n~0) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* 2 main_~n~0)))} is VALID [2020-07-10 20:25:11,778 INFO L280 TraceCheckUtils]: 29: Hoare triple {1745#(and (<= (* 2 main_~n~0) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* 2 main_~n~0)))} #t~post1 := ~i~0; {1746#(and (<= (* 2 main_~n~0) (+ |main_#t~post1| 2)) (<= (+ |main_#t~post1| 2) (* 2 main_~n~0)))} is VALID [2020-07-10 20:25:11,779 INFO L280 TraceCheckUtils]: 30: Hoare triple {1746#(and (<= (* 2 main_~n~0) (+ |main_#t~post1| 2)) (<= (+ |main_#t~post1| 2) (* 2 main_~n~0)))} ~i~0 := 1 + #t~post1; {1747#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} is VALID [2020-07-10 20:25:11,779 INFO L280 TraceCheckUtils]: 31: Hoare triple {1747#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} havoc #t~post1; {1747#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} is VALID [2020-07-10 20:25:11,780 INFO L280 TraceCheckUtils]: 32: Hoare triple {1747#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} assume !!(~i~0 < 2 * ~k~0); {1749#(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-10 20:25:11,781 INFO L280 TraceCheckUtils]: 33: Hoare triple {1749#(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)); {1749#(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-10 20:25:11,781 INFO L280 TraceCheckUtils]: 34: Hoare triple {1749#(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; {1750#(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-10 20:25:11,785 INFO L280 TraceCheckUtils]: 35: Hoare triple {1750#(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; {1751#(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-10 20:25:11,787 INFO L280 TraceCheckUtils]: 36: Hoare triple {1751#(and (or (<= main_~i~0 (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} havoc #t~post1; {1751#(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-10 20:25:11,788 INFO L280 TraceCheckUtils]: 37: Hoare triple {1751#(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); {1752#(and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} is VALID [2020-07-10 20:25:11,789 INFO L263 TraceCheckUtils]: 38: Hoare triple {1752#(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)); {1753#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:25:11,790 INFO L280 TraceCheckUtils]: 39: Hoare triple {1753#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1754#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:25:11,790 INFO L280 TraceCheckUtils]: 40: Hoare triple {1754#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1739#false} is VALID [2020-07-10 20:25:11,791 INFO L280 TraceCheckUtils]: 41: Hoare triple {1739#false} assume !false; {1739#false} is VALID [2020-07-10 20:25:11,796 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-10 20:25:11,796 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:25:11,797 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1098585811] [2020-07-10 20:25:11,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:25:11,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-10 20:25:11,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145041251] [2020-07-10 20:25:11,798 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2020-07-10 20:25:11,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:25:11,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-10 20:25:11,838 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-10 20:25:11,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-10 20:25:11,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:25:11,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-10 20:25:11,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-07-10 20:25:11,841 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 15 states. [2020-07-10 20:25:12,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:12,930 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2020-07-10 20:25:12,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-10 20:25:12,930 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2020-07-10 20:25:12,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:25:12,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 20:25:12,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 48 transitions. [2020-07-10 20:25:12,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 20:25:12,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 48 transitions. [2020-07-10 20:25:12,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 48 transitions. [2020-07-10 20:25:12,999 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-10 20:25:12,999 INFO L225 Difference]: With dead ends: 71 [2020-07-10 20:25:13,000 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 20:25:13,001 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2020-07-10 20:25:13,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 20:25:13,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 20:25:13,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:25:13,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 20:25:13,002 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:25:13,002 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:25:13,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:13,002 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:25:13,002 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:25:13,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:13,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:13,003 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:25:13,003 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:25:13,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:13,003 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:25:13,003 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:25:13,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:13,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:13,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:25:13,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:25:13,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 20:25:13,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 20:25:13,004 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2020-07-10 20:25:13,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:25:13,004 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 20:25:13,004 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-10 20:25:13,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-10 20:25:13,004 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-10 20:25:13,004 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:25:13,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:13,005 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 20:25:13,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 20:25:13,522 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 25 [2020-07-10 20:25:13,860 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:25:13,860 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:25:13,861 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:25:13,861 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 20:25:13,861 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 20:25:13,861 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:25:13,861 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-10 20:25:13,861 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-10 20:25:13,861 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-10 20:25:13,861 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-10 20:25:13,861 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-10 20:25:13,862 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 25) the Hoare annotation is: true [2020-07-10 20:25:13,862 INFO L271 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: true [2020-07-10 20:25:13,862 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-10 20:25:13,862 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (and (<= main_~i~0 0) (<= 0 main_~i~0) (<= 0 main_~n~0) (<= main_~n~0 0)) [2020-07-10 20:25:13,862 INFO L271 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-07-10 20:25:13,862 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (<= main_~i~0 0) (<= 0 main_~i~0)) [2020-07-10 20:25:13,863 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 25) the Hoare annotation is: true [2020-07-10 20:25:13,863 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 25) the Hoare annotation is: true [2020-07-10 20:25:13,863 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-10 20:25:13,863 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-10 20:25:13,863 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (and (<= main_~i~0 0) (<= 0 main_~i~0) (<= 0 main_~n~0) (<= main_~n~0 0)) [2020-07-10 20:25:13,864 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-10 20:25:13,864 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (<= main_~i~0 0) (<= 0 main_~i~0) (<= 0 main_~n~0) (<= main_~n~0 0)) [2020-07-10 20:25:13,864 INFO L264 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: (and (<= main_~i~0 0) (<= 0 main_~i~0) (<= 0 main_~n~0) (<= main_~n~0 0)) [2020-07-10 20:25:13,864 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-10 20:25:13,864 INFO L264 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: (and (<= main_~i~0 0) (<= 0 main_~i~0) (<= 0 main_~n~0) (<= main_~n~0 0)) [2020-07-10 20:25:13,865 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-10 20:25:13,865 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-10 20:25:13,865 INFO L264 CegarLoopResult]: At program point L18-6(lines 18 22) the Hoare annotation is: (let ((.cse2 (* 2 main_~n~0))) (let ((.cse0 (<= main_~i~0 .cse2)) (.cse1 (<= .cse2 main_~i~0))) (or (and (<= 0 main_~n~0) (<= main_~n~0 0) .cse0 .cse1) (and .cse0 .cse1 (<= main_~n~0 main_~k~0)) (let ((.cse3 (+ main_~i~0 1))) (and (<= .cse2 .cse3) (<= .cse3 (* 2 main_~k~0)) (<= .cse3 .cse2)))))) [2020-07-10 20:25:13,865 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 (<= main_~i~0 (+ (* 2 main_~n~0) 1)) (<= 0 main_~n~0) (<= main_~n~0 0) .cse0))) [2020-07-10 20:25:13,865 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-10 20:25:13,866 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: true [2020-07-10 20:25:13,866 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-10 20:25:13,866 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-10 20:25:13,866 INFO L271 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: true [2020-07-10 20:25:13,866 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-10 20:25:13,871 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 20:25:13,873 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 20:25:13,873 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 20:25:13,874 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-10 20:25:13,874 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-10 20:25:13,893 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-10 20:25:13,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 08:25:13 BoogieIcfgContainer [2020-07-10 20:25:13,910 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 20:25:13,914 INFO L168 Benchmark]: Toolchain (without parser) took 10191.14 ms. Allocated memory was 145.2 MB in the beginning and 312.0 MB in the end (delta: 166.7 MB). Free memory was 102.6 MB in the beginning and 257.4 MB in the end (delta: -154.8 MB). Peak memory consumption was 11.9 MB. Max. memory is 7.1 GB. [2020-07-10 20:25:13,920 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 145.2 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 20:25:13,921 INFO L168 Benchmark]: CACSL2BoogieTranslator took 252.83 ms. Allocated memory is still 145.2 MB. Free memory was 102.4 MB in the beginning and 92.5 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-10 20:25:13,922 INFO L168 Benchmark]: Boogie Preprocessor took 132.24 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 92.5 MB in the beginning and 181.7 MB in the end (delta: -89.2 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2020-07-10 20:25:13,927 INFO L168 Benchmark]: RCFGBuilder took 357.37 ms. Allocated memory is still 202.9 MB. Free memory was 181.7 MB in the beginning and 162.7 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2020-07-10 20:25:13,928 INFO L168 Benchmark]: TraceAbstraction took 9442.64 ms. Allocated memory was 202.9 MB in the beginning and 312.0 MB in the end (delta: 109.1 MB). Free memory was 162.0 MB in the beginning and 257.4 MB in the end (delta: -95.3 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2020-07-10 20:25:13,935 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 145.2 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 252.83 ms. Allocated memory is still 145.2 MB. Free memory was 102.4 MB in the beginning and 92.5 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 132.24 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 92.5 MB in the beginning and 181.7 MB in the end (delta: -89.2 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 357.37 ms. Allocated memory is still 202.9 MB. Free memory was 181.7 MB in the beginning and 162.7 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9442.64 ms. Allocated memory was 202.9 MB in the beginning and 312.0 MB in the end (delta: 109.1 MB). Free memory was 162.0 MB in the beginning and 257.4 MB in the end (delta: -95.3 MB). Peak memory consumption was 13.7 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: ((((0 <= n && n <= 0) && i <= 2 * n) && 2 * n <= i) || ((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: 8.4s, OverallIterations: 7, TraceHistogramMax: 4, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 146 SDtfs, 145 SDslu, 631 SDs, 0 SdLazy, 637 SolverSat, 48 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 46 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 32 LocationsWithAnnotation, 80 PreInvPairs, 132 NumberOfFragments, 469 HoareAnnotationTreeSize, 80 FomulaSimplifications, 918 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 32 FomulaSimplificationsInter, 693 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...