/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-lit/hhk2008.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:24:52,740 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:24:52,742 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:24:52,755 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:24:52,755 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:24:52,756 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:24:52,758 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:24:52,759 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:24:52,761 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:24:52,762 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:24:52,763 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:24:52,764 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:24:52,764 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:24:52,765 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:24:52,766 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:24:52,768 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:24:52,768 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:24:52,769 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:24:52,771 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:24:52,773 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:24:52,775 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:24:52,776 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:24:52,777 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:24:52,778 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:24:52,781 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:24:52,781 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:24:52,782 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:24:52,783 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:24:52,783 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:24:52,784 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:24:52,784 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:24:52,785 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:24:52,786 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:24:52,787 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:24:52,789 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:24:52,789 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:24:52,793 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:24:52,793 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:24:52,793 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:24:52,794 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:24:52,795 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:24:52,796 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:24:52,814 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:24:52,816 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:24:52,817 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:24:52,817 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:24:52,818 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:24:52,818 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:24:52,818 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:24:52,818 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:24:52,818 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:24:52,819 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:24:52,819 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:24:52,819 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:24:52,820 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:24:52,820 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:24:52,821 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:24:52,821 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:24:52,821 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:24:52,821 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:24:52,821 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:24:52,822 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:24:52,822 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:24:52,822 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:24:52,822 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:24:53,094 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:24:53,107 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:24:53,110 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:24:53,112 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:24:53,112 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:24:53,113 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/hhk2008.i [2020-07-10 20:24:53,177 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b2b46d5a/fe314a9ef6884e039560d7956bf72ad1/FLAGc9d4e6919 [2020-07-10 20:24:53,625 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:24:53,626 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/hhk2008.i [2020-07-10 20:24:53,632 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b2b46d5a/fe314a9ef6884e039560d7956bf72ad1/FLAGc9d4e6919 [2020-07-10 20:24:53,983 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b2b46d5a/fe314a9ef6884e039560d7956bf72ad1 [2020-07-10 20:24:53,993 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:24:53,996 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:24:53,997 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:24:53,997 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:24:54,000 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:24:54,002 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:24:53" (1/1) ... [2020-07-10 20:24:54,006 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c7fc675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:54, skipping insertion in model container [2020-07-10 20:24:54,006 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:24:53" (1/1) ... [2020-07-10 20:24:54,014 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:24:54,029 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:24:54,204 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:24:54,209 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:24:54,227 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:24:54,243 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:24:54,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:54 WrapperNode [2020-07-10 20:24:54,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:24:54,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:24:54,244 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:24:54,245 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:24:54,255 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:54" (1/1) ... [2020-07-10 20:24:54,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:54" (1/1) ... [2020-07-10 20:24:54,261 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:54" (1/1) ... [2020-07-10 20:24:54,261 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:54" (1/1) ... [2020-07-10 20:24:54,267 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:54" (1/1) ... [2020-07-10 20:24:54,272 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:54" (1/1) ... [2020-07-10 20:24:54,274 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:54" (1/1) ... [2020-07-10 20:24:54,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:24:54,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:24:54,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:24:54,364 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:24:54,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:54" (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:24:54,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:24:54,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:24:54,429 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 20:24:54,429 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:24:54,429 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:24:54,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:24:54,429 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 20:24:54,429 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 20:24:54,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:24:54,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:24:54,430 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:24:54,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:24:54,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:24:54,730 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:24:54,730 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 20:24:54,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:24:54 BoogieIcfgContainer [2020-07-10 20:24:54,742 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:24:54,751 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:24:54,752 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:24:54,758 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:24:54,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:24:53" (1/3) ... [2020-07-10 20:24:54,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74573ad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:24:54, skipping insertion in model container [2020-07-10 20:24:54,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:54" (2/3) ... [2020-07-10 20:24:54,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74573ad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:24:54, skipping insertion in model container [2020-07-10 20:24:54,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:24:54" (3/3) ... [2020-07-10 20:24:54,765 INFO L109 eAbstractionObserver]: Analyzing ICFG hhk2008.i [2020-07-10 20:24:54,776 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:24:54,783 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:24:54,795 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:24:54,817 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:24:54,817 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:24:54,818 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:24:54,818 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:24:54,818 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:24:54,818 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:24:54,818 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:24:54,818 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:24:54,834 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-07-10 20:24:54,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 20:24:54,844 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:54,845 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:24:54,845 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:54,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:54,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1378758603, now seen corresponding path program 1 times [2020-07-10 20:24:54,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:54,859 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [382772186] [2020-07-10 20:24:54,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:55,340 INFO L280 TraceCheckUtils]: 0: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-10 20:24:55,341 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {36#true} {36#true} #62#return; {36#true} is VALID [2020-07-10 20:24:55,343 INFO L263 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2020-07-10 20:24:55,344 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-10 20:24:55,344 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #62#return; {36#true} is VALID [2020-07-10 20:24:55,345 INFO L263 TraceCheckUtils]: 3: Hoare triple {36#true} call #t~ret2 := main(); {36#true} is VALID [2020-07-10 20:24:55,345 INFO L280 TraceCheckUtils]: 4: Hoare triple {36#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {36#true} is VALID [2020-07-10 20:24:55,346 INFO L280 TraceCheckUtils]: 5: Hoare triple {36#true} ~a~0 := #t~nondet0; {36#true} is VALID [2020-07-10 20:24:55,346 INFO L280 TraceCheckUtils]: 6: Hoare triple {36#true} havoc #t~nondet0; {36#true} is VALID [2020-07-10 20:24:55,346 INFO L280 TraceCheckUtils]: 7: Hoare triple {36#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {36#true} is VALID [2020-07-10 20:24:55,347 INFO L280 TraceCheckUtils]: 8: Hoare triple {36#true} ~b~0 := #t~nondet1; {36#true} is VALID [2020-07-10 20:24:55,347 INFO L280 TraceCheckUtils]: 9: Hoare triple {36#true} havoc #t~nondet1; {36#true} is VALID [2020-07-10 20:24:55,348 INFO L280 TraceCheckUtils]: 10: Hoare triple {36#true} havoc ~res~0; {36#true} is VALID [2020-07-10 20:24:55,348 INFO L280 TraceCheckUtils]: 11: Hoare triple {36#true} havoc ~cnt~0; {36#true} is VALID [2020-07-10 20:24:55,349 INFO L280 TraceCheckUtils]: 12: Hoare triple {36#true} assume !!(~a~0 <= 1000000); {36#true} is VALID [2020-07-10 20:24:55,350 INFO L280 TraceCheckUtils]: 13: Hoare triple {36#true} assume !!(0 <= ~b~0 && ~b~0 <= 1000000); {40#(<= 0 main_~b~0)} is VALID [2020-07-10 20:24:55,352 INFO L280 TraceCheckUtils]: 14: Hoare triple {40#(<= 0 main_~b~0)} ~res~0 := ~a~0; {41#(and (<= main_~res~0 (+ main_~a~0 main_~b~0)) (or (<= (+ main_~a~0 main_~b~0) main_~res~0) (<= main_~a~0 main_~res~0)))} is VALID [2020-07-10 20:24:55,354 INFO L280 TraceCheckUtils]: 15: Hoare triple {41#(and (<= main_~res~0 (+ main_~a~0 main_~b~0)) (or (<= (+ main_~a~0 main_~b~0) main_~res~0) (<= main_~a~0 main_~res~0)))} ~cnt~0 := ~b~0; {42#(and (or (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~a~0 main_~b~0) main_~res~0)) (<= main_~res~0 (+ main_~a~0 main_~b~0)))} is VALID [2020-07-10 20:24:55,355 INFO L280 TraceCheckUtils]: 16: Hoare triple {42#(and (or (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~a~0 main_~b~0) main_~res~0)) (<= main_~res~0 (+ main_~a~0 main_~b~0)))} assume !(~cnt~0 > 0); {43#(and (<= (+ main_~a~0 main_~b~0) main_~res~0) (<= main_~res~0 (+ main_~a~0 main_~b~0)))} is VALID [2020-07-10 20:24:55,359 INFO L263 TraceCheckUtils]: 17: Hoare triple {43#(and (<= (+ main_~a~0 main_~b~0) main_~res~0) (<= main_~res~0 (+ main_~a~0 main_~b~0)))} call __VERIFIER_assert((if ~res~0 == ~a~0 + ~b~0 then 1 else 0)); {44#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:24:55,360 INFO L280 TraceCheckUtils]: 18: Hoare triple {44#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {45#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:24:55,361 INFO L280 TraceCheckUtils]: 19: Hoare triple {45#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {37#false} is VALID [2020-07-10 20:24:55,362 INFO L280 TraceCheckUtils]: 20: Hoare triple {37#false} assume !false; {37#false} is VALID [2020-07-10 20:24:55,366 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:24:55,367 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:55,369 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [382772186] [2020-07-10 20:24:55,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:55,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 20:24:55,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048629492] [2020-07-10 20:24:55,378 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-07-10 20:24:55,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:55,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 20:24:55,430 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:24:55,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 20:24:55,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:55,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 20:24:55,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-10 20:24:55,446 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 8 states. [2020-07-10 20:24:56,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:56,095 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2020-07-10 20:24:56,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 20:24:56,096 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-07-10 20:24:56,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:56,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 20:24:56,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2020-07-10 20:24:56,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 20:24:56,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2020-07-10 20:24:56,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 67 transitions. [2020-07-10 20:24:56,212 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:56,243 INFO L225 Difference]: With dead ends: 58 [2020-07-10 20:24:56,244 INFO L226 Difference]: Without dead ends: 27 [2020-07-10 20:24:56,252 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-07-10 20:24:56,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-10 20:24:56,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2020-07-10 20:24:56,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:56,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 25 states. [2020-07-10 20:24:56,339 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 25 states. [2020-07-10 20:24:56,339 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 25 states. [2020-07-10 20:24:56,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:56,346 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2020-07-10 20:24:56,346 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-10 20:24:56,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:56,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:56,347 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 27 states. [2020-07-10 20:24:56,348 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 27 states. [2020-07-10 20:24:56,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:56,358 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2020-07-10 20:24:56,358 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-10 20:24:56,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:56,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:56,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:56,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:56,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-10 20:24:56,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2020-07-10 20:24:56,371 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 21 [2020-07-10 20:24:56,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:56,371 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2020-07-10 20:24:56,372 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 20:24:56,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 25 transitions. [2020-07-10 20:24:56,401 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:24:56,401 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2020-07-10 20:24:56,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 20:24:56,403 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:56,403 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:24:56,403 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:24:56,404 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:56,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:56,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1865209823, now seen corresponding path program 1 times [2020-07-10 20:24:56,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:56,406 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [692578566] [2020-07-10 20:24:56,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 11 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 11 to 19 Garbage collection #2: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 [2020-07-10 20:24:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:58,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:59,022 INFO L280 TraceCheckUtils]: 0: Hoare triple {276#true} assume true; {276#true} is VALID [2020-07-10 20:24:59,023 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {276#true} {276#true} #62#return; {276#true} is VALID [2020-07-10 20:24:59,023 INFO L263 TraceCheckUtils]: 0: Hoare triple {276#true} call ULTIMATE.init(); {276#true} is VALID [2020-07-10 20:24:59,024 INFO L280 TraceCheckUtils]: 1: Hoare triple {276#true} assume true; {276#true} is VALID [2020-07-10 20:24:59,024 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {276#true} {276#true} #62#return; {276#true} is VALID [2020-07-10 20:24:59,024 INFO L263 TraceCheckUtils]: 3: Hoare triple {276#true} call #t~ret2 := main(); {276#true} is VALID [2020-07-10 20:24:59,025 INFO L280 TraceCheckUtils]: 4: Hoare triple {276#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {276#true} is VALID [2020-07-10 20:24:59,025 INFO L280 TraceCheckUtils]: 5: Hoare triple {276#true} ~a~0 := #t~nondet0; {276#true} is VALID [2020-07-10 20:24:59,025 INFO L280 TraceCheckUtils]: 6: Hoare triple {276#true} havoc #t~nondet0; {276#true} is VALID [2020-07-10 20:24:59,026 INFO L280 TraceCheckUtils]: 7: Hoare triple {276#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {276#true} is VALID [2020-07-10 20:24:59,026 INFO L280 TraceCheckUtils]: 8: Hoare triple {276#true} ~b~0 := #t~nondet1; {276#true} is VALID [2020-07-10 20:24:59,026 INFO L280 TraceCheckUtils]: 9: Hoare triple {276#true} havoc #t~nondet1; {276#true} is VALID [2020-07-10 20:24:59,027 INFO L280 TraceCheckUtils]: 10: Hoare triple {276#true} havoc ~res~0; {276#true} is VALID [2020-07-10 20:24:59,027 INFO L280 TraceCheckUtils]: 11: Hoare triple {276#true} havoc ~cnt~0; {276#true} is VALID [2020-07-10 20:24:59,027 INFO L280 TraceCheckUtils]: 12: Hoare triple {276#true} assume !!(~a~0 <= 1000000); {276#true} is VALID [2020-07-10 20:24:59,028 INFO L280 TraceCheckUtils]: 13: Hoare triple {276#true} assume !!(0 <= ~b~0 && ~b~0 <= 1000000); {276#true} is VALID [2020-07-10 20:24:59,032 INFO L280 TraceCheckUtils]: 14: Hoare triple {276#true} ~res~0 := ~a~0; {280#(and (<= main_~res~0 main_~a~0) (<= main_~a~0 main_~res~0))} is VALID [2020-07-10 20:24:59,039 INFO L280 TraceCheckUtils]: 15: Hoare triple {280#(and (<= main_~res~0 main_~a~0) (<= main_~a~0 main_~res~0))} ~cnt~0 := ~b~0; {281#(and (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~res~0 main_~cnt~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-10 20:24:59,041 INFO L280 TraceCheckUtils]: 16: Hoare triple {281#(and (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~res~0 main_~cnt~0) (+ main_~a~0 main_~b~0)))} [68] L21-2-->L21-3_primed: Formula: (let ((.cse0 (+ v_oct_main_~res~0_in_1 v_oct_main_~cnt~0_in_1)) (.cse1 (+ v_oct_main_~res~0_out_1 v_oct_main_~cnt~0_out_1))) (or (and (<= .cse0 .cse1) (<= .cse1 .cse0) (<= (+ v_oct_main_~res~0_in_1 2) v_oct_main_~res~0_out_1) (<= v_oct_main_~res~0_out_1 .cse0)) (let ((.cse2 (+ v_oct_main_~res~0_in_1 1)) (.cse3 (+ v_oct_main_~cnt~0_out_1 1))) (and (<= .cse2 v_oct_main_~res~0_out_1) (<= 2 (* 2 v_oct_main_~cnt~0_in_1)) (<= .cse3 v_oct_main_~cnt~0_in_1) (<= v_oct_main_~res~0_out_1 .cse2) (or (< .cse1 .cse0) (< .cse0 v_oct_main_~res~0_out_1) (< v_oct_main_~cnt~0_in_1 (+ v_oct_main_~cnt~0_out_1 2)) (< .cse0 .cse1)) (<= v_oct_main_~cnt~0_in_1 .cse3))))) InVars {main_~res~0=v_oct_main_~res~0_in_1, main_~cnt~0=v_oct_main_~cnt~0_in_1} OutVars{main_~res~0=v_oct_main_~res~0_out_1, main_~cnt~0=v_oct_main_~cnt~0_out_1} AuxVars[] AssignedVars[main_~res~0, main_~cnt~0] {282#(and (or (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~a~0 main_~b~0) main_~res~0)) (<= main_~res~0 (+ main_~a~0 main_~b~0)))} is VALID [2020-07-10 20:24:59,042 INFO L280 TraceCheckUtils]: 17: Hoare triple {282#(and (or (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~a~0 main_~b~0) main_~res~0)) (<= main_~res~0 (+ main_~a~0 main_~b~0)))} [67] L21-3_primed-->L21-3: Formula: (not (< 0 v_main_~cnt~0_2)) InVars {main_~cnt~0=v_main_~cnt~0_2} OutVars{main_~cnt~0=v_main_~cnt~0_2} AuxVars[] AssignedVars[] {283#(and (<= (+ main_~a~0 main_~b~0) main_~res~0) (<= main_~res~0 (+ main_~a~0 main_~b~0)))} is VALID [2020-07-10 20:24:59,043 INFO L263 TraceCheckUtils]: 18: Hoare triple {283#(and (<= (+ main_~a~0 main_~b~0) main_~res~0) (<= main_~res~0 (+ main_~a~0 main_~b~0)))} call __VERIFIER_assert((if ~res~0 == ~a~0 + ~b~0 then 1 else 0)); {284#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:24:59,044 INFO L280 TraceCheckUtils]: 19: Hoare triple {284#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {285#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:24:59,045 INFO L280 TraceCheckUtils]: 20: Hoare triple {285#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {277#false} is VALID [2020-07-10 20:24:59,045 INFO L280 TraceCheckUtils]: 21: Hoare triple {277#false} assume !false; {277#false} is VALID [2020-07-10 20:24:59,048 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:24:59,164 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:59,165 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [692578566] [2020-07-10 20:24:59,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:59,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-10 20:24:59,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115792691] [2020-07-10 20:24:59,167 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-07-10 20:24:59,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:59,168 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 20:24:59,198 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:24:59,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 20:24:59,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:59,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 20:24:59,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-07-10 20:24:59,200 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 10 states. [2020-07-10 20:24:59,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:59,585 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2020-07-10 20:24:59,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-10 20:24:59,586 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-07-10 20:24:59,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:59,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 20:24:59,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 27 transitions. [2020-07-10 20:24:59,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 20:24:59,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 27 transitions. [2020-07-10 20:24:59,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 27 transitions. [2020-07-10 20:24:59,625 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:59,626 INFO L225 Difference]: With dead ends: 27 [2020-07-10 20:24:59,626 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 20:24:59,628 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2020-07-10 20:24:59,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 20:24:59,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 20:24:59,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:59,629 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 20:24:59,629 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:24:59,629 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:24:59,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:59,629 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:24:59,630 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:24:59,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:59,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:59,630 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:24:59,630 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:24:59,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:59,631 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:24:59,631 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:24:59,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:59,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:59,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:59,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:59,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 20:24:59,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 20:24:59,632 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2020-07-10 20:24:59,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:59,633 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 20:24:59,633 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 20:24:59,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-10 20:24:59,633 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:24:59,633 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:24:59,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:59,634 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:24:59,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 20:24:59,945 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:24:59,945 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:24:59,945 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:24:59,945 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 20:24:59,945 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 20:24:59,945 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:24:59,945 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-10 20:24:59,946 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-10 20:24:59,946 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-10 20:24:59,946 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-10 20:24:59,946 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-10 20:24:59,946 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (<= 0 main_~b~0) [2020-07-10 20:24:59,946 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 27) the Hoare annotation is: true [2020-07-10 20:24:59,947 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (let ((.cse1 (+ main_~res~0 main_~cnt~0 1)) (.cse0 (+ main_~a~0 main_~b~0))) (and (< 0 (+ main_~cnt~0 1)) (<= .cse0 .cse1) (<= .cse1 .cse0) (<= 0 main_~b~0))) [2020-07-10 20:24:59,947 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (<= 0 main_~b~0) [2020-07-10 20:24:59,947 INFO L264 CegarLoopResult]: At program point L21-2(lines 21 24) the Hoare annotation is: (let ((.cse1 (+ main_~res~0 main_~cnt~0)) (.cse0 (+ main_~a~0 main_~b~0))) (and (<= .cse0 .cse1) (< 0 (+ main_~cnt~0 1)) (<= 0 main_~b~0) (<= .cse1 .cse0))) [2020-07-10 20:24:59,947 INFO L264 CegarLoopResult]: At program point L21-3(lines 21 24) the Hoare annotation is: (let ((.cse0 (+ main_~a~0 main_~b~0))) (and (<= .cse0 main_~res~0) (<= main_~res~0 .cse0) (<= 0 main_~b~0))) [2020-07-10 20:24:59,947 INFO L271 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-07-10 20:24:59,947 INFO L271 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-07-10 20:24:59,948 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-10 20:24:59,948 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-07-10 20:24:59,948 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-07-10 20:24:59,948 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 27) the Hoare annotation is: true [2020-07-10 20:24:59,948 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 27) the Hoare annotation is: true [2020-07-10 20:24:59,948 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (let ((.cse1 (+ main_~res~0 main_~cnt~0)) (.cse0 (+ main_~a~0 main_~b~0))) (and (<= .cse0 .cse1) (<= 0 main_~b~0) (<= .cse1 .cse0) (< 0 main_~cnt~0))) [2020-07-10 20:24:59,949 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (<= main_~res~0 main_~a~0) (<= main_~a~0 main_~res~0) (<= main_~res~0 (+ main_~a~0 main_~b~0))) [2020-07-10 20:24:59,949 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-10 20:24:59,949 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-07-10 20:24:59,949 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-10 20:24:59,949 INFO L271 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: true [2020-07-10 20:24:59,949 INFO L271 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-07-10 20:24:59,950 INFO L271 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: true [2020-07-10 20:24:59,950 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-10 20:24:59,950 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-10 20:24:59,950 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-10 20:24:59,950 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:24:59,950 INFO L264 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-10 20:24:59,951 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:24:59,955 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 20:24:59,956 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 20:24:59,957 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 20:24:59,958 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-10 20:24:59,958 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-10 20:24:59,973 INFO L163 areAnnotationChecker]: CFG has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 20:24:59,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 08:24:59 BoogieIcfgContainer [2020-07-10 20:24:59,987 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 20:24:59,989 INFO L168 Benchmark]: Toolchain (without parser) took 5993.80 ms. Allocated memory was 137.4 MB in the beginning and 248.0 MB in the end (delta: 110.6 MB). Free memory was 102.9 MB in the beginning and 216.1 MB in the end (delta: -113.1 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 20:24:59,990 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.4 MB. Free memory was 120.8 MB in the beginning and 120.6 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:24:59,991 INFO L168 Benchmark]: CACSL2BoogieTranslator took 247.24 ms. Allocated memory is still 137.4 MB. Free memory was 102.7 MB in the beginning and 92.9 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:24:59,992 INFO L168 Benchmark]: Boogie Preprocessor took 117.73 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 92.9 MB in the beginning and 182.6 MB in the end (delta: -89.7 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. [2020-07-10 20:24:59,993 INFO L168 Benchmark]: RCFGBuilder took 379.17 ms. Allocated memory is still 202.4 MB. Free memory was 182.6 MB in the beginning and 162.5 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. [2020-07-10 20:24:59,994 INFO L168 Benchmark]: TraceAbstraction took 5235.23 ms. Allocated memory was 202.4 MB in the beginning and 248.0 MB in the end (delta: 45.6 MB). Free memory was 161.9 MB in the beginning and 216.1 MB in the end (delta: -54.2 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 20:24:59,998 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.22 ms. Allocated memory is still 137.4 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 247.24 ms. Allocated memory is still 137.4 MB. Free memory was 102.7 MB in the beginning and 92.9 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 117.73 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 92.9 MB in the beginning and 182.6 MB in the end (delta: -89.7 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 379.17 ms. Allocated memory is still 202.4 MB. Free memory was 182.6 MB in the beginning and 162.5 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5235.23 ms. Allocated memory was 202.4 MB in the beginning and 248.0 MB in the end (delta: 45.6 MB). Free memory was 161.9 MB in the beginning and 216.1 MB in the end (delta: -54.2 MB). There was no memory consumed. 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: 21]: Loop Invariant Derived loop invariant: ((a + b <= res + cnt && 0 < cnt + 1) && 0 <= b) && res + cnt <= a + b - 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: 0 == \old(cond) || !(0 == cond) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.8s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 47 SDtfs, 34 SDslu, 207 SDs, 0 SdLazy, 127 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 45 PreInvPairs, 64 NumberOfFragments, 152 HoareAnnotationTreeSize, 45 FomulaSimplifications, 121 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 33 FomulaSimplificationsInter, 120 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...