/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/ldv-regression/test28-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:25:38,710 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:25:38,713 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:25:38,730 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:25:38,730 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:25:38,732 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:25:38,733 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:25:38,735 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:25:38,737 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:25:38,738 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:25:38,739 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:25:38,740 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:25:38,740 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:25:38,741 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:25:38,742 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:25:38,744 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:25:38,744 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:25:38,745 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:25:38,747 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:25:38,749 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:25:38,751 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:25:38,752 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:25:38,753 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:25:38,754 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:25:38,756 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:25:38,756 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:25:38,756 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:25:38,758 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:25:38,758 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:25:38,759 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:25:38,759 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:25:38,760 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:25:38,761 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:25:38,762 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:25:38,763 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:25:38,763 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:25:38,764 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:25:38,764 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:25:38,764 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:25:38,765 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:25:38,766 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:25:38,767 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-08 12:25:38,783 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:25:38,783 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:25:38,785 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:25:38,785 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:25:38,785 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:25:38,785 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:25:38,786 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:25:38,786 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:25:38,786 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:25:38,786 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:25:38,786 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:25:38,787 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:25:38,787 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:25:38,787 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:25:38,787 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:25:38,787 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:25:38,788 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:25:38,788 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:25:38,788 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:25:38,788 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:25:38,789 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:25:38,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:25:38,789 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:25:38,790 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:25:38,790 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:25:38,790 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:25:38,790 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:25:38,790 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:25:38,791 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:25:38,791 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:25:39,116 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:25:39,133 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:25:39,136 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:25:39,138 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:25:39,138 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:25:39,139 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test28-2.c [2020-07-08 12:25:39,213 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f97abd3f/5e1f90d4c6e54ca7922ea454bbd8d6a3/FLAG451977a9c [2020-07-08 12:25:39,615 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:25:39,616 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test28-2.c [2020-07-08 12:25:39,624 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f97abd3f/5e1f90d4c6e54ca7922ea454bbd8d6a3/FLAG451977a9c [2020-07-08 12:25:39,992 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f97abd3f/5e1f90d4c6e54ca7922ea454bbd8d6a3 [2020-07-08 12:25:40,002 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:25:40,004 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:25:40,007 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:25:40,007 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:25:40,011 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:25:40,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:25:39" (1/1) ... [2020-07-08 12:25:40,016 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@707820b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:25:40, skipping insertion in model container [2020-07-08 12:25:40,016 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:25:39" (1/1) ... [2020-07-08 12:25:40,025 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:25:40,041 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:25:40,212 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:25:40,225 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:25:40,242 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:25:40,257 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:25:40,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:25:40 WrapperNode [2020-07-08 12:25:40,258 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:25:40,259 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:25:40,259 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:25:40,259 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:25:40,363 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:25:40" (1/1) ... [2020-07-08 12:25:40,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:25:40" (1/1) ... [2020-07-08 12:25:40,371 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:25:40" (1/1) ... [2020-07-08 12:25:40,371 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:25:40" (1/1) ... [2020-07-08 12:25:40,381 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:25:40" (1/1) ... [2020-07-08 12:25:40,384 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:25:40" (1/1) ... [2020-07-08 12:25:40,385 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:25:40" (1/1) ... [2020-07-08 12:25:40,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:25:40,387 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:25:40,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:25:40,388 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:25:40,389 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:25:40" (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-08 12:25:40,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:25:40,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:25:40,453 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:25:40,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:25:40,454 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:25:40,454 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:25:40,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 12:25:40,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 12:25:40,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 12:25:40,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 12:25:40,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:25:40,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:25:40,831 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:25:40,831 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-08 12:25:40,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:25:40 BoogieIcfgContainer [2020-07-08 12:25:40,835 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:25:40,837 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:25:40,837 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:25:40,840 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:25:40,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:25:39" (1/3) ... [2020-07-08 12:25:40,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4819f45c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:25:40, skipping insertion in model container [2020-07-08 12:25:40,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:25:40" (2/3) ... [2020-07-08 12:25:40,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4819f45c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:25:40, skipping insertion in model container [2020-07-08 12:25:40,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:25:40" (3/3) ... [2020-07-08 12:25:40,844 INFO L109 eAbstractionObserver]: Analyzing ICFG test28-2.c [2020-07-08 12:25:40,853 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:25:40,860 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:25:40,873 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:25:40,896 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:25:40,896 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:25:40,897 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:25:40,897 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:25:40,897 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:25:40,897 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:25:40,897 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:25:40,897 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:25:40,914 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-07-08 12:25:40,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-08 12:25:40,919 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:25:40,920 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:25:40,920 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:25:40,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:25:40,926 INFO L82 PathProgramCache]: Analyzing trace with hash 668850033, now seen corresponding path program 1 times [2020-07-08 12:25:40,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:25:40,936 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852289609] [2020-07-08 12:25:40,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:25:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:41,232 INFO L280 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {21#true} is VALID [2020-07-08 12:25:41,232 INFO L280 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2020-07-08 12:25:41,233 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #35#return; {21#true} is VALID [2020-07-08 12:25:41,237 INFO L263 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {28#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:25:41,238 INFO L280 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {21#true} is VALID [2020-07-08 12:25:41,238 INFO L280 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2020-07-08 12:25:41,239 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #35#return; {21#true} is VALID [2020-07-08 12:25:41,239 INFO L263 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret4 := main(); {21#true} is VALID [2020-07-08 12:25:41,240 INFO L280 TraceCheckUtils]: 5: Hoare triple {21#true} call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(8);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {21#true} is VALID [2020-07-08 12:25:41,242 INFO L280 TraceCheckUtils]: 6: Hoare triple {21#true} assume 0 != ~n~0;#t~ite1.base, #t~ite1.offset := ~#d1~0.base, ~#d1~0.offset; {26#(and (= |main_~#d1~0.base| |main_#t~ite1.base|) (= |main_#t~ite1.offset| |main_~#d1~0.offset|))} is VALID [2020-07-08 12:25:41,243 INFO L280 TraceCheckUtils]: 7: Hoare triple {26#(and (= |main_~#d1~0.base| |main_#t~ite1.base|) (= |main_#t~ite1.offset| |main_~#d1~0.offset|))} ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset;havoc #t~ite1.base, #t~ite1.offset; {27#(and (= |main_~#d1~0.offset| main_~pd~0.offset) (= |main_~#d1~0.base| main_~pd~0.base))} is VALID [2020-07-08 12:25:41,245 INFO L280 TraceCheckUtils]: 8: Hoare triple {27#(and (= |main_~#d1~0.offset| main_~pd~0.offset) (= |main_~#d1~0.base| main_~pd~0.base))} assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int(0, ~pd~0.base, 4 + ~pd~0.offset, 4); {22#false} is VALID [2020-07-08 12:25:41,245 INFO L280 TraceCheckUtils]: 9: Hoare triple {22#false} #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; {22#false} is VALID [2020-07-08 12:25:41,246 INFO L280 TraceCheckUtils]: 10: Hoare triple {22#false} assume #t~short3;call #t~mem2 := read~int(~#d2~0.base, 4 + ~#d2~0.offset, 4);#t~short3 := 0 != #t~mem2; {22#false} is VALID [2020-07-08 12:25:41,246 INFO L280 TraceCheckUtils]: 11: Hoare triple {22#false} assume #t~short3;havoc #t~mem2;havoc #t~short3; {22#false} is VALID [2020-07-08 12:25:41,246 INFO L280 TraceCheckUtils]: 12: Hoare triple {22#false} assume !false; {22#false} is VALID [2020-07-08 12:25:41,248 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-08 12:25:41,249 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852289609] [2020-07-08 12:25:41,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:25:41,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 12:25:41,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390788233] [2020-07-08 12:25:41,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-08 12:25:41,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:25:41,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:25:41,312 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-08 12:25:41,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:25:41,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:25:41,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:25:41,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:25:41,337 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 5 states. [2020-07-08 12:25:41,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:41,557 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2020-07-08 12:25:41,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 12:25:41,558 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-08 12:25:41,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:25:41,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:25:41,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2020-07-08 12:25:41,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:25:41,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2020-07-08 12:25:41,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2020-07-08 12:25:41,649 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:41,661 INFO L225 Difference]: With dead ends: 34 [2020-07-08 12:25:41,662 INFO L226 Difference]: Without dead ends: 21 [2020-07-08 12:25:41,666 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:25:41,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-08 12:25:41,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2020-07-08 12:25:41,718 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:25:41,719 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 16 states. [2020-07-08 12:25:41,720 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 16 states. [2020-07-08 12:25:41,720 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 16 states. [2020-07-08 12:25:41,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:41,725 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2020-07-08 12:25:41,725 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2020-07-08 12:25:41,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:41,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:41,726 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 21 states. [2020-07-08 12:25:41,727 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 21 states. [2020-07-08 12:25:41,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:41,731 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2020-07-08 12:25:41,731 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2020-07-08 12:25:41,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:41,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:41,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:25:41,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:25:41,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-08 12:25:41,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2020-07-08 12:25:41,737 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2020-07-08 12:25:41,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:25:41,738 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-07-08 12:25:41,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:25:41,738 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-07-08 12:25:41,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-08 12:25:41,739 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:25:41,739 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:25:41,740 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:25:41,740 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:25:41,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:25:41,741 INFO L82 PathProgramCache]: Analyzing trace with hash 667002991, now seen corresponding path program 1 times [2020-07-08 12:25:41,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:25:41,742 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508186221] [2020-07-08 12:25:41,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:25:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:41,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:41,912 INFO L280 TraceCheckUtils]: 0: Hoare triple {145#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {135#true} is VALID [2020-07-08 12:25:41,912 INFO L280 TraceCheckUtils]: 1: Hoare triple {135#true} assume true; {135#true} is VALID [2020-07-08 12:25:41,913 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {135#true} {135#true} #35#return; {135#true} is VALID [2020-07-08 12:25:41,914 INFO L263 TraceCheckUtils]: 0: Hoare triple {135#true} call ULTIMATE.init(); {145#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:25:41,914 INFO L280 TraceCheckUtils]: 1: Hoare triple {145#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {135#true} is VALID [2020-07-08 12:25:41,915 INFO L280 TraceCheckUtils]: 2: Hoare triple {135#true} assume true; {135#true} is VALID [2020-07-08 12:25:41,915 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {135#true} {135#true} #35#return; {135#true} is VALID [2020-07-08 12:25:41,915 INFO L263 TraceCheckUtils]: 4: Hoare triple {135#true} call #t~ret4 := main(); {135#true} is VALID [2020-07-08 12:25:41,917 INFO L280 TraceCheckUtils]: 5: Hoare triple {135#true} call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(8);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {140#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} is VALID [2020-07-08 12:25:41,918 INFO L280 TraceCheckUtils]: 6: Hoare triple {140#(not (= |main_~#d1~0.base| |main_~#d2~0.base|))} assume 0 != ~n~0;#t~ite1.base, #t~ite1.offset := ~#d1~0.base, ~#d1~0.offset; {141#(and (= |main_~#d1~0.base| |main_#t~ite1.base|) (not (= |main_~#d1~0.base| |main_~#d2~0.base|)))} is VALID [2020-07-08 12:25:41,919 INFO L280 TraceCheckUtils]: 7: Hoare triple {141#(and (= |main_~#d1~0.base| |main_#t~ite1.base|) (not (= |main_~#d1~0.base| |main_~#d2~0.base|)))} ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset;havoc #t~ite1.base, #t~ite1.offset; {142#(and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= |main_~#d1~0.base| main_~pd~0.base))} is VALID [2020-07-08 12:25:41,920 INFO L280 TraceCheckUtils]: 8: Hoare triple {142#(and (not (= |main_~#d1~0.base| |main_~#d2~0.base|)) (= |main_~#d1~0.base| main_~pd~0.base))} assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int(0, ~pd~0.base, ~pd~0.offset, 4); {143#(not (= main_~pd~0.base |main_~#d2~0.base|))} is VALID [2020-07-08 12:25:41,921 INFO L280 TraceCheckUtils]: 9: Hoare triple {143#(not (= main_~pd~0.base |main_~#d2~0.base|))} #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; {144#(not |main_#t~short3|)} is VALID [2020-07-08 12:25:41,922 INFO L280 TraceCheckUtils]: 10: Hoare triple {144#(not |main_#t~short3|)} assume #t~short3;call #t~mem2 := read~int(~#d2~0.base, 4 + ~#d2~0.offset, 4);#t~short3 := 0 != #t~mem2; {136#false} is VALID [2020-07-08 12:25:41,922 INFO L280 TraceCheckUtils]: 11: Hoare triple {136#false} assume #t~short3;havoc #t~mem2;havoc #t~short3; {136#false} is VALID [2020-07-08 12:25:41,923 INFO L280 TraceCheckUtils]: 12: Hoare triple {136#false} assume !false; {136#false} is VALID [2020-07-08 12:25:41,924 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-08 12:25:41,924 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508186221] [2020-07-08 12:25:41,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:25:41,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-08 12:25:41,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084913731] [2020-07-08 12:25:41,927 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-07-08 12:25:41,927 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:25:41,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 12:25:41,948 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-08 12:25:41,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 12:25:41,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:25:41,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 12:25:41,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:25:41,949 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 8 states. [2020-07-08 12:25:42,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:42,178 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-08 12:25:42,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 12:25:42,178 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-07-08 12:25:42,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:25:42,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 12:25:42,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2020-07-08 12:25:42,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 12:25:42,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2020-07-08 12:25:42,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 25 transitions. [2020-07-08 12:25:42,219 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:25:42,221 INFO L225 Difference]: With dead ends: 23 [2020-07-08 12:25:42,221 INFO L226 Difference]: Without dead ends: 14 [2020-07-08 12:25:42,222 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-07-08 12:25:42,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-08 12:25:42,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-08 12:25:42,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:25:42,232 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2020-07-08 12:25:42,232 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-08 12:25:42,232 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-08 12:25:42,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:42,234 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2020-07-08 12:25:42,234 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2020-07-08 12:25:42,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:42,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:42,235 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-08 12:25:42,235 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-08 12:25:42,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:42,237 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2020-07-08 12:25:42,237 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2020-07-08 12:25:42,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:42,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:42,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:25:42,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:25:42,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 12:25:42,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions. [2020-07-08 12:25:42,240 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 13 [2020-07-08 12:25:42,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:25:42,240 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 13 transitions. [2020-07-08 12:25:42,241 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 12:25:42,241 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2020-07-08 12:25:42,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-08 12:25:42,241 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:25:42,242 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:25:42,242 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 12:25:42,242 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:25:42,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:25:42,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1851109901, now seen corresponding path program 1 times [2020-07-08 12:25:42,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:25:42,243 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930979001] [2020-07-08 12:25:42,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:25:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:42,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:25:42,504 INFO L280 TraceCheckUtils]: 0: Hoare triple {239#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {228#true} is VALID [2020-07-08 12:25:42,504 INFO L280 TraceCheckUtils]: 1: Hoare triple {228#true} assume true; {228#true} is VALID [2020-07-08 12:25:42,505 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {228#true} {228#true} #35#return; {228#true} is VALID [2020-07-08 12:25:42,506 INFO L263 TraceCheckUtils]: 0: Hoare triple {228#true} call ULTIMATE.init(); {239#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:25:42,507 INFO L280 TraceCheckUtils]: 1: Hoare triple {239#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {228#true} is VALID [2020-07-08 12:25:42,507 INFO L280 TraceCheckUtils]: 2: Hoare triple {228#true} assume true; {228#true} is VALID [2020-07-08 12:25:42,507 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {228#true} {228#true} #35#return; {228#true} is VALID [2020-07-08 12:25:42,507 INFO L263 TraceCheckUtils]: 4: Hoare triple {228#true} call #t~ret4 := main(); {228#true} is VALID [2020-07-08 12:25:42,509 INFO L280 TraceCheckUtils]: 5: Hoare triple {228#true} call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(8);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {233#(= 0 |main_~#d2~0.offset|)} is VALID [2020-07-08 12:25:42,510 INFO L280 TraceCheckUtils]: 6: Hoare triple {233#(= 0 |main_~#d2~0.offset|)} assume !(0 != ~n~0);#t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset; {234#(and (= |main_#t~ite1.base| |main_~#d2~0.base|) (= 0 |main_~#d2~0.offset|) (= |main_#t~ite1.offset| 0))} is VALID [2020-07-08 12:25:42,511 INFO L280 TraceCheckUtils]: 7: Hoare triple {234#(and (= |main_#t~ite1.base| |main_~#d2~0.base|) (= 0 |main_~#d2~0.offset|) (= |main_#t~ite1.offset| 0))} ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset;havoc #t~ite1.base, #t~ite1.offset; {235#(and (= |main_~#d2~0.offset| main_~pd~0.offset) (= main_~pd~0.base |main_~#d2~0.base|))} is VALID [2020-07-08 12:25:42,512 INFO L280 TraceCheckUtils]: 8: Hoare triple {235#(and (= |main_~#d2~0.offset| main_~pd~0.offset) (= main_~pd~0.base |main_~#d2~0.base|))} assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int(0, ~pd~0.base, 4 + ~pd~0.offset, 4); {236#(and (= |main_~#d2~0.offset| main_~pd~0.offset) (= 0 (select (select |#memory_int| |main_~#d2~0.base|) (+ |main_~#d2~0.offset| 4))) (= main_~pd~0.base |main_~#d2~0.base|))} is VALID [2020-07-08 12:25:42,513 INFO L280 TraceCheckUtils]: 9: Hoare triple {236#(and (= |main_~#d2~0.offset| main_~pd~0.offset) (= 0 (select (select |#memory_int| |main_~#d2~0.base|) (+ |main_~#d2~0.offset| 4))) (= main_~pd~0.base |main_~#d2~0.base|))} #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; {237#(= 0 (select (select |#memory_int| |main_~#d2~0.base|) (+ |main_~#d2~0.offset| 4)))} is VALID [2020-07-08 12:25:42,514 INFO L280 TraceCheckUtils]: 10: Hoare triple {237#(= 0 (select (select |#memory_int| |main_~#d2~0.base|) (+ |main_~#d2~0.offset| 4)))} assume #t~short3;call #t~mem2 := read~int(~#d2~0.base, 4 + ~#d2~0.offset, 4);#t~short3 := 0 != #t~mem2; {238#(not |main_#t~short3|)} is VALID [2020-07-08 12:25:42,515 INFO L280 TraceCheckUtils]: 11: Hoare triple {238#(not |main_#t~short3|)} assume #t~short3;havoc #t~mem2;havoc #t~short3; {229#false} is VALID [2020-07-08 12:25:42,515 INFO L280 TraceCheckUtils]: 12: Hoare triple {229#false} assume !false; {229#false} is VALID [2020-07-08 12:25:42,516 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-08 12:25:42,517 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930979001] [2020-07-08 12:25:42,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:25:42,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-08 12:25:42,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063995490] [2020-07-08 12:25:42,518 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2020-07-08 12:25:42,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:25:42,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 12:25:42,538 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-08 12:25:42,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 12:25:42,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:25:42,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 12:25:42,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-08 12:25:42,540 INFO L87 Difference]: Start difference. First operand 14 states and 13 transitions. Second operand 9 states. [2020-07-08 12:25:42,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:42,760 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2020-07-08 12:25:42,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 12:25:42,761 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2020-07-08 12:25:42,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:25:42,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 12:25:42,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2020-07-08 12:25:42,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 12:25:42,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2020-07-08 12:25:42,765 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 13 transitions. [2020-07-08 12:25:42,790 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-08 12:25:42,791 INFO L225 Difference]: With dead ends: 14 [2020-07-08 12:25:42,791 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 12:25:42,792 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-07-08 12:25:42,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 12:25:42,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 12:25:42,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:25:42,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 12:25:42,793 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:25:42,793 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:25:42,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:42,794 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:25:42,794 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:25:42,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:42,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:42,795 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:25:42,795 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:25:42,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:25:42,796 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:25:42,796 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:25:42,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:42,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:25:42,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:25:42,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:25:42,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 12:25:42,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 12:25:42,798 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2020-07-08 12:25:42,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:25:42,798 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 12:25:42,798 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 12:25:42,799 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:25:42,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:25:42,799 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 12:25:42,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 12:25:42,858 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-08 12:25:42,858 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-07-08 12:25:42,858 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:25:42,859 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:25:42,859 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 12:25:42,859 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 12:25:42,859 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-08 12:25:42,860 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 10 28) no Hoare annotation was computed. [2020-07-08 12:25:42,860 INFO L264 CegarLoopResult]: At program point L21(lines 11 28) the Hoare annotation is: false [2020-07-08 12:25:42,860 INFO L268 CegarLoopResult]: For program point L15(lines 15 19) no Hoare annotation was computed. [2020-07-08 12:25:42,860 INFO L268 CegarLoopResult]: For program point L15-2(lines 15 19) no Hoare annotation was computed. [2020-07-08 12:25:42,860 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 10 28) no Hoare annotation was computed. [2020-07-08 12:25:42,861 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 26) no Hoare annotation was computed. [2020-07-08 12:25:42,861 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 10 28) the Hoare annotation is: (= |#valid| |old(#valid)|) [2020-07-08 12:25:42,861 INFO L268 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2020-07-08 12:25:42,862 INFO L268 CegarLoopResult]: For program point L20-2(lines 20 22) no Hoare annotation was computed. [2020-07-08 12:25:42,862 INFO L268 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2020-07-08 12:25:42,862 INFO L268 CegarLoopResult]: For program point L14-2(line 14) no Hoare annotation was computed. [2020-07-08 12:25:42,869 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:25:42,871 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-08 12:25:42,871 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:25:42,871 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:25:42,872 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-08 12:25:42,873 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-08 12:25:42,873 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:25:42,873 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:25:42,873 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2020-07-08 12:25:42,873 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-08 12:25:42,874 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-08 12:25:42,874 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2020-07-08 12:25:42,874 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-08 12:25:42,874 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-08 12:25:42,874 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2020-07-08 12:25:42,875 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2020-07-08 12:25:42,875 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2020-07-08 12:25:42,875 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:25:42,875 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:25:42,876 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:25:42,876 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 12:25:42,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:25:42 BoogieIcfgContainer [2020-07-08 12:25:42,885 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:25:42,898 INFO L168 Benchmark]: Toolchain (without parser) took 2884.96 ms. Allocated memory was 143.1 MB in the beginning and 229.1 MB in the end (delta: 86.0 MB). Free memory was 101.0 MB in the beginning and 75.3 MB in the end (delta: 25.7 MB). Peak memory consumption was 111.6 MB. Max. memory is 7.1 GB. [2020-07-08 12:25:42,900 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 143.1 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 12:25:42,902 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.62 ms. Allocated memory is still 143.1 MB. Free memory was 100.8 MB in the beginning and 90.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-08 12:25:42,903 INFO L168 Benchmark]: Boogie Preprocessor took 128.30 ms. Allocated memory was 143.1 MB in the beginning and 200.3 MB in the end (delta: 57.1 MB). Free memory was 90.6 MB in the beginning and 178.2 MB in the end (delta: -87.6 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-08 12:25:42,905 INFO L168 Benchmark]: RCFGBuilder took 448.27 ms. Allocated memory is still 200.3 MB. Free memory was 177.5 MB in the beginning and 159.9 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 7.1 GB. [2020-07-08 12:25:42,913 INFO L168 Benchmark]: TraceAbstraction took 2048.96 ms. Allocated memory was 200.3 MB in the beginning and 229.1 MB in the end (delta: 28.8 MB). Free memory was 159.2 MB in the beginning and 75.3 MB in the end (delta: 83.9 MB). Peak memory consumption was 112.8 MB. Max. memory is 7.1 GB. [2020-07-08 12:25:42,922 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.24 ms. Allocated memory is still 143.1 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 251.62 ms. Allocated memory is still 143.1 MB. Free memory was 100.8 MB in the beginning and 90.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 128.30 ms. Allocated memory was 143.1 MB in the beginning and 200.3 MB in the end (delta: 57.1 MB). Free memory was 90.6 MB in the beginning and 178.2 MB in the end (delta: -87.6 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 448.27 ms. Allocated memory is still 200.3 MB. Free memory was 177.5 MB in the beginning and 159.9 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2048.96 ms. Allocated memory was 200.3 MB in the beginning and 229.1 MB in the end (delta: 28.8 MB). Free memory was 159.2 MB in the beginning and 75.3 MB in the end (delta: 83.9 MB). Peak memory consumption was 112.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 26]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.9s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 24 SDtfs, 32 SDslu, 68 SDs, 0 SdLazy, 125 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred 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, 3 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 5 NumberOfFragments, 16 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 7 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 36 ConstructedInterpolants, 0 QuantifiedInterpolants, 1644 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 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...