/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/McCarthy91-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 14:43:59,826 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 14:43:59,828 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 14:43:59,840 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 14:43:59,841 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 14:43:59,842 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 14:43:59,843 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 14:43:59,845 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 14:43:59,847 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 14:43:59,848 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 14:43:59,849 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 14:43:59,851 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 14:43:59,851 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 14:43:59,852 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 14:43:59,853 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 14:43:59,854 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 14:43:59,855 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 14:43:59,856 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 14:43:59,858 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 14:43:59,861 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 14:43:59,863 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 14:43:59,864 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 14:43:59,865 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 14:43:59,866 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 14:43:59,869 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 14:43:59,869 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 14:43:59,870 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 14:43:59,870 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 14:43:59,871 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 14:43:59,872 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 14:43:59,872 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 14:43:59,873 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 14:43:59,874 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 14:43:59,875 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 14:43:59,876 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 14:43:59,876 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 14:43:59,877 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 14:43:59,877 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 14:43:59,877 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 14:43:59,878 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 14:43:59,879 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 14:43:59,880 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 14:43:59,895 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 14:43:59,895 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 14:43:59,896 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 14:43:59,897 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 14:43:59,897 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 14:43:59,897 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 14:43:59,897 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 14:43:59,897 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 14:43:59,898 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 14:43:59,898 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 14:43:59,898 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 14:43:59,898 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 14:43:59,898 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 14:43:59,899 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 14:43:59,899 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 14:43:59,899 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 14:43:59,899 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 14:43:59,899 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 14:43:59,900 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 14:43:59,900 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 14:43:59,900 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 14:43:59,900 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:43:59,900 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 14:43:59,901 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 14:43:59,901 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 14:43:59,901 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 14:43:59,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 14:43:59,901 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 14:43:59,902 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 14:43:59,902 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 14:44:00,182 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 14:44:00,195 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 14:44:00,199 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 14:44:00,201 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 14:44:00,201 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 14:44:00,202 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-10 14:44:00,280 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/185f29778/3ee3c7ca301a4e328a62e17ad0ba29ac/FLAGa5dadd84b [2020-07-10 14:44:00,775 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 14:44:00,776 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/McCarthy91-2.c [2020-07-10 14:44:00,782 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/185f29778/3ee3c7ca301a4e328a62e17ad0ba29ac/FLAGa5dadd84b [2020-07-10 14:44:01,126 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/185f29778/3ee3c7ca301a4e328a62e17ad0ba29ac [2020-07-10 14:44:01,139 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 14:44:01,141 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 14:44:01,147 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 14:44:01,148 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 14:44:01,152 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 14:44:01,154 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:44:01" (1/1) ... [2020-07-10 14:44:01,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51541991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:44:01, skipping insertion in model container [2020-07-10 14:44:01,158 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:44:01" (1/1) ... [2020-07-10 14:44:01,168 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 14:44:01,190 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 14:44:01,436 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:44:01,441 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 14:44:01,459 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:44:01,476 INFO L208 MainTranslator]: Completed translation [2020-07-10 14:44:01,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:44:01 WrapperNode [2020-07-10 14:44:01,477 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 14:44:01,478 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 14:44:01,478 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 14:44:01,478 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 14:44:01,494 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:44:01" (1/1) ... [2020-07-10 14:44:01,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:44:01" (1/1) ... [2020-07-10 14:44:01,500 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:44:01" (1/1) ... [2020-07-10 14:44:01,500 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:44:01" (1/1) ... [2020-07-10 14:44:01,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:44:01" (1/1) ... [2020-07-10 14:44:01,508 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:44:01" (1/1) ... [2020-07-10 14:44:01,509 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:44:01" (1/1) ... [2020-07-10 14:44:01,511 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 14:44:01,511 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 14:44:01,512 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 14:44:01,512 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 14:44:01,513 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:44:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:44:01,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 14:44:01,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 14:44:01,669 INFO L138 BoogieDeclarations]: Found implementation of procedure f91 [2020-07-10 14:44:01,669 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 14:44:01,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 14:44:01,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 14:44:01,669 INFO L130 BoogieDeclarations]: Found specification of procedure f91 [2020-07-10 14:44:01,669 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 14:44:01,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 14:44:01,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 14:44:01,914 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 14:44:01,914 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 14:44:01,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:44:01 BoogieIcfgContainer [2020-07-10 14:44:01,921 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 14:44:01,922 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 14:44:01,922 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 14:44:01,926 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 14:44:01,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 02:44:01" (1/3) ... [2020-07-10 14:44:01,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f907dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:44:01, skipping insertion in model container [2020-07-10 14:44:01,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:44:01" (2/3) ... [2020-07-10 14:44:01,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f907dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:44:01, skipping insertion in model container [2020-07-10 14:44:01,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:44:01" (3/3) ... [2020-07-10 14:44:01,931 INFO L109 eAbstractionObserver]: Analyzing ICFG McCarthy91-2.c [2020-07-10 14:44:01,945 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 14:44:01,955 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 14:44:01,971 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 14:44:02,002 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 14:44:02,002 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 14:44:02,002 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 14:44:02,003 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 14:44:02,003 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 14:44:02,003 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 14:44:02,003 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 14:44:02,003 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 14:44:02,023 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2020-07-10 14:44:02,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-10 14:44:02,031 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:44:02,032 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:44:02,032 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:44:02,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:44:02,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1590359645, now seen corresponding path program 1 times [2020-07-10 14:44:02,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:44:02,056 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50278163] [2020-07-10 14:44:02,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:44:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:02,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:02,400 INFO L280 TraceCheckUtils]: 0: Hoare triple {25#true} assume true; {25#true} is VALID [2020-07-10 14:44:02,400 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {25#true} {25#true} #26#return; {25#true} is VALID [2020-07-10 14:44:02,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:02,501 INFO L280 TraceCheckUtils]: 0: Hoare triple {25#true} ~x := #in~x; {35#(= f91_~x |f91_#in~x|)} is VALID [2020-07-10 14:44:02,503 INFO L280 TraceCheckUtils]: 1: Hoare triple {35#(= f91_~x |f91_#in~x|)} assume ~x > 100;#res := ~x - 10; {36#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|) (<= |f91_#in~x| (+ |f91_#res| 10)))} is VALID [2020-07-10 14:44:02,505 INFO L280 TraceCheckUtils]: 2: Hoare triple {36#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|) (<= |f91_#in~x| (+ |f91_#res| 10)))} assume true; {36#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|) (<= |f91_#in~x| (+ |f91_#res| 10)))} is VALID [2020-07-10 14:44:02,508 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {36#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|) (<= |f91_#in~x| (+ |f91_#res| 10)))} {25#true} #30#return; {33#(and (<= main_~x~0 (+ |main_#t~ret3| 10)) (<= (+ |main_#t~ret3| 10) main_~x~0) (<= 91 |main_#t~ret3|))} is VALID [2020-07-10 14:44:02,509 INFO L263 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {25#true} is VALID [2020-07-10 14:44:02,510 INFO L280 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2020-07-10 14:44:02,510 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #26#return; {25#true} is VALID [2020-07-10 14:44:02,511 INFO L263 TraceCheckUtils]: 3: Hoare triple {25#true} call #t~ret4 := main(); {25#true} is VALID [2020-07-10 14:44:02,511 INFO L280 TraceCheckUtils]: 4: Hoare triple {25#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~x~0 := #t~nondet2;havoc #t~nondet2; {25#true} is VALID [2020-07-10 14:44:02,512 INFO L263 TraceCheckUtils]: 5: Hoare triple {25#true} call #t~ret3 := f91(~x~0); {25#true} is VALID [2020-07-10 14:44:02,513 INFO L280 TraceCheckUtils]: 6: Hoare triple {25#true} ~x := #in~x; {35#(= f91_~x |f91_#in~x|)} is VALID [2020-07-10 14:44:02,515 INFO L280 TraceCheckUtils]: 7: Hoare triple {35#(= f91_~x |f91_#in~x|)} assume ~x > 100;#res := ~x - 10; {36#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|) (<= |f91_#in~x| (+ |f91_#res| 10)))} is VALID [2020-07-10 14:44:02,517 INFO L280 TraceCheckUtils]: 8: Hoare triple {36#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|) (<= |f91_#in~x| (+ |f91_#res| 10)))} assume true; {36#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|) (<= |f91_#in~x| (+ |f91_#res| 10)))} is VALID [2020-07-10 14:44:02,519 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {36#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|) (<= |f91_#in~x| (+ |f91_#res| 10)))} {25#true} #30#return; {33#(and (<= main_~x~0 (+ |main_#t~ret3| 10)) (<= (+ |main_#t~ret3| 10) main_~x~0) (<= 91 |main_#t~ret3|))} is VALID [2020-07-10 14:44:02,521 INFO L280 TraceCheckUtils]: 10: Hoare triple {33#(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;~result~0 := #t~ret3;havoc #t~ret3; {34#(and (<= main_~x~0 (+ main_~result~0 10)) (<= 91 main_~result~0) (<= (+ main_~result~0 10) main_~x~0))} is VALID [2020-07-10 14:44:02,526 INFO L280 TraceCheckUtils]: 11: Hoare triple {34#(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)); {26#false} is VALID [2020-07-10 14:44:02,526 INFO L280 TraceCheckUtils]: 12: Hoare triple {26#false} assume !false; {26#false} is VALID [2020-07-10 14:44:02,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 14:44:02,530 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50278163] [2020-07-10 14:44:02,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:44:02,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 14:44:02,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607274519] [2020-07-10 14:44:02,540 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-07-10 14:44:02,543 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:44:02,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 14:44:02,576 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:44:02,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 14:44:02,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:44:02,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 14:44:02,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:44:02,589 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 6 states. [2020-07-10 14:44:03,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:03,015 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2020-07-10 14:44:03,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 14:44:03,015 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-07-10 14:44:03,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:44:03,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:44:03,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2020-07-10 14:44:03,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:44:03,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2020-07-10 14:44:03,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2020-07-10 14:44:03,163 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:44:03,193 INFO L225 Difference]: With dead ends: 34 [2020-07-10 14:44:03,195 INFO L226 Difference]: Without dead ends: 20 [2020-07-10 14:44:03,202 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-10 14:44:03,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-10 14:44:03,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-10 14:44:03,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:44:03,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2020-07-10 14:44:03,265 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-10 14:44:03,265 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-10 14:44:03,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:03,276 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2020-07-10 14:44:03,276 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-07-10 14:44:03,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:44:03,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:44:03,279 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-10 14:44:03,279 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-10 14:44:03,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:03,290 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2020-07-10 14:44:03,290 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-07-10 14:44:03,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:44:03,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:44:03,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:44:03,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:44:03,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-10 14:44:03,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2020-07-10 14:44:03,303 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2020-07-10 14:44:03,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:44:03,305 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-07-10 14:44:03,306 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 14:44:03,306 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-07-10 14:44:03,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 14:44:03,308 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:44:03,310 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:44:03,311 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 14:44:03,311 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:44:03,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:44:03,312 INFO L82 PathProgramCache]: Analyzing trace with hash 2121223720, now seen corresponding path program 1 times [2020-07-10 14:44:03,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:44:03,313 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054408871] [2020-07-10 14:44:03,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:44:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:03,472 INFO L280 TraceCheckUtils]: 0: Hoare triple {151#true} assume true; {151#true} is VALID [2020-07-10 14:44:03,473 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {151#true} {151#true} #26#return; {151#true} is VALID [2020-07-10 14:44:03,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:03,610 INFO L280 TraceCheckUtils]: 0: Hoare triple {151#true} ~x := #in~x; {185#(= f91_~x |f91_#in~x|)} is VALID [2020-07-10 14:44:03,612 INFO L280 TraceCheckUtils]: 1: Hoare triple {185#(= f91_~x |f91_#in~x|)} assume ~x > 100;#res := ~x - 10; {186#(<= (+ |f91_#res| 10) |f91_#in~x|)} is VALID [2020-07-10 14:44:03,612 INFO L280 TraceCheckUtils]: 2: Hoare triple {186#(<= (+ |f91_#res| 10) |f91_#in~x|)} assume true; {186#(<= (+ |f91_#res| 10) |f91_#in~x|)} is VALID [2020-07-10 14:44:03,614 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {186#(<= (+ |f91_#res| 10) |f91_#in~x|)} {173#(<= f91_~x 100)} #32#return; {178#(<= |f91_#t~ret0| 101)} is VALID [2020-07-10 14:44:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:03,658 INFO L280 TraceCheckUtils]: 0: Hoare triple {151#true} ~x := #in~x; {185#(= f91_~x |f91_#in~x|)} is VALID [2020-07-10 14:44:03,659 INFO L280 TraceCheckUtils]: 1: Hoare triple {185#(= f91_~x |f91_#in~x|)} assume ~x > 100;#res := ~x - 10; {187#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} is VALID [2020-07-10 14:44:03,661 INFO L280 TraceCheckUtils]: 2: Hoare triple {187#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} assume true; {187#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} is VALID [2020-07-10 14:44:03,663 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {187#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} {178#(<= |f91_#t~ret0| 101)} #34#return; {183#(and (<= 91 |f91_#t~ret1|) (<= |f91_#t~ret1| 91))} is VALID [2020-07-10 14:44:03,663 INFO L280 TraceCheckUtils]: 0: Hoare triple {151#true} ~x := #in~x; {151#true} is VALID [2020-07-10 14:44:03,664 INFO L280 TraceCheckUtils]: 1: Hoare triple {151#true} assume !(~x > 100); {173#(<= f91_~x 100)} is VALID [2020-07-10 14:44:03,664 INFO L263 TraceCheckUtils]: 2: Hoare triple {173#(<= f91_~x 100)} call #t~ret0 := f91(11 + ~x); {151#true} is VALID [2020-07-10 14:44:03,665 INFO L280 TraceCheckUtils]: 3: Hoare triple {151#true} ~x := #in~x; {185#(= f91_~x |f91_#in~x|)} is VALID [2020-07-10 14:44:03,666 INFO L280 TraceCheckUtils]: 4: Hoare triple {185#(= f91_~x |f91_#in~x|)} assume ~x > 100;#res := ~x - 10; {186#(<= (+ |f91_#res| 10) |f91_#in~x|)} is VALID [2020-07-10 14:44:03,666 INFO L280 TraceCheckUtils]: 5: Hoare triple {186#(<= (+ |f91_#res| 10) |f91_#in~x|)} assume true; {186#(<= (+ |f91_#res| 10) |f91_#in~x|)} is VALID [2020-07-10 14:44:03,668 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {186#(<= (+ |f91_#res| 10) |f91_#in~x|)} {173#(<= f91_~x 100)} #32#return; {178#(<= |f91_#t~ret0| 101)} is VALID [2020-07-10 14:44:03,668 INFO L280 TraceCheckUtils]: 7: Hoare triple {178#(<= |f91_#t~ret0| 101)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {178#(<= |f91_#t~ret0| 101)} is VALID [2020-07-10 14:44:03,669 INFO L263 TraceCheckUtils]: 8: Hoare triple {178#(<= |f91_#t~ret0| 101)} call #t~ret1 := f91(#t~ret0); {151#true} is VALID [2020-07-10 14:44:03,669 INFO L280 TraceCheckUtils]: 9: Hoare triple {151#true} ~x := #in~x; {185#(= f91_~x |f91_#in~x|)} is VALID [2020-07-10 14:44:03,670 INFO L280 TraceCheckUtils]: 10: Hoare triple {185#(= f91_~x |f91_#in~x|)} assume ~x > 100;#res := ~x - 10; {187#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} is VALID [2020-07-10 14:44:03,671 INFO L280 TraceCheckUtils]: 11: Hoare triple {187#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} assume true; {187#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} is VALID [2020-07-10 14:44:03,673 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {187#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} {178#(<= |f91_#t~ret0| 101)} #34#return; {183#(and (<= 91 |f91_#t~ret1|) (<= |f91_#t~ret1| 91))} is VALID [2020-07-10 14:44:03,674 INFO L280 TraceCheckUtils]: 13: Hoare triple {183#(and (<= 91 |f91_#t~ret1|) (<= |f91_#t~ret1| 91))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret0;havoc #t~ret1; {184#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} is VALID [2020-07-10 14:44:03,676 INFO L280 TraceCheckUtils]: 14: Hoare triple {184#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} assume true; {184#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} is VALID [2020-07-10 14:44:03,680 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {184#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} {151#true} #30#return; {171#(and (<= |main_#t~ret3| 91) (<= 91 |main_#t~ret3|))} is VALID [2020-07-10 14:44:03,681 INFO L263 TraceCheckUtils]: 0: Hoare triple {151#true} call ULTIMATE.init(); {151#true} is VALID [2020-07-10 14:44:03,682 INFO L280 TraceCheckUtils]: 1: Hoare triple {151#true} assume true; {151#true} is VALID [2020-07-10 14:44:03,682 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {151#true} {151#true} #26#return; {151#true} is VALID [2020-07-10 14:44:03,682 INFO L263 TraceCheckUtils]: 3: Hoare triple {151#true} call #t~ret4 := main(); {151#true} is VALID [2020-07-10 14:44:03,683 INFO L280 TraceCheckUtils]: 4: Hoare triple {151#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~x~0 := #t~nondet2;havoc #t~nondet2; {151#true} is VALID [2020-07-10 14:44:03,683 INFO L263 TraceCheckUtils]: 5: Hoare triple {151#true} call #t~ret3 := f91(~x~0); {151#true} is VALID [2020-07-10 14:44:03,683 INFO L280 TraceCheckUtils]: 6: Hoare triple {151#true} ~x := #in~x; {151#true} is VALID [2020-07-10 14:44:03,685 INFO L280 TraceCheckUtils]: 7: Hoare triple {151#true} assume !(~x > 100); {173#(<= f91_~x 100)} is VALID [2020-07-10 14:44:03,686 INFO L263 TraceCheckUtils]: 8: Hoare triple {173#(<= f91_~x 100)} call #t~ret0 := f91(11 + ~x); {151#true} is VALID [2020-07-10 14:44:03,689 INFO L280 TraceCheckUtils]: 9: Hoare triple {151#true} ~x := #in~x; {185#(= f91_~x |f91_#in~x|)} is VALID [2020-07-10 14:44:03,692 INFO L280 TraceCheckUtils]: 10: Hoare triple {185#(= f91_~x |f91_#in~x|)} assume ~x > 100;#res := ~x - 10; {186#(<= (+ |f91_#res| 10) |f91_#in~x|)} is VALID [2020-07-10 14:44:03,693 INFO L280 TraceCheckUtils]: 11: Hoare triple {186#(<= (+ |f91_#res| 10) |f91_#in~x|)} assume true; {186#(<= (+ |f91_#res| 10) |f91_#in~x|)} is VALID [2020-07-10 14:44:03,695 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {186#(<= (+ |f91_#res| 10) |f91_#in~x|)} {173#(<= f91_~x 100)} #32#return; {178#(<= |f91_#t~ret0| 101)} is VALID [2020-07-10 14:44:03,696 INFO L280 TraceCheckUtils]: 13: Hoare triple {178#(<= |f91_#t~ret0| 101)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {178#(<= |f91_#t~ret0| 101)} is VALID [2020-07-10 14:44:03,697 INFO L263 TraceCheckUtils]: 14: Hoare triple {178#(<= |f91_#t~ret0| 101)} call #t~ret1 := f91(#t~ret0); {151#true} is VALID [2020-07-10 14:44:03,698 INFO L280 TraceCheckUtils]: 15: Hoare triple {151#true} ~x := #in~x; {185#(= f91_~x |f91_#in~x|)} is VALID [2020-07-10 14:44:03,699 INFO L280 TraceCheckUtils]: 16: Hoare triple {185#(= f91_~x |f91_#in~x|)} assume ~x > 100;#res := ~x - 10; {187#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} is VALID [2020-07-10 14:44:03,700 INFO L280 TraceCheckUtils]: 17: Hoare triple {187#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} assume true; {187#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} is VALID [2020-07-10 14:44:03,701 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {187#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} {178#(<= |f91_#t~ret0| 101)} #34#return; {183#(and (<= 91 |f91_#t~ret1|) (<= |f91_#t~ret1| 91))} is VALID [2020-07-10 14:44:03,703 INFO L280 TraceCheckUtils]: 19: Hoare triple {183#(and (<= 91 |f91_#t~ret1|) (<= |f91_#t~ret1| 91))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret0;havoc #t~ret1; {184#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} is VALID [2020-07-10 14:44:03,704 INFO L280 TraceCheckUtils]: 20: Hoare triple {184#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} assume true; {184#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} is VALID [2020-07-10 14:44:03,706 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {184#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} {151#true} #30#return; {171#(and (<= |main_#t~ret3| 91) (<= 91 |main_#t~ret3|))} is VALID [2020-07-10 14:44:03,707 INFO L280 TraceCheckUtils]: 22: Hoare triple {171#(and (<= |main_#t~ret3| 91) (<= 91 |main_#t~ret3|))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~result~0 := #t~ret3;havoc #t~ret3; {172#(and (<= main_~result~0 91) (<= 91 main_~result~0))} is VALID [2020-07-10 14:44:03,708 INFO L280 TraceCheckUtils]: 23: Hoare triple {172#(and (<= main_~result~0 91) (<= 91 main_~result~0))} assume !(91 == ~result~0 || (~x~0 > 101 && ~result~0 == ~x~0 - 10)); {152#false} is VALID [2020-07-10 14:44:03,709 INFO L280 TraceCheckUtils]: 24: Hoare triple {152#false} assume !false; {152#false} is VALID [2020-07-10 14:44:03,711 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-10 14:44:03,712 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054408871] [2020-07-10 14:44:03,713 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137182718] [2020-07-10 14:44:03,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:44:03,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:03,760 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 19 conjunts are in the unsatisfiable core [2020-07-10 14:44:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:44:03,780 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:44:04,039 INFO L263 TraceCheckUtils]: 0: Hoare triple {151#true} call ULTIMATE.init(); {151#true} is VALID [2020-07-10 14:44:04,040 INFO L280 TraceCheckUtils]: 1: Hoare triple {151#true} assume true; {151#true} is VALID [2020-07-10 14:44:04,040 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {151#true} {151#true} #26#return; {151#true} is VALID [2020-07-10 14:44:04,040 INFO L263 TraceCheckUtils]: 3: Hoare triple {151#true} call #t~ret4 := main(); {151#true} is VALID [2020-07-10 14:44:04,041 INFO L280 TraceCheckUtils]: 4: Hoare triple {151#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~x~0 := #t~nondet2;havoc #t~nondet2; {151#true} is VALID [2020-07-10 14:44:04,041 INFO L263 TraceCheckUtils]: 5: Hoare triple {151#true} call #t~ret3 := f91(~x~0); {151#true} is VALID [2020-07-10 14:44:04,041 INFO L280 TraceCheckUtils]: 6: Hoare triple {151#true} ~x := #in~x; {151#true} is VALID [2020-07-10 14:44:04,042 INFO L280 TraceCheckUtils]: 7: Hoare triple {151#true} assume !(~x > 100); {173#(<= f91_~x 100)} is VALID [2020-07-10 14:44:04,043 INFO L263 TraceCheckUtils]: 8: Hoare triple {173#(<= f91_~x 100)} call #t~ret0 := f91(11 + ~x); {151#true} is VALID [2020-07-10 14:44:04,043 INFO L280 TraceCheckUtils]: 9: Hoare triple {151#true} ~x := #in~x; {218#(<= f91_~x |f91_#in~x|)} is VALID [2020-07-10 14:44:04,044 INFO L280 TraceCheckUtils]: 10: Hoare triple {218#(<= f91_~x |f91_#in~x|)} assume ~x > 100;#res := ~x - 10; {186#(<= (+ |f91_#res| 10) |f91_#in~x|)} is VALID [2020-07-10 14:44:04,045 INFO L280 TraceCheckUtils]: 11: Hoare triple {186#(<= (+ |f91_#res| 10) |f91_#in~x|)} assume true; {186#(<= (+ |f91_#res| 10) |f91_#in~x|)} is VALID [2020-07-10 14:44:04,047 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {186#(<= (+ |f91_#res| 10) |f91_#in~x|)} {173#(<= f91_~x 100)} #32#return; {178#(<= |f91_#t~ret0| 101)} is VALID [2020-07-10 14:44:04,047 INFO L280 TraceCheckUtils]: 13: Hoare triple {178#(<= |f91_#t~ret0| 101)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {178#(<= |f91_#t~ret0| 101)} is VALID [2020-07-10 14:44:04,048 INFO L263 TraceCheckUtils]: 14: Hoare triple {178#(<= |f91_#t~ret0| 101)} call #t~ret1 := f91(#t~ret0); {151#true} is VALID [2020-07-10 14:44:04,049 INFO L280 TraceCheckUtils]: 15: Hoare triple {151#true} ~x := #in~x; {218#(<= f91_~x |f91_#in~x|)} is VALID [2020-07-10 14:44:04,050 INFO L280 TraceCheckUtils]: 16: Hoare triple {218#(<= f91_~x |f91_#in~x|)} assume ~x > 100;#res := ~x - 10; {187#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} is VALID [2020-07-10 14:44:04,051 INFO L280 TraceCheckUtils]: 17: Hoare triple {187#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} assume true; {187#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} is VALID [2020-07-10 14:44:04,053 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {187#(and (<= 91 |f91_#res|) (<= (+ |f91_#res| 10) |f91_#in~x|))} {178#(<= |f91_#t~ret0| 101)} #34#return; {183#(and (<= 91 |f91_#t~ret1|) (<= |f91_#t~ret1| 91))} is VALID [2020-07-10 14:44:04,054 INFO L280 TraceCheckUtils]: 19: Hoare triple {183#(and (<= 91 |f91_#t~ret1|) (<= |f91_#t~ret1| 91))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret0;havoc #t~ret1; {184#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} is VALID [2020-07-10 14:44:04,055 INFO L280 TraceCheckUtils]: 20: Hoare triple {184#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} assume true; {184#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} is VALID [2020-07-10 14:44:04,056 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {184#(and (<= 91 |f91_#res|) (<= |f91_#res| 91))} {151#true} #30#return; {171#(and (<= |main_#t~ret3| 91) (<= 91 |main_#t~ret3|))} is VALID [2020-07-10 14:44:04,057 INFO L280 TraceCheckUtils]: 22: Hoare triple {171#(and (<= |main_#t~ret3| 91) (<= 91 |main_#t~ret3|))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647;~result~0 := #t~ret3;havoc #t~ret3; {172#(and (<= main_~result~0 91) (<= 91 main_~result~0))} is VALID [2020-07-10 14:44:04,059 INFO L280 TraceCheckUtils]: 23: Hoare triple {172#(and (<= main_~result~0 91) (<= 91 main_~result~0))} assume !(91 == ~result~0 || (~x~0 > 101 && ~result~0 == ~x~0 - 10)); {152#false} is VALID [2020-07-10 14:44:04,059 INFO L280 TraceCheckUtils]: 24: Hoare triple {152#false} assume !false; {152#false} is VALID [2020-07-10 14:44:04,061 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-10 14:44:04,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:44:04,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2020-07-10 14:44:04,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145285249] [2020-07-10 14:44:04,064 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2020-07-10 14:44:04,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:44:04,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-10 14:44:04,101 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:44:04,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-10 14:44:04,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:44:04,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-10 14:44:04,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-07-10 14:44:04,103 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 12 states. [2020-07-10 14:44:04,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:04,608 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2020-07-10 14:44:04,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 14:44:04,608 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2020-07-10 14:44:04,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:44:04,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 14:44:04,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 23 transitions. [2020-07-10 14:44:04,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 14:44:04,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 23 transitions. [2020-07-10 14:44:04,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 23 transitions. [2020-07-10 14:44:04,651 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:44:04,651 INFO L225 Difference]: With dead ends: 20 [2020-07-10 14:44:04,651 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 14:44:04,653 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2020-07-10 14:44:04,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 14:44:04,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 14:44:04,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:44:04,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 14:44:04,654 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 14:44:04,654 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 14:44:04,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:04,655 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 14:44:04,655 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 14:44:04,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:44:04,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:44:04,656 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 14:44:04,656 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 14:44:04,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:44:04,656 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 14:44:04,656 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 14:44:04,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:44:04,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:44:04,657 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:44:04,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:44:04,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 14:44:04,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 14:44:04,658 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2020-07-10 14:44:04,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:44:04,658 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 14:44:04,658 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-10 14:44:04,659 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 14:44:04,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:44:04,869 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-10 14:44:04,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 14:44:04,946 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 14:44:04,946 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 14:44:04,946 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 14:44:04,947 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 14:44:04,947 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 14:44:04,947 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 14:44:04,947 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 30) no Hoare annotation was computed. [2020-07-10 14:44:04,947 INFO L268 CegarLoopResult]: For program point L30(line 30) no Hoare annotation was computed. [2020-07-10 14:44:04,948 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 24 32) the Hoare annotation is: true [2020-07-10 14:44:04,948 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 24 32) no Hoare annotation was computed. [2020-07-10 14:44:04,948 INFO L268 CegarLoopResult]: For program point L27(lines 27 31) no Hoare annotation was computed. [2020-07-10 14:44:04,948 INFO L271 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: true [2020-07-10 14:44:04,948 INFO L268 CegarLoopResult]: For program point L26-1(line 26) no Hoare annotation was computed. [2020-07-10 14:44:04,948 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 24 32) no Hoare annotation was computed. [2020-07-10 14:44:04,949 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-10 14:44:04,949 INFO L268 CegarLoopResult]: For program point L16(lines 16 20) no Hoare annotation was computed. [2020-07-10 14:44:04,949 INFO L268 CegarLoopResult]: For program point L19-3(line 19) no Hoare annotation was computed. [2020-07-10 14:44:04,949 INFO L271 CegarLoopResult]: At program point f91ENTRY(lines 15 21) the Hoare annotation is: true [2020-07-10 14:44:04,949 INFO L268 CegarLoopResult]: For program point f91FINAL(lines 15 21) no Hoare annotation was computed. [2020-07-10 14:44:04,949 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (= f91_~x |f91_#in~x|) (<= f91_~x 100)) [2020-07-10 14:44:04,949 INFO L268 CegarLoopResult]: For program point f91EXIT(lines 15 21) no Hoare annotation was computed. [2020-07-10 14:44:04,950 INFO L268 CegarLoopResult]: For program point L19-1(line 19) no Hoare annotation was computed. [2020-07-10 14:44:04,954 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 14:44:04,955 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-10 14:44:04,955 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 14:44:04,956 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 14:44:04,956 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-10 14:44:04,956 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-10 14:44:04,956 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-10 14:44:04,956 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 14:44:04,956 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-10 14:44:04,956 WARN L170 areAnnotationChecker]: f91FINAL has no Hoare annotation [2020-07-10 14:44:04,956 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2020-07-10 14:44:04,957 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-10 14:44:04,957 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-10 14:44:04,957 WARN L170 areAnnotationChecker]: f91EXIT has no Hoare annotation [2020-07-10 14:44:04,957 WARN L170 areAnnotationChecker]: f91EXIT has no Hoare annotation [2020-07-10 14:44:04,957 WARN L170 areAnnotationChecker]: f91EXIT has no Hoare annotation [2020-07-10 14:44:04,957 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2020-07-10 14:44:04,957 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 14:44:04,958 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-10 14:44:04,958 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-10 14:44:04,958 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2020-07-10 14:44:04,958 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2020-07-10 14:44:04,958 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 14:44:04,958 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 14:44:04,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 02:44:04 BoogieIcfgContainer [2020-07-10 14:44:04,962 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 14:44:04,965 INFO L168 Benchmark]: Toolchain (without parser) took 3823.48 ms. Allocated memory was 135.3 MB in the beginning and 253.8 MB in the end (delta: 118.5 MB). Free memory was 100.2 MB in the beginning and 172.4 MB in the end (delta: -72.2 MB). Peak memory consumption was 46.3 MB. Max. memory is 7.1 GB. [2020-07-10 14:44:04,966 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 135.3 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 14:44:04,967 INFO L168 Benchmark]: CACSL2BoogieTranslator took 331.12 ms. Allocated memory is still 135.3 MB. Free memory was 99.8 MB in the beginning and 90.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2020-07-10 14:44:04,968 INFO L168 Benchmark]: Boogie Preprocessor took 32.79 ms. Allocated memory is still 135.3 MB. Free memory was 90.4 MB in the beginning and 89.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-10 14:44:04,969 INFO L168 Benchmark]: RCFGBuilder took 409.46 ms. Allocated memory was 135.3 MB in the beginning and 199.2 MB in the end (delta: 64.0 MB). Free memory was 89.0 MB in the beginning and 162.8 MB in the end (delta: -73.7 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-07-10 14:44:04,970 INFO L168 Benchmark]: TraceAbstraction took 3039.43 ms. Allocated memory was 199.2 MB in the beginning and 253.8 MB in the end (delta: 54.5 MB). Free memory was 162.1 MB in the beginning and 172.4 MB in the end (delta: -10.4 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. [2020-07-10 14:44:04,974 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 135.3 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 331.12 ms. Allocated memory is still 135.3 MB. Free memory was 99.8 MB in the beginning and 90.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.79 ms. Allocated memory is still 135.3 MB. Free memory was 90.4 MB in the beginning and 89.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 409.46 ms. Allocated memory was 135.3 MB in the beginning and 199.2 MB in the end (delta: 64.0 MB). Free memory was 89.0 MB in the beginning and 162.8 MB in the end (delta: -73.7 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3039.43 ms. Allocated memory was 199.2 MB in the beginning and 253.8 MB in the end (delta: 54.5 MB). Free memory was 162.1 MB in the beginning and 172.4 MB in the end (delta: -10.4 MB). Peak memory consumption was 44.2 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.8s, OverallIterations: 2, TraceHistogramMax: 3, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 28 SDtfs, 15 SDslu, 115 SDs, 0 SdLazy, 135 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred 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, 8 LocationsWithAnnotation, 14 PreInvPairs, 14 NumberOfFragments, 23 HoareAnnotationTreeSize, 14 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 63 NumberOfCodeBlocks, 63 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 60 ConstructedInterpolants, 0 QuantifiedInterpolants, 5016 SizeOfPredicates, 5 NumberOfNonLiveVariables, 61 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 16/24 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...