/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/McCarthy91-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 00:34:13,550 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 00:34:13,553 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 00:34:13,566 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 00:34:13,566 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 00:34:13,568 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 00:34:13,569 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 00:34:13,571 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 00:34:13,573 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 00:34:13,573 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 00:34:13,574 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 00:34:13,576 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 00:34:13,576 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 00:34:13,577 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 00:34:13,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 00:34:13,579 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 00:34:13,580 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 00:34:13,581 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 00:34:13,582 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 00:34:13,584 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 00:34:13,586 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 00:34:13,587 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 00:34:13,588 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 00:34:13,589 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 00:34:13,591 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 00:34:13,591 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 00:34:13,591 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 00:34:13,592 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 00:34:13,593 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 00:34:13,594 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 00:34:13,594 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 00:34:13,595 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 00:34:13,596 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 00:34:13,596 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 00:34:13,597 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 00:34:13,597 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 00:34:13,598 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 00:34:13,598 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 00:34:13,599 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 00:34:13,600 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 00:34:13,600 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 00:34:13,601 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 00:34:13,611 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 00:34:13,611 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 00:34:13,613 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 00:34:13,613 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 00:34:13,613 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 00:34:13,614 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 00:34:13,614 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 00:34:13,614 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 00:34:13,614 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 00:34:13,614 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 00:34:13,615 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 00:34:13,615 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 00:34:13,615 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 00:34:13,615 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 00:34:13,615 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 00:34:13,616 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 00:34:13,616 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 00:34:13,616 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 00:34:13,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:34:13,617 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 00:34:13,617 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 00:34:13,617 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 00:34:13,617 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-11 00:34:13,963 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 00:34:13,985 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 00:34:13,990 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 00:34:13,991 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 00:34:13,992 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 00:34:13,992 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/McCarthy91-2.c [2020-07-11 00:34:14,075 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f0538ca2/650c310bb93f4d68be12f4a00ccdce41/FLAG1e21e7895 [2020-07-11 00:34:14,514 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 00:34:14,514 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/McCarthy91-2.c [2020-07-11 00:34:14,520 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f0538ca2/650c310bb93f4d68be12f4a00ccdce41/FLAG1e21e7895 [2020-07-11 00:34:14,896 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f0538ca2/650c310bb93f4d68be12f4a00ccdce41 [2020-07-11 00:34:14,905 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 00:34:14,907 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 00:34:14,908 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 00:34:14,908 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 00:34:14,912 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 00:34:14,913 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:34:14" (1/1) ... [2020-07-11 00:34:14,916 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2019d042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:34:14, skipping insertion in model container [2020-07-11 00:34:14,916 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:34:14" (1/1) ... [2020-07-11 00:34:14,924 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 00:34:14,945 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 00:34:15,156 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:34:15,161 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 00:34:15,179 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:34:15,195 INFO L208 MainTranslator]: Completed translation [2020-07-11 00:34:15,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:34:15 WrapperNode [2020-07-11 00:34:15,196 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 00:34:15,197 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 00:34:15,197 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 00:34:15,197 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 00:34:15,213 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:34:15" (1/1) ... [2020-07-11 00:34:15,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:34:15" (1/1) ... [2020-07-11 00:34:15,222 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:34:15" (1/1) ... [2020-07-11 00:34:15,222 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:34:15" (1/1) ... [2020-07-11 00:34:15,227 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:34:15" (1/1) ... [2020-07-11 00:34:15,230 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:34:15" (1/1) ... [2020-07-11 00:34:15,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:34:15" (1/1) ... [2020-07-11 00:34:15,232 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 00:34:15,233 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 00:34:15,233 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 00:34:15,233 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 00:34:15,234 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:34:15" (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-11 00:34:15,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 00:34:15,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 00:34:15,419 INFO L138 BoogieDeclarations]: Found implementation of procedure f91 [2020-07-11 00:34:15,419 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 00:34:15,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 00:34:15,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 00:34:15,420 INFO L130 BoogieDeclarations]: Found specification of procedure f91 [2020-07-11 00:34:15,420 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 00:34:15,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 00:34:15,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 00:34:15,691 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 00:34:15,691 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-11 00:34:15,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:34:15 BoogieIcfgContainer [2020-07-11 00:34:15,697 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 00:34:15,699 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 00:34:15,699 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 00:34:15,705 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 00:34:15,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 12:34:14" (1/3) ... [2020-07-11 00:34:15,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41222949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:34:15, skipping insertion in model container [2020-07-11 00:34:15,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:34:15" (2/3) ... [2020-07-11 00:34:15,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41222949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:34:15, skipping insertion in model container [2020-07-11 00:34:15,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:34:15" (3/3) ... [2020-07-11 00:34:15,710 INFO L109 eAbstractionObserver]: Analyzing ICFG McCarthy91-2.c [2020-07-11 00:34:15,726 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 00:34:15,737 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 00:34:15,755 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 00:34:15,782 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 00:34:15,783 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 00:34:15,783 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 00:34:15,783 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 00:34:15,783 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 00:34:15,783 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 00:34:15,783 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 00:34:15,784 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 00:34:15,801 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2020-07-11 00:34:15,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-11 00:34:15,813 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:34:15,814 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-11 00:34:15,814 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:34:15,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:34:15,821 INFO L82 PathProgramCache]: Analyzing trace with hash 346555185, now seen corresponding path program 1 times [2020-07-11 00:34:15,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:34:15,832 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1135084795] [2020-07-11 00:34:15,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:34:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:16,171 INFO L280 TraceCheckUtils]: 0: Hoare triple {34#true} assume true; {34#true} is VALID [2020-07-11 00:34:16,172 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {34#true} {34#true} #35#return; {34#true} is VALID [2020-07-11 00:34:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:16,274 INFO L280 TraceCheckUtils]: 0: Hoare triple {34#true} ~x := #in~x; {45#(= f91_~x |f91_#in~x|)} is VALID [2020-07-11 00:34:16,276 INFO L280 TraceCheckUtils]: 1: Hoare triple {45#(= f91_~x |f91_#in~x|)} assume ~x > 100; {46#(and (= f91_~x |f91_#in~x|) (<= 101 f91_~x))} is VALID [2020-07-11 00:34:16,278 INFO L280 TraceCheckUtils]: 2: Hoare triple {46#(and (= f91_~x |f91_#in~x|) (<= 101 f91_~x))} #res := ~x - 10; {47#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|) (<= |f91_#in~x| (+ |f91_#res| 10)))} is VALID [2020-07-11 00:34:16,279 INFO L280 TraceCheckUtils]: 3: Hoare triple {47#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|) (<= |f91_#in~x| (+ |f91_#res| 10)))} assume true; {47#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|) (<= |f91_#in~x| (+ |f91_#res| 10)))} is VALID [2020-07-11 00:34:16,281 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {47#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|) (<= |f91_#in~x| (+ |f91_#res| 10)))} {34#true} #39#return; {43#(and (<= main_~x~0 (+ |main_#t~ret3| 10)) (<= (+ |main_#t~ret3| 10) main_~x~0) (<= 91 |main_#t~ret3|))} is VALID [2020-07-11 00:34:16,283 INFO L263 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2020-07-11 00:34:16,283 INFO L280 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2020-07-11 00:34:16,283 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #35#return; {34#true} is VALID [2020-07-11 00:34:16,284 INFO L263 TraceCheckUtils]: 3: Hoare triple {34#true} call #t~ret4 := main(); {34#true} is VALID [2020-07-11 00:34:16,284 INFO L280 TraceCheckUtils]: 4: Hoare triple {34#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {34#true} is VALID [2020-07-11 00:34:16,285 INFO L280 TraceCheckUtils]: 5: Hoare triple {34#true} ~x~0 := #t~nondet2; {34#true} is VALID [2020-07-11 00:34:16,285 INFO L280 TraceCheckUtils]: 6: Hoare triple {34#true} havoc #t~nondet2; {34#true} is VALID [2020-07-11 00:34:16,285 INFO L263 TraceCheckUtils]: 7: Hoare triple {34#true} call #t~ret3 := f91(~x~0); {34#true} is VALID [2020-07-11 00:34:16,287 INFO L280 TraceCheckUtils]: 8: Hoare triple {34#true} ~x := #in~x; {45#(= f91_~x |f91_#in~x|)} is VALID [2020-07-11 00:34:16,288 INFO L280 TraceCheckUtils]: 9: Hoare triple {45#(= f91_~x |f91_#in~x|)} assume ~x > 100; {46#(and (= f91_~x |f91_#in~x|) (<= 101 f91_~x))} is VALID [2020-07-11 00:34:16,289 INFO L280 TraceCheckUtils]: 10: Hoare triple {46#(and (= f91_~x |f91_#in~x|) (<= 101 f91_~x))} #res := ~x - 10; {47#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|) (<= |f91_#in~x| (+ |f91_#res| 10)))} is VALID [2020-07-11 00:34:16,291 INFO L280 TraceCheckUtils]: 11: Hoare triple {47#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|) (<= |f91_#in~x| (+ |f91_#res| 10)))} assume true; {47#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|) (<= |f91_#in~x| (+ |f91_#res| 10)))} is VALID [2020-07-11 00:34:16,293 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {47#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|) (<= |f91_#in~x| (+ |f91_#res| 10)))} {34#true} #39#return; {43#(and (<= main_~x~0 (+ |main_#t~ret3| 10)) (<= (+ |main_#t~ret3| 10) main_~x~0) (<= 91 |main_#t~ret3|))} is VALID [2020-07-11 00:34:16,294 INFO L280 TraceCheckUtils]: 13: Hoare triple {43#(and (<= main_~x~0 (+ |main_#t~ret3| 10)) (<= (+ |main_#t~ret3| 10) main_~x~0) (<= 91 |main_#t~ret3|))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {43#(and (<= main_~x~0 (+ |main_#t~ret3| 10)) (<= (+ |main_#t~ret3| 10) main_~x~0) (<= 91 |main_#t~ret3|))} is VALID [2020-07-11 00:34:16,296 INFO L280 TraceCheckUtils]: 14: Hoare triple {43#(and (<= main_~x~0 (+ |main_#t~ret3| 10)) (<= (+ |main_#t~ret3| 10) main_~x~0) (<= 91 |main_#t~ret3|))} ~result~0 := #t~ret3; {44#(and (<= main_~x~0 (+ main_~result~0 10)) (<= 91 main_~result~0) (<= (+ main_~result~0 10) main_~x~0))} is VALID [2020-07-11 00:34:16,297 INFO L280 TraceCheckUtils]: 15: Hoare triple {44#(and (<= main_~x~0 (+ main_~result~0 10)) (<= 91 main_~result~0) (<= (+ main_~result~0 10) main_~x~0))} havoc #t~ret3; {44#(and (<= main_~x~0 (+ main_~result~0 10)) (<= 91 main_~result~0) (<= (+ main_~result~0 10) main_~x~0))} is VALID [2020-07-11 00:34:16,298 INFO L280 TraceCheckUtils]: 16: Hoare triple {44#(and (<= main_~x~0 (+ main_~result~0 10)) (<= 91 main_~result~0) (<= (+ main_~result~0 10) main_~x~0))} assume !(91 == ~result~0 || (~x~0 > 101 && ~result~0 == ~x~0 - 10)); {35#false} is VALID [2020-07-11 00:34:16,299 INFO L280 TraceCheckUtils]: 17: Hoare triple {35#false} assume !false; {35#false} is VALID [2020-07-11 00:34:16,302 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-11 00:34:16,303 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1135084795] [2020-07-11 00:34:16,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:34:16,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-11 00:34:16,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940515871] [2020-07-11 00:34:16,313 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-07-11 00:34:16,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:34:16,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 00:34:16,355 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-11 00:34:16,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 00:34:16,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:34:16,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 00:34:16,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-11 00:34:16,369 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 7 states. [2020-07-11 00:34:16,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:16,885 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2020-07-11 00:34:16,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-11 00:34:16,885 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-07-11 00:34:16,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:34:16,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 00:34:16,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2020-07-11 00:34:16,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 00:34:16,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2020-07-11 00:34:16,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 51 transitions. [2020-07-11 00:34:16,974 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:16,987 INFO L225 Difference]: With dead ends: 46 [2020-07-11 00:34:16,987 INFO L226 Difference]: Without dead ends: 28 [2020-07-11 00:34:16,991 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-11 00:34:17,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-11 00:34:17,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-11 00:34:17,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:34:17,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-11 00:34:17,067 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-11 00:34:17,067 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-11 00:34:17,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:17,073 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-07-11 00:34:17,074 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-11 00:34:17,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:17,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:17,075 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-11 00:34:17,075 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-11 00:34:17,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:17,081 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-07-11 00:34:17,081 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-11 00:34:17,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:17,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:17,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:34:17,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:34:17,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-11 00:34:17,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2020-07-11 00:34:17,089 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 18 [2020-07-11 00:34:17,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:34:17,090 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2020-07-11 00:34:17,090 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 00:34:17,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 31 transitions. [2020-07-11 00:34:17,141 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-11 00:34:17,141 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-11 00:34:17,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-11 00:34:17,143 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:34:17,144 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 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-11 00:34:17,144 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 00:34:17,144 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:34:17,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:34:17,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1167280018, now seen corresponding path program 1 times [2020-07-11 00:34:17,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:34:17,146 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1200671350] [2020-07-11 00:34:17,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:34:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:17,255 INFO L280 TraceCheckUtils]: 0: Hoare triple {258#true} assume true; {258#true} is VALID [2020-07-11 00:34:17,256 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {258#true} {258#true} #35#return; {258#true} is VALID [2020-07-11 00:34:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:17,388 INFO L280 TraceCheckUtils]: 0: Hoare triple {258#true} ~x := #in~x; {299#(= f91_~x |f91_#in~x|)} is VALID [2020-07-11 00:34:17,391 INFO L280 TraceCheckUtils]: 1: Hoare triple {299#(= f91_~x |f91_#in~x|)} assume ~x > 100; {299#(= f91_~x |f91_#in~x|)} is VALID [2020-07-11 00:34:17,393 INFO L280 TraceCheckUtils]: 2: Hoare triple {299#(= f91_~x |f91_#in~x|)} #res := ~x - 10; {300#(<= (+ |f91_#res| 10) |f91_#in~x|)} is VALID [2020-07-11 00:34:17,394 INFO L280 TraceCheckUtils]: 3: Hoare triple {300#(<= (+ |f91_#res| 10) |f91_#in~x|)} assume true; {300#(<= (+ |f91_#res| 10) |f91_#in~x|)} is VALID [2020-07-11 00:34:17,395 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {300#(<= (+ |f91_#res| 10) |f91_#in~x|)} {285#(<= f91_~x 100)} #41#return; {291#(<= |f91_#t~ret0| 101)} is VALID [2020-07-11 00:34:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:17,466 INFO L280 TraceCheckUtils]: 0: Hoare triple {258#true} ~x := #in~x; {299#(= f91_~x |f91_#in~x|)} is VALID [2020-07-11 00:34:17,468 INFO L280 TraceCheckUtils]: 1: Hoare triple {299#(= f91_~x |f91_#in~x|)} assume ~x > 100; {301#(and (= f91_~x |f91_#in~x|) (<= 101 f91_~x))} is VALID [2020-07-11 00:34:17,469 INFO L280 TraceCheckUtils]: 2: Hoare triple {301#(and (= f91_~x |f91_#in~x|) (<= 101 f91_~x))} #res := ~x - 10; {302#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} is VALID [2020-07-11 00:34:17,470 INFO L280 TraceCheckUtils]: 3: Hoare triple {302#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} assume true; {302#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} is VALID [2020-07-11 00:34:17,472 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {302#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} {291#(<= |f91_#t~ret0| 101)} #43#return; {297#(and (<= 91 |f91_#t~ret1|) (<= |f91_#t~ret1| 91))} is VALID [2020-07-11 00:34:17,473 INFO L280 TraceCheckUtils]: 0: Hoare triple {258#true} ~x := #in~x; {258#true} is VALID [2020-07-11 00:34:17,474 INFO L280 TraceCheckUtils]: 1: Hoare triple {258#true} assume !(~x > 100); {285#(<= f91_~x 100)} is VALID [2020-07-11 00:34:17,474 INFO L263 TraceCheckUtils]: 2: Hoare triple {285#(<= f91_~x 100)} call #t~ret0 := f91(11 + ~x); {258#true} is VALID [2020-07-11 00:34:17,475 INFO L280 TraceCheckUtils]: 3: Hoare triple {258#true} ~x := #in~x; {299#(= f91_~x |f91_#in~x|)} is VALID [2020-07-11 00:34:17,476 INFO L280 TraceCheckUtils]: 4: Hoare triple {299#(= f91_~x |f91_#in~x|)} assume ~x > 100; {299#(= f91_~x |f91_#in~x|)} is VALID [2020-07-11 00:34:17,477 INFO L280 TraceCheckUtils]: 5: Hoare triple {299#(= f91_~x |f91_#in~x|)} #res := ~x - 10; {300#(<= (+ |f91_#res| 10) |f91_#in~x|)} is VALID [2020-07-11 00:34:17,478 INFO L280 TraceCheckUtils]: 6: Hoare triple {300#(<= (+ |f91_#res| 10) |f91_#in~x|)} assume true; {300#(<= (+ |f91_#res| 10) |f91_#in~x|)} is VALID [2020-07-11 00:34:17,480 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {300#(<= (+ |f91_#res| 10) |f91_#in~x|)} {285#(<= f91_~x 100)} #41#return; {291#(<= |f91_#t~ret0| 101)} is VALID [2020-07-11 00:34:17,481 INFO L280 TraceCheckUtils]: 8: Hoare triple {291#(<= |f91_#t~ret0| 101)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {291#(<= |f91_#t~ret0| 101)} is VALID [2020-07-11 00:34:17,481 INFO L263 TraceCheckUtils]: 9: Hoare triple {291#(<= |f91_#t~ret0| 101)} call #t~ret1 := f91(#t~ret0); {258#true} is VALID [2020-07-11 00:34:17,482 INFO L280 TraceCheckUtils]: 10: Hoare triple {258#true} ~x := #in~x; {299#(= f91_~x |f91_#in~x|)} is VALID [2020-07-11 00:34:17,483 INFO L280 TraceCheckUtils]: 11: Hoare triple {299#(= f91_~x |f91_#in~x|)} assume ~x > 100; {301#(and (= f91_~x |f91_#in~x|) (<= 101 f91_~x))} is VALID [2020-07-11 00:34:17,485 INFO L280 TraceCheckUtils]: 12: Hoare triple {301#(and (= f91_~x |f91_#in~x|) (<= 101 f91_~x))} #res := ~x - 10; {302#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} is VALID [2020-07-11 00:34:17,486 INFO L280 TraceCheckUtils]: 13: Hoare triple {302#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} assume true; {302#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} is VALID [2020-07-11 00:34:17,487 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {302#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} {291#(<= |f91_#t~ret0| 101)} #43#return; {297#(and (<= 91 |f91_#t~ret1|) (<= |f91_#t~ret1| 91))} is VALID [2020-07-11 00:34:17,489 INFO L280 TraceCheckUtils]: 15: Hoare triple {297#(and (<= 91 |f91_#t~ret1|) (<= |f91_#t~ret1| 91))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {297#(and (<= 91 |f91_#t~ret1|) (<= |f91_#t~ret1| 91))} is VALID [2020-07-11 00:34:17,490 INFO L280 TraceCheckUtils]: 16: Hoare triple {297#(and (<= 91 |f91_#t~ret1|) (<= |f91_#t~ret1| 91))} #res := #t~ret1; {298#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} is VALID [2020-07-11 00:34:17,492 INFO L280 TraceCheckUtils]: 17: Hoare triple {298#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} havoc #t~ret0; {298#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} is VALID [2020-07-11 00:34:17,493 INFO L280 TraceCheckUtils]: 18: Hoare triple {298#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} havoc #t~ret1; {298#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} is VALID [2020-07-11 00:34:17,494 INFO L280 TraceCheckUtils]: 19: Hoare triple {298#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} assume true; {298#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} is VALID [2020-07-11 00:34:17,496 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {298#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} {258#true} #39#return; {283#(and (<= |main_#t~ret3| 91) (<= 91 |main_#t~ret3|))} is VALID [2020-07-11 00:34:17,499 INFO L263 TraceCheckUtils]: 0: Hoare triple {258#true} call ULTIMATE.init(); {258#true} is VALID [2020-07-11 00:34:17,499 INFO L280 TraceCheckUtils]: 1: Hoare triple {258#true} assume true; {258#true} is VALID [2020-07-11 00:34:17,500 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {258#true} {258#true} #35#return; {258#true} is VALID [2020-07-11 00:34:17,500 INFO L263 TraceCheckUtils]: 3: Hoare triple {258#true} call #t~ret4 := main(); {258#true} is VALID [2020-07-11 00:34:17,500 INFO L280 TraceCheckUtils]: 4: Hoare triple {258#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {258#true} is VALID [2020-07-11 00:34:17,501 INFO L280 TraceCheckUtils]: 5: Hoare triple {258#true} ~x~0 := #t~nondet2; {258#true} is VALID [2020-07-11 00:34:17,501 INFO L280 TraceCheckUtils]: 6: Hoare triple {258#true} havoc #t~nondet2; {258#true} is VALID [2020-07-11 00:34:17,501 INFO L263 TraceCheckUtils]: 7: Hoare triple {258#true} call #t~ret3 := f91(~x~0); {258#true} is VALID [2020-07-11 00:34:17,502 INFO L280 TraceCheckUtils]: 8: Hoare triple {258#true} ~x := #in~x; {258#true} is VALID [2020-07-11 00:34:17,503 INFO L280 TraceCheckUtils]: 9: Hoare triple {258#true} assume !(~x > 100); {285#(<= f91_~x 100)} is VALID [2020-07-11 00:34:17,504 INFO L263 TraceCheckUtils]: 10: Hoare triple {285#(<= f91_~x 100)} call #t~ret0 := f91(11 + ~x); {258#true} is VALID [2020-07-11 00:34:17,505 INFO L280 TraceCheckUtils]: 11: Hoare triple {258#true} ~x := #in~x; {299#(= f91_~x |f91_#in~x|)} is VALID [2020-07-11 00:34:17,505 INFO L280 TraceCheckUtils]: 12: Hoare triple {299#(= f91_~x |f91_#in~x|)} assume ~x > 100; {299#(= f91_~x |f91_#in~x|)} is VALID [2020-07-11 00:34:17,507 INFO L280 TraceCheckUtils]: 13: Hoare triple {299#(= f91_~x |f91_#in~x|)} #res := ~x - 10; {300#(<= (+ |f91_#res| 10) |f91_#in~x|)} is VALID [2020-07-11 00:34:17,508 INFO L280 TraceCheckUtils]: 14: Hoare triple {300#(<= (+ |f91_#res| 10) |f91_#in~x|)} assume true; {300#(<= (+ |f91_#res| 10) |f91_#in~x|)} is VALID [2020-07-11 00:34:17,510 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {300#(<= (+ |f91_#res| 10) |f91_#in~x|)} {285#(<= f91_~x 100)} #41#return; {291#(<= |f91_#t~ret0| 101)} is VALID [2020-07-11 00:34:17,511 INFO L280 TraceCheckUtils]: 16: Hoare triple {291#(<= |f91_#t~ret0| 101)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {291#(<= |f91_#t~ret0| 101)} is VALID [2020-07-11 00:34:17,511 INFO L263 TraceCheckUtils]: 17: Hoare triple {291#(<= |f91_#t~ret0| 101)} call #t~ret1 := f91(#t~ret0); {258#true} is VALID [2020-07-11 00:34:17,512 INFO L280 TraceCheckUtils]: 18: Hoare triple {258#true} ~x := #in~x; {299#(= f91_~x |f91_#in~x|)} is VALID [2020-07-11 00:34:17,514 INFO L280 TraceCheckUtils]: 19: Hoare triple {299#(= f91_~x |f91_#in~x|)} assume ~x > 100; {301#(and (= f91_~x |f91_#in~x|) (<= 101 f91_~x))} is VALID [2020-07-11 00:34:17,515 INFO L280 TraceCheckUtils]: 20: Hoare triple {301#(and (= f91_~x |f91_#in~x|) (<= 101 f91_~x))} #res := ~x - 10; {302#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} is VALID [2020-07-11 00:34:17,517 INFO L280 TraceCheckUtils]: 21: Hoare triple {302#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} assume true; {302#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} is VALID [2020-07-11 00:34:17,519 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {302#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} {291#(<= |f91_#t~ret0| 101)} #43#return; {297#(and (<= 91 |f91_#t~ret1|) (<= |f91_#t~ret1| 91))} is VALID [2020-07-11 00:34:17,520 INFO L280 TraceCheckUtils]: 23: Hoare triple {297#(and (<= 91 |f91_#t~ret1|) (<= |f91_#t~ret1| 91))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {297#(and (<= 91 |f91_#t~ret1|) (<= |f91_#t~ret1| 91))} is VALID [2020-07-11 00:34:17,522 INFO L280 TraceCheckUtils]: 24: Hoare triple {297#(and (<= 91 |f91_#t~ret1|) (<= |f91_#t~ret1| 91))} #res := #t~ret1; {298#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} is VALID [2020-07-11 00:34:17,523 INFO L280 TraceCheckUtils]: 25: Hoare triple {298#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} havoc #t~ret0; {298#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} is VALID [2020-07-11 00:34:17,524 INFO L280 TraceCheckUtils]: 26: Hoare triple {298#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} havoc #t~ret1; {298#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} is VALID [2020-07-11 00:34:17,525 INFO L280 TraceCheckUtils]: 27: Hoare triple {298#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} assume true; {298#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} is VALID [2020-07-11 00:34:17,527 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {298#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} {258#true} #39#return; {283#(and (<= |main_#t~ret3| 91) (<= 91 |main_#t~ret3|))} is VALID [2020-07-11 00:34:17,528 INFO L280 TraceCheckUtils]: 29: Hoare triple {283#(and (<= |main_#t~ret3| 91) (<= 91 |main_#t~ret3|))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {283#(and (<= |main_#t~ret3| 91) (<= 91 |main_#t~ret3|))} is VALID [2020-07-11 00:34:17,530 INFO L280 TraceCheckUtils]: 30: Hoare triple {283#(and (<= |main_#t~ret3| 91) (<= 91 |main_#t~ret3|))} ~result~0 := #t~ret3; {284#(and (<= main_~result~0 91) (<= 91 main_~result~0))} is VALID [2020-07-11 00:34:17,531 INFO L280 TraceCheckUtils]: 31: Hoare triple {284#(and (<= main_~result~0 91) (<= 91 main_~result~0))} havoc #t~ret3; {284#(and (<= main_~result~0 91) (<= 91 main_~result~0))} is VALID [2020-07-11 00:34:17,532 INFO L280 TraceCheckUtils]: 32: Hoare triple {284#(and (<= main_~result~0 91) (<= 91 main_~result~0))} assume !(91 == ~result~0 || (~x~0 > 101 && ~result~0 == ~x~0 - 10)); {259#false} is VALID [2020-07-11 00:34:17,533 INFO L280 TraceCheckUtils]: 33: Hoare triple {259#false} assume !false; {259#false} is VALID [2020-07-11 00:34:17,537 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-11 00:34:17,537 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1200671350] [2020-07-11 00:34:17,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:34:17,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-07-11 00:34:17,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465443683] [2020-07-11 00:34:17,540 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2020-07-11 00:34:17,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:34:17,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-11 00:34:17,589 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:17,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-11 00:34:17,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:34:17,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-11 00:34:17,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-07-11 00:34:17,591 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 12 states. [2020-07-11 00:34:18,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:18,304 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-07-11 00:34:18,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-11 00:34:18,305 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2020-07-11 00:34:18,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:34:18,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-11 00:34:18,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 31 transitions. [2020-07-11 00:34:18,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-11 00:34:18,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 31 transitions. [2020-07-11 00:34:18,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 31 transitions. [2020-07-11 00:34:18,359 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-11 00:34:18,360 INFO L225 Difference]: With dead ends: 28 [2020-07-11 00:34:18,360 INFO L226 Difference]: Without dead ends: 0 [2020-07-11 00:34:18,362 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2020-07-11 00:34:18,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-11 00:34:18,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-11 00:34:18,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:34:18,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-11 00:34:18,363 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 00:34:18,363 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 00:34:18,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:18,363 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 00:34:18,364 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:34:18,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:18,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:18,364 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 00:34:18,364 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 00:34:18,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:18,365 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 00:34:18,365 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:34:18,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:18,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:18,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:34:18,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:34:18,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-11 00:34:18,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-11 00:34:18,366 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2020-07-11 00:34:18,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:34:18,367 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-11 00:34:18,367 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-11 00:34:18,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-11 00:34:18,367 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-11 00:34:18,367 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:34:18,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:18,368 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 00:34:18,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-11 00:34:18,796 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-11 00:34:18,796 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-11 00:34:18,797 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-11 00:34:18,797 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 00:34:18,797 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-11 00:34:18,797 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-11 00:34:18,797 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 30) the Hoare annotation is: false [2020-07-11 00:34:18,798 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: false [2020-07-11 00:34:18,798 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 24 32) the Hoare annotation is: true [2020-07-11 00:34:18,798 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-07-11 00:34:18,798 INFO L264 CegarLoopResult]: At program point L27(lines 27 31) the Hoare annotation is: (let ((.cse0 (<= 91 main_~result~0))) (or (and (<= main_~result~0 91) .cse0) (let ((.cse1 (+ main_~result~0 10))) (and (<= main_~x~0 .cse1) .cse0 (<= .cse1 main_~x~0))))) [2020-07-11 00:34:18,798 INFO L271 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: true [2020-07-11 00:34:18,798 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-07-11 00:34:18,799 INFO L264 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: (let ((.cse0 (<= 91 |main_#t~ret3|))) (or (and (<= |main_#t~ret3| 91) .cse0) (let ((.cse1 (+ |main_#t~ret3| 10))) (and (<= main_~x~0 .cse1) (<= .cse1 main_~x~0) .cse0)))) [2020-07-11 00:34:18,799 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 24 32) the Hoare annotation is: true [2020-07-11 00:34:18,799 INFO L271 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: true [2020-07-11 00:34:18,799 INFO L264 CegarLoopResult]: At program point L26-2(line 26) the Hoare annotation is: (let ((.cse0 (<= 91 |main_#t~ret3|))) (or (and (<= |main_#t~ret3| 91) .cse0) (let ((.cse1 (+ |main_#t~ret3| 10))) (and (<= main_~x~0 .cse1) (<= .cse1 main_~x~0) .cse0)))) [2020-07-11 00:34:18,800 INFO L264 CegarLoopResult]: At program point L26-3(line 26) the Hoare annotation is: (let ((.cse2 (<= 91 |main_#t~ret3|))) (or (let ((.cse0 (+ |main_#t~ret3| 10)) (.cse1 (+ main_~result~0 10))) (and (<= main_~x~0 .cse0) (<= main_~x~0 .cse1) (<= .cse0 main_~x~0) (<= .cse1 main_~x~0) .cse2)) (and (<= |main_#t~ret3| 91) (<= main_~result~0 91) (<= 91 main_~result~0) .cse2))) [2020-07-11 00:34:18,800 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 24 32) the Hoare annotation is: true [2020-07-11 00:34:18,800 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (= f91_~x |f91_#in~x|) (<= f91_~x 100)) [2020-07-11 00:34:18,800 INFO L264 CegarLoopResult]: At program point f91EXIT(lines 15 21) the Hoare annotation is: (let ((.cse0 (= f91_~x |f91_#in~x|))) (or (and (<= 91 |f91_#res|) (<= |f91_#res| 91) .cse0 (<= f91_~x 100)) (let ((.cse1 (+ |f91_#res| 10))) (and (<= .cse1 |f91_#in~x|) (<= |f91_#in~x| .cse1) .cse0 (<= 101 f91_~x))))) [2020-07-11 00:34:18,801 INFO L264 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (and (<= |f91_#t~ret0| 101) (= f91_~x |f91_#in~x|) (<= f91_~x 100)) [2020-07-11 00:34:18,801 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (and (= f91_~x |f91_#in~x|) (<= 101 f91_~x)) [2020-07-11 00:34:18,801 INFO L264 CegarLoopResult]: At program point L19-2(line 19) the Hoare annotation is: (and (<= |f91_#t~ret0| 101) (= f91_~x |f91_#in~x|) (<= f91_~x 100)) [2020-07-11 00:34:18,801 INFO L264 CegarLoopResult]: At program point L16(lines 16 20) the Hoare annotation is: (= f91_~x |f91_#in~x|) [2020-07-11 00:34:18,801 INFO L264 CegarLoopResult]: At program point L19-3(line 19) the Hoare annotation is: (and (<= |f91_#t~ret0| 101) (<= 91 |f91_#t~ret1|) (<= |f91_#t~ret1| 91) (= f91_~x |f91_#in~x|) (<= f91_~x 100)) [2020-07-11 00:34:18,802 INFO L264 CegarLoopResult]: At program point L19-4(line 19) the Hoare annotation is: (and (<= |f91_#t~ret0| 101) (<= 91 |f91_#t~ret1|) (<= |f91_#t~ret1| 91) (= f91_~x |f91_#in~x|) (<= f91_~x 100)) [2020-07-11 00:34:18,802 INFO L264 CegarLoopResult]: At program point L19-5(line 19) the Hoare annotation is: (and (<= |f91_#t~ret0| 101) (<= 91 |f91_#res|) (<= 91 |f91_#t~ret1|) (<= |f91_#res| 91) (<= |f91_#t~ret1| 91) (= f91_~x |f91_#in~x|) (<= f91_~x 100)) [2020-07-11 00:34:18,802 INFO L264 CegarLoopResult]: At program point L19-6(line 19) the Hoare annotation is: (and (<= 91 |f91_#res|) (<= 91 |f91_#t~ret1|) (<= |f91_#res| 91) (<= |f91_#t~ret1| 91) (= f91_~x |f91_#in~x|) (<= f91_~x 100)) [2020-07-11 00:34:18,802 INFO L271 CegarLoopResult]: At program point f91ENTRY(lines 15 21) the Hoare annotation is: true [2020-07-11 00:34:18,802 INFO L264 CegarLoopResult]: At program point f91FINAL(lines 15 21) the Hoare annotation is: (let ((.cse0 (= f91_~x |f91_#in~x|))) (or (and (<= 91 |f91_#res|) (<= |f91_#res| 91) .cse0 (<= f91_~x 100)) (let ((.cse1 (+ |f91_#res| 10))) (and (<= .cse1 |f91_#in~x|) (<= |f91_#in~x| .cse1) .cse0 (<= 101 f91_~x))))) [2020-07-11 00:34:18,826 INFO L163 areAnnotationChecker]: CFG has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-11 00:34:18,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 12:34:18 BoogieIcfgContainer [2020-07-11 00:34:18,840 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 00:34:18,843 INFO L168 Benchmark]: Toolchain (without parser) took 3935.15 ms. Allocated memory was 136.8 MB in the beginning and 250.6 MB in the end (delta: 113.8 MB). Free memory was 102.5 MB in the beginning and 198.5 MB in the end (delta: -96.0 MB). Peak memory consumption was 17.8 MB. Max. memory is 7.1 GB. [2020-07-11 00:34:18,844 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 136.8 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-11 00:34:18,845 INFO L168 Benchmark]: CACSL2BoogieTranslator took 288.04 ms. Allocated memory is still 136.8 MB. Free memory was 102.1 MB in the beginning and 92.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-07-11 00:34:18,846 INFO L168 Benchmark]: Boogie Preprocessor took 36.01 ms. Allocated memory is still 136.8 MB. Free memory was 92.8 MB in the beginning and 91.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-11 00:34:18,847 INFO L168 Benchmark]: RCFGBuilder took 464.22 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 91.4 MB in the beginning and 162.8 MB in the end (delta: -71.5 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2020-07-11 00:34:18,848 INFO L168 Benchmark]: TraceAbstraction took 3140.81 ms. Allocated memory was 200.3 MB in the beginning and 250.6 MB in the end (delta: 50.3 MB). Free memory was 162.1 MB in the beginning and 198.5 MB in the end (delta: -36.4 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-07-11 00:34:18,852 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.21 ms. Allocated memory is still 136.8 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 288.04 ms. Allocated memory is still 136.8 MB. Free memory was 102.1 MB in the beginning and 92.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.01 ms. Allocated memory is still 136.8 MB. Free memory was 92.8 MB in the beginning and 91.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 464.22 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 91.4 MB in the beginning and 162.8 MB in the end (delta: -71.5 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3140.81 ms. Allocated memory was 200.3 MB in the beginning and 250.6 MB in the end (delta: 50.3 MB). Free memory was 162.1 MB in the beginning and 198.5 MB in the end (delta: -36.4 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 30]: 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 - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 15]: Procedure Contract for f91 Derived contract for procedure f91: (((91 <= \result && \result <= 91) && x == \old(x)) && x <= 100) || (((\result + 10 <= \old(x) && \old(x) <= \result + 10) && x == \old(x)) && 101 <= x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.5s, OverallIterations: 2, TraceHistogramMax: 3, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 40 SDtfs, 38 SDslu, 172 SDs, 0 SdLazy, 174 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 31 LocationsWithAnnotation, 55 PreInvPairs, 74 NumberOfFragments, 292 HoareAnnotationTreeSize, 55 FomulaSimplifications, 40 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 31 FomulaSimplificationsInter, 70 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 52 NumberOfCodeBlocks, 52 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 50 ConstructedInterpolants, 0 QuantifiedInterpolants, 6206 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 9/13 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...