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-acfac67 [2018-01-28 23:46:44,456 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 23:46:44,457 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 23:46:44,469 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 23:46:44,470 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 23:46:44,471 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 23:46:44,472 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 23:46:44,473 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 23:46:44,475 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 23:46:44,475 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 23:46:44,476 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 23:46:44,476 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 23:46:44,477 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 23:46:44,478 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 23:46:44,479 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 23:46:44,481 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 23:46:44,484 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 23:46:44,485 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 23:46:44,487 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 23:46:44,488 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 23:46:44,490 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 23:46:44,490 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 23:46:44,491 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 23:46:44,492 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 23:46:44,492 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 23:46:44,494 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 23:46:44,494 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 23:46:44,495 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 23:46:44,495 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 23:46:44,495 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 23:46:44,496 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 23:46:44,496 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-28 23:46:44,506 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 23:46:44,506 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 23:46:44,507 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 23:46:44,507 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 23:46:44,507 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 23:46:44,507 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 23:46:44,508 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 23:46:44,508 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 23:46:44,508 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 23:46:44,509 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 23:46:44,509 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 23:46:44,509 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 23:46:44,509 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 23:46:44,509 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 23:46:44,510 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 23:46:44,510 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 23:46:44,510 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 23:46:44,510 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 23:46:44,510 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 23:46:44,510 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 23:46:44,511 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 23:46:44,511 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 23:46:44,511 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 23:46:44,511 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 23:46:44,511 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 23:46:44,512 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 23:46:44,512 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 23:46:44,512 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 23:46:44,512 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 23:46:44,512 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 23:46:44,513 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 23:46:44,513 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 23:46:44,514 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 23:46:44,514 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 23:46:44,548 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 23:46:44,561 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 23:46:44,566 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 23:46:44,568 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 23:46:44,568 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 23:46:44,569 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-28 23:46:44,738 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 23:46:44,745 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-28 23:46:44,745 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 23:46:44,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 23:46:44,750 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 23:46:44,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 11:46:44" (1/1) ... [2018-01-28 23:46:44,753 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@473a6bac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:46:44, skipping insertion in model container [2018-01-28 23:46:44,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 11:46:44" (1/1) ... [2018-01-28 23:46:44,772 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 23:46:44,812 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 23:46:44,925 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 23:46:44,946 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 23:46:44,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:46:44 WrapperNode [2018-01-28 23:46:44,954 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 23:46:44,955 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 23:46:44,955 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 23:46:44,955 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 23:46:44,966 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:46:44" (1/1) ... [2018-01-28 23:46:44,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:46:44" (1/1) ... [2018-01-28 23:46:44,978 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:46:44" (1/1) ... [2018-01-28 23:46:44,979 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:46:44" (1/1) ... [2018-01-28 23:46:44,982 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:46:44" (1/1) ... [2018-01-28 23:46:44,985 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:46:44" (1/1) ... [2018-01-28 23:46:44,986 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:46:44" (1/1) ... [2018-01-28 23:46:44,988 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 23:46:44,988 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 23:46:44,988 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 23:46:44,988 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 23:46:44,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:46:44" (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-28 23:46:45,033 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 23:46:45,033 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 23:46:45,034 INFO L136 BoogieDeclarations]: Found implementation of procedure Sum [2018-01-28 23:46:45,034 INFO L136 BoogieDeclarations]: Found implementation of procedure Sum2 [2018-01-28 23:46:45,034 INFO L136 BoogieDeclarations]: Found implementation of procedure dummy_abort [2018-01-28 23:46:45,034 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 23:46:45,034 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-28 23:46:45,034 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-28 23:46:45,034 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 23:46:45,034 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 23:46:45,034 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 23:46:45,035 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-28 23:46:45,035 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-28 23:46:45,035 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-28 23:46:45,035 INFO L128 BoogieDeclarations]: Found specification of procedure Sum [2018-01-28 23:46:45,035 INFO L128 BoogieDeclarations]: Found specification of procedure Sum2 [2018-01-28 23:46:45,035 INFO L128 BoogieDeclarations]: Found specification of procedure dummy_abort [2018-01-28 23:46:45,035 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 23:46:45,036 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 23:46:45,036 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 23:46:45,160 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-28 23:46:45,324 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 23:46:45,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:46:45 BoogieIcfgContainer [2018-01-28 23:46:45,325 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 23:46:45,326 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-28 23:46:45,326 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-28 23:46:45,327 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-28 23:46:45,331 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:46:45" (1/1) ... [2018-01-28 23:46:45,339 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-28 23:46:45,340 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-28 23:46:45,340 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-28 23:46:45,419 INFO L218 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-28 23:46:45,486 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-28 23:46:48,659 INFO L311 AbstractInterpreter]: Visited 119 different actions 306 times. Merged at 67 different actions 103 times. Never widened. Found 24 fixpoints after 12 different actions. Largest state had 29 variables. [2018-01-28 23:46:48,662 INFO L226 apSepIcfgTransformer]: finished equality analysis [2018-01-28 23:46:48,683 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 12 [2018-01-28 23:46:48,683 INFO L238 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-28 23:46:48,684 INFO L239 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-28 23:46:48,684 INFO L241 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-28 23:46:48,696 INFO L544 PartitionManager]: partitioning result: [2018-01-28 23:46:48,696 INFO L549 PartitionManager]: location blocks for array group [#memory_int] [2018-01-28 23:46:48,696 INFO L558 PartitionManager]: at dimension 0 [2018-01-28 23:46:48,696 INFO L559 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-01-28 23:46:48,697 INFO L560 PartitionManager]: # location blocks :2 [2018-01-28 23:46:48,697 INFO L558 PartitionManager]: at dimension 1 [2018-01-28 23:46:48,697 INFO L559 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-01-28 23:46:48,697 INFO L560 PartitionManager]: # location blocks :2 [2018-01-28 23:46:48,698 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-28 23:46:48,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.01 11:46:48 BasicIcfg [2018-01-28 23:46:48,725 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-28 23:46:48,726 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 23:46:48,726 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 23:46:48,791 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 23:46:48,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 11:46:44" (1/4) ... [2018-01-28 23:46:48,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39e4217f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 11:46:48, skipping insertion in model container [2018-01-28 23:46:48,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:46:44" (2/4) ... [2018-01-28 23:46:48,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39e4217f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 11:46:48, skipping insertion in model container [2018-01-28 23:46:48,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:46:45" (3/4) ... [2018-01-28 23:46:48,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39e4217f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 11:46:48, skipping insertion in model container [2018-01-28 23:46:48,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.01 11:46:48" (4/4) ... [2018-01-28 23:46:48,795 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-28 23:46:48,804 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 23:46:48,812 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 25 error locations. [2018-01-28 23:46:48,854 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 23:46:48,854 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 23:46:48,855 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 23:46:48,855 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 23:46:48,855 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 23:46:48,855 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 23:46:48,855 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 23:46:48,855 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 23:46:48,856 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 23:46:48,871 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states. [2018-01-28 23:46:48,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-01-28 23:46:48,876 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:46:48,877 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-01-28 23:46:48,877 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-28 23:46:48,880 INFO L82 PathProgramCache]: Analyzing trace with hash 484023432, now seen corresponding path program 1 times [2018-01-28 23:46:48,882 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:46:48,882 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:46:48,923 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:46:48,923 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:46:48,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:46:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:46:48,976 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:46:49,044 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-28 23:46:49,047 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:46:49,047 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 23:46:49,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 23:46:49,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 23:46:49,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 23:46:49,062 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 4 states. [2018-01-28 23:46:49,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:46:49,342 INFO L93 Difference]: Finished difference Result 149 states and 171 transitions. [2018-01-28 23:46:49,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 23:46:49,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-01-28 23:46:49,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:46:49,356 INFO L225 Difference]: With dead ends: 149 [2018-01-28 23:46:49,356 INFO L226 Difference]: Without dead ends: 94 [2018-01-28 23:46:49,360 INFO L533 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-28 23:46:49,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-28 23:46:49,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-01-28 23:46:49,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-28 23:46:49,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2018-01-28 23:46:49,402 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 5 [2018-01-28 23:46:49,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:46:49,403 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2018-01-28 23:46:49,404 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 23:46:49,404 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2018-01-28 23:46:49,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-01-28 23:46:49,404 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:46:49,404 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-01-28 23:46:49,405 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-28 23:46:49,405 INFO L82 PathProgramCache]: Analyzing trace with hash 484023434, now seen corresponding path program 1 times [2018-01-28 23:46:49,405 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:46:49,405 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:46:49,406 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:46:49,406 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:46:49,406 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:46:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:46:49,416 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:46:49,474 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-28 23:46:49,475 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:46:49,475 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 23:46:49,476 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 23:46:49,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 23:46:49,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 23:46:49,477 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand 4 states. [2018-01-28 23:46:49,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:46:49,607 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2018-01-28 23:46:49,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 23:46:49,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-01-28 23:46:49,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:46:49,609 INFO L225 Difference]: With dead ends: 94 [2018-01-28 23:46:49,610 INFO L226 Difference]: Without dead ends: 86 [2018-01-28 23:46:49,611 INFO L533 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-28 23:46:49,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-28 23:46:49,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-01-28 23:46:49,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-28 23:46:49,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2018-01-28 23:46:49,620 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 5 [2018-01-28 23:46:49,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:46:49,620 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 97 transitions. [2018-01-28 23:46:49,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 23:46:49,621 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2018-01-28 23:46:49,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-28 23:46:49,622 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:46:49,622 INFO L330 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-28 23:46:49,622 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-28 23:46:49,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1396048431, now seen corresponding path program 1 times [2018-01-28 23:46:49,622 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:46:49,622 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:46:49,623 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:46:49,624 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:46:49,624 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:46:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:46:49,642 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:46:49,693 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-28 23:46:49,693 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:46:49,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 23:46:49,694 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 23:46:49,694 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 23:46:49,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 23:46:49,694 INFO L87 Difference]: Start difference. First operand 86 states and 97 transitions. Second operand 5 states. [2018-01-28 23:46:49,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:46:49,776 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2018-01-28 23:46:49,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 23:46:49,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-28 23:46:49,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:46:49,777 INFO L225 Difference]: With dead ends: 88 [2018-01-28 23:46:49,778 INFO L226 Difference]: Without dead ends: 86 [2018-01-28 23:46:49,778 INFO L533 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-28 23:46:49,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-28 23:46:49,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-01-28 23:46:49,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-28 23:46:49,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2018-01-28 23:46:49,786 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 20 [2018-01-28 23:46:49,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:46:49,786 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2018-01-28 23:46:49,786 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 23:46:49,787 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2018-01-28 23:46:49,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-28 23:46:49,787 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:46:49,787 INFO L330 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-28 23:46:49,787 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-28 23:46:49,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1396048429, now seen corresponding path program 1 times [2018-01-28 23:46:49,788 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:46:49,788 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:46:49,789 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:46:49,789 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:46:49,789 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:46:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:46:49,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:46:49,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-28 23:46:49,940 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:46:49,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 23:46:49,941 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 23:46:49,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 23:46:49,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 23:46:49,941 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand 6 states. [2018-01-28 23:46:50,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:46:50,069 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2018-01-28 23:46:50,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 23:46:50,070 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-28 23:46:50,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:46:50,070 INFO L225 Difference]: With dead ends: 84 [2018-01-28 23:46:50,070 INFO L226 Difference]: Without dead ends: 83 [2018-01-28 23:46:50,071 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 23:46:50,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-28 23:46:50,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-01-28 23:46:50,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-28 23:46:50,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2018-01-28 23:46:50,076 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 20 [2018-01-28 23:46:50,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:46:50,077 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2018-01-28 23:46:50,077 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 23:46:50,077 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2018-01-28 23:46:50,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-28 23:46:50,078 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:46:50,078 INFO L330 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-28 23:46:50,078 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-28 23:46:50,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1473196916, now seen corresponding path program 1 times [2018-01-28 23:46:50,078 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:46:50,079 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:46:50,079 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:46:50,079 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:46:50,080 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:46:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:46:50,091 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:46:50,128 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-28 23:46:50,128 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:46:50,128 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 23:46:50,128 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 23:46:50,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 23:46:50,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 23:46:50,129 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand 5 states. [2018-01-28 23:46:50,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:46:50,216 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2018-01-28 23:46:50,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 23:46:50,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-01-28 23:46:50,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:46:50,217 INFO L225 Difference]: With dead ends: 85 [2018-01-28 23:46:50,218 INFO L226 Difference]: Without dead ends: 83 [2018-01-28 23:46:50,218 INFO L533 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-28 23:46:50,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-28 23:46:50,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-01-28 23:46:50,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-28 23:46:50,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2018-01-28 23:46:50,224 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 23 [2018-01-28 23:46:50,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:46:50,224 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2018-01-28 23:46:50,225 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 23:46:50,225 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2018-01-28 23:46:50,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-28 23:46:50,226 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:46:50,226 INFO L330 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-28 23:46:50,226 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-28 23:46:50,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1473196918, now seen corresponding path program 1 times [2018-01-28 23:46:50,227 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:46:50,227 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:46:50,228 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:46:50,228 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:46:50,228 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:46:50,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:46:50,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:46:50,350 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-28 23:46:50,350 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:46:50,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 23:46:50,350 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 23:46:50,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 23:46:50,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 23:46:50,351 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand 6 states. [2018-01-28 23:46:50,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:46:50,488 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2018-01-28 23:46:50,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 23:46:50,489 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-28 23:46:50,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:46:50,490 INFO L225 Difference]: With dead ends: 81 [2018-01-28 23:46:50,490 INFO L226 Difference]: Without dead ends: 80 [2018-01-28 23:46:50,490 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 23:46:50,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-28 23:46:50,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-28 23:46:50,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-28 23:46:50,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions. [2018-01-28 23:46:50,498 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 91 transitions. Word has length 23 [2018-01-28 23:46:50,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:46:50,498 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 91 transitions. [2018-01-28 23:46:50,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 23:46:50,499 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 91 transitions. [2018-01-28 23:46:50,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-28 23:46:50,500 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:46:50,500 INFO L330 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-28 23:46:50,500 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-28 23:46:50,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1509909318, now seen corresponding path program 1 times [2018-01-28 23:46:50,501 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:46:50,501 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:46:50,501 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:46:50,502 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:46:50,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:46:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:46:50,515 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:46:50,622 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-28 23:46:50,622 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:46:50,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 23:46:50,622 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 23:46:50,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 23:46:50,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-28 23:46:50,623 INFO L87 Difference]: Start difference. First operand 80 states and 91 transitions. Second operand 7 states. [2018-01-28 23:46:50,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:46:50,743 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2018-01-28 23:46:50,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 23:46:50,743 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-01-28 23:46:50,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:46:50,746 INFO L225 Difference]: With dead ends: 94 [2018-01-28 23:46:50,746 INFO L226 Difference]: Without dead ends: 93 [2018-01-28 23:46:50,746 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-28 23:46:50,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-28 23:46:50,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2018-01-28 23:46:50,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-28 23:46:50,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2018-01-28 23:46:50,752 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 23 [2018-01-28 23:46:50,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:46:50,752 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2018-01-28 23:46:50,752 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 23:46:50,752 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2018-01-28 23:46:50,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-28 23:46:50,753 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:46:50,753 INFO L330 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-28 23:46:50,753 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-28 23:46:50,754 INFO L82 PathProgramCache]: Analyzing trace with hash -360997084, now seen corresponding path program 1 times [2018-01-28 23:46:50,754 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:46:50,754 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:46:50,754 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:46:50,754 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:46:50,755 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:46:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-28 23:46:50,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-28 23:46:50,795 INFO L389 BasicCegarLoop]: Counterexample might be feasible [2018-01-28 23:46:50,800 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-28 23:46:50,800 INFO L84 mationBacktranslator]: Skipped ATE [483] [483] L1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-28 23:46:50,800 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-28 23:46:50,800 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-28 23:46:50,800 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-28 23:46:50,801 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-28 23:46:50,801 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_33_locs_-47_1| |v_#memory_int_part_locs_33_locs_-47_2|) (= |v_#memory_int_part_locs_33_locs_0_1| |v_#memory_int_part_locs_33_locs_0_2|) (= |v_#memory_int_part_locs_0_locs_-47_1| |v_#memory_int_part_locs_0_locs_-47_2|) (= |v_#memory_int_part_locs_0_locs_0_1| |v_#memory_int_part_locs_0_locs_0_2|))) InVars {#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_2|, #memory_int_part_locs_33_locs_-47=|v_#memory_int_part_locs_33_locs_-47_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, #memory_int_part_locs_33_locs_0=|v_#memory_int_part_locs_33_locs_0_2|, #length=|v_#length_14|, #memory_int_part_locs_0_locs_-47=|v_#memory_int_part_locs_0_locs_-47_2|} OutVars{#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_1|, #memory_int_part_locs_33_locs_-47=|v_#memory_int_part_locs_33_locs_-47_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, #memory_int_part_locs_33_locs_0=|v_#memory_int_part_locs_33_locs_0_1|, #length=|v_#length_14|, #memory_int_part_locs_0_locs_-47=|v_#memory_int_part_locs_0_locs_-47_1|} AuxVars[] AssignedVars[#memory_int_part_locs_0_locs_0, #memory_int_part_locs_33_locs_-47, #memory_int, #memory_int_part_locs_33_locs_0, #memory_int_part_locs_0_locs_-47] [2018-01-28 23:46:50,801 INFO L84 mationBacktranslator]: Skipped ATE [517] [517] L673'-->L674: Formula: (and (and (= |v_#memory_int_part_locs_0_locs_0_3| |v_#memory_int_part_locs_0_locs_0_4|) (= |v_#memory_int_part_locs_33_locs_-47_3| |v_#memory_int_part_locs_33_locs_-47_4|) (= |v_#memory_int_part_locs_33_locs_0_3| |v_#memory_int_part_locs_33_locs_0_4|) (= |v_#memory_int_part_locs_0_locs_-47_3| |v_#memory_int_part_locs_0_locs_-47_4|)) (<= 0 (+ v_main_~p~9.offset_6 10)) (<= (+ 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_0_locs_0=|v_#memory_int_part_locs_0_locs_0_3|, #memory_int_part_locs_33_locs_-47=|v_#memory_int_part_locs_33_locs_-47_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, #memory_int_part_locs_33_locs_0=|v_#memory_int_part_locs_33_locs_0_3|, #length=|v_#length_16|, #memory_int_part_locs_0_locs_-47=|v_#memory_int_part_locs_0_locs_-47_3|} OutVars{#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_4|, #memory_int_part_locs_33_locs_-47=|v_#memory_int_part_locs_33_locs_-47_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, #memory_int_part_locs_33_locs_0=|v_#memory_int_part_locs_33_locs_0_4|, #length=|v_#length_16|, #memory_int_part_locs_0_locs_-47=|v_#memory_int_part_locs_0_locs_-47_4|} AuxVars[] AssignedVars[#memory_int_part_locs_0_locs_0, #memory_int_part_locs_33_locs_-47, #memory_int, #memory_int_part_locs_33_locs_0, #memory_int_part_locs_0_locs_-47] [2018-01-28 23:46:50,801 INFO L84 mationBacktranslator]: Skipped ATE [525] [525] L674-->L675: Formula: (and (<= (+ v_main_~p~9.offset_8 48) (select |v_#length_18| v_main_~p~9.base_11)) (<= 0 (+ v_main_~p~9.offset_8 40)) (= 1 (select |v_#valid_19| v_main_~p~9.base_11)) (and (= |v_#memory_int_part_locs_33_locs_0_5| |v_#memory_int_part_locs_33_locs_0_6|) (= |v_#memory_int_part_locs_33_locs_-47_5| |v_#memory_int_part_locs_33_locs_-47_6|) (= |v_#memory_int_part_locs_0_locs_0_5| |v_#memory_int_part_locs_0_locs_0_6|) (= |v_#memory_int_part_locs_0_locs_-47_5| |v_#memory_int_part_locs_0_locs_-47_6|))) InVars {#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_5|, #memory_int_part_locs_33_locs_-47=|v_#memory_int_part_locs_33_locs_-47_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, #memory_int_part_locs_33_locs_0=|v_#memory_int_part_locs_33_locs_0_5|, #length=|v_#length_18|, #memory_int_part_locs_0_locs_-47=|v_#memory_int_part_locs_0_locs_-47_5|} OutVars{#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_6|, #memory_int_part_locs_33_locs_-47=|v_#memory_int_part_locs_33_locs_-47_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, #memory_int_part_locs_33_locs_0=|v_#memory_int_part_locs_33_locs_0_6|, #length=|v_#length_18|, #memory_int_part_locs_0_locs_-47=|v_#memory_int_part_locs_0_locs_-47_6|} AuxVars[] AssignedVars[#memory_int_part_locs_0_locs_0, #memory_int_part_locs_33_locs_-47, #memory_int, #memory_int_part_locs_33_locs_0, #memory_int_part_locs_0_locs_-47] [2018-01-28 23:46:50,801 INFO L84 mationBacktranslator]: Skipped ATE [535] [535] L675-->L676: Formula: (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 (= |v_#memory_int_part_locs_33_locs_0_7| |v_#memory_int_part_locs_33_locs_0_8|) (= |v_#memory_int_part_locs_0_locs_0_7| |v_#memory_int_part_locs_0_locs_0_8|) (= |v_#memory_int_part_locs_33_locs_-47_7| |v_#memory_int_part_locs_33_locs_-47_8|) (= |v_#memory_int_part_locs_0_locs_-47_7| |v_#memory_int_part_locs_0_locs_-47_8|)) (<= 0 (+ v_main_~p~9.offset_10 70))) InVars {#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_7|, #memory_int_part_locs_33_locs_-47=|v_#memory_int_part_locs_33_locs_-47_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, #memory_int_part_locs_33_locs_0=|v_#memory_int_part_locs_33_locs_0_7|, #length=|v_#length_20|, #memory_int_part_locs_0_locs_-47=|v_#memory_int_part_locs_0_locs_-47_7|} OutVars{#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_8|, #memory_int_part_locs_33_locs_-47=|v_#memory_int_part_locs_33_locs_-47_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, #memory_int_part_locs_33_locs_0=|v_#memory_int_part_locs_33_locs_0_8|, #length=|v_#length_20|, #memory_int_part_locs_0_locs_-47=|v_#memory_int_part_locs_0_locs_-47_8|} AuxVars[] AssignedVars[#memory_int_part_locs_0_locs_0, #memory_int_part_locs_33_locs_-47, #memory_int, #memory_int_part_locs_33_locs_0, #memory_int_part_locs_0_locs_-47] [2018-01-28 23:46:50,802 INFO L84 mationBacktranslator]: Skipped ATE [545] [545] L676-->L677: Formula: (and (<= 0 (+ v_main_~p~9.offset_12 18)) (and (= |v_#memory_int_part_locs_33_locs_0_11| |v_#memory_int_part_locs_33_locs_0_12|) (= |v_#memory_int_part_locs_0_locs_0_11| |v_#memory_int_part_locs_0_locs_0_12|) (= |v_#memory_int_part_locs_0_locs_-47_11| |v_#memory_int_part_locs_0_locs_-47_12|) (= |v_#memory_int_part_locs_33_locs_-47_11| |v_#memory_int_part_locs_33_locs_-47_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_0_locs_0=|v_#memory_int_part_locs_0_locs_0_11|, #memory_int_part_locs_33_locs_-47=|v_#memory_int_part_locs_33_locs_-47_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, #memory_int_part_locs_33_locs_0=|v_#memory_int_part_locs_33_locs_0_11|, #length=|v_#length_22|, #memory_int_part_locs_0_locs_-47=|v_#memory_int_part_locs_0_locs_-47_11|} OutVars{#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_12|, #memory_int_part_locs_33_locs_-47=|v_#memory_int_part_locs_33_locs_-47_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, #memory_int_part_locs_33_locs_0=|v_#memory_int_part_locs_33_locs_0_12|, #length=|v_#length_22|, #memory_int_part_locs_0_locs_-47=|v_#memory_int_part_locs_0_locs_-47_12|} AuxVars[] AssignedVars[#memory_int_part_locs_0_locs_0, #memory_int_part_locs_33_locs_-47, #memory_int, #memory_int_part_locs_33_locs_0, #memory_int_part_locs_0_locs_-47] [2018-01-28 23:46:50,802 INFO L84 mationBacktranslator]: Skipped ATE [553] [553] L677-->L678: Formula: (and (= 1 (select |v_#valid_25| v_main_~p~9.base_20)) (and (= |v_#memory_int_part_locs_0_locs_0_13| |v_#memory_int_part_locs_0_locs_0_14|) (= |v_#memory_int_part_locs_33_locs_0_13| |v_#memory_int_part_locs_33_locs_0_14|) (= |v_#memory_int_part_locs_33_locs_-47_13| |v_#memory_int_part_locs_33_locs_-47_14|) (= |v_#memory_int_part_locs_0_locs_-47_13| |v_#memory_int_part_locs_0_locs_-47_14|)) (<= (+ v_main_~p~9.offset_14 56) (select |v_#length_24| v_main_~p~9.base_20)) (<= 0 (+ v_main_~p~9.offset_14 48))) InVars {#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_13|, #memory_int_part_locs_33_locs_-47=|v_#memory_int_part_locs_33_locs_-47_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, #memory_int_part_locs_33_locs_0=|v_#memory_int_part_locs_33_locs_0_13|, #length=|v_#length_24|, #memory_int_part_locs_0_locs_-47=|v_#memory_int_part_locs_0_locs_-47_13|} OutVars{#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_14|, #memory_int_part_locs_33_locs_-47=|v_#memory_int_part_locs_33_locs_-47_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, #memory_int_part_locs_33_locs_0=|v_#memory_int_part_locs_33_locs_0_14|, #length=|v_#length_24|, #memory_int_part_locs_0_locs_-47=|v_#memory_int_part_locs_0_locs_-47_14|} AuxVars[] AssignedVars[#memory_int_part_locs_0_locs_0, #memory_int_part_locs_33_locs_-47, #memory_int, #memory_int_part_locs_33_locs_0, #memory_int_part_locs_0_locs_-47] [2018-01-28 23:46:50,802 INFO L84 mationBacktranslator]: Skipped ATE [559] [559] L678-->L679: Formula: (and (<= (+ v_main_~p~9.offset_16 86) (select |v_#length_26| v_main_~p~9.base_23)) (<= 0 (+ v_main_~p~9.offset_16 78)) (and (= |v_#memory_int_part_locs_0_locs_-47_15| |v_#memory_int_part_locs_0_locs_-47_16|) (= |v_#memory_int_part_locs_33_locs_0_15| |v_#memory_int_part_locs_33_locs_0_16|) (= |v_#memory_int_part_locs_33_locs_-47_15| |v_#memory_int_part_locs_33_locs_-47_16|) (= |v_#memory_int_part_locs_0_locs_0_15| |v_#memory_int_part_locs_0_locs_0_16|)) (= 1 (select |v_#valid_27| v_main_~p~9.base_23))) InVars {#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_15|, #memory_int_part_locs_33_locs_-47=|v_#memory_int_part_locs_33_locs_-47_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, #memory_int_part_locs_33_locs_0=|v_#memory_int_part_locs_33_locs_0_15|, #length=|v_#length_26|, #memory_int_part_locs_0_locs_-47=|v_#memory_int_part_locs_0_locs_-47_15|} OutVars{#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_16|, #memory_int_part_locs_33_locs_-47=|v_#memory_int_part_locs_33_locs_-47_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, #memory_int_part_locs_33_locs_0=|v_#memory_int_part_locs_33_locs_0_16|, #length=|v_#length_26|, #memory_int_part_locs_0_locs_-47=|v_#memory_int_part_locs_0_locs_-47_16|} AuxVars[] AssignedVars[#memory_int_part_locs_0_locs_0, #memory_int_part_locs_33_locs_-47, #memory_int, #memory_int_part_locs_33_locs_0, #memory_int_part_locs_0_locs_-47] [2018-01-28 23:46:50,802 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-28 23:46:50,802 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-28 23:46:50,803 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-28 23:46:50,803 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-28 23:46:50,803 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-28 23:46:50,803 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-28 23:46:50,803 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-28 23:46:50,803 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-28 23:46:50,804 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-28 23:46:50,804 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-28 23:46:50,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 11:46:50 BasicIcfg [2018-01-28 23:46:50,810 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 23:46:50,811 INFO L168 Benchmark]: Toolchain (without parser) took 6072.16 ms. Allocated memory was 306.7 MB in the beginning and 744.0 MB in the end (delta: 437.3 MB). Free memory was 264.6 MB in the beginning and 492.8 MB in the end (delta: -228.3 MB). Peak memory consumption was 209.0 MB. Max. memory is 5.3 GB. [2018-01-28 23:46:50,812 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 306.7 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 23:46:50,812 INFO L168 Benchmark]: CACSL2BoogieTranslator took 209.10 ms. Allocated memory is still 306.7 MB. Free memory was 263.5 MB in the beginning and 252.4 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. [2018-01-28 23:46:50,812 INFO L168 Benchmark]: Boogie Preprocessor took 33.02 ms. Allocated memory is still 306.7 MB. Free memory was 252.4 MB in the beginning and 250.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-28 23:46:50,813 INFO L168 Benchmark]: RCFGBuilder took 337.56 ms. Allocated memory is still 306.7 MB. Free memory was 250.4 MB in the beginning and 225.4 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. [2018-01-28 23:46:50,813 INFO L168 Benchmark]: IcfgTransformer took 3399.61 ms. Allocated memory was 306.7 MB in the beginning and 580.9 MB in the end (delta: 274.2 MB). Free memory was 225.4 MB in the beginning and 535.6 MB in the end (delta: -310.1 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 23:46:50,813 INFO L168 Benchmark]: TraceAbstraction took 2083.87 ms. Allocated memory was 580.9 MB in the beginning and 744.0 MB in the end (delta: 163.1 MB). Free memory was 535.6 MB in the beginning and 492.8 MB in the end (delta: 42.7 MB). Peak memory consumption was 205.8 MB. Max. memory is 5.3 GB. [2018-01-28 23:46:50,815 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.18 ms. Allocated memory is still 306.7 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 209.10 ms. Allocated memory is still 306.7 MB. Free memory was 263.5 MB in the beginning and 252.4 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.02 ms. Allocated memory is still 306.7 MB. Free memory was 252.4 MB in the beginning and 250.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 337.56 ms. Allocated memory is still 306.7 MB. Free memory was 250.4 MB in the beginning and 225.4 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. * IcfgTransformer took 3399.61 ms. Allocated memory was 306.7 MB in the beginning and 580.9 MB in the end (delta: 274.2 MB). Free memory was 225.4 MB in the beginning and 535.6 MB in the end (delta: -310.1 MB). There was no memory consumed. Max. memory is 5.3 GB. * TraceAbstraction took 2083.87 ms. Allocated memory was 580.9 MB in the beginning and 744.0 MB in the end (delta: 163.1 MB). Free memory was 535.6 MB in the beginning and 492.8 MB in the end (delta: 42.7 MB). Peak memory consumption was 205.8 MB. 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 : 1054 LocStat_NO_SUPPORTING_DISEQUALITIES : 433 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 : 146 TransStat_NO_SUPPORTING_DISEQUALITIES : 19 TransStat_NO_DISJUNCTIONS : 148 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.012089 RENAME_VARIABLES(MILLISECONDS) : 0.278034 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.000571 PROJECTAWAY(MILLISECONDS) : 0.084635 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.095006 DISJOIN(MILLISECONDS) : 0.337764 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.297225 ADD_EQUALITY(MILLISECONDS) : 0.025629 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.032665 #CONJOIN_DISJUNCTIVE : 410 #RENAME_VARIABLES : 897 #UNFREEZE : 0 #CONJOIN : 643 #PROJECTAWAY : 616 #ADD_WEAK_EQUALITY : 19 #DISJOIN : 103 #RENAME_VARIABLES_DISJUNCTIVE : 867 #ADD_EQUALITY : 154 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 16 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: HeapSeparatorStatistics COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_0 : 2 COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : 2 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_1 : 2 COUNT_BLOCKS_for_[#memory_int]_at_dim_1 : 2 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, 1.9s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 570 SDtfs, 455 SDslu, 1083 SDs, 0 SdLazy, 545 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=0, 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, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 142 NumberOfCodeBlocks, 142 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 18613 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-28_23-46-50-825.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-28_23-46-50-825.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-28_23-46-50-825.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-28_23-46-50-825.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-28_23-46-50-825.csv Received shutdown request...