java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/memsafety/20051113-1.c_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 01:31:36,169 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 01:31:36,171 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 01:31:36,185 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 01:31:36,186 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 01:31:36,187 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 01:31:36,188 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 01:31:36,190 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 01:31:36,192 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 01:31:36,192 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 01:31:36,193 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 01:31:36,194 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 01:31:36,195 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 01:31:36,196 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 01:31:36,197 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 01:31:36,199 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 01:31:36,201 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 01:31:36,203 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 01:31:36,205 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 01:31:36,206 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 01:31:36,208 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 01:31:36,209 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 01:31:36,209 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 01:31:36,210 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 01:31:36,211 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 01:31:36,212 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 01:31:36,212 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 01:31:36,213 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 01:31:36,213 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 01:31:36,213 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 01:31:36,214 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 01:31:36,214 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 01:31:36,222 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 01:31:36,223 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 01:31:36,224 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 01:31:36,224 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 01:31:36,224 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 01:31:36,224 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 01:31:36,224 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 01:31:36,225 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 01:31:36,225 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 01:31:36,225 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 01:31:36,225 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 01:31:36,225 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 01:31:36,225 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 01:31:36,225 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 01:31:36,226 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 01:31:36,226 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 01:31:36,226 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 01:31:36,226 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 01:31:36,226 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 01:31:36,226 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 01:31:36,226 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 01:31:36,226 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 01:31:36,227 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 01:31:36,227 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 01:31:36,227 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 01:31:36,227 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 01:31:36,228 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 01:31:36,228 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 01:31:36,228 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 01:31:36,228 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 01:31:36,228 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 01:31:36,228 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 01:31:36,229 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 01:31:36,229 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 01:31:36,261 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 01:31:36,273 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 01:31:36,276 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 01:31:36,278 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 01:31:36,278 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 01:31:36,279 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/20051113-1.c_false-valid-memtrack.i [2018-01-30 01:31:36,442 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 01:31:36,448 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-30 01:31:36,449 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 01:31:36,449 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 01:31:36,454 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 01:31:36,454 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:31:36" (1/1) ... [2018-01-30 01:31:36,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1142a270 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:31:36, skipping insertion in model container [2018-01-30 01:31:36,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:31:36" (1/1) ... [2018-01-30 01:31:36,473 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:31:36,516 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:31:36,634 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:31:36,653 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:31:36,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:31:36 WrapperNode [2018-01-30 01:31:36,663 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 01:31:36,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 01:31:36,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 01:31:36,665 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 01:31:36,681 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:31:36" (1/1) ... [2018-01-30 01:31:36,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:31:36" (1/1) ... [2018-01-30 01:31:36,694 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:31:36" (1/1) ... [2018-01-30 01:31:36,694 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:31:36" (1/1) ... [2018-01-30 01:31:36,700 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:31:36" (1/1) ... [2018-01-30 01:31:36,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:31:36" (1/1) ... [2018-01-30 01:31:36,705 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:31:36" (1/1) ... [2018-01-30 01:31:36,706 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 01:31:36,707 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 01:31:36,707 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 01:31:36,707 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 01:31:36,708 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:31:36" (1/1) ... No working directory specified, using /storage/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 [2018-01-30 01:31:36,758 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 01:31:36,758 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 01:31:36,758 INFO L136 BoogieDeclarations]: Found implementation of procedure Sum [2018-01-30 01:31:36,759 INFO L136 BoogieDeclarations]: Found implementation of procedure Sum2 [2018-01-30 01:31:36,759 INFO L136 BoogieDeclarations]: Found implementation of procedure dummy_abort [2018-01-30 01:31:36,759 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 01:31:36,759 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-30 01:31:36,759 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-30 01:31:36,759 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 01:31:36,759 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 01:31:36,759 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 01:31:36,759 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-30 01:31:36,759 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-30 01:31:36,760 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-30 01:31:36,760 INFO L128 BoogieDeclarations]: Found specification of procedure Sum [2018-01-30 01:31:36,760 INFO L128 BoogieDeclarations]: Found specification of procedure Sum2 [2018-01-30 01:31:36,760 INFO L128 BoogieDeclarations]: Found specification of procedure dummy_abort [2018-01-30 01:31:36,760 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 01:31:36,760 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 01:31:36,760 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 01:31:36,910 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-30 01:31:37,112 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 01:31:37,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:31:37 BoogieIcfgContainer [2018-01-30 01:31:37,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 01:31:37,151 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-30 01:31:37,151 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-30 01:31:37,152 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-30 01:31:37,155 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:31:37" (1/1) ... [2018-01-30 01:31:37,161 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-30 01:31:37,162 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-30 01:31:37,162 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-30 01:31:37,213 INFO L162 apSepIcfgTransformer]: finished StoreIndexFreezer, created 18 freeze vars and freeze var literals (each corresponds to one heap write) [2018-01-30 01:31:37,263 INFO L221 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-30 01:31:37,314 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-30 01:31:46,200 INFO L311 AbstractInterpreter]: Visited 119 different actions 306 times. Merged at 67 different actions 103 times. Never widened. Found 23 fixpoints after 11 different actions. Largest state had 74 variables. [2018-01-30 01:31:46,202 INFO L229 apSepIcfgTransformer]: finished equality analysis [2018-01-30 01:31:46,213 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 12 [2018-01-30 01:31:46,214 INFO L241 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-30 01:31:46,214 INFO L242 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-30 01:31:46,215 INFO L244 apSepIcfgTransformer]: select infos: Set: ((select |v_#memory_int_22| v_main_~p~9.base_23), at (SUMMARY for call write~int(4311810305, ~p~9.base, ~p~9.offset + 4 + 60 + 0 + 14, 8); srcloc: L678)) ((select |v_#memory_int_20| v_main_~p~9.base_20), at (SUMMARY for call write~int(999, ~p~9.base, ~p~9.offset + 4 + 30 + 0 + 14, 8); srcloc: L677)) ((select |v_#memory_int_10| v_main_~p~9.base_5), at (SUMMARY for call write~int(3, ~p~9.base, ~p~9.offset + 0, 4); srcloc: L673)) ((select (select |v_#memory_int_5| v_Sum_~instrs.base_4) v_Sum_~instrs.offset_3), at (SUMMARY for call #t~mem4 := read~int(~instrs.base, ~instrs.offset + 0, 4); srcloc: L652')) ((select |v_#memory_int_4| |v_#Ultimate.C_memset_#ptr.base_3|), at (#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr21 * 1 := #value];)) ((select (select |v_#memory_int_1| v_Sum2_~instrs.base_2) v_Sum2_~instrs.offset_2), at (SUMMARY for call #t~mem7 := read~int(~instrs.base, ~instrs.offset + 0, 4); srcloc: L662')) ((select |v_#memory_int_18| v_main_~p~9.base_17), at (SUMMARY for call write~int(555, ~p~9.base, ~p~9.offset + 4 + 0 + 0 + 14, 8); srcloc: L676)) ((select |v_#memory_int_12| v_main_~p~9.base_8), at (SUMMARY for call write~int(555, ~p~9.base, ~p~9.offset + 4 + 0 + 0 + 6, 8); srcloc: L673')) ((select |v_#memory_int_14| v_main_~p~9.base_11), at (SUMMARY for call write~int(999, ~p~9.base, ~p~9.offset + 4 + 30 + 0 + 6, 8); srcloc: L674)) ((select |v_#memory_int_16| v_main_~p~9.base_14), at (SUMMARY for call write~int(4311810305, ~p~9.base, ~p~9.offset + 4 + 60 + 0 + 6, 8); srcloc: L675)) ((select (select |v_#memory_int_6| v_Sum_~instrs.base_7) (+ (* 30 v_Sum_~i~3_8) v_Sum_~instrs.offset_5 10)), at (SUMMARY for call #t~mem5 := read~int(~instrs.base, ~instrs.offset + 4 + ~i~3 * 30 + 0 + 6, 8); srcloc: L653)) ((select (select |v_#memory_int_2| v_Sum2_~instrs.base_5) (+ (* 30 v_Sum2_~i~6_5) v_Sum2_~instrs.offset_4 18)), at (SUMMARY for call #t~mem8 := read~int(~instrs.base, ~instrs.offset + 4 + ~i~6 * 30 + 0 + 14, 8); srcloc: L663)) [2018-01-30 01:31:46,237 INFO L547 PartitionManager]: partitioning result: [2018-01-30 01:31:46,238 INFO L552 PartitionManager]: location blocks for array group [#memory_int] [2018-01-30 01:31:46,238 INFO L561 PartitionManager]: at dimension 0 [2018-01-30 01:31:46,238 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 9 [2018-01-30 01:31:46,238 INFO L563 PartitionManager]: # location blocks :3 [2018-01-30 01:31:46,239 INFO L561 PartitionManager]: at dimension 1 [2018-01-30 01:31:46,239 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 8 [2018-01-30 01:31:46,239 INFO L563 PartitionManager]: # location blocks :1 [2018-01-30 01:31:46,240 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-30 01:31:46,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 01:31:46 BasicIcfg [2018-01-30 01:31:46,263 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-30 01:31:46,264 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 01:31:46,264 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 01:31:46,337 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 01:31:46,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 01:31:36" (1/4) ... [2018-01-30 01:31:46,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42aba10a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:31:46, skipping insertion in model container [2018-01-30 01:31:46,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:31:36" (2/4) ... [2018-01-30 01:31:46,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42aba10a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:31:46, skipping insertion in model container [2018-01-30 01:31:46,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:31:37" (3/4) ... [2018-01-30 01:31:46,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42aba10a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 01:31:46, skipping insertion in model container [2018-01-30 01:31:46,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 01:31:46" (4/4) ... [2018-01-30 01:31:46,341 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-30 01:31:46,350 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 01:31:46,358 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 25 error locations. [2018-01-30 01:31:46,388 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 01:31:46,388 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 01:31:46,388 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 01:31:46,388 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 01:31:46,389 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 01:31:46,389 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 01:31:46,389 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 01:31:46,389 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 01:31:46,389 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 01:31:46,401 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states. [2018-01-30 01:31:46,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-01-30 01:31:46,405 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:31:46,406 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-01-30 01:31:46,406 INFO L371 AbstractCegarLoop]: === Iteration 1 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-30 01:31:46,409 INFO L82 PathProgramCache]: Analyzing trace with hash 484023432, now seen corresponding path program 1 times [2018-01-30 01:31:46,410 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:31:46,411 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:31:46,449 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:31:46,449 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:31:46,449 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:31:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:31:46,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:31:46,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:31:46,556 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:31:46,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:31:46,558 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:31:46,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:31:46,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:31:46,568 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 4 states. [2018-01-30 01:31:46,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:31:46,756 INFO L93 Difference]: Finished difference Result 149 states and 171 transitions. [2018-01-30 01:31:46,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:31:46,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-01-30 01:31:46,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:31:46,768 INFO L225 Difference]: With dead ends: 149 [2018-01-30 01:31:46,768 INFO L226 Difference]: Without dead ends: 94 [2018-01-30 01:31:46,771 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:31:46,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-30 01:31:46,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-01-30 01:31:46,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-30 01:31:46,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2018-01-30 01:31:46,808 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 5 [2018-01-30 01:31:46,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:31:46,809 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2018-01-30 01:31:46,809 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:31:46,809 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2018-01-30 01:31:46,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-01-30 01:31:46,809 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:31:46,809 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-01-30 01:31:46,810 INFO L371 AbstractCegarLoop]: === Iteration 2 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-30 01:31:46,810 INFO L82 PathProgramCache]: Analyzing trace with hash 484023434, now seen corresponding path program 1 times [2018-01-30 01:31:46,810 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:31:46,810 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:31:46,811 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:31:46,811 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:31:46,811 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:31:46,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:31:46,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:31:46,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:31:46,940 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:31:46,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:31:46,942 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:31:46,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:31:46,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:31:46,942 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand 4 states. [2018-01-30 01:31:47,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:31:47,085 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2018-01-30 01:31:47,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:31:47,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-01-30 01:31:47,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:31:47,087 INFO L225 Difference]: With dead ends: 94 [2018-01-30 01:31:47,087 INFO L226 Difference]: Without dead ends: 86 [2018-01-30 01:31:47,088 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:31:47,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-30 01:31:47,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-01-30 01:31:47,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-30 01:31:47,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2018-01-30 01:31:47,098 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 5 [2018-01-30 01:31:47,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:31:47,098 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 97 transitions. [2018-01-30 01:31:47,099 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:31:47,099 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2018-01-30 01:31:47,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-30 01:31:47,099 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:31:47,099 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:31:47,100 INFO L371 AbstractCegarLoop]: === Iteration 3 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-30 01:31:47,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1396048431, now seen corresponding path program 1 times [2018-01-30 01:31:47,100 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:31:47,100 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:31:47,101 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:31:47,101 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:31:47,101 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:31:47,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:31:47,116 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:31:47,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:31:47,166 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:31:47,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:31:47,166 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:31:47,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:31:47,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:31:47,167 INFO L87 Difference]: Start difference. First operand 86 states and 97 transitions. Second operand 5 states. [2018-01-30 01:31:47,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:31:47,296 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2018-01-30 01:31:47,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 01:31:47,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-30 01:31:47,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:31:47,297 INFO L225 Difference]: With dead ends: 88 [2018-01-30 01:31:47,298 INFO L226 Difference]: Without dead ends: 86 [2018-01-30 01:31:47,298 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:31:47,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-30 01:31:47,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-01-30 01:31:47,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-30 01:31:47,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2018-01-30 01:31:47,307 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 20 [2018-01-30 01:31:47,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:31:47,307 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2018-01-30 01:31:47,308 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 01:31:47,308 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2018-01-30 01:31:47,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-30 01:31:47,309 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:31:47,309 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:31:47,309 INFO L371 AbstractCegarLoop]: === Iteration 4 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-30 01:31:47,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1396048429, now seen corresponding path program 1 times [2018-01-30 01:31:47,309 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:31:47,309 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:31:47,310 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:31:47,310 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:31:47,310 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:31:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:31:47,330 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:31:47,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:31:47,534 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:31:47,534 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 01:31:47,534 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 01:31:47,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 01:31:47,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-30 01:31:47,535 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand 7 states. [2018-01-30 01:31:47,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:31:47,730 INFO L93 Difference]: Finished difference Result 124 states and 145 transitions. [2018-01-30 01:31:47,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 01:31:47,731 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-01-30 01:31:47,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:31:47,732 INFO L225 Difference]: With dead ends: 124 [2018-01-30 01:31:47,732 INFO L226 Difference]: Without dead ends: 123 [2018-01-30 01:31:47,733 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-30 01:31:47,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-30 01:31:47,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 111. [2018-01-30 01:31:47,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-30 01:31:47,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2018-01-30 01:31:47,746 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 20 [2018-01-30 01:31:47,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:31:47,747 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2018-01-30 01:31:47,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 01:31:47,747 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2018-01-30 01:31:47,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-30 01:31:47,748 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:31:47,748 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:31:47,749 INFO L371 AbstractCegarLoop]: === Iteration 5 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-30 01:31:47,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1473196916, now seen corresponding path program 1 times [2018-01-30 01:31:47,749 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:31:47,749 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:31:47,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:31:47,750 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:31:47,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:31:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:31:47,767 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:31:47,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:31:47,812 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:31:47,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:31:47,813 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:31:47,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:31:47,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:31:47,814 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand 5 states. [2018-01-30 01:31:47,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:31:47,949 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2018-01-30 01:31:47,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 01:31:47,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-01-30 01:31:47,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:31:47,952 INFO L225 Difference]: With dead ends: 111 [2018-01-30 01:31:47,953 INFO L226 Difference]: Without dead ends: 109 [2018-01-30 01:31:47,953 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:31:47,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-30 01:31:47,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-01-30 01:31:47,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-30 01:31:47,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 123 transitions. [2018-01-30 01:31:47,965 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 123 transitions. Word has length 23 [2018-01-30 01:31:47,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:31:47,966 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 123 transitions. [2018-01-30 01:31:47,966 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 01:31:47,966 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2018-01-30 01:31:47,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-30 01:31:47,967 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:31:47,967 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:31:47,967 INFO L371 AbstractCegarLoop]: === Iteration 6 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-30 01:31:47,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1473196918, now seen corresponding path program 1 times [2018-01-30 01:31:47,968 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:31:47,968 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:31:47,969 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:31:47,969 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:31:47,969 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:31:47,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:31:47,984 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:31:48,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:31:48,130 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:31:48,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 01:31:48,130 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 01:31:48,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 01:31:48,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-30 01:31:48,131 INFO L87 Difference]: Start difference. First operand 109 states and 123 transitions. Second operand 7 states. [2018-01-30 01:31:48,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:31:48,315 INFO L93 Difference]: Finished difference Result 140 states and 162 transitions. [2018-01-30 01:31:48,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 01:31:48,316 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-01-30 01:31:48,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:31:48,317 INFO L225 Difference]: With dead ends: 140 [2018-01-30 01:31:48,317 INFO L226 Difference]: Without dead ends: 139 [2018-01-30 01:31:48,317 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-30 01:31:48,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-30 01:31:48,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 132. [2018-01-30 01:31:48,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-30 01:31:48,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 152 transitions. [2018-01-30 01:31:48,328 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 152 transitions. Word has length 23 [2018-01-30 01:31:48,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:31:48,328 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 152 transitions. [2018-01-30 01:31:48,328 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 01:31:48,329 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 152 transitions. [2018-01-30 01:31:48,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-30 01:31:48,330 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:31:48,330 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:31:48,330 INFO L371 AbstractCegarLoop]: === Iteration 7 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-30 01:31:48,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1509909318, now seen corresponding path program 1 times [2018-01-30 01:31:48,331 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:31:48,331 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:31:48,331 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:31:48,332 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:31:48,332 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:31:48,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:31:48,350 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:31:48,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:31:48,568 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:31:48,568 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 01:31:48,568 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 01:31:48,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 01:31:48,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-30 01:31:48,569 INFO L87 Difference]: Start difference. First operand 132 states and 152 transitions. Second operand 9 states. [2018-01-30 01:31:48,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:31:48,802 INFO L93 Difference]: Finished difference Result 153 states and 176 transitions. [2018-01-30 01:31:48,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 01:31:48,803 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-01-30 01:31:48,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:31:48,804 INFO L225 Difference]: With dead ends: 153 [2018-01-30 01:31:48,804 INFO L226 Difference]: Without dead ends: 152 [2018-01-30 01:31:48,804 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-01-30 01:31:48,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-30 01:31:48,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 137. [2018-01-30 01:31:48,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-01-30 01:31:48,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 158 transitions. [2018-01-30 01:31:48,813 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 158 transitions. Word has length 23 [2018-01-30 01:31:48,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:31:48,814 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 158 transitions. [2018-01-30 01:31:48,814 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 01:31:48,814 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 158 transitions. [2018-01-30 01:31:48,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-30 01:31:48,815 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:31:48,815 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:31:48,815 INFO L371 AbstractCegarLoop]: === Iteration 8 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-30 01:31:48,816 INFO L82 PathProgramCache]: Analyzing trace with hash -360997084, now seen corresponding path program 1 times [2018-01-30 01:31:48,816 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:31:48,816 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:31:48,816 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:31:48,817 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:31:48,817 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:31:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-30 01:31:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-30 01:31:48,862 INFO L409 BasicCegarLoop]: Counterexample might be feasible [2018-01-30 01:31:48,865 INFO L84 mationBacktranslator]: Skipped ATE [477] [477] ULTIMATE.startENTRY-->L1: Formula: true InVars {} OutVars{#NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, #valid=|v_#valid_32|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] [2018-01-30 01:31:48,866 INFO L84 mationBacktranslator]: Skipped ATE [483] [483] L1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-30 01:31:48,866 INFO L84 mationBacktranslator]: Skipped ATE [489] [489] mainENTRY-->L671: Formula: (and (not (= |v_main_#t~malloc9.base_1| 0)) (= |v_#valid_11| (store |v_#valid_12| |v_main_#t~malloc9.base_1| 1)) (= 0 (select |v_#valid_12| |v_main_#t~malloc9.base_1|)) (= |v_#length_10| (store |v_#length_11| |v_main_#t~malloc9.base_1| 94)) (= |v_main_#t~malloc9.offset_1| 0)) InVars {#length=|v_#length_11|, #valid=|v_#valid_12|} OutVars{main_#t~malloc9.offset=|v_main_#t~malloc9.offset_1|, #length=|v_#length_10|, main_#t~malloc9.base=|v_main_#t~malloc9.base_1|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[main_#t~malloc9.base, #valid, main_#t~malloc9.offset, #length] [2018-01-30 01:31:48,866 INFO L84 mationBacktranslator]: Skipped ATE [493] [493] L671-->L672: Formula: (and (= v_main_~p~9.offset_1 |v_main_#t~malloc9.offset_2|) (= v_main_~p~9.base_1 |v_main_#t~malloc9.base_2|)) InVars {main_#t~malloc9.offset=|v_main_#t~malloc9.offset_2|, main_#t~malloc9.base=|v_main_#t~malloc9.base_2|} OutVars{main_~p~9.base=v_main_~p~9.base_1, main_#t~malloc9.offset=|v_main_#t~malloc9.offset_2|, main_#t~malloc9.base=|v_main_#t~malloc9.base_2|, main_~p~9.offset=v_main_~p~9.offset_1} AuxVars[] AssignedVars[main_~p~9.offset, main_~p~9.base] [2018-01-30 01:31:48,866 INFO L84 mationBacktranslator]: Skipped ATE [497] [497] L672-->L672': Formula: (and (<= (+ v_main_~p~9.offset_2 94) (select |v_#length_12| v_main_~p~9.base_2)) (= v_main_~p~9.base_2 |v_main_#t~memset10.base_1|) (<= 0 v_main_~p~9.offset_2) (= 1 (select |v_#valid_13| v_main_~p~9.base_2)) (= |v_main_#t~memset10.offset_1| v_main_~p~9.offset_2)) InVars {main_~p~9.base=v_main_~p~9.base_2, #length=|v_#length_12|, main_~p~9.offset=v_main_~p~9.offset_2, #valid=|v_#valid_13|} OutVars{main_#t~memset10.offset=|v_main_#t~memset10.offset_1|, main_~p~9.offset=v_main_~p~9.offset_2, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, main_~p~9.base=v_main_~p~9.base_2, #length=|v_#length_12|, main_#t~memset10.base=|v_main_#t~memset10.base_1|} AuxVars[] AssignedVars[main_#t~memset10.offset, #memory_int, main_#t~memset10.base] [2018-01-30 01:31:48,866 INFO L84 mationBacktranslator]: Skipped ATE [505] [505] L672'-->L673: Formula: true InVars {} OutVars{main_#t~memset10.base=|v_main_#t~memset10.base_2|, main_#t~memset10.offset=|v_main_#t~memset10.offset_2|} AuxVars[] AssignedVars[main_#t~memset10.offset, main_#t~memset10.base] [2018-01-30 01:31:48,866 INFO L84 mationBacktranslator]: Skipped ATE [509] [509] L673-->L673': Formula: (and (= 1 (select |v_#valid_15| v_main_~p~9.base_5)) (<= 0 v_main_~p~9.offset_4) (<= (+ v_main_~p~9.offset_4 4) (select |v_#length_14| v_main_~p~9.base_5)) (and (= |v_#memory_int_part_locs_79_locs_28_1| (store |v_#memory_int_part_locs_79_locs_28_2| v_main_~p~9.base_5 (store (select |v_#memory_int_part_locs_30_locs_28_2| v_main_~p~9.base_5) v_main_~p~9.offset_4 3))) (= |v_#memory_int_part_locs_41_locs_28_1| |v_#memory_int_part_locs_41_locs_28_2|) (= |v_#memory_int_part_locs_30_locs_28_1| |v_#memory_int_part_locs_30_locs_28_2|))) InVars {#memory_int_part_locs_30_locs_28=|v_#memory_int_part_locs_30_locs_28_2|, #memory_int_part_locs_41_locs_28=|v_#memory_int_part_locs_41_locs_28_2|, main_~p~9.offset=v_main_~p~9.offset_4, #valid=|v_#valid_15|, main_~p~9.base=v_main_~p~9.base_5, #length=|v_#length_14|, #memory_int_part_locs_79_locs_28=|v_#memory_int_part_locs_79_locs_28_2|} OutVars{#memory_int_part_locs_30_locs_28=|v_#memory_int_part_locs_30_locs_28_1|, #memory_int_part_locs_41_locs_28=|v_#memory_int_part_locs_41_locs_28_1|, main_~p~9.offset=v_main_~p~9.offset_4, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_9|, main_~p~9.base=v_main_~p~9.base_5, #length=|v_#length_14|, #memory_int_part_locs_79_locs_28=|v_#memory_int_part_locs_79_locs_28_1|} AuxVars[] AssignedVars[#memory_int_part_locs_30_locs_28, #memory_int_part_locs_41_locs_28, #memory_int, #memory_int_part_locs_79_locs_28] [2018-01-30 01:31:48,866 INFO L84 mationBacktranslator]: Skipped ATE [517] [517] L673'-->L674: Formula: (let ((.cse0 (+ v_main_~p~9.offset_6 10))) (and (and (= (store |v_#memory_int_part_locs_79_locs_28_3| v_main_~p~9.base_8 (store (select |v_#memory_int_part_locs_79_locs_28_3| v_main_~p~9.base_8) .cse0 555)) |v_#memory_int_part_locs_79_locs_28_4|) (= |v_#memory_int_part_locs_30_locs_28_3| |v_#memory_int_part_locs_30_locs_28_4|) (= |v_#memory_int_part_locs_41_locs_28_3| |v_#memory_int_part_locs_41_locs_28_4|)) (<= 0 .cse0) (<= (+ v_main_~p~9.offset_6 18) (select |v_#length_16| v_main_~p~9.base_8)) (= 1 (select |v_#valid_17| v_main_~p~9.base_8)))) InVars {#memory_int_part_locs_30_locs_28=|v_#memory_int_part_locs_30_locs_28_3|, #memory_int_part_locs_41_locs_28=|v_#memory_int_part_locs_41_locs_28_3|, main_~p~9.offset=v_main_~p~9.offset_6, #valid=|v_#valid_17|, main_~p~9.base=v_main_~p~9.base_8, #length=|v_#length_16|, #memory_int_part_locs_79_locs_28=|v_#memory_int_part_locs_79_locs_28_3|} OutVars{#memory_int_part_locs_30_locs_28=|v_#memory_int_part_locs_30_locs_28_4|, #memory_int_part_locs_41_locs_28=|v_#memory_int_part_locs_41_locs_28_4|, main_~p~9.offset=v_main_~p~9.offset_6, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_11|, main_~p~9.base=v_main_~p~9.base_8, #length=|v_#length_16|, #memory_int_part_locs_79_locs_28=|v_#memory_int_part_locs_79_locs_28_4|} AuxVars[] AssignedVars[#memory_int_part_locs_30_locs_28, #memory_int_part_locs_41_locs_28, #memory_int, #memory_int_part_locs_79_locs_28] [2018-01-30 01:31:48,866 INFO L84 mationBacktranslator]: Skipped ATE [525] [525] L674-->L675: Formula: (let ((.cse0 (+ v_main_~p~9.offset_8 40))) (and (<= (+ v_main_~p~9.offset_8 48) (select |v_#length_18| v_main_~p~9.base_11)) (<= 0 .cse0) (= 1 (select |v_#valid_19| v_main_~p~9.base_11)) (and (= |v_#memory_int_part_locs_30_locs_28_5| |v_#memory_int_part_locs_30_locs_28_6|) (= (store |v_#memory_int_part_locs_79_locs_28_5| v_main_~p~9.base_11 (store (select |v_#memory_int_part_locs_79_locs_28_5| v_main_~p~9.base_11) .cse0 999)) |v_#memory_int_part_locs_79_locs_28_6|) (= |v_#memory_int_part_locs_41_locs_28_5| |v_#memory_int_part_locs_41_locs_28_6|)))) InVars {#memory_int_part_locs_30_locs_28=|v_#memory_int_part_locs_30_locs_28_5|, #memory_int_part_locs_41_locs_28=|v_#memory_int_part_locs_41_locs_28_5|, main_~p~9.offset=v_main_~p~9.offset_8, #valid=|v_#valid_19|, main_~p~9.base=v_main_~p~9.base_11, #length=|v_#length_18|, #memory_int_part_locs_79_locs_28=|v_#memory_int_part_locs_79_locs_28_5|} OutVars{#memory_int_part_locs_30_locs_28=|v_#memory_int_part_locs_30_locs_28_6|, #memory_int_part_locs_41_locs_28=|v_#memory_int_part_locs_41_locs_28_6|, main_~p~9.offset=v_main_~p~9.offset_8, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_13|, main_~p~9.base=v_main_~p~9.base_11, #length=|v_#length_18|, #memory_int_part_locs_79_locs_28=|v_#memory_int_part_locs_79_locs_28_6|} AuxVars[] AssignedVars[#memory_int_part_locs_30_locs_28, #memory_int_part_locs_41_locs_28, #memory_int, #memory_int_part_locs_79_locs_28] [2018-01-30 01:31:48,867 INFO L84 mationBacktranslator]: Skipped ATE [535] [535] L675-->L676: Formula: (let ((.cse0 (+ v_main_~p~9.offset_10 70))) (and (<= (+ v_main_~p~9.offset_10 78) (select |v_#length_20| v_main_~p~9.base_14)) (= (select |v_#valid_21| v_main_~p~9.base_14) 1) (and (= (store |v_#memory_int_part_locs_79_locs_28_7| v_main_~p~9.base_14 (store (select |v_#memory_int_part_locs_79_locs_28_7| v_main_~p~9.base_14) .cse0 4311810305)) |v_#memory_int_part_locs_79_locs_28_8|) (= |v_#memory_int_part_locs_30_locs_28_7| |v_#memory_int_part_locs_30_locs_28_8|) (= |v_#memory_int_part_locs_41_locs_28_7| |v_#memory_int_part_locs_41_locs_28_8|)) (<= 0 .cse0))) InVars {#memory_int_part_locs_30_locs_28=|v_#memory_int_part_locs_30_locs_28_7|, #memory_int_part_locs_41_locs_28=|v_#memory_int_part_locs_41_locs_28_7|, main_~p~9.offset=v_main_~p~9.offset_10, #valid=|v_#valid_21|, main_~p~9.base=v_main_~p~9.base_14, #length=|v_#length_20|, #memory_int_part_locs_79_locs_28=|v_#memory_int_part_locs_79_locs_28_7|} OutVars{#memory_int_part_locs_30_locs_28=|v_#memory_int_part_locs_30_locs_28_8|, #memory_int_part_locs_41_locs_28=|v_#memory_int_part_locs_41_locs_28_8|, main_~p~9.offset=v_main_~p~9.offset_10, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_15|, main_~p~9.base=v_main_~p~9.base_14, #length=|v_#length_20|, #memory_int_part_locs_79_locs_28=|v_#memory_int_part_locs_79_locs_28_8|} AuxVars[] AssignedVars[#memory_int_part_locs_30_locs_28, #memory_int_part_locs_41_locs_28, #memory_int, #memory_int_part_locs_79_locs_28] [2018-01-30 01:31:48,867 INFO L84 mationBacktranslator]: Skipped ATE [545] [545] L676-->L677: Formula: (let ((.cse0 (+ v_main_~p~9.offset_12 18))) (and (<= 0 .cse0) (and (= |v_#memory_int_part_locs_41_locs_28_11| |v_#memory_int_part_locs_41_locs_28_12|) (= |v_#memory_int_part_locs_30_locs_28_11| |v_#memory_int_part_locs_30_locs_28_12|) (= (store |v_#memory_int_part_locs_79_locs_28_11| v_main_~p~9.base_17 (store (select |v_#memory_int_part_locs_79_locs_28_11| v_main_~p~9.base_17) .cse0 555)) |v_#memory_int_part_locs_79_locs_28_12|)) (<= (+ v_main_~p~9.offset_12 26) (select |v_#length_22| v_main_~p~9.base_17)) (= 1 (select |v_#valid_23| v_main_~p~9.base_17)))) InVars {#memory_int_part_locs_30_locs_28=|v_#memory_int_part_locs_30_locs_28_11|, #memory_int_part_locs_41_locs_28=|v_#memory_int_part_locs_41_locs_28_11|, main_~p~9.offset=v_main_~p~9.offset_12, #valid=|v_#valid_23|, main_~p~9.base=v_main_~p~9.base_17, #length=|v_#length_22|, #memory_int_part_locs_79_locs_28=|v_#memory_int_part_locs_79_locs_28_11|} OutVars{#memory_int_part_locs_30_locs_28=|v_#memory_int_part_locs_30_locs_28_12|, #memory_int_part_locs_41_locs_28=|v_#memory_int_part_locs_41_locs_28_12|, main_~p~9.offset=v_main_~p~9.offset_12, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_17|, main_~p~9.base=v_main_~p~9.base_17, #length=|v_#length_22|, #memory_int_part_locs_79_locs_28=|v_#memory_int_part_locs_79_locs_28_12|} AuxVars[] AssignedVars[#memory_int_part_locs_30_locs_28, #memory_int_part_locs_41_locs_28, #memory_int, #memory_int_part_locs_79_locs_28] [2018-01-30 01:31:48,867 INFO L84 mationBacktranslator]: Skipped ATE [553] [553] L677-->L678: Formula: (let ((.cse0 (+ v_main_~p~9.offset_14 48))) (and (= 1 (select |v_#valid_25| v_main_~p~9.base_20)) (and (= |v_#memory_int_part_locs_30_locs_28_13| |v_#memory_int_part_locs_30_locs_28_14|) (= (store |v_#memory_int_part_locs_79_locs_28_13| v_main_~p~9.base_20 (store (select |v_#memory_int_part_locs_79_locs_28_13| v_main_~p~9.base_20) .cse0 999)) |v_#memory_int_part_locs_79_locs_28_14|) (= |v_#memory_int_part_locs_41_locs_28_13| |v_#memory_int_part_locs_41_locs_28_14|)) (<= (+ v_main_~p~9.offset_14 56) (select |v_#length_24| v_main_~p~9.base_20)) (<= 0 .cse0))) InVars {#memory_int_part_locs_30_locs_28=|v_#memory_int_part_locs_30_locs_28_13|, #memory_int_part_locs_41_locs_28=|v_#memory_int_part_locs_41_locs_28_13|, main_~p~9.offset=v_main_~p~9.offset_14, #valid=|v_#valid_25|, main_~p~9.base=v_main_~p~9.base_20, #length=|v_#length_24|, #memory_int_part_locs_79_locs_28=|v_#memory_int_part_locs_79_locs_28_13|} OutVars{#memory_int_part_locs_30_locs_28=|v_#memory_int_part_locs_30_locs_28_14|, #memory_int_part_locs_41_locs_28=|v_#memory_int_part_locs_41_locs_28_14|, main_~p~9.offset=v_main_~p~9.offset_14, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_19|, main_~p~9.base=v_main_~p~9.base_20, #length=|v_#length_24|, #memory_int_part_locs_79_locs_28=|v_#memory_int_part_locs_79_locs_28_14|} AuxVars[] AssignedVars[#memory_int_part_locs_30_locs_28, #memory_int_part_locs_41_locs_28, #memory_int, #memory_int_part_locs_79_locs_28] [2018-01-30 01:31:48,867 INFO L84 mationBacktranslator]: Skipped ATE [559] [559] L678-->L679: Formula: (let ((.cse0 (+ v_main_~p~9.offset_16 78))) (and (<= (+ v_main_~p~9.offset_16 86) (select |v_#length_26| v_main_~p~9.base_23)) (<= 0 .cse0) (and (= |v_#memory_int_part_locs_41_locs_28_15| |v_#memory_int_part_locs_41_locs_28_16|) (= (store |v_#memory_int_part_locs_79_locs_28_15| v_main_~p~9.base_23 (store (select |v_#memory_int_part_locs_79_locs_28_15| v_main_~p~9.base_23) .cse0 4311810305)) |v_#memory_int_part_locs_79_locs_28_16|) (= |v_#memory_int_part_locs_30_locs_28_15| |v_#memory_int_part_locs_30_locs_28_16|)) (= 1 (select |v_#valid_27| v_main_~p~9.base_23)))) InVars {#memory_int_part_locs_30_locs_28=|v_#memory_int_part_locs_30_locs_28_15|, #memory_int_part_locs_41_locs_28=|v_#memory_int_part_locs_41_locs_28_15|, main_~p~9.offset=v_main_~p~9.offset_16, #valid=|v_#valid_27|, main_~p~9.base=v_main_~p~9.base_23, #length=|v_#length_26|, #memory_int_part_locs_79_locs_28=|v_#memory_int_part_locs_79_locs_28_15|} OutVars{#memory_int_part_locs_30_locs_28=|v_#memory_int_part_locs_30_locs_28_16|, #memory_int_part_locs_41_locs_28=|v_#memory_int_part_locs_41_locs_28_16|, main_~p~9.offset=v_main_~p~9.offset_16, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_21|, main_~p~9.base=v_main_~p~9.base_23, #length=|v_#length_26|, #memory_int_part_locs_79_locs_28=|v_#memory_int_part_locs_79_locs_28_16|} AuxVars[] AssignedVars[#memory_int_part_locs_30_locs_28, #memory_int_part_locs_41_locs_28, #memory_int, #memory_int_part_locs_79_locs_28] [2018-01-30 01:31:48,867 INFO L84 mationBacktranslator]: Skipped ATE [565] [565] L679-->L680: Formula: true InVars {} OutVars{main_#t~ret18=|v_main_#t~ret18_1|} AuxVars[] AssignedVars[main_#t~ret18] [2018-01-30 01:31:48,867 INFO L84 mationBacktranslator]: Skipped ATE [571] [571] L680-->L680'': Formula: (= (mod |v_main_#t~ret18_4| 18446744073709551616) 4311811859) InVars {main_#t~ret18=|v_main_#t~ret18_4|} OutVars{main_#t~ret18=|v_main_#t~ret18_4|} AuxVars[] AssignedVars[] [2018-01-30 01:31:48,867 INFO L84 mationBacktranslator]: Skipped ATE [577] [577] L680''-->L680''': Formula: true InVars {} OutVars{main_#t~ret18=|v_main_#t~ret18_5|} AuxVars[] AssignedVars[main_#t~ret18] [2018-01-30 01:31:48,867 INFO L84 mationBacktranslator]: Skipped ATE [585] [585] L680'''-->L682: Formula: true InVars {} OutVars{main_#t~ret19=|v_main_#t~ret19_1|} AuxVars[] AssignedVars[main_#t~ret19] [2018-01-30 01:31:48,868 INFO L84 mationBacktranslator]: Skipped ATE [593] [593] L682-->L682': Formula: (and (<= |v_main_#t~ret19_2| 9223372036854775807) (<= 0 (+ |v_main_#t~ret19_2| 9223372036854775808))) InVars {main_#t~ret19=|v_main_#t~ret19_2|} OutVars{main_#t~ret19=|v_main_#t~ret19_2|} AuxVars[] AssignedVars[] [2018-01-30 01:31:48,868 INFO L84 mationBacktranslator]: Skipped ATE [601] [601] L682'-->L682''': Formula: (= 4311811859 |v_main_#t~ret19_5|) InVars {main_#t~ret19=|v_main_#t~ret19_5|} OutVars{main_#t~ret19=|v_main_#t~ret19_5|} AuxVars[] AssignedVars[] [2018-01-30 01:31:48,868 INFO L84 mationBacktranslator]: Skipped ATE [613] [613] L682'''-->L682'''': Formula: true InVars {} OutVars{main_#t~ret19=|v_main_#t~ret19_6|} AuxVars[] AssignedVars[main_#t~ret19] [2018-01-30 01:31:48,868 INFO L84 mationBacktranslator]: Skipped ATE [609] [609] L682''''-->L685: Formula: (and (= v_main_~p~9.base_28 0) (= v_main_~p~9.offset_20 0)) InVars {} OutVars{main_~p~9.base=v_main_~p~9.base_28, main_~p~9.offset=v_main_~p~9.offset_20} AuxVars[] AssignedVars[main_~p~9.offset, main_~p~9.base] [2018-01-30 01:31:48,868 INFO L84 mationBacktranslator]: Skipped ATE [625] [625] L685-->mainFINAL: Formula: (= |v_main_#res_1| 0) InVars {} OutVars{main_#res=|v_main_#res_1|} AuxVars[] AssignedVars[main_#res] [2018-01-30 01:31:48,868 INFO L84 mationBacktranslator]: Skipped ATE [641] [641] mainFINAL-->mainErr16EnsuresViolation: Formula: (not (= |v_#valid_10| |old(#valid)|)) InVars {#valid=|v_#valid_10|, old(#valid)=|old(#valid)|} OutVars{#valid=|v_#valid_10|, old(#valid)=|old(#valid)|} AuxVars[] AssignedVars[] [2018-01-30 01:31:48,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 01:31:48 BasicIcfg [2018-01-30 01:31:48,873 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 01:31:48,874 INFO L168 Benchmark]: Toolchain (without parser) took 12431.38 ms. Allocated memory was 307.8 MB in the beginning and 1.3 GB in the end (delta: 995.6 MB). Free memory was 266.6 MB in the beginning and 995.4 MB in the end (delta: -728.8 MB). Peak memory consumption was 266.8 MB. Max. memory is 5.3 GB. [2018-01-30 01:31:48,875 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 307.8 MB. Free memory is still 272.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 01:31:48,875 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.72 ms. Allocated memory is still 307.8 MB. Free memory was 266.6 MB in the beginning and 254.7 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-30 01:31:48,875 INFO L168 Benchmark]: Boogie Preprocessor took 42.00 ms. Allocated memory is still 307.8 MB. Free memory was 254.7 MB in the beginning and 252.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-30 01:31:48,876 INFO L168 Benchmark]: RCFGBuilder took 444.38 ms. Allocated memory is still 307.8 MB. Free memory was 252.7 MB in the beginning and 227.7 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. [2018-01-30 01:31:48,876 INFO L168 Benchmark]: IcfgTransformer took 9111.46 ms. Allocated memory was 307.8 MB in the beginning and 1.0 GB in the end (delta: 697.8 MB). Free memory was 227.7 MB in the beginning and 556.2 MB in the end (delta: -328.5 MB). Peak memory consumption was 369.3 MB. Max. memory is 5.3 GB. [2018-01-30 01:31:48,877 INFO L168 Benchmark]: TraceAbstraction took 2609.61 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 297.8 MB). Free memory was 556.2 MB in the beginning and 995.4 MB in the end (delta: -439.2 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 01:31:48,879 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 307.8 MB. Free memory is still 272.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 214.72 ms. Allocated memory is still 307.8 MB. Free memory was 266.6 MB in the beginning and 254.7 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.00 ms. Allocated memory is still 307.8 MB. Free memory was 254.7 MB in the beginning and 252.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 444.38 ms. Allocated memory is still 307.8 MB. Free memory was 252.7 MB in the beginning and 227.7 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. * IcfgTransformer took 9111.46 ms. Allocated memory was 307.8 MB in the beginning and 1.0 GB in the end (delta: 697.8 MB). Free memory was 227.7 MB in the beginning and 556.2 MB in the end (delta: -328.5 MB). Peak memory consumption was 369.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2609.61 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 297.8 MB). Free memory was 556.2 MB in the beginning and 995.4 MB in the end (delta: -439.2 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 92 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 3199 LocStat_NO_SUPPORTING_DISEQUALITIES : 1761 LocStat_NO_DISJUNCTIONS : -184 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 138 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 251 TransStat_NO_SUPPORTING_DISEQUALITIES : 19 TransStat_NO_DISJUNCTIONS : 148 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.015771 RENAME_VARIABLES(MILLISECONDS) : 0.271973 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.000995 PROJECTAWAY(MILLISECONDS) : 0.117941 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.068308 DISJOIN(MILLISECONDS) : 0.481605 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.298627 ADD_EQUALITY(MILLISECONDS) : 0.014833 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010314 #CONJOIN_DISJUNCTIVE : 410 #RENAME_VARIABLES : 897 #UNFREEZE : 0 #CONJOIN : 748 #PROJECTAWAY : 615 #ADD_WEAK_EQUALITY : 19 #DISJOIN : 103 #RENAME_VARIABLES_DISJUNCTIVE : 867 #ADD_EQUALITY : 259 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 16 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int] : 3 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_0 : 9 COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : 3 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_1 : 8 COUNT_BLOCKS_for_[#memory_int]_at_dim_1 : 1 COUNT_ARRAY_READS for [#memory_int] : 12 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 670]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 670. Possible FailurePath: - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 105 locations, 25 error locations. UNSAFE Result, 2.4s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 589 SDtfs, 661 SDslu, 1219 SDs, 0 SdLazy, 658 SolverSat, 107 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 36 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 142 NumberOfCodeBlocks, 142 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 19273 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-30_01-31-48-889.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-01-30_01-31-48-889.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-01-30_01-31-48-889.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-01-30_01-31-48-889.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_01-31-48-889.csv Received shutdown request...