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-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-industry-pattern/check_removal_from_set_after_insertion_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 04:16:06,117 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 04:16:06,118 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 04:16:06,127 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 04:16:06,127 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 04:16:06,128 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 04:16:06,129 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 04:16:06,131 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 04:16:06,132 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 04:16:06,133 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 04:16:06,133 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 04:16:06,133 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 04:16:06,134 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 04:16:06,134 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 04:16:06,135 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 04:16:06,136 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 04:16:06,137 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 04:16:06,138 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 04:16:06,139 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 04:16:06,139 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 04:16:06,141 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 04:16:06,141 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 04:16:06,141 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 04:16:06,141 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 04:16:06,142 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 04:16:06,143 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 04:16:06,146 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 04:16:06,147 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 04:16:06,147 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 04:16:06,147 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 04:16:06,147 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 04:16:06,147 INFO L98 SettingsManager]: Beginning loading settings from /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 04:16:06,157 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 04:16:06,157 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 04:16:06,157 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 04:16:06,157 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 04:16:06,157 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 04:16:06,157 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 04:16:06,158 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 04:16:06,159 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 04:16:06,160 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 04:16:06,160 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 04:16:06,160 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 04:16:06,160 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 04:16:06,160 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 04:16:06,160 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 04:16:06,160 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 04:16:06,160 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 04:16:06,160 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 04:16:06,160 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 04:16:06,160 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 04:16:06,161 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 04:16:06,161 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 04:16:06,161 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 04:16:06,161 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 04:16:06,161 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 04:16:06,161 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 04:16:06,161 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 04:16:06,161 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 04:16:06,161 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 04:16:06,161 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 04:16:06,161 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 04:16:06,161 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 04:16:06,162 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 04:16:06,162 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 04:16:06,162 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 04:16:06,190 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 04:16:06,196 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 04:16:06,201 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 04:16:06,202 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 04:16:06,202 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 04:16:06,203 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-industry-pattern/check_removal_from_set_after_insertion_false-unreach-call.i [2018-01-30 04:16:06,274 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 04:16:06,275 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-30 04:16:06,276 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 04:16:06,276 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 04:16:06,281 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 04:16:06,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 04:16:06" (1/1) ... [2018-01-30 04:16:06,284 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f811e47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:16:06, skipping insertion in model container [2018-01-30 04:16:06,284 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 04:16:06" (1/1) ... [2018-01-30 04:16:06,295 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 04:16:06,306 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 04:16:06,394 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 04:16:06,410 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 04:16:06,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:16:06 WrapperNode [2018-01-30 04:16:06,413 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 04:16:06,415 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 04:16:06,416 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 04:16:06,416 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 04:16:06,423 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:16:06" (1/1) ... [2018-01-30 04:16:06,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:16:06" (1/1) ... [2018-01-30 04:16:06,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:16:06" (1/1) ... [2018-01-30 04:16:06,432 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:16:06" (1/1) ... [2018-01-30 04:16:06,434 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:16:06" (1/1) ... [2018-01-30 04:16:06,438 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:16:06" (1/1) ... [2018-01-30 04:16:06,439 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:16:06" (1/1) ... [2018-01-30 04:16:06,440 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 04:16:06,440 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 04:16:06,440 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 04:16:06,440 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 04:16:06,441 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:16:06" (1/1) ... No working directory specified, using /home/daniel/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 04:16:06,478 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 04:16:06,478 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 04:16:06,479 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-01-30 04:16:06,479 INFO L136 BoogieDeclarations]: Found implementation of procedure insert [2018-01-30 04:16:06,479 INFO L136 BoogieDeclarations]: Found implementation of procedure elem_exists [2018-01-30 04:16:06,479 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 04:16:06,479 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-30 04:16:06,479 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-30 04:16:06,479 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 04:16:06,479 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 04:16:06,479 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 04:16:06,479 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 04:16:06,479 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-01-30 04:16:06,479 INFO L128 BoogieDeclarations]: Found specification of procedure insert [2018-01-30 04:16:06,479 INFO L128 BoogieDeclarations]: Found specification of procedure elem_exists [2018-01-30 04:16:06,480 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 04:16:06,480 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 04:16:06,480 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 04:16:06,840 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 04:16:06,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 04:16:06 BoogieIcfgContainer [2018-01-30 04:16:06,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 04:16:06,841 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-30 04:16:06,841 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-30 04:16:06,842 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-30 04:16:06,843 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 04:16:06" (1/1) ... [2018-01-30 04:16:06,849 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-30 04:16:06,849 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-30 04:16:06,850 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-30 04:16:06,877 INFO L162 apSepIcfgTransformer]: finished StoreIndexFreezer, created 7 freeze vars and freeze var literals (each corresponds to one heap write) [2018-01-30 04:16:06,891 INFO L221 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-30 04:16:06,927 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-30 04:16:25,331 INFO L311 AbstractInterpreter]: Visited 119 different actions 907 times. Merged at 75 different actions 506 times. Widened at 6 different actions 14 times. Found 89 fixpoints after 23 different actions. Largest state had 52 variables. [2018-01-30 04:16:25,332 INFO L229 apSepIcfgTransformer]: finished equality analysis [2018-01-30 04:16:25,338 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 6 [2018-01-30 04:16:25,339 INFO L241 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-30 04:16:25,339 INFO L242 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-30 04:16:25,339 INFO L244 apSepIcfgTransformer]: select infos: Set: ((select (select |v_#memory_int_9| |v_main_~#set~7.base_7|) (+ |v_main_~#set~7.offset_7| (* 4 v_main_~i~7_11))), at (SUMMARY for call #t~mem7 := read~int(~#set~7.base, ~#set~7.offset + ~i~7 * 4, 4); srcloc: L27)) ((select |v_#memory_int_3| v_insert_~set.base_2), at (SUMMARY for call write~int(~value, ~set.base, ~set.offset + ~size * 4, 4); srcloc: L5)) ((select |v_#memory_int_12| |v_main_~#set~7.base_9|), at (SUMMARY for call write~int(#t~mem10, ~#set~7.base, ~#set~7.offset + ~i~7 * 4, 4); srcloc: L37')) ((select (select |v_#memory_int_10| |v_main_~#set~7.base_8|) (+ |v_main_~#set~7.offset_8| (* 4 v_main_~i~7_18) 4)), at (SUMMARY for call #t~mem10 := read~int(~#set~7.base, ~#set~7.offset + (~i~7 + 1) * 4, 4); srcloc: L37)) ((select (select |v_#memory_int_6| |v_main_~#set~7.base_1|) (+ (* 4 v_main_~i~7_4) |v_main_~#set~7.offset_1|)), at (SUMMARY for call #t~mem12 := read~int(~#set~7.base, ~#set~7.offset + ~i~7 * 4, 4); srcloc: L44)) ((select (select |v_#memory_int_1| v_elem_exists_~set.base_2) (+ v_elem_exists_~set.offset_2 (* 4 v_elem_exists_~i~5_5))), at (SUMMARY for call #t~mem2 := read~int(~set.base, ~set.offset + ~i~5 * 4, 4); srcloc: L11)) [2018-01-30 04:16:25,344 INFO L547 PartitionManager]: partitioning result: [2018-01-30 04:16:25,344 INFO L552 PartitionManager]: location blocks for array group [#memory_int] [2018-01-30 04:16:25,344 INFO L561 PartitionManager]: at dimension 0 [2018-01-30 04:16:25,344 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-01-30 04:16:25,345 INFO L563 PartitionManager]: # location blocks :2 [2018-01-30 04:16:25,345 INFO L561 PartitionManager]: at dimension 1 [2018-01-30 04:16:25,345 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-01-30 04:16:25,345 INFO L563 PartitionManager]: # location blocks :1 [2018-01-30 04:16:25,345 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-30 04:16:25,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 04:16:25 BasicIcfg [2018-01-30 04:16:25,358 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-30 04:16:25,359 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 04:16:25,359 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 04:16:25,360 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 04:16:25,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 04:16:06" (1/4) ... [2018-01-30 04:16:25,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ad8fbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 04:16:25, skipping insertion in model container [2018-01-30 04:16:25,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 04:16:06" (2/4) ... [2018-01-30 04:16:25,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ad8fbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 04:16:25, skipping insertion in model container [2018-01-30 04:16:25,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 04:16:06" (3/4) ... [2018-01-30 04:16:25,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ad8fbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 04:16:25, skipping insertion in model container [2018-01-30 04:16:25,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 04:16:25" (4/4) ... [2018-01-30 04:16:25,362 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-30 04:16:25,368 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 04:16:25,372 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 04:16:25,459 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 04:16:25,459 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 04:16:25,459 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 04:16:25,460 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 04:16:25,460 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 04:16:25,460 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 04:16:25,460 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 04:16:25,460 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 04:16:25,460 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 04:16:25,467 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states. [2018-01-30 04:16:25,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-30 04:16:25,471 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:16:25,472 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, 1] [2018-01-30 04:16:25,472 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:16:25,474 INFO L82 PathProgramCache]: Analyzing trace with hash -914862611, now seen corresponding path program 1 times [2018-01-30 04:16:25,475 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:16:25,475 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:16:25,504 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:16:25,504 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:16:25,504 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:16:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:16:25,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:16:25,544 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 04:16:25,546 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 04:16:25,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 04:16:25,547 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-30 04:16:25,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-30 04:16:25,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-30 04:16:25,554 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 2 states. [2018-01-30 04:16:25,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:16:25,574 INFO L93 Difference]: Finished difference Result 182 states and 221 transitions. [2018-01-30 04:16:25,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-30 04:16:25,575 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-01-30 04:16:25,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:16:25,580 INFO L225 Difference]: With dead ends: 182 [2018-01-30 04:16:25,580 INFO L226 Difference]: Without dead ends: 93 [2018-01-30 04:16:25,582 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-30 04:16:25,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-30 04:16:25,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-01-30 04:16:25,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-30 04:16:25,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2018-01-30 04:16:25,605 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 24 [2018-01-30 04:16:25,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:16:25,605 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2018-01-30 04:16:25,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-30 04:16:25,605 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2018-01-30 04:16:25,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-30 04:16:25,606 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:16:25,606 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, 1, 1, 1] [2018-01-30 04:16:25,606 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:16:25,606 INFO L82 PathProgramCache]: Analyzing trace with hash 461769487, now seen corresponding path program 1 times [2018-01-30 04:16:25,606 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:16:25,606 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:16:25,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:16:25,607 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:16:25,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:16:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:16:25,617 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:16:25,669 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 04:16:25,669 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 04:16:25,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 04:16:25,670 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 04:16:25,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 04:16:25,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 04:16:25,670 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand 3 states. [2018-01-30 04:16:25,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:16:25,721 INFO L93 Difference]: Finished difference Result 125 states and 143 transitions. [2018-01-30 04:16:25,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 04:16:25,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-01-30 04:16:25,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:16:25,722 INFO L225 Difference]: With dead ends: 125 [2018-01-30 04:16:25,722 INFO L226 Difference]: Without dead ends: 98 [2018-01-30 04:16:25,723 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 04:16:25,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-30 04:16:25,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-01-30 04:16:25,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-30 04:16:25,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2018-01-30 04:16:25,729 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 26 [2018-01-30 04:16:25,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:16:25,730 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2018-01-30 04:16:25,730 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 04:16:25,730 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2018-01-30 04:16:25,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-30 04:16:25,731 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:16:25,731 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 04:16:25,731 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:16:25,731 INFO L82 PathProgramCache]: Analyzing trace with hash -2031848768, now seen corresponding path program 1 times [2018-01-30 04:16:25,731 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:16:25,731 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:16:25,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:16:25,732 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:16:25,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:16:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:16:25,742 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:16:26,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 04:16:26,002 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:16:26,002 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 04:16:26,034 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:16:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:16:26,072 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:16:26,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 04:16:26,155 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 04:16:26,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2018-01-30 04:16:26,156 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 04:16:26,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 04:16:26,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-30 04:16:26,156 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand 10 states. [2018-01-30 04:16:26,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:16:26,598 INFO L93 Difference]: Finished difference Result 227 states and 261 transitions. [2018-01-30 04:16:26,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 04:16:26,598 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-01-30 04:16:26,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:16:26,600 INFO L225 Difference]: With dead ends: 227 [2018-01-30 04:16:26,600 INFO L226 Difference]: Without dead ends: 178 [2018-01-30 04:16:26,600 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-01-30 04:16:26,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-01-30 04:16:26,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 116. [2018-01-30 04:16:26,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-30 04:16:26,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 130 transitions. [2018-01-30 04:16:26,608 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 130 transitions. Word has length 39 [2018-01-30 04:16:26,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:16:26,608 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 130 transitions. [2018-01-30 04:16:26,608 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 04:16:26,608 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 130 transitions. [2018-01-30 04:16:26,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-30 04:16:26,609 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:16:26,609 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:16:26,609 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:16:26,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1583445219, now seen corresponding path program 1 times [2018-01-30 04:16:26,610 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:16:26,610 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:16:26,610 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:16:26,610 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:16:26,610 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:16:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:16:26,621 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 04:16:26,792 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 04:16:26,792 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 04:16:26,793 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 04:16:26,804 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:16:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 04:16:26,826 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 04:16:26,890 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 04:16:26,907 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 04:16:26,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-01-30 04:16:26,908 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-30 04:16:26,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-30 04:16:26,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-01-30 04:16:26,908 INFO L87 Difference]: Start difference. First operand 116 states and 130 transitions. Second operand 14 states. [2018-01-30 04:16:27,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 04:16:27,427 INFO L93 Difference]: Finished difference Result 226 states and 260 transitions. [2018-01-30 04:16:27,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 04:16:27,428 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2018-01-30 04:16:27,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 04:16:27,429 INFO L225 Difference]: With dead ends: 226 [2018-01-30 04:16:27,429 INFO L226 Difference]: Without dead ends: 141 [2018-01-30 04:16:27,430 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2018-01-30 04:16:27,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-01-30 04:16:27,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2018-01-30 04:16:27,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-30 04:16:27,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 149 transitions. [2018-01-30 04:16:27,437 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 149 transitions. Word has length 56 [2018-01-30 04:16:27,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 04:16:27,438 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 149 transitions. [2018-01-30 04:16:27,438 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-30 04:16:27,438 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 149 transitions. [2018-01-30 04:16:27,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-30 04:16:27,439 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 04:16:27,439 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 04:16:27,440 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 04:16:27,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1287684134, now seen corresponding path program 2 times [2018-01-30 04:16:27,440 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 04:16:27,440 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 04:16:27,440 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:16:27,440 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 04:16:27,440 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 04:16:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-30 04:16:27,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-30 04:16:27,484 INFO L409 BasicCegarLoop]: Counterexample might be feasible [2018-01-30 04:16:27,485 INFO L84 mationBacktranslator]: Skipped ATE [477] [477] ULTIMATE.startENTRY-->L1: Formula: true InVars {} OutVars{#NULL.offset=|v_#NULL.offset_2|, ~SIZE=v_~SIZE_2, #NULL.base=|v_#NULL.base_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[~SIZE, #valid, #NULL.offset, #NULL.base] [2018-01-30 04:16:27,485 INFO L84 mationBacktranslator]: Skipped ATE [483] [483] L1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-30 04:16:27,485 INFO L84 mationBacktranslator]: Skipped ATE [489] [489] mainENTRY-->L16: Formula: true InVars {} OutVars{main_~i~7=v_main_~i~7_7} AuxVars[] AssignedVars[main_~i~7] [2018-01-30 04:16:27,485 INFO L84 mationBacktranslator]: Skipped ATE [493] [493] L16-->L16': Formula: true InVars {} OutVars{main_~pos~7=v_main_~pos~7_1} AuxVars[] AssignedVars[main_~pos~7] [2018-01-30 04:16:27,485 INFO L84 mationBacktranslator]: Skipped ATE [497] [497] L16'-->L16'': Formula: (= v_main_~n~7_1 0) InVars {} OutVars{main_~n~7=v_main_~n~7_1} AuxVars[] AssignedVars[main_~n~7] [2018-01-30 04:16:27,486 INFO L84 mationBacktranslator]: Skipped ATE [501] [501] L16''-->L17: Formula: (= v_main_~found~7_4 0) InVars {} OutVars{main_~found~7=v_main_~found~7_4} AuxVars[] AssignedVars[main_~found~7] [2018-01-30 04:16:27,486 INFO L84 mationBacktranslator]: Skipped ATE [503] [503] L17-->L17': Formula: (and (= 0 (select |v_#valid_10| |v_main_~#set~7.base_4|)) (= |v_main_~#set~7.offset_4| 0) (= |v_#length_3| (store |v_#length_4| |v_main_~#set~7.base_4| (* 4 v_~SIZE_6))) (not (= 0 |v_main_~#set~7.base_4|)) (= |v_#valid_9| (store |v_#valid_10| |v_main_~#set~7.base_4| 1))) InVars {#length=|v_#length_4|, ~SIZE=v_~SIZE_6, #valid=|v_#valid_10|} OutVars{main_~#set~7.offset=|v_main_~#set~7.offset_4|, #length=|v_#length_3|, ~SIZE=v_~SIZE_6, main_~#set~7.base=|v_main_~#set~7.base_4|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[main_~#set~7.base, #valid, main_~#set~7.offset, #length] [2018-01-30 04:16:27,486 INFO L84 mationBacktranslator]: Skipped ATE [505] [505] L17'-->L19: Formula: true InVars {} OutVars{main_~values~7=v_main_~values~7_1} AuxVars[] AssignedVars[main_~values~7] [2018-01-30 04:16:27,486 INFO L84 mationBacktranslator]: Skipped ATE [507] [507] L19-->L20: Formula: true InVars {} OutVars{main_~element~7=v_main_~element~7_2} AuxVars[] AssignedVars[main_~element~7] [2018-01-30 04:16:27,486 INFO L84 mationBacktranslator]: Skipped ATE [509] [509] L20-->L21: Formula: true InVars {} OutVars{main_~v~7=v_main_~v~7_1} AuxVars[] AssignedVars[main_~v~7] [2018-01-30 04:16:27,486 INFO L84 mationBacktranslator]: Skipped ATE [511] [511] L21-->L21'''''': Formula: (= v_main_~v~7_2 0) InVars {} OutVars{main_~v~7=v_main_~v~7_2} AuxVars[] AssignedVars[main_~v~7] [2018-01-30 04:16:27,486 INFO L84 mationBacktranslator]: Skipped ATE [513] [513] L21''''''-->L21': Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-30 04:16:27,486 INFO L84 mationBacktranslator]: Skipped ATE [519] [519] L21'-->L22: Formula: (< v_main_~v~7_4 v_~SIZE_8) InVars {~SIZE=v_~SIZE_8, main_~v~7=v_main_~v~7_4} OutVars{~SIZE=v_~SIZE_8, main_~v~7=v_main_~v~7_4} AuxVars[] AssignedVars[] [2018-01-30 04:16:27,486 INFO L84 mationBacktranslator]: Skipped ATE [523] [523] L22-->L22': Formula: true InVars {} OutVars{main_#t~ret4=|v_main_#t~ret4_1|} AuxVars[] AssignedVars[main_#t~ret4] [2018-01-30 04:16:27,486 INFO L84 mationBacktranslator]: Skipped ATE [531] [531] L22'-->L22'': Formula: (and (<= |v_main_#t~ret4_2| 2147483647) (<= 0 (+ |v_main_#t~ret4_2| 2147483648))) InVars {main_#t~ret4=|v_main_#t~ret4_2|} OutVars{main_#t~ret4=|v_main_#t~ret4_2|} AuxVars[] AssignedVars[] [2018-01-30 04:16:27,486 INFO L84 mationBacktranslator]: Skipped ATE [545] [545] L22''-->L22''''': Formula: (= |v_main_#t~ret4_5| 1) InVars {main_#t~ret4=|v_main_#t~ret4_5|} OutVars{main_#t~ret4=|v_main_#t~ret4_5|} AuxVars[] AssignedVars[] [2018-01-30 04:16:27,486 INFO L84 mationBacktranslator]: Skipped ATE [559] [559] L22'''''-->L21''': Formula: true InVars {} OutVars{main_#t~ret4=|v_main_#t~ret4_6|} AuxVars[] AssignedVars[main_#t~ret4] [2018-01-30 04:16:27,486 INFO L84 mationBacktranslator]: Skipped ATE [579] [579] L21'''-->L21'''': Formula: (= |v_main_#t~post3_1| v_main_~v~7_7) InVars {main_~v~7=v_main_~v~7_7} OutVars{main_#t~post3=|v_main_#t~post3_1|, main_~v~7=v_main_~v~7_7} AuxVars[] AssignedVars[main_#t~post3] [2018-01-30 04:16:27,487 INFO L84 mationBacktranslator]: Skipped ATE [601] [601] L21''''-->L21''''': Formula: (= v_main_~v~7_8 (+ |v_main_#t~post3_2| 1)) InVars {main_#t~post3=|v_main_#t~post3_2|} OutVars{main_~v~7=v_main_~v~7_8, main_#t~post3=|v_main_#t~post3_2|} AuxVars[] AssignedVars[main_~v~7] [2018-01-30 04:16:27,487 INFO L84 mationBacktranslator]: Skipped ATE [621] [621] L21'''''-->L21'''''': Formula: true InVars {} OutVars{main_#t~post3=|v_main_#t~post3_3|} AuxVars[] AssignedVars[main_#t~post3] [2018-01-30 04:16:27,487 INFO L84 mationBacktranslator]: Skipped ATE [513] [513] L21''''''-->L21': Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-30 04:16:27,487 INFO L84 mationBacktranslator]: Skipped ATE [519] [519] L21'-->L22: Formula: (< v_main_~v~7_4 v_~SIZE_8) InVars {~SIZE=v_~SIZE_8, main_~v~7=v_main_~v~7_4} OutVars{~SIZE=v_~SIZE_8, main_~v~7=v_main_~v~7_4} AuxVars[] AssignedVars[] [2018-01-30 04:16:27,487 INFO L84 mationBacktranslator]: Skipped ATE [523] [523] L22-->L22': Formula: true InVars {} OutVars{main_#t~ret4=|v_main_#t~ret4_1|} AuxVars[] AssignedVars[main_#t~ret4] [2018-01-30 04:16:27,487 INFO L84 mationBacktranslator]: Skipped ATE [531] [531] L22'-->L22'': Formula: (and (<= |v_main_#t~ret4_2| 2147483647) (<= 0 (+ |v_main_#t~ret4_2| 2147483648))) InVars {main_#t~ret4=|v_main_#t~ret4_2|} OutVars{main_#t~ret4=|v_main_#t~ret4_2|} AuxVars[] AssignedVars[] [2018-01-30 04:16:27,487 INFO L84 mationBacktranslator]: Skipped ATE [545] [545] L22''-->L22''''': Formula: (= |v_main_#t~ret4_5| 1) InVars {main_#t~ret4=|v_main_#t~ret4_5|} OutVars{main_#t~ret4=|v_main_#t~ret4_5|} AuxVars[] AssignedVars[] [2018-01-30 04:16:27,487 INFO L84 mationBacktranslator]: Skipped ATE [559] [559] L22'''''-->L21''': Formula: true InVars {} OutVars{main_#t~ret4=|v_main_#t~ret4_6|} AuxVars[] AssignedVars[main_#t~ret4] [2018-01-30 04:16:27,487 INFO L84 mationBacktranslator]: Skipped ATE [579] [579] L21'''-->L21'''': Formula: (= |v_main_#t~post3_1| v_main_~v~7_7) InVars {main_~v~7=v_main_~v~7_7} OutVars{main_#t~post3=|v_main_#t~post3_1|, main_~v~7=v_main_~v~7_7} AuxVars[] AssignedVars[main_#t~post3] [2018-01-30 04:16:27,487 INFO L84 mationBacktranslator]: Skipped ATE [601] [601] L21''''-->L21''''': Formula: (= v_main_~v~7_8 (+ |v_main_#t~post3_2| 1)) InVars {main_#t~post3=|v_main_#t~post3_2|} OutVars{main_~v~7=v_main_~v~7_8, main_#t~post3=|v_main_#t~post3_2|} AuxVars[] AssignedVars[main_~v~7] [2018-01-30 04:16:27,487 INFO L84 mationBacktranslator]: Skipped ATE [621] [621] L21'''''-->L21'''''': Formula: true InVars {} OutVars{main_#t~post3=|v_main_#t~post3_3|} AuxVars[] AssignedVars[main_#t~post3] [2018-01-30 04:16:27,487 INFO L84 mationBacktranslator]: Skipped ATE [513] [513] L21''''''-->L21': Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-30 04:16:27,487 INFO L84 mationBacktranslator]: Skipped ATE [517] [517] L21'-->L21''''''': Formula: (not (< v_main_~v~7_3 v_~SIZE_7)) InVars {~SIZE=v_~SIZE_7, main_~v~7=v_main_~v~7_3} OutVars{~SIZE=v_~SIZE_7, main_~v~7=v_main_~v~7_3} AuxVars[] AssignedVars[] [2018-01-30 04:16:27,487 INFO L84 mationBacktranslator]: Skipped ATE [521] [521] L21'''''''-->L26''''': Formula: (= v_main_~i~7_8 0) InVars {} OutVars{main_~i~7=v_main_~i~7_8} AuxVars[] AssignedVars[main_~i~7] [2018-01-30 04:16:27,487 INFO L84 mationBacktranslator]: Skipped ATE [527] [527] L26'''''-->L26: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-30 04:16:27,488 INFO L84 mationBacktranslator]: Skipped ATE [537] [537] L26-->L27: Formula: (and (< v_main_~i~7_10 v_~SIZE_10) (not (= 1 v_main_~found~7_6))) InVars {main_~found~7=v_main_~found~7_6, ~SIZE=v_~SIZE_10, main_~i~7=v_main_~i~7_10} OutVars{main_~found~7=v_main_~found~7_6, ~SIZE=v_~SIZE_10, main_~i~7=v_main_~i~7_10} AuxVars[] AssignedVars[] [2018-01-30 04:16:27,488 INFO L84 mationBacktranslator]: Skipped ATE [549] [549] L27-->L27': Formula: (= (select (select |v_#memory_int_part_locs_30_locs_72_1| |v_main_~#set~7.base_7|) (+ |v_main_~#set~7.offset_7| (* 4 v_main_~i~7_11))) |v_main_#t~mem7_1|) InVars {main_~#set~7.offset=|v_main_~#set~7.offset_7|, #memory_int_part_locs_30_locs_72=|v_#memory_int_part_locs_30_locs_72_1|, main_~#set~7.base=|v_main_~#set~7.base_7|, main_~i~7=v_main_~i~7_11} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~#set~7.offset=|v_main_~#set~7.offset_7|, #memory_int_part_locs_30_locs_72=|v_#memory_int_part_locs_30_locs_72_1|, main_~#set~7.base=|v_main_~#set~7.base_7|, main_~i~7=v_main_~i~7_11} AuxVars[] AssignedVars[main_#t~mem7] [2018-01-30 04:16:27,488 INFO L84 mationBacktranslator]: Skipped ATE [563] [563] L27'-->L27'': Formula: (= |v_main_#t~mem7_2| v_main_~element~7_3) InVars {main_#t~mem7=|v_main_#t~mem7_2|, main_~element~7=v_main_~element~7_3} OutVars{main_#t~mem7=|v_main_#t~mem7_2|, main_~element~7=v_main_~element~7_3} AuxVars[] AssignedVars[] [2018-01-30 04:16:27,488 INFO L84 mationBacktranslator]: Skipped ATE [583] [583] L27''-->L29: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_3|} AuxVars[] AssignedVars[main_#t~mem7] [2018-01-30 04:16:27,488 INFO L84 mationBacktranslator]: Skipped ATE [605] [605] L29-->L30: Formula: (= v_main_~found~7_7 1) InVars {} OutVars{main_~found~7=v_main_~found~7_7} AuxVars[] AssignedVars[main_~found~7] [2018-01-30 04:16:27,488 INFO L84 mationBacktranslator]: Skipped ATE [627] [627] L30-->L26'': Formula: (= v_main_~pos~7_2 v_main_~i~7_12) InVars {main_~i~7=v_main_~i~7_12} OutVars{main_~pos~7=v_main_~pos~7_2, main_~i~7=v_main_~i~7_12} AuxVars[] AssignedVars[main_~pos~7] [2018-01-30 04:16:27,488 INFO L84 mationBacktranslator]: Skipped ATE [607] [607] L26''-->L26''': Formula: (= |v_main_#t~post6_1| v_main_~i~7_13) InVars {main_~i~7=v_main_~i~7_13} OutVars{main_#t~post6=|v_main_#t~post6_1|, main_~i~7=v_main_~i~7_13} AuxVars[] AssignedVars[main_#t~post6] [2018-01-30 04:16:27,488 INFO L84 mationBacktranslator]: Skipped ATE [629] [629] L26'''-->L26'''': Formula: (= v_main_~i~7_14 (+ |v_main_#t~post6_2| 1)) InVars {main_#t~post6=|v_main_#t~post6_2|} OutVars{main_#t~post6=|v_main_#t~post6_2|, main_~i~7=v_main_~i~7_14} AuxVars[] AssignedVars[main_~i~7] [2018-01-30 04:16:27,488 INFO L84 mationBacktranslator]: Skipped ATE [645] [645] L26''''-->L26''''': Formula: true InVars {} OutVars{main_#t~post6=|v_main_#t~post6_3|} AuxVars[] AssignedVars[main_#t~post6] [2018-01-30 04:16:27,488 INFO L84 mationBacktranslator]: Skipped ATE [527] [527] L26'''''-->L26: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-30 04:16:27,488 INFO L84 mationBacktranslator]: Skipped ATE [535] [535] L26-->L26'''''': Formula: (or (not (< v_main_~i~7_9 v_~SIZE_9)) (= 1 v_main_~found~7_5)) InVars {main_~found~7=v_main_~found~7_5, ~SIZE=v_~SIZE_9, main_~i~7=v_main_~i~7_9} OutVars{main_~found~7=v_main_~found~7_5, ~SIZE=v_~SIZE_9, main_~i~7=v_main_~i~7_9} AuxVars[] AssignedVars[] [2018-01-30 04:16:27,488 INFO L84 mationBacktranslator]: Skipped ATE [539] [539] L26''''''-->L35: Formula: (= 1 v_main_~found~7_8) InVars {main_~found~7=v_main_~found~7_8} OutVars{main_~found~7=v_main_~found~7_8} AuxVars[] AssignedVars[] [2018-01-30 04:16:27,488 INFO L84 mationBacktranslator]: Skipped ATE [551] [551] L35-->L35'''''': Formula: (= v_main_~i~7_15 v_main_~pos~7_3) InVars {main_~pos~7=v_main_~pos~7_3} OutVars{main_~pos~7=v_main_~pos~7_3, main_~i~7=v_main_~i~7_15} AuxVars[] AssignedVars[main_~i~7] [2018-01-30 04:16:27,489 INFO L84 mationBacktranslator]: Skipped ATE [567] [567] L35''''''-->L35': Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-30 04:16:27,489 INFO L84 mationBacktranslator]: Skipped ATE [589] [589] L35'-->L37: Formula: (< (+ v_main_~i~7_17 1) v_~SIZE_12) InVars {~SIZE=v_~SIZE_12, main_~i~7=v_main_~i~7_17} OutVars{~SIZE=v_~SIZE_12, main_~i~7=v_main_~i~7_17} AuxVars[] AssignedVars[] [2018-01-30 04:16:27,489 INFO L84 mationBacktranslator]: Skipped ATE [609] [609] L37-->L37': Formula: (= (select (select |v_#memory_int_part_locs_34_locs_72_1| |v_main_~#set~7.base_8|) (+ |v_main_~#set~7.offset_8| (* 4 v_main_~i~7_18) 4)) |v_main_#t~mem10_1|) InVars {main_~#set~7.offset=|v_main_~#set~7.offset_8|, #memory_int_part_locs_34_locs_72=|v_#memory_int_part_locs_34_locs_72_1|, main_~#set~7.base=|v_main_~#set~7.base_8|, main_~i~7=v_main_~i~7_18} OutVars{main_~#set~7.offset=|v_main_~#set~7.offset_8|, #memory_int_part_locs_34_locs_72=|v_#memory_int_part_locs_34_locs_72_1|, main_#t~mem10=|v_main_#t~mem10_1|, main_~#set~7.base=|v_main_~#set~7.base_8|, main_~i~7=v_main_~i~7_18} AuxVars[] AssignedVars[main_#t~mem10] [2018-01-30 04:16:27,489 INFO L84 mationBacktranslator]: Skipped ATE [631] [631] L37'-->L37'': Formula: (and (= |v_#memory_int_part_locs_30_locs_72_2| |v_#memory_int_part_locs_30_locs_72_3|) (= |v_#memory_int_part_locs_34_locs_72_2| (store |v_#memory_int_part_locs_34_locs_72_3| |v_main_~#set~7.base_9| (store (select |v_#memory_int_part_locs_34_locs_72_3| |v_main_~#set~7.base_9|) (+ |v_main_~#set~7.offset_9| (* 4 v_main_~i~7_19)) |v_main_#t~mem10_2|)))) InVars {#memory_int_part_locs_30_locs_72=|v_#memory_int_part_locs_30_locs_72_3|, #memory_int_part_locs_34_locs_72=|v_#memory_int_part_locs_34_locs_72_3|, main_#t~mem10=|v_main_#t~mem10_2|, main_~#set~7.base=|v_main_~#set~7.base_9|, main_~#set~7.offset=|v_main_~#set~7.offset_9|, main_~i~7=v_main_~i~7_19} OutVars{#memory_int_part_locs_30_locs_72=|v_#memory_int_part_locs_30_locs_72_2|, #memory_int_part_locs_34_locs_72=|v_#memory_int_part_locs_34_locs_72_2|, main_#t~mem10=|v_main_#t~mem10_2|, main_~#set~7.base=|v_main_~#set~7.base_9|, #memory_int=|v_#memory_int_11|, main_~#set~7.offset=|v_main_~#set~7.offset_9|, main_~i~7=v_main_~i~7_19} AuxVars[] AssignedVars[#memory_int_part_locs_30_locs_72, #memory_int_part_locs_34_locs_72, #memory_int] [2018-01-30 04:16:27,489 INFO L84 mationBacktranslator]: Skipped ATE [647] [647] L37''-->L35''': Formula: true InVars {} OutVars{main_#t~mem10=|v_main_#t~mem10_3|} AuxVars[] AssignedVars[main_#t~mem10] [2018-01-30 04:16:27,489 INFO L84 mationBacktranslator]: Skipped ATE [659] [659] L35'''-->L35'''': Formula: (= |v_main_#t~post8_2| v_main_~i~7_20) InVars {main_~i~7=v_main_~i~7_20} OutVars{main_#t~post8=|v_main_#t~post8_2|, main_~i~7=v_main_~i~7_20} AuxVars[] AssignedVars[main_#t~post8] [2018-01-30 04:16:27,489 INFO L84 mationBacktranslator]: Skipped ATE [671] [671] L35''''-->L35''''': Formula: (= v_main_~i~7_21 (+ |v_main_#t~post8_3| 1)) InVars {main_#t~post8=|v_main_#t~post8_3|} OutVars{main_#t~post8=|v_main_#t~post8_3|, main_~i~7=v_main_~i~7_21} AuxVars[] AssignedVars[main_~i~7] [2018-01-30 04:16:27,489 INFO L84 mationBacktranslator]: Skipped ATE [685] [685] L35'''''-->L35'''''': Formula: true InVars {} OutVars{main_#t~post8=|v_main_#t~post8_1|} AuxVars[] AssignedVars[main_#t~post8] [2018-01-30 04:16:27,489 INFO L84 mationBacktranslator]: Skipped ATE [567] [567] L35''''''-->L35': Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-30 04:16:27,489 INFO L84 mationBacktranslator]: Skipped ATE [587] [587] L35'-->L33: Formula: (not (< (+ v_main_~i~7_16 1) v_~SIZE_11)) InVars {~SIZE=v_~SIZE_11, main_~i~7=v_main_~i~7_16} OutVars{~SIZE=v_~SIZE_11, main_~i~7=v_main_~i~7_16} AuxVars[] AssignedVars[] [2018-01-30 04:16:27,489 INFO L84 mationBacktranslator]: Skipped ATE [553] [553] L33-->L42: Formula: (= 1 v_main_~found~7_2) InVars {main_~found~7=v_main_~found~7_2} OutVars{main_~found~7=v_main_~found~7_2} AuxVars[] AssignedVars[] [2018-01-30 04:16:27,489 INFO L84 mationBacktranslator]: Skipped ATE [571] [571] L42-->L42'''''': Formula: (= v_main_~i~7_1 0) InVars {} OutVars{main_~i~7=v_main_~i~7_1} AuxVars[] AssignedVars[main_~i~7] [2018-01-30 04:16:27,489 INFO L84 mationBacktranslator]: Skipped ATE [591] [591] L42''''''-->L42': Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-30 04:16:27,489 INFO L84 mationBacktranslator]: Skipped ATE [613] [613] L42'-->L44: Formula: (< (+ v_main_~i~7_3 1) v_~SIZE_5) InVars {~SIZE=v_~SIZE_5, main_~i~7=v_main_~i~7_3} OutVars{~SIZE=v_~SIZE_5, main_~i~7=v_main_~i~7_3} AuxVars[] AssignedVars[] [2018-01-30 04:16:27,490 INFO L84 mationBacktranslator]: Skipped ATE [633] [633] L44-->L44': Formula: (= (select (select |v_#memory_int_part_locs_34_locs_72_4| |v_main_~#set~7.base_1|) (+ (* 4 v_main_~i~7_4) |v_main_~#set~7.offset_1|)) |v_main_#t~mem12_1|) InVars {main_~#set~7.offset=|v_main_~#set~7.offset_1|, #memory_int_part_locs_34_locs_72=|v_#memory_int_part_locs_34_locs_72_4|, main_~#set~7.base=|v_main_~#set~7.base_1|, main_~i~7=v_main_~i~7_4} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_~#set~7.offset=|v_main_~#set~7.offset_1|, #memory_int_part_locs_34_locs_72=|v_#memory_int_part_locs_34_locs_72_4|, main_~#set~7.base=|v_main_~#set~7.base_1|, main_~i~7=v_main_~i~7_4} AuxVars[] AssignedVars[main_#t~mem12] [2018-01-30 04:16:27,490 INFO L84 mationBacktranslator]: Skipped ATE [651] [651] L44'-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= v_main_~element~7_5 |v_main_#t~mem12_4|)) 1 0)) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_~element~7=v_main_~element~7_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond] [2018-01-30 04:16:27,490 INFO L84 mationBacktranslator]: Skipped ATE [663] [663] __VERIFIER_assertENTRY-->L2: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] [2018-01-30 04:16:27,490 INFO L84 mationBacktranslator]: Skipped ATE [675] [675] L2-->L2': Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] [2018-01-30 04:16:27,490 INFO L84 mationBacktranslator]: Skipped ATE [689] [689] L2'-->__VERIFIER_assertErr0AssertViolation: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-30 04:16:27,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 04:16:27 BasicIcfg [2018-01-30 04:16:27,493 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 04:16:27,494 INFO L168 Benchmark]: Toolchain (without parser) took 21219.26 ms. Allocated memory was 151.0 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 116.2 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 322.5 MB. Max. memory is 5.3 GB. [2018-01-30 04:16:27,494 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 151.0 MB. Free memory is still 120.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 04:16:27,494 INFO L168 Benchmark]: CACSL2BoogieTranslator took 139.54 ms. Allocated memory is still 151.0 MB. Free memory was 116.0 MB in the beginning and 107.1 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 5.3 GB. [2018-01-30 04:16:27,494 INFO L168 Benchmark]: Boogie Preprocessor took 24.24 ms. Allocated memory is still 151.0 MB. Free memory was 107.1 MB in the beginning and 105.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 5.3 GB. [2018-01-30 04:16:27,494 INFO L168 Benchmark]: RCFGBuilder took 401.01 ms. Allocated memory is still 151.0 MB. Free memory was 105.3 MB in the beginning and 83.3 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. [2018-01-30 04:16:27,495 INFO L168 Benchmark]: IcfgTransformer took 18517.03 ms. Allocated memory was 151.0 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 83.0 MB in the beginning and 464.4 MB in the end (delta: -381.3 MB). Peak memory consumption was 958.2 MB. Max. memory is 5.3 GB. [2018-01-30 04:16:27,495 INFO L168 Benchmark]: TraceAbstraction took 2134.82 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 89.7 MB). Free memory was 464.4 MB in the beginning and 1.2 GB in the end (delta: -758.5 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 04:16:27,495 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.12 ms. Allocated memory is still 151.0 MB. Free memory is still 120.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 139.54 ms. Allocated memory is still 151.0 MB. Free memory was 116.0 MB in the beginning and 107.1 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 24.24 ms. Allocated memory is still 151.0 MB. Free memory was 107.1 MB in the beginning and 105.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 5.3 GB. * RCFGBuilder took 401.01 ms. Allocated memory is still 151.0 MB. Free memory was 105.3 MB in the beginning and 83.3 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. * IcfgTransformer took 18517.03 ms. Allocated memory was 151.0 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 83.0 MB in the beginning and 464.4 MB in the end (delta: -381.3 MB). Peak memory consumption was 958.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2134.82 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 89.7 MB). Free memory was 464.4 MB in the beginning and 1.2 GB in the end (delta: -758.5 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 : 98 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 1380 LocStat_NO_SUPPORTING_DISEQUALITIES : 988 LocStat_NO_DISJUNCTIONS : -196 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 134 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 145 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 130 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.007552 RENAME_VARIABLES(MILLISECONDS) : 0.146513 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.000283 PROJECTAWAY(MILLISECONDS) : 0.050558 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.024365 DISJOIN(MILLISECONDS) : 0.238056 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.158441 ADD_EQUALITY(MILLISECONDS) : 0.013962 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.004201 #CONJOIN_DISJUNCTIVE : 1444 #RENAME_VARIABLES : 3304 #UNFREEZE : 0 #CONJOIN : 2100 #PROJECTAWAY : 2003 #ADD_WEAK_EQUALITY : 8 #DISJOIN : 414 #RENAME_VARIABLES_DISJUNCTIVE : 3350 #ADD_EQUALITY : 147 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int] : 2 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 : 1 COUNT_ARRAY_READS for [#memory_int] : 6 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 2]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 99 locations, 1 error locations. UNSAFE Result, 2.0s OverallTime, 5 OverallIterations, 3 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 424 SDtfs, 563 SDslu, 1250 SDs, 0 SdLazy, 409 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=4, 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, 4 MinimizatonAttempts, 73 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 305 NumberOfCodeBlocks, 305 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 234 ConstructedInterpolants, 0 QuantifiedInterpolants, 40007 SizeOfPredicates, 10 NumberOfNonLiveVariables, 173 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 8/16 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/check_removal_from_set_after_insertion_false-unreach-call.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-30_04-16-27-503.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/check_removal_from_set_after_insertion_false-unreach-call.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-01-30_04-16-27-503.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/check_removal_from_set_after_insertion_false-unreach-call.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-01-30_04-16-27-503.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/check_removal_from_set_after_insertion_false-unreach-call.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-01-30_04-16-27-503.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/check_removal_from_set_after_insertion_false-unreach-call.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_04-16-27-503.csv Received shutdown request...