/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-267fbe0 [2020-07-18 04:40:26,826 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 04:40:26,828 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 04:40:26,842 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 04:40:26,842 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 04:40:26,844 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 04:40:26,845 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 04:40:26,849 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 04:40:26,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 04:40:26,851 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 04:40:26,852 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 04:40:26,860 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 04:40:26,860 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 04:40:26,861 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 04:40:26,864 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 04:40:26,866 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 04:40:26,867 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 04:40:26,868 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 04:40:26,872 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 04:40:26,874 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 04:40:26,878 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 04:40:26,880 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 04:40:26,881 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 04:40:26,885 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 04:40:26,887 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 04:40:26,888 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 04:40:26,888 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 04:40:26,891 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 04:40:26,892 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 04:40:26,894 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 04:40:26,894 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 04:40:26,895 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 04:40:26,896 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 04:40:26,897 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 04:40:26,902 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 04:40:26,902 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 04:40:26,903 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 04:40:26,903 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 04:40:26,903 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 04:40:26,904 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 04:40:26,906 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 04:40:26,907 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:40:26,932 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 04:40:26,933 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 04:40:26,934 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 04:40:26,934 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 04:40:26,936 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 04:40:26,936 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 04:40:26,937 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 04:40:26,937 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 04:40:26,937 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 04:40:26,939 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 04:40:26,940 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 04:40:26,940 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 04:40:26,940 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 04:40:26,940 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 04:40:26,940 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 04:40:26,941 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 04:40:26,941 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 04:40:26,941 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 04:40:26,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 04:40:26,941 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 04:40:26,941 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 04:40:26,942 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 04:40:26,942 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:40:27,224 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 04:40:27,239 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 04:40:27,242 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 04:40:27,244 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 04:40:27,244 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 04:40:27,245 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-18 04:40:27,311 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26d9d9696/0d20bbba85634b8e8ae99693c09c402f/FLAG94d1c22b8 [2020-07-18 04:40:27,745 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 04:40:27,746 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/McCarthy91-2.c [2020-07-18 04:40:27,753 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26d9d9696/0d20bbba85634b8e8ae99693c09c402f/FLAG94d1c22b8 [2020-07-18 04:40:28,145 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26d9d9696/0d20bbba85634b8e8ae99693c09c402f [2020-07-18 04:40:28,153 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 04:40:28,156 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 04:40:28,157 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 04:40:28,157 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 04:40:28,160 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 04:40:28,161 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 04:40:28" (1/1) ... [2020-07-18 04:40:28,164 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17514c31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:40:28, skipping insertion in model container [2020-07-18 04:40:28,164 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 04:40:28" (1/1) ... [2020-07-18 04:40:28,171 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 04:40:28,187 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 04:40:28,351 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 04:40:28,356 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 04:40:28,373 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 04:40:28,387 INFO L208 MainTranslator]: Completed translation [2020-07-18 04:40:28,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:40:28 WrapperNode [2020-07-18 04:40:28,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 04:40:28,389 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 04:40:28,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 04:40:28,389 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 04:40:28,400 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:40:28" (1/1) ... [2020-07-18 04:40:28,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:40:28" (1/1) ... [2020-07-18 04:40:28,405 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:40:28" (1/1) ... [2020-07-18 04:40:28,405 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:40:28" (1/1) ... [2020-07-18 04:40:28,410 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:40:28" (1/1) ... [2020-07-18 04:40:28,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:40:28" (1/1) ... [2020-07-18 04:40:28,413 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:40:28" (1/1) ... [2020-07-18 04:40:28,415 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 04:40:28,415 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 04:40:28,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 04:40:28,416 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 04:40:28,416 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:40:28" (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:40:28,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 04:40:28,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 04:40:28,570 INFO L138 BoogieDeclarations]: Found implementation of procedure f91 [2020-07-18 04:40:28,570 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 04:40:28,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 04:40:28,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 04:40:28,570 INFO L130 BoogieDeclarations]: Found specification of procedure f91 [2020-07-18 04:40:28,570 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 04:40:28,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 04:40:28,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 04:40:28,840 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 04:40:28,840 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-18 04:40:28,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 04:40:28 BoogieIcfgContainer [2020-07-18 04:40:28,845 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 04:40:28,847 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 04:40:28,848 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 04:40:28,851 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 04:40:28,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 04:40:28" (1/3) ... [2020-07-18 04:40:28,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f2a6916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 04:40:28, skipping insertion in model container [2020-07-18 04:40:28,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:40:28" (2/3) ... [2020-07-18 04:40:28,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f2a6916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 04:40:28, skipping insertion in model container [2020-07-18 04:40:28,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 04:40:28" (3/3) ... [2020-07-18 04:40:28,857 INFO L109 eAbstractionObserver]: Analyzing ICFG McCarthy91-2.c [2020-07-18 04:40:28,870 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 04:40:28,880 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 04:40:28,899 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 04:40:28,938 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 04:40:28,939 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 04:40:28,939 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-18 04:40:28,939 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 04:40:28,939 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 04:40:28,939 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 04:40:28,940 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 04:40:28,940 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 04:40:28,967 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2020-07-18 04:40:28,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-18 04:40:28,981 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:40:28,982 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:40:28,982 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:40:28,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:40:28,988 INFO L82 PathProgramCache]: Analyzing trace with hash 346555185, now seen corresponding path program 1 times [2020-07-18 04:40:28,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:40:28,994 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1163675945] [2020-07-18 04:40:28,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:40:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:29,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:29,294 INFO L280 TraceCheckUtils]: 0: Hoare triple {34#true} assume true; {34#true} is VALID [2020-07-18 04:40:29,295 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {34#true} {34#true} #35#return; {34#true} is VALID [2020-07-18 04:40:29,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:29,406 INFO L280 TraceCheckUtils]: 0: Hoare triple {34#true} ~x := #in~x; {45#(= f91_~x |f91_#in~x|)} is VALID [2020-07-18 04:40:29,408 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-18 04:40:29,409 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-18 04:40:29,411 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-18 04:40:29,413 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-18 04:40:29,414 INFO L263 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2020-07-18 04:40:29,415 INFO L280 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2020-07-18 04:40:29,415 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #35#return; {34#true} is VALID [2020-07-18 04:40:29,415 INFO L263 TraceCheckUtils]: 3: Hoare triple {34#true} call #t~ret4 := main(); {34#true} is VALID [2020-07-18 04:40:29,416 INFO L280 TraceCheckUtils]: 4: Hoare triple {34#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {34#true} is VALID [2020-07-18 04:40:29,416 INFO L280 TraceCheckUtils]: 5: Hoare triple {34#true} ~x~0 := #t~nondet2; {34#true} is VALID [2020-07-18 04:40:29,417 INFO L280 TraceCheckUtils]: 6: Hoare triple {34#true} havoc #t~nondet2; {34#true} is VALID [2020-07-18 04:40:29,417 INFO L263 TraceCheckUtils]: 7: Hoare triple {34#true} call #t~ret3 := f91(~x~0); {34#true} is VALID [2020-07-18 04:40:29,418 INFO L280 TraceCheckUtils]: 8: Hoare triple {34#true} ~x := #in~x; {45#(= f91_~x |f91_#in~x|)} is VALID [2020-07-18 04:40:29,419 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-18 04:40:29,421 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-18 04:40:29,423 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-18 04:40:29,425 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-18 04:40:29,426 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-18 04:40:29,427 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-18 04:40:29,429 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-18 04:40:29,430 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-18 04:40:29,431 INFO L280 TraceCheckUtils]: 17: Hoare triple {35#false} assume !false; {35#false} is VALID [2020-07-18 04:40:29,434 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:40:29,435 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1163675945] [2020-07-18 04:40:29,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 04:40:29,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-18 04:40:29,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526574094] [2020-07-18 04:40:29,445 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-07-18 04:40:29,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:40:29,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-18 04:40:29,489 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:40:29,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-18 04:40:29,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:40:29,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-18 04:40:29,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-18 04:40:29,502 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 7 states. [2020-07-18 04:40:30,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:30,005 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2020-07-18 04:40:30,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-18 04:40:30,006 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-07-18 04:40:30,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:40:30,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 04:40:30,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2020-07-18 04:40:30,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 04:40:30,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2020-07-18 04:40:30,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 51 transitions. [2020-07-18 04:40:30,092 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-18 04:40:30,105 INFO L225 Difference]: With dead ends: 46 [2020-07-18 04:40:30,105 INFO L226 Difference]: Without dead ends: 28 [2020-07-18 04:40:30,109 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-18 04:40:30,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-18 04:40:30,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-18 04:40:30,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:40:30,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-18 04:40:30,172 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-18 04:40:30,172 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-18 04:40:30,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:30,178 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-07-18 04:40:30,179 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-18 04:40:30,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:40:30,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:40:30,180 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-18 04:40:30,180 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-18 04:40:30,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:30,185 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-07-18 04:40:30,186 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-18 04:40:30,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:40:30,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:40:30,187 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:40:30,187 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:40:30,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-18 04:40:30,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2020-07-18 04:40:30,193 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 18 [2020-07-18 04:40:30,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:40:30,193 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2020-07-18 04:40:30,193 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-18 04:40:30,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 31 transitions. [2020-07-18 04:40:30,232 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:40:30,233 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-18 04:40:30,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-18 04:40:30,235 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:40:30,235 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-18 04:40:30,235 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 04:40:30,236 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:40:30,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:40:30,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1167280018, now seen corresponding path program 1 times [2020-07-18 04:40:30,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:40:30,237 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2028674247] [2020-07-18 04:40:30,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:40:30,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:30,365 INFO L280 TraceCheckUtils]: 0: Hoare triple {258#true} assume true; {258#true} is VALID [2020-07-18 04:40:30,366 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {258#true} {258#true} #35#return; {258#true} is VALID [2020-07-18 04:40:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:30,548 INFO L280 TraceCheckUtils]: 0: Hoare triple {258#true} ~x := #in~x; {299#(= f91_~x |f91_#in~x|)} is VALID [2020-07-18 04:40:30,549 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-18 04:40:30,550 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-18 04:40:30,550 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-18 04:40:30,552 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-18 04:40:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:30,618 INFO L280 TraceCheckUtils]: 0: Hoare triple {258#true} ~x := #in~x; {299#(= f91_~x |f91_#in~x|)} is VALID [2020-07-18 04:40:30,619 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-18 04:40:30,620 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-18 04:40:30,621 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-18 04:40:30,623 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-18 04:40:30,623 INFO L280 TraceCheckUtils]: 0: Hoare triple {258#true} ~x := #in~x; {258#true} is VALID [2020-07-18 04:40:30,624 INFO L280 TraceCheckUtils]: 1: Hoare triple {258#true} assume !(~x > 100); {285#(<= f91_~x 100)} is VALID [2020-07-18 04:40:30,625 INFO L263 TraceCheckUtils]: 2: Hoare triple {285#(<= f91_~x 100)} call #t~ret0 := f91(11 + ~x); {258#true} is VALID [2020-07-18 04:40:30,626 INFO L280 TraceCheckUtils]: 3: Hoare triple {258#true} ~x := #in~x; {299#(= f91_~x |f91_#in~x|)} is VALID [2020-07-18 04:40:30,626 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-18 04:40:30,627 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-18 04:40:30,628 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-18 04:40:30,630 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-18 04:40:30,631 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-18 04:40:30,632 INFO L263 TraceCheckUtils]: 9: Hoare triple {291#(<= |f91_#t~ret0| 101)} call #t~ret1 := f91(#t~ret0); {258#true} is VALID [2020-07-18 04:40:30,633 INFO L280 TraceCheckUtils]: 10: Hoare triple {258#true} ~x := #in~x; {299#(= f91_~x |f91_#in~x|)} is VALID [2020-07-18 04:40:30,634 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-18 04:40:30,635 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-18 04:40:30,636 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-18 04:40:30,638 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-18 04:40:30,639 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-18 04:40:30,640 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-18 04:40:30,641 INFO L280 TraceCheckUtils]: 17: 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-18 04:40:30,642 INFO L280 TraceCheckUtils]: 18: 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-18 04:40:30,643 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-18 04:40:30,645 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-18 04:40:30,647 INFO L263 TraceCheckUtils]: 0: Hoare triple {258#true} call ULTIMATE.init(); {258#true} is VALID [2020-07-18 04:40:30,648 INFO L280 TraceCheckUtils]: 1: Hoare triple {258#true} assume true; {258#true} is VALID [2020-07-18 04:40:30,648 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {258#true} {258#true} #35#return; {258#true} is VALID [2020-07-18 04:40:30,648 INFO L263 TraceCheckUtils]: 3: Hoare triple {258#true} call #t~ret4 := main(); {258#true} is VALID [2020-07-18 04:40:30,649 INFO L280 TraceCheckUtils]: 4: Hoare triple {258#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {258#true} is VALID [2020-07-18 04:40:30,649 INFO L280 TraceCheckUtils]: 5: Hoare triple {258#true} ~x~0 := #t~nondet2; {258#true} is VALID [2020-07-18 04:40:30,650 INFO L280 TraceCheckUtils]: 6: Hoare triple {258#true} havoc #t~nondet2; {258#true} is VALID [2020-07-18 04:40:30,650 INFO L263 TraceCheckUtils]: 7: Hoare triple {258#true} call #t~ret3 := f91(~x~0); {258#true} is VALID [2020-07-18 04:40:30,650 INFO L280 TraceCheckUtils]: 8: Hoare triple {258#true} ~x := #in~x; {258#true} is VALID [2020-07-18 04:40:30,651 INFO L280 TraceCheckUtils]: 9: Hoare triple {258#true} assume !(~x > 100); {285#(<= f91_~x 100)} is VALID [2020-07-18 04:40:30,652 INFO L263 TraceCheckUtils]: 10: Hoare triple {285#(<= f91_~x 100)} call #t~ret0 := f91(11 + ~x); {258#true} is VALID [2020-07-18 04:40:30,653 INFO L280 TraceCheckUtils]: 11: Hoare triple {258#true} ~x := #in~x; {299#(= f91_~x |f91_#in~x|)} is VALID [2020-07-18 04:40:30,653 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-18 04:40:30,654 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-18 04:40:30,655 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-18 04:40:30,657 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-18 04:40:30,658 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-18 04:40:30,659 INFO L263 TraceCheckUtils]: 17: Hoare triple {291#(<= |f91_#t~ret0| 101)} call #t~ret1 := f91(#t~ret0); {258#true} is VALID [2020-07-18 04:40:30,660 INFO L280 TraceCheckUtils]: 18: Hoare triple {258#true} ~x := #in~x; {299#(= f91_~x |f91_#in~x|)} is VALID [2020-07-18 04:40:30,661 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-18 04:40:30,662 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-18 04:40:30,663 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-18 04:40:30,665 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-18 04:40:30,666 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-18 04:40:30,667 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-18 04:40:30,668 INFO L280 TraceCheckUtils]: 25: 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-18 04:40:30,669 INFO L280 TraceCheckUtils]: 26: 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-18 04:40:30,670 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-18 04:40:30,671 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-18 04:40:30,672 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-18 04:40:30,674 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-18 04:40:30,675 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-18 04:40:30,676 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-18 04:40:30,677 INFO L280 TraceCheckUtils]: 33: Hoare triple {259#false} assume !false; {259#false} is VALID [2020-07-18 04:40:30,680 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-18 04:40:30,681 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2028674247] [2020-07-18 04:40:30,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:40:30,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-07-18 04:40:30,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342808017] [2020-07-18 04:40:30,684 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2020-07-18 04:40:30,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:40:30,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-18 04:40:30,727 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-18 04:40:30,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-18 04:40:30,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:40:30,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-18 04:40:30,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-07-18 04:40:30,729 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 12 states. [2020-07-18 04:40:31,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:31,392 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-07-18 04:40:31,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-18 04:40:31,393 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2020-07-18 04:40:31,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:40:31,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-18 04:40:31,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 31 transitions. [2020-07-18 04:40:31,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-18 04:40:31,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 31 transitions. [2020-07-18 04:40:31,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 31 transitions. [2020-07-18 04:40:31,440 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:40:31,440 INFO L225 Difference]: With dead ends: 28 [2020-07-18 04:40:31,441 INFO L226 Difference]: Without dead ends: 0 [2020-07-18 04:40:31,442 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2020-07-18 04:40:31,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-18 04:40:31,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-18 04:40:31,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:40:31,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-18 04:40:31,443 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 04:40:31,443 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 04:40:31,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:31,444 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 04:40:31,444 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 04:40:31,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:40:31,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:40:31,445 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 04:40:31,445 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 04:40:31,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:31,445 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 04:40:31,445 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 04:40:31,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:40:31,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:40:31,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:40:31,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:40:31,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-18 04:40:31,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-18 04:40:31,447 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2020-07-18 04:40:31,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:40:31,447 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-18 04:40:31,447 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-18 04:40:31,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-18 04:40:31,448 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-18 04:40:31,448 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 04:40:31,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:40:31,448 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 04:40:31,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-18 04:40:31,875 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-18 04:40:31,875 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-18 04:40:31,876 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-18 04:40:31,876 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 04:40:31,876 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-18 04:40:31,876 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-18 04:40:31,876 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 30) the Hoare annotation is: false [2020-07-18 04:40:31,877 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: false [2020-07-18 04:40:31,877 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 24 32) the Hoare annotation is: true [2020-07-18 04:40:31,877 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-07-18 04:40:31,877 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-18 04:40:31,877 INFO L271 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: true [2020-07-18 04:40:31,878 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-07-18 04:40:31,878 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-18 04:40:31,878 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 24 32) the Hoare annotation is: true [2020-07-18 04:40:31,878 INFO L271 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: true [2020-07-18 04:40:31,878 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-18 04:40:31,879 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-18 04:40:31,879 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 24 32) the Hoare annotation is: true [2020-07-18 04:40:31,879 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (= f91_~x |f91_#in~x|) (<= f91_~x 100)) [2020-07-18 04:40:31,879 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-18 04:40:31,880 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-18 04:40:31,880 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (and (= f91_~x |f91_#in~x|) (<= 101 f91_~x)) [2020-07-18 04:40:31,880 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-18 04:40:31,880 INFO L264 CegarLoopResult]: At program point L16(lines 16 20) the Hoare annotation is: (= f91_~x |f91_#in~x|) [2020-07-18 04:40:31,881 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-18 04:40:31,881 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-18 04:40:31,881 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-18 04:40:31,881 INFO L264 CegarLoopResult]: At program point L19-6(line 19) the Hoare annotation is: (and (<= |f91_#t~ret0| 101) (<= 91 |f91_#res|) (<= |f91_#res| 91) (= f91_~x |f91_#in~x|) (<= f91_~x 100)) [2020-07-18 04:40:31,881 INFO L271 CegarLoopResult]: At program point f91ENTRY(lines 15 21) the Hoare annotation is: true [2020-07-18 04:40:31,882 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-18 04:40:31,901 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-18 04:40:31,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 04:40:31 BoogieIcfgContainer [2020-07-18 04:40:31,914 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 04:40:31,918 INFO L168 Benchmark]: Toolchain (without parser) took 3762.15 ms. Allocated memory was 139.5 MB in the beginning and 245.9 MB in the end (delta: 106.4 MB). Free memory was 102.4 MB in the beginning and 176.3 MB in the end (delta: -73.8 MB). Peak memory consumption was 32.6 MB. Max. memory is 7.1 GB. [2020-07-18 04:40:31,919 INFO L168 Benchmark]: CDTParser took 0.86 ms. Allocated memory is still 139.5 MB. Free memory was 120.7 MB in the beginning and 120.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-18 04:40:31,920 INFO L168 Benchmark]: CACSL2BoogieTranslator took 231.39 ms. Allocated memory is still 139.5 MB. Free memory was 102.2 MB in the beginning and 92.7 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-18 04:40:31,921 INFO L168 Benchmark]: Boogie Preprocessor took 26.18 ms. Allocated memory is still 139.5 MB. Free memory was 92.7 MB in the beginning and 91.3 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:40:31,922 INFO L168 Benchmark]: RCFGBuilder took 430.40 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 91.3 MB in the beginning and 165.9 MB in the end (delta: -74.5 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2020-07-18 04:40:31,923 INFO L168 Benchmark]: TraceAbstraction took 3067.10 ms. Allocated memory was 203.9 MB in the beginning and 245.9 MB in the end (delta: 41.9 MB). Free memory was 165.9 MB in the beginning and 176.3 MB in the end (delta: -10.4 MB). Peak memory consumption was 31.5 MB. Max. memory is 7.1 GB. [2020-07-18 04:40:31,927 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.86 ms. Allocated memory is still 139.5 MB. Free memory was 120.7 MB in the beginning and 120.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 231.39 ms. Allocated memory is still 139.5 MB. Free memory was 102.2 MB in the beginning and 92.7 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.18 ms. Allocated memory is still 139.5 MB. Free memory was 92.7 MB in the beginning and 91.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 430.40 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 91.3 MB in the beginning and 165.9 MB in the end (delta: -74.5 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3067.10 ms. Allocated memory was 203.9 MB in the beginning and 245.9 MB in the end (delta: 41.9 MB). Free memory was 165.9 MB in the beginning and 176.3 MB in the end (delta: -10.4 MB). Peak memory consumption was 31.5 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.3s, 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.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 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, 289 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...