/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/sum_2x3-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 04:59:36,238 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 04:59:36,240 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 04:59:36,253 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 04:59:36,253 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 04:59:36,255 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 04:59:36,256 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 04:59:36,258 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 04:59:36,259 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 04:59:36,260 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 04:59:36,261 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 04:59:36,262 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 04:59:36,263 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 04:59:36,264 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 04:59:36,265 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 04:59:36,266 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 04:59:36,267 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 04:59:36,268 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 04:59:36,270 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 04:59:36,272 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 04:59:36,273 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 04:59:36,274 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 04:59:36,275 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 04:59:36,276 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 04:59:36,279 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 04:59:36,279 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 04:59:36,279 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 04:59:36,280 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 04:59:36,280 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 04:59:36,282 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 04:59:36,282 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 04:59:36,282 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 04:59:36,283 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 04:59:36,284 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 04:59:36,285 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 04:59:36,285 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 04:59:36,286 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 04:59:36,286 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 04:59:36,286 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 04:59:36,287 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 04:59:36,288 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 04:59:36,289 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 04:59:36,299 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 04:59:36,299 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 04:59:36,301 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 04:59:36,301 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 04:59:36,301 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 04:59:36,301 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 04:59:36,302 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 04:59:36,302 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 04:59:36,302 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 04:59:36,302 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 04:59:36,302 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 04:59:36,303 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 04:59:36,303 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 04:59:36,303 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 04:59:36,303 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 04:59:36,303 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 04:59:36,304 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 04:59:36,304 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 04:59:36,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 04:59:36,304 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 04:59:36,305 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 04:59:36,305 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 04:59:36,305 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-18 04:59:36,663 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 04:59:36,686 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 04:59:36,691 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 04:59:36,692 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 04:59:36,693 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 04:59:36,694 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/sum_2x3-1.c [2020-07-18 04:59:36,776 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd981a320/fda44a77759648c6966bdad88a53ab3b/FLAGacacc5cfa [2020-07-18 04:59:37,258 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 04:59:37,259 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/sum_2x3-1.c [2020-07-18 04:59:37,265 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd981a320/fda44a77759648c6966bdad88a53ab3b/FLAGacacc5cfa [2020-07-18 04:59:37,611 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd981a320/fda44a77759648c6966bdad88a53ab3b [2020-07-18 04:59:37,623 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 04:59:37,626 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 04:59:37,627 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 04:59:37,628 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 04:59:37,631 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 04:59:37,633 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 04:59:37" (1/1) ... [2020-07-18 04:59:37,636 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e726cc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:59:37, skipping insertion in model container [2020-07-18 04:59:37,636 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 04:59:37" (1/1) ... [2020-07-18 04:59:37,645 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 04:59:37,664 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 04:59:37,879 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 04:59:37,886 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 04:59:37,908 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 04:59:37,923 INFO L208 MainTranslator]: Completed translation [2020-07-18 04:59:37,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:59:37 WrapperNode [2020-07-18 04:59:37,924 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 04:59:37,925 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 04:59:37,925 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 04:59:37,925 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 04:59:37,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:59:37" (1/1) ... [2020-07-18 04:59:37,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:59:37" (1/1) ... [2020-07-18 04:59:37,943 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:59:37" (1/1) ... [2020-07-18 04:59:37,943 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:59:37" (1/1) ... [2020-07-18 04:59:37,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:59:37" (1/1) ... [2020-07-18 04:59:37,950 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:59:37" (1/1) ... [2020-07-18 04:59:37,951 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:59:37" (1/1) ... [2020-07-18 04:59:37,952 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 04:59:37,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 04:59:37,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 04:59:37,952 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 04:59:37,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:59:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 04:59:38,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 04:59:38,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 04:59:38,102 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-07-18 04:59:38,102 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 04:59:38,102 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 04:59:38,102 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-07-18 04:59:38,102 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 04:59:38,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 04:59:38,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 04:59:38,390 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 04:59:38,391 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-18 04:59:38,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 04:59:38 BoogieIcfgContainer [2020-07-18 04:59:38,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 04:59:38,410 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 04:59:38,411 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 04:59:38,413 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 04:59:38,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 04:59:37" (1/3) ... [2020-07-18 04:59:38,415 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eff516a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 04:59:38, skipping insertion in model container [2020-07-18 04:59:38,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:59:37" (2/3) ... [2020-07-18 04:59:38,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eff516a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 04:59:38, skipping insertion in model container [2020-07-18 04:59:38,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 04:59:38" (3/3) ... [2020-07-18 04:59:38,418 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_2x3-1.c [2020-07-18 04:59:38,427 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 04:59:38,434 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 04:59:38,444 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 04:59:38,464 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 04:59:38,464 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 04:59:38,464 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-18 04:59:38,464 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 04:59:38,464 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 04:59:38,464 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 04:59:38,464 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 04:59:38,465 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 04:59:38,477 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2020-07-18 04:59:38,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-18 04:59:38,486 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:59:38,487 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 04:59:38,488 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:59:38,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:59:38,494 INFO L82 PathProgramCache]: Analyzing trace with hash 989240825, now seen corresponding path program 1 times [2020-07-18 04:59:38,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:59:38,504 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1523691717] [2020-07-18 04:59:38,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:59:38,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:59:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:59:38,721 INFO L280 TraceCheckUtils]: 0: Hoare triple {30#true} assume true; {30#true} is VALID [2020-07-18 04:59:38,721 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {30#true} {30#true} #33#return; {30#true} is VALID [2020-07-18 04:59:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:59:38,813 INFO L280 TraceCheckUtils]: 0: Hoare triple {30#true} ~n := #in~n; {41#(= sum_~n |sum_#in~n|)} is VALID [2020-07-18 04:59:38,814 INFO L280 TraceCheckUtils]: 1: Hoare triple {41#(= sum_~n |sum_#in~n|)} ~m := #in~m; {41#(= sum_~n |sum_#in~n|)} is VALID [2020-07-18 04:59:38,815 INFO L280 TraceCheckUtils]: 2: Hoare triple {41#(= sum_~n |sum_#in~n|)} assume ~n <= 0; {42#(<= |sum_#in~n| 0)} is VALID [2020-07-18 04:59:38,817 INFO L280 TraceCheckUtils]: 3: Hoare triple {42#(<= |sum_#in~n| 0)} #res := ~m + ~n; {42#(<= |sum_#in~n| 0)} is VALID [2020-07-18 04:59:38,818 INFO L280 TraceCheckUtils]: 4: Hoare triple {42#(<= |sum_#in~n| 0)} assume true; {42#(<= |sum_#in~n| 0)} is VALID [2020-07-18 04:59:38,821 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {42#(<= |sum_#in~n| 0)} {34#(<= 2 main_~a~0)} #39#return; {31#false} is VALID [2020-07-18 04:59:38,822 INFO L263 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2020-07-18 04:59:38,822 INFO L280 TraceCheckUtils]: 1: Hoare triple {30#true} assume true; {30#true} is VALID [2020-07-18 04:59:38,823 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {30#true} {30#true} #33#return; {30#true} is VALID [2020-07-18 04:59:38,823 INFO L263 TraceCheckUtils]: 3: Hoare triple {30#true} call #t~ret2 := main(); {30#true} is VALID [2020-07-18 04:59:38,825 INFO L280 TraceCheckUtils]: 4: Hoare triple {30#true} ~a~0 := 2; {34#(<= 2 main_~a~0)} is VALID [2020-07-18 04:59:38,826 INFO L280 TraceCheckUtils]: 5: Hoare triple {34#(<= 2 main_~a~0)} ~b~0 := 3; {34#(<= 2 main_~a~0)} is VALID [2020-07-18 04:59:38,826 INFO L263 TraceCheckUtils]: 6: Hoare triple {34#(<= 2 main_~a~0)} call #t~ret1 := sum(~a~0, ~b~0); {30#true} is VALID [2020-07-18 04:59:38,827 INFO L280 TraceCheckUtils]: 7: Hoare triple {30#true} ~n := #in~n; {41#(= sum_~n |sum_#in~n|)} is VALID [2020-07-18 04:59:38,828 INFO L280 TraceCheckUtils]: 8: Hoare triple {41#(= sum_~n |sum_#in~n|)} ~m := #in~m; {41#(= sum_~n |sum_#in~n|)} is VALID [2020-07-18 04:59:38,830 INFO L280 TraceCheckUtils]: 9: Hoare triple {41#(= sum_~n |sum_#in~n|)} assume ~n <= 0; {42#(<= |sum_#in~n| 0)} is VALID [2020-07-18 04:59:38,832 INFO L280 TraceCheckUtils]: 10: Hoare triple {42#(<= |sum_#in~n| 0)} #res := ~m + ~n; {42#(<= |sum_#in~n| 0)} is VALID [2020-07-18 04:59:38,835 INFO L280 TraceCheckUtils]: 11: Hoare triple {42#(<= |sum_#in~n| 0)} assume true; {42#(<= |sum_#in~n| 0)} is VALID [2020-07-18 04:59:38,837 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {42#(<= |sum_#in~n| 0)} {34#(<= 2 main_~a~0)} #39#return; {31#false} is VALID [2020-07-18 04:59:38,838 INFO L280 TraceCheckUtils]: 13: Hoare triple {31#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {31#false} is VALID [2020-07-18 04:59:38,838 INFO L280 TraceCheckUtils]: 14: Hoare triple {31#false} ~result~0 := #t~ret1; {31#false} is VALID [2020-07-18 04:59:38,839 INFO L280 TraceCheckUtils]: 15: Hoare triple {31#false} havoc #t~ret1; {31#false} is VALID [2020-07-18 04:59:38,839 INFO L280 TraceCheckUtils]: 16: Hoare triple {31#false} assume ~result~0 == ~a~0 + ~b~0; {31#false} is VALID [2020-07-18 04:59:38,839 INFO L280 TraceCheckUtils]: 17: Hoare triple {31#false} assume !false; {31#false} is VALID [2020-07-18 04:59:38,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 04:59:38,843 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1523691717] [2020-07-18 04:59:38,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 04:59:38,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 04:59:38,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277488277] [2020-07-18 04:59:38,853 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-18 04:59:38,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:59:38,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 04:59:38,905 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:59:38,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 04:59:38,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:59:38,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 04:59:38,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 04:59:38,918 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 5 states. [2020-07-18 04:59:39,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:59:39,196 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2020-07-18 04:59:39,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 04:59:39,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-18 04:59:39,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:59:39,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 04:59:39,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2020-07-18 04:59:39,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 04:59:39,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2020-07-18 04:59:39,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2020-07-18 04:59:39,287 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:59:39,299 INFO L225 Difference]: With dead ends: 39 [2020-07-18 04:59:39,300 INFO L226 Difference]: Without dead ends: 25 [2020-07-18 04:59:39,304 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-18 04:59:39,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-18 04:59:39,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-18 04:59:39,384 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:59:39,385 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2020-07-18 04:59:39,386 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-18 04:59:39,386 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-18 04:59:39,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:59:39,392 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-07-18 04:59:39,392 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-18 04:59:39,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:59:39,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:59:39,394 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-18 04:59:39,394 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-18 04:59:39,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:59:39,398 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-07-18 04:59:39,399 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-18 04:59:39,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:59:39,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:59:39,400 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:59:39,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:59:39,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-18 04:59:39,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2020-07-18 04:59:39,406 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 18 [2020-07-18 04:59:39,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:59:39,406 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-07-18 04:59:39,407 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 04:59:39,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 26 transitions. [2020-07-18 04:59:39,449 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-18 04:59:39,449 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-18 04:59:39,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-18 04:59:39,461 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:59:39,463 INFO L422 BasicCegarLoop]: trace histogram [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-18 04:59:39,464 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 04:59:39,464 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:59:39,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:59:39,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1852726759, now seen corresponding path program 1 times [2020-07-18 04:59:39,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:59:39,466 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [903429075] [2020-07-18 04:59:39,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:59:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:59:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:59:39,541 INFO L280 TraceCheckUtils]: 0: Hoare triple {225#true} assume true; {225#true} is VALID [2020-07-18 04:59:39,542 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {225#true} {225#true} #33#return; {225#true} is VALID [2020-07-18 04:59:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:59:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:59:39,618 INFO L280 TraceCheckUtils]: 0: Hoare triple {225#true} ~n := #in~n; {245#(= sum_~n |sum_#in~n|)} is VALID [2020-07-18 04:59:39,619 INFO L280 TraceCheckUtils]: 1: Hoare triple {245#(= sum_~n |sum_#in~n|)} ~m := #in~m; {245#(= sum_~n |sum_#in~n|)} is VALID [2020-07-18 04:59:39,620 INFO L280 TraceCheckUtils]: 2: Hoare triple {245#(= sum_~n |sum_#in~n|)} assume ~n <= 0; {253#(<= |sum_#in~n| 0)} is VALID [2020-07-18 04:59:39,620 INFO L280 TraceCheckUtils]: 3: Hoare triple {253#(<= |sum_#in~n| 0)} #res := ~m + ~n; {253#(<= |sum_#in~n| 0)} is VALID [2020-07-18 04:59:39,621 INFO L280 TraceCheckUtils]: 4: Hoare triple {253#(<= |sum_#in~n| 0)} assume true; {253#(<= |sum_#in~n| 0)} is VALID [2020-07-18 04:59:39,624 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {253#(<= |sum_#in~n| 0)} {245#(= sum_~n |sum_#in~n|)} #37#return; {252#(<= |sum_#in~n| 1)} is VALID [2020-07-18 04:59:39,625 INFO L280 TraceCheckUtils]: 0: Hoare triple {225#true} ~n := #in~n; {245#(= sum_~n |sum_#in~n|)} is VALID [2020-07-18 04:59:39,626 INFO L280 TraceCheckUtils]: 1: Hoare triple {245#(= sum_~n |sum_#in~n|)} ~m := #in~m; {245#(= sum_~n |sum_#in~n|)} is VALID [2020-07-18 04:59:39,626 INFO L280 TraceCheckUtils]: 2: Hoare triple {245#(= sum_~n |sum_#in~n|)} assume !(~n <= 0); {245#(= sum_~n |sum_#in~n|)} is VALID [2020-07-18 04:59:39,627 INFO L263 TraceCheckUtils]: 3: Hoare triple {245#(= sum_~n |sum_#in~n|)} call #t~ret0 := sum(~n - 1, 1 + ~m); {225#true} is VALID [2020-07-18 04:59:39,627 INFO L280 TraceCheckUtils]: 4: Hoare triple {225#true} ~n := #in~n; {245#(= sum_~n |sum_#in~n|)} is VALID [2020-07-18 04:59:39,628 INFO L280 TraceCheckUtils]: 5: Hoare triple {245#(= sum_~n |sum_#in~n|)} ~m := #in~m; {245#(= sum_~n |sum_#in~n|)} is VALID [2020-07-18 04:59:39,629 INFO L280 TraceCheckUtils]: 6: Hoare triple {245#(= sum_~n |sum_#in~n|)} assume ~n <= 0; {253#(<= |sum_#in~n| 0)} is VALID [2020-07-18 04:59:39,630 INFO L280 TraceCheckUtils]: 7: Hoare triple {253#(<= |sum_#in~n| 0)} #res := ~m + ~n; {253#(<= |sum_#in~n| 0)} is VALID [2020-07-18 04:59:39,630 INFO L280 TraceCheckUtils]: 8: Hoare triple {253#(<= |sum_#in~n| 0)} assume true; {253#(<= |sum_#in~n| 0)} is VALID [2020-07-18 04:59:39,632 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {253#(<= |sum_#in~n| 0)} {245#(= sum_~n |sum_#in~n|)} #37#return; {252#(<= |sum_#in~n| 1)} is VALID [2020-07-18 04:59:39,633 INFO L280 TraceCheckUtils]: 10: Hoare triple {252#(<= |sum_#in~n| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {252#(<= |sum_#in~n| 1)} is VALID [2020-07-18 04:59:39,634 INFO L280 TraceCheckUtils]: 11: Hoare triple {252#(<= |sum_#in~n| 1)} #res := #t~ret0; {252#(<= |sum_#in~n| 1)} is VALID [2020-07-18 04:59:39,635 INFO L280 TraceCheckUtils]: 12: Hoare triple {252#(<= |sum_#in~n| 1)} havoc #t~ret0; {252#(<= |sum_#in~n| 1)} is VALID [2020-07-18 04:59:39,636 INFO L280 TraceCheckUtils]: 13: Hoare triple {252#(<= |sum_#in~n| 1)} assume true; {252#(<= |sum_#in~n| 1)} is VALID [2020-07-18 04:59:39,637 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {252#(<= |sum_#in~n| 1)} {229#(<= 2 main_~a~0)} #39#return; {226#false} is VALID [2020-07-18 04:59:39,638 INFO L263 TraceCheckUtils]: 0: Hoare triple {225#true} call ULTIMATE.init(); {225#true} is VALID [2020-07-18 04:59:39,639 INFO L280 TraceCheckUtils]: 1: Hoare triple {225#true} assume true; {225#true} is VALID [2020-07-18 04:59:39,639 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {225#true} {225#true} #33#return; {225#true} is VALID [2020-07-18 04:59:39,639 INFO L263 TraceCheckUtils]: 3: Hoare triple {225#true} call #t~ret2 := main(); {225#true} is VALID [2020-07-18 04:59:39,640 INFO L280 TraceCheckUtils]: 4: Hoare triple {225#true} ~a~0 := 2; {229#(<= 2 main_~a~0)} is VALID [2020-07-18 04:59:39,641 INFO L280 TraceCheckUtils]: 5: Hoare triple {229#(<= 2 main_~a~0)} ~b~0 := 3; {229#(<= 2 main_~a~0)} is VALID [2020-07-18 04:59:39,641 INFO L263 TraceCheckUtils]: 6: Hoare triple {229#(<= 2 main_~a~0)} call #t~ret1 := sum(~a~0, ~b~0); {225#true} is VALID [2020-07-18 04:59:39,642 INFO L280 TraceCheckUtils]: 7: Hoare triple {225#true} ~n := #in~n; {245#(= sum_~n |sum_#in~n|)} is VALID [2020-07-18 04:59:39,643 INFO L280 TraceCheckUtils]: 8: Hoare triple {245#(= sum_~n |sum_#in~n|)} ~m := #in~m; {245#(= sum_~n |sum_#in~n|)} is VALID [2020-07-18 04:59:39,644 INFO L280 TraceCheckUtils]: 9: Hoare triple {245#(= sum_~n |sum_#in~n|)} assume !(~n <= 0); {245#(= sum_~n |sum_#in~n|)} is VALID [2020-07-18 04:59:39,644 INFO L263 TraceCheckUtils]: 10: Hoare triple {245#(= sum_~n |sum_#in~n|)} call #t~ret0 := sum(~n - 1, 1 + ~m); {225#true} is VALID [2020-07-18 04:59:39,645 INFO L280 TraceCheckUtils]: 11: Hoare triple {225#true} ~n := #in~n; {245#(= sum_~n |sum_#in~n|)} is VALID [2020-07-18 04:59:39,646 INFO L280 TraceCheckUtils]: 12: Hoare triple {245#(= sum_~n |sum_#in~n|)} ~m := #in~m; {245#(= sum_~n |sum_#in~n|)} is VALID [2020-07-18 04:59:39,646 INFO L280 TraceCheckUtils]: 13: Hoare triple {245#(= sum_~n |sum_#in~n|)} assume ~n <= 0; {253#(<= |sum_#in~n| 0)} is VALID [2020-07-18 04:59:39,647 INFO L280 TraceCheckUtils]: 14: Hoare triple {253#(<= |sum_#in~n| 0)} #res := ~m + ~n; {253#(<= |sum_#in~n| 0)} is VALID [2020-07-18 04:59:39,648 INFO L280 TraceCheckUtils]: 15: Hoare triple {253#(<= |sum_#in~n| 0)} assume true; {253#(<= |sum_#in~n| 0)} is VALID [2020-07-18 04:59:39,650 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {253#(<= |sum_#in~n| 0)} {245#(= sum_~n |sum_#in~n|)} #37#return; {252#(<= |sum_#in~n| 1)} is VALID [2020-07-18 04:59:39,651 INFO L280 TraceCheckUtils]: 17: Hoare triple {252#(<= |sum_#in~n| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {252#(<= |sum_#in~n| 1)} is VALID [2020-07-18 04:59:39,651 INFO L280 TraceCheckUtils]: 18: Hoare triple {252#(<= |sum_#in~n| 1)} #res := #t~ret0; {252#(<= |sum_#in~n| 1)} is VALID [2020-07-18 04:59:39,652 INFO L280 TraceCheckUtils]: 19: Hoare triple {252#(<= |sum_#in~n| 1)} havoc #t~ret0; {252#(<= |sum_#in~n| 1)} is VALID [2020-07-18 04:59:39,653 INFO L280 TraceCheckUtils]: 20: Hoare triple {252#(<= |sum_#in~n| 1)} assume true; {252#(<= |sum_#in~n| 1)} is VALID [2020-07-18 04:59:39,654 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {252#(<= |sum_#in~n| 1)} {229#(<= 2 main_~a~0)} #39#return; {226#false} is VALID [2020-07-18 04:59:39,655 INFO L280 TraceCheckUtils]: 22: Hoare triple {226#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {226#false} is VALID [2020-07-18 04:59:39,655 INFO L280 TraceCheckUtils]: 23: Hoare triple {226#false} ~result~0 := #t~ret1; {226#false} is VALID [2020-07-18 04:59:39,655 INFO L280 TraceCheckUtils]: 24: Hoare triple {226#false} havoc #t~ret1; {226#false} is VALID [2020-07-18 04:59:39,655 INFO L280 TraceCheckUtils]: 25: Hoare triple {226#false} assume ~result~0 == ~a~0 + ~b~0; {226#false} is VALID [2020-07-18 04:59:39,656 INFO L280 TraceCheckUtils]: 26: Hoare triple {226#false} assume !false; {226#false} is VALID [2020-07-18 04:59:39,658 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-18 04:59:39,658 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [903429075] [2020-07-18 04:59:39,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:59:39,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-18 04:59:39,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914283508] [2020-07-18 04:59:39,661 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-18 04:59:39,661 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:59:39,661 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 04:59:39,692 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:59:39,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 04:59:39,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:59:39,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 04:59:39,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-18 04:59:39,693 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 6 states. [2020-07-18 04:59:39,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:59:39,882 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-07-18 04:59:39,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 04:59:39,883 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-18 04:59:39,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:59:39,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 04:59:39,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2020-07-18 04:59:39,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 04:59:39,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2020-07-18 04:59:39,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 37 transitions. [2020-07-18 04:59:39,938 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:59:39,941 INFO L225 Difference]: With dead ends: 36 [2020-07-18 04:59:39,941 INFO L226 Difference]: Without dead ends: 30 [2020-07-18 04:59:39,942 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-18 04:59:39,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-18 04:59:39,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-18 04:59:39,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:59:39,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-18 04:59:39,986 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-18 04:59:39,987 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-18 04:59:39,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:59:39,992 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-18 04:59:39,992 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-18 04:59:39,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:59:39,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:59:39,993 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-18 04:59:39,997 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-18 04:59:40,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:59:40,009 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-18 04:59:40,009 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-18 04:59:40,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:59:40,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:59:40,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:59:40,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:59:40,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-18 04:59:40,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-07-18 04:59:40,016 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 27 [2020-07-18 04:59:40,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:59:40,018 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-07-18 04:59:40,018 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 04:59:40,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 31 transitions. [2020-07-18 04:59:40,061 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:59:40,062 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-18 04:59:40,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-18 04:59:40,063 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:59:40,064 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 04:59:40,064 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 04:59:40,066 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:59:40,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:59:40,066 INFO L82 PathProgramCache]: Analyzing trace with hash -175020829, now seen corresponding path program 2 times [2020-07-18 04:59:40,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:59:40,067 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1156872856] [2020-07-18 04:59:40,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:59:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 04:59:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 04:59:40,162 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-18 04:59:40,163 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-18 04:59:40,163 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 04:59:40,191 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-18 04:59:40,191 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-18 04:59:40,191 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-18 04:59:40,191 WARN L170 areAnnotationChecker]: sumENTRY has no Hoare annotation [2020-07-18 04:59:40,192 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-18 04:59:40,192 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-18 04:59:40,192 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 04:59:40,192 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 04:59:40,192 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2020-07-18 04:59:40,192 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-18 04:59:40,193 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-18 04:59:40,193 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-18 04:59:40,193 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-18 04:59:40,193 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-18 04:59:40,193 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-18 04:59:40,193 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-18 04:59:40,193 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-18 04:59:40,194 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-18 04:59:40,194 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2020-07-18 04:59:40,194 WARN L170 areAnnotationChecker]: sumFINAL has no Hoare annotation [2020-07-18 04:59:40,194 WARN L170 areAnnotationChecker]: L7-1 has no Hoare annotation [2020-07-18 04:59:40,194 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2020-07-18 04:59:40,194 WARN L170 areAnnotationChecker]: sumEXIT has no Hoare annotation [2020-07-18 04:59:40,194 WARN L170 areAnnotationChecker]: sumEXIT has no Hoare annotation [2020-07-18 04:59:40,195 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2020-07-18 04:59:40,195 WARN L170 areAnnotationChecker]: L14-3 has no Hoare annotation [2020-07-18 04:59:40,195 WARN L170 areAnnotationChecker]: L7-3 has no Hoare annotation [2020-07-18 04:59:40,195 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-18 04:59:40,195 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-18 04:59:40,195 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-18 04:59:40,196 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-18 04:59:40,196 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2020-07-18 04:59:40,196 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-18 04:59:40,196 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 04:59:40,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 04:59:40 BoogieIcfgContainer [2020-07-18 04:59:40,199 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 04:59:40,203 INFO L168 Benchmark]: Toolchain (without parser) took 2577.57 ms. Allocated memory was 143.1 MB in the beginning and 227.0 MB in the end (delta: 83.9 MB). Free memory was 101.4 MB in the beginning and 113.5 MB in the end (delta: -12.1 MB). Peak memory consumption was 71.8 MB. Max. memory is 7.1 GB. [2020-07-18 04:59:40,204 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 143.1 MB. Free memory was 119.6 MB in the beginning and 119.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-18 04:59:40,205 INFO L168 Benchmark]: CACSL2BoogieTranslator took 297.03 ms. Allocated memory is still 143.1 MB. Free memory was 101.0 MB in the beginning and 91.1 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-18 04:59:40,206 INFO L168 Benchmark]: Boogie Preprocessor took 27.15 ms. Allocated memory is still 143.1 MB. Free memory was 91.1 MB in the beginning and 89.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-18 04:59:40,207 INFO L168 Benchmark]: RCFGBuilder took 444.95 ms. Allocated memory was 143.1 MB in the beginning and 198.2 MB in the end (delta: 55.1 MB). Free memory was 89.7 MB in the beginning and 161.7 MB in the end (delta: -72.0 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-18 04:59:40,208 INFO L168 Benchmark]: TraceAbstraction took 1788.98 ms. Allocated memory was 198.2 MB in the beginning and 227.0 MB in the end (delta: 28.8 MB). Free memory was 161.7 MB in the beginning and 113.5 MB in the end (delta: 48.2 MB). Peak memory consumption was 77.0 MB. Max. memory is 7.1 GB. [2020-07-18 04:59:40,212 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.25 ms. Allocated memory is still 143.1 MB. Free memory was 119.6 MB in the beginning and 119.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 297.03 ms. Allocated memory is still 143.1 MB. Free memory was 101.0 MB in the beginning and 91.1 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.15 ms. Allocated memory is still 143.1 MB. Free memory was 91.1 MB in the beginning and 89.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 444.95 ms. Allocated memory was 143.1 MB in the beginning and 198.2 MB in the end (delta: 55.1 MB). Free memory was 89.7 MB in the beginning and 161.7 MB in the end (delta: -72.0 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1788.98 ms. Allocated memory was 198.2 MB in the beginning and 227.0 MB in the end (delta: 28.8 MB). Free memory was 161.7 MB in the beginning and 113.5 MB in the end (delta: 48.2 MB). Peak memory consumption was 77.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 16]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int a = 2; VAL [a=2] [L13] int b = 3; VAL [a=2, b=3] [L14] CALL, EXPR sum(a, b) VAL [\old(m)=3, \old(n)=2] [L4] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=2, m=3, n=2] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=1] [L4] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=1, m=4, n=1] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=0] [L4] COND TRUE n <= 0 VAL [\old(m)=5, \old(n)=0, m=5, n=0] [L5] return m + n; VAL [\old(m)=5, \old(n)=0, \result=5, m=5, n=0] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=1, m=4, n=1, sum(n - 1, m + 1)=5] [L7] return sum(n - 1, m + 1); VAL [\old(m)=4, \old(n)=1, \result=5, m=4, n=1, sum(n - 1, m + 1)=5] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=2, m=3, n=2, sum(n - 1, m + 1)=5] [L7] return sum(n - 1, m + 1); VAL [\old(m)=3, \old(n)=2, \result=5, m=3, n=2, sum(n - 1, m + 1)=5] [L14] RET, EXPR sum(a, b) VAL [a=2, b=3, sum(a, b)=5] [L14] int result = sum(a, b); VAL [a=2, b=3, result=5, sum(a, b)=5] [L15] COND TRUE result == a + b VAL [a=2, b=3, result=5] [L16] __VERIFIER_error() VAL [a=2, b=3, result=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 1.7s, OverallIterations: 3, TraceHistogramMax: 3, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 39 SDtfs, 32 SDslu, 84 SDs, 0 SdLazy, 48 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 1983 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 3/5 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...