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/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 01:04:01,304 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 01:04:01,306 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 01:04:01,321 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 01:04:01,322 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 01:04:01,323 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 01:04:01,324 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 01:04:01,325 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 01:04:01,327 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 01:04:01,328 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 01:04:01,329 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 01:04:01,329 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 01:04:01,330 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 01:04:01,331 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 01:04:01,332 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 01:04:01,335 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 01:04:01,337 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 01:04:01,339 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 01:04:01,340 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 01:04:01,341 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 01:04:01,344 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 01:04:01,344 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 01:04:01,344 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 01:04:01,345 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 01:04:01,346 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 01:04:01,348 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 01:04:01,348 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 01:04:01,349 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 01:04:01,349 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 01:04:01,349 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 01:04:01,350 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 01:04:01,350 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 01:04:01,359 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 01:04:01,359 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 01:04:01,360 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 01:04:01,360 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 01:04:01,360 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 01:04:01,360 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 01:04:01,360 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 01:04:01,361 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 01:04:01,361 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 01:04:01,361 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 01:04:01,361 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 01:04:01,361 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 01:04:01,361 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 01:04:01,362 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 01:04:01,362 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 01:04:01,362 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 01:04:01,362 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 01:04:01,362 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 01:04:01,362 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 01:04:01,362 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 01:04:01,362 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 01:04:01,363 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 01:04:01,363 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 01:04:01,363 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 01:04:01,363 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 01:04:01,363 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 01:04:01,364 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 01:04:01,364 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 01:04:01,364 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 01:04:01,364 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 01:04:01,364 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 01:04:01,364 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 01:04:01,365 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 01:04:01,365 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 01:04:01,400 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 01:04:01,412 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 01:04:01,415 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 01:04:01,416 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 01:04:01,417 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 01:04:01,417 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-01-30 01:04:01,592 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 01:04:01,597 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-30 01:04:01,598 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 01:04:01,598 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 01:04:01,604 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 01:04:01,605 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:04:01" (1/1) ... [2018-01-30 01:04:01,607 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76f35a96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:04:01, skipping insertion in model container [2018-01-30 01:04:01,607 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:04:01" (1/1) ... [2018-01-30 01:04:01,621 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:04:01,659 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:04:01,773 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:04:01,796 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:04:01,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:04:01 WrapperNode [2018-01-30 01:04:01,802 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 01:04:01,803 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 01:04:01,803 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 01:04:01,803 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 01:04:01,814 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:04:01" (1/1) ... [2018-01-30 01:04:01,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:04:01" (1/1) ... [2018-01-30 01:04:01,825 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:04:01" (1/1) ... [2018-01-30 01:04:01,825 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:04:01" (1/1) ... [2018-01-30 01:04:01,829 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:04:01" (1/1) ... [2018-01-30 01:04:01,832 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:04:01" (1/1) ... [2018-01-30 01:04:01,833 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:04:01" (1/1) ... [2018-01-30 01:04:01,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 01:04:01,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 01:04:01,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 01:04:01,835 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 01:04:01,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:04:01" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 01:04:01,882 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 01:04:01,883 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 01:04:01,883 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrspn [2018-01-30 01:04:01,883 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 01:04:01,883 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-30 01:04:01,883 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-30 01:04:01,884 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 01:04:01,884 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 01:04:01,884 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 01:04:01,884 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 01:04:01,884 INFO L128 BoogieDeclarations]: Found specification of procedure cstrspn [2018-01-30 01:04:01,884 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 01:04:01,885 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 01:04:01,885 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 01:04:02,150 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 01:04:02,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:04:02 BoogieIcfgContainer [2018-01-30 01:04:02,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 01:04:02,151 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-30 01:04:02,152 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-30 01:04:02,152 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-30 01:04:02,155 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:04:02" (1/1) ... [2018-01-30 01:04:02,161 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-30 01:04:02,162 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-30 01:04:02,162 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-30 01:04:02,214 INFO L162 apSepIcfgTransformer]: finished StoreIndexFreezer, created 9 freeze vars and freeze var literals (each corresponds to one heap write) [2018-01-30 01:04:02,248 INFO L221 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-30 01:04:02,317 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-30 01:05:21,710 INFO L311 AbstractInterpreter]: Visited 101 different actions 1156 times. Merged at 67 different actions 695 times. Widened at 1 different actions 4 times. Found 82 fixpoints after 10 different actions. Largest state had 61 variables. [2018-01-30 01:05:21,713 INFO L229 apSepIcfgTransformer]: finished equality analysis [2018-01-30 01:05:21,726 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 7 [2018-01-30 01:05:21,726 INFO L241 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-30 01:05:21,727 INFO L242 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-30 01:05:21,727 INFO L244 apSepIcfgTransformer]: select infos: Set: ((select (select |v_#memory_int_10| v_cstrspn_~s~2.base_6) v_cstrspn_~s~2.offset_5), at (SUMMARY for call #t~mem4 := read~int(~s~2.base, ~s~2.offset, 1); srcloc: L548''')) ((select |v_#memory_int_6| v_main_~nondetString2~4.base_2), at (SUMMARY for call write~int(0, ~nondetString2~4.base, ~nondetString2~4.offset + (~length2~4 - 1) * 1, 1); srcloc: L566')) ((select (select |v_#memory_int_9| v_cstrspn_~s~2.base_3) v_cstrspn_~s~2.offset_3), at (SUMMARY for call #t~mem3 := read~int(~s~2.base, ~s~2.offset, 1); srcloc: L548)) ((select (select |v_#memory_int_11| v_cstrspn_~s~2.base_11) v_cstrspn_~s~2.offset_9), at (SUMMARY for call #t~mem7 := read~int(~s~2.base, ~s~2.offset, 1); srcloc: L548''''''''''''''')) ((select |v_#memory_int_4| v_main_~nondetString1~4.base_2), at (SUMMARY for call write~int(0, ~nondetString1~4.base, ~nondetString1~4.offset + (~length1~4 - 1) * 1, 1); srcloc: L566)) ((select (select |v_#memory_int_8| v_cstrspn_~sc1~2.base_6) v_cstrspn_~sc1~2.offset_5), at (SUMMARY for call #t~mem2 := read~int(~sc1~2.base, ~sc1~2.offset, 1); srcloc: L547)) ((select (select |v_#memory_int_7| v_cstrspn_~sc1~2.base_3) v_cstrspn_~sc1~2.offset_3), at (SUMMARY for call #t~mem1 := read~int(~sc1~2.base, ~sc1~2.offset, 1); srcloc: L545')) [2018-01-30 01:05:21,756 INFO L547 PartitionManager]: partitioning result: [2018-01-30 01:05:21,756 INFO L552 PartitionManager]: location blocks for array group [#memory_int] [2018-01-30 01:05:21,756 INFO L561 PartitionManager]: at dimension 0 [2018-01-30 01:05:21,756 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 3 [2018-01-30 01:05:21,756 INFO L563 PartitionManager]: # location blocks :3 [2018-01-30 01:05:21,757 INFO L561 PartitionManager]: at dimension 1 [2018-01-30 01:05:21,757 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-01-30 01:05:21,757 INFO L563 PartitionManager]: # location blocks :1 [2018-01-30 01:05:21,757 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-30 01:05:21,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 01:05:21 BasicIcfg [2018-01-30 01:05:21,796 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-30 01:05:21,797 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 01:05:21,797 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 01:05:21,861 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 01:05:21,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 01:04:01" (1/4) ... [2018-01-30 01:05:21,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5345e4ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:05:21, skipping insertion in model container [2018-01-30 01:05:21,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:04:01" (2/4) ... [2018-01-30 01:05:21,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5345e4ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:05:21, skipping insertion in model container [2018-01-30 01:05:21,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:04:02" (3/4) ... [2018-01-30 01:05:21,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5345e4ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 01:05:21, skipping insertion in model container [2018-01-30 01:05:21,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 01:05:21" (4/4) ... [2018-01-30 01:05:21,865 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-30 01:05:21,875 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 01:05:21,896 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-30 01:05:21,942 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 01:05:21,942 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 01:05:21,942 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 01:05:21,943 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 01:05:21,943 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 01:05:21,943 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 01:05:21,943 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 01:05:21,943 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 01:05:21,944 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 01:05:21,955 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2018-01-30 01:05:21,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-30 01:05:21,961 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:05:21,962 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:05:21,962 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-01-30 01:05:21,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1050940434, now seen corresponding path program 1 times [2018-01-30 01:05:21,967 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:05:21,967 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:05:22,009 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:22,009 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:05:22,009 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:05:22,068 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:05:22,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:05:22,175 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:05:22,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:05:22,177 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:05:22,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:05:22,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:05:22,187 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 4 states. [2018-01-30 01:05:22,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:05:22,308 INFO L93 Difference]: Finished difference Result 149 states and 164 transitions. [2018-01-30 01:05:22,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:05:22,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-30 01:05:22,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:05:22,320 INFO L225 Difference]: With dead ends: 149 [2018-01-30 01:05:22,320 INFO L226 Difference]: Without dead ends: 87 [2018-01-30 01:05:22,323 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:05:22,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-30 01:05:22,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-01-30 01:05:22,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-30 01:05:22,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2018-01-30 01:05:22,359 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 15 [2018-01-30 01:05:22,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:05:22,359 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2018-01-30 01:05:22,359 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:05:22,360 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2018-01-30 01:05:22,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-30 01:05:22,360 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:05:22,361 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:05:22,361 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-01-30 01:05:22,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1050940432, now seen corresponding path program 1 times [2018-01-30 01:05:22,361 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:05:22,361 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:05:22,362 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:22,362 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:05:22,362 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:05:22,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:05:22,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:05:22,533 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:05:22,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:05:22,534 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:05:22,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:05:22,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:05:22,535 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand 6 states. [2018-01-30 01:05:22,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:05:22,626 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2018-01-30 01:05:22,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:05:22,628 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-30 01:05:22,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:05:22,630 INFO L225 Difference]: With dead ends: 87 [2018-01-30 01:05:22,630 INFO L226 Difference]: Without dead ends: 86 [2018-01-30 01:05:22,631 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-30 01:05:22,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-30 01:05:22,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-01-30 01:05:22,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-30 01:05:22,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2018-01-30 01:05:22,640 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 15 [2018-01-30 01:05:22,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:05:22,641 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2018-01-30 01:05:22,641 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:05:22,641 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2018-01-30 01:05:22,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-30 01:05:22,642 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:05:22,642 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:05:22,642 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-01-30 01:05:22,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1780585313, now seen corresponding path program 1 times [2018-01-30 01:05:22,642 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:05:22,643 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:05:22,644 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:22,644 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:05:22,644 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:05:22,656 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:05:22,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:05:22,682 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:05:22,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:05:22,682 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:05:22,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:05:22,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:05:22,683 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand 4 states. [2018-01-30 01:05:22,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:05:22,736 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2018-01-30 01:05:22,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:05:22,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-30 01:05:22,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:05:22,738 INFO L225 Difference]: With dead ends: 86 [2018-01-30 01:05:22,738 INFO L226 Difference]: Without dead ends: 85 [2018-01-30 01:05:22,738 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:05:22,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-30 01:05:22,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-30 01:05:22,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-30 01:05:22,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2018-01-30 01:05:22,744 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 16 [2018-01-30 01:05:22,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:05:22,744 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2018-01-30 01:05:22,744 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:05:22,744 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2018-01-30 01:05:22,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-30 01:05:22,744 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:05:22,745 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:05:22,745 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-01-30 01:05:22,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1780585315, now seen corresponding path program 1 times [2018-01-30 01:05:22,745 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:05:22,745 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:05:22,746 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:22,746 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:05:22,746 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:05:22,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:05:22,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:05:22,832 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:05:22,832 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:05:22,833 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:05:22,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:05:22,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:05:22,833 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 5 states. [2018-01-30 01:05:22,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:05:22,883 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-01-30 01:05:22,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:05:22,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-30 01:05:22,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:05:22,886 INFO L225 Difference]: With dead ends: 85 [2018-01-30 01:05:22,886 INFO L226 Difference]: Without dead ends: 84 [2018-01-30 01:05:22,886 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:05:22,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-30 01:05:22,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-30 01:05:22,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-30 01:05:22,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2018-01-30 01:05:22,893 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 16 [2018-01-30 01:05:22,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:05:22,893 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2018-01-30 01:05:22,894 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 01:05:22,894 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2018-01-30 01:05:22,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-30 01:05:22,895 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:05:22,895 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] [2018-01-30 01:05:22,895 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-01-30 01:05:22,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1247887850, now seen corresponding path program 1 times [2018-01-30 01:05:22,895 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:05:22,896 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:05:22,897 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:22,897 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:05:22,897 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:05:22,910 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:05:22,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:05:22,967 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:05:22,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:05:22,968 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:05:22,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:05:22,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:05:22,968 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand 6 states. [2018-01-30 01:05:23,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:05:23,164 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2018-01-30 01:05:23,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:05:23,165 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-30 01:05:23,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:05:23,166 INFO L225 Difference]: With dead ends: 88 [2018-01-30 01:05:23,166 INFO L226 Difference]: Without dead ends: 86 [2018-01-30 01:05:23,166 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-30 01:05:23,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-30 01:05:23,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-01-30 01:05:23,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-30 01:05:23,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2018-01-30 01:05:23,173 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 25 [2018-01-30 01:05:23,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:05:23,174 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2018-01-30 01:05:23,174 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:05:23,174 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2018-01-30 01:05:23,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-30 01:05:23,175 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:05:23,175 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] [2018-01-30 01:05:23,175 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-01-30 01:05:23,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1247887852, now seen corresponding path program 1 times [2018-01-30 01:05:23,175 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:05:23,175 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:05:23,176 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:23,176 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:05:23,176 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:05:23,194 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:05:23,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:05:23,307 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:05:23,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 01:05:23,308 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 01:05:23,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 01:05:23,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-30 01:05:23,308 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand 9 states. [2018-01-30 01:05:23,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:05:23,521 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2018-01-30 01:05:23,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 01:05:23,522 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-01-30 01:05:23,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:05:23,523 INFO L225 Difference]: With dead ends: 86 [2018-01-30 01:05:23,523 INFO L226 Difference]: Without dead ends: 84 [2018-01-30 01:05:23,523 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-01-30 01:05:23,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-30 01:05:23,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-30 01:05:23,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-30 01:05:23,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2018-01-30 01:05:23,531 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 25 [2018-01-30 01:05:23,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:05:23,532 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2018-01-30 01:05:23,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 01:05:23,532 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2018-01-30 01:05:23,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-30 01:05:23,533 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:05:23,533 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] [2018-01-30 01:05:23,533 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-01-30 01:05:23,533 INFO L82 PathProgramCache]: Analyzing trace with hash -456998170, now seen corresponding path program 1 times [2018-01-30 01:05:23,534 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:05:23,534 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:05:23,535 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:23,535 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:05:23,535 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:23,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:05:23,548 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:05:23,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:05:23,684 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:05:23,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:05:23,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:05:23,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:05:23,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:05:23,685 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand 6 states. [2018-01-30 01:05:23,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:05:23,861 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2018-01-30 01:05:23,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 01:05:23,862 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-30 01:05:23,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:05:23,863 INFO L225 Difference]: With dead ends: 84 [2018-01-30 01:05:23,863 INFO L226 Difference]: Without dead ends: 69 [2018-01-30 01:05:23,863 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-30 01:05:23,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-30 01:05:23,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-01-30 01:05:23,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-30 01:05:23,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2018-01-30 01:05:23,869 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 25 [2018-01-30 01:05:23,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:05:23,870 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2018-01-30 01:05:23,870 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:05:23,870 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2018-01-30 01:05:23,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-30 01:05:23,871 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:05:23,871 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:05:23,871 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-01-30 01:05:23,872 INFO L82 PathProgramCache]: Analyzing trace with hash 392251896, now seen corresponding path program 1 times [2018-01-30 01:05:23,872 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:05:23,872 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:05:23,872 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:23,873 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:05:23,873 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:05:23,884 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:05:23,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:05:23,950 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:05:23,950 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:05:23,950 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:05:23,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:05:23,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:05:23,951 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 6 states. [2018-01-30 01:05:24,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:05:24,034 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2018-01-30 01:05:24,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:05:24,034 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-01-30 01:05:24,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:05:24,035 INFO L225 Difference]: With dead ends: 76 [2018-01-30 01:05:24,035 INFO L226 Difference]: Without dead ends: 73 [2018-01-30 01:05:24,035 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-30 01:05:24,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-30 01:05:24,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2018-01-30 01:05:24,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-30 01:05:24,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2018-01-30 01:05:24,046 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 33 [2018-01-30 01:05:24,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:05:24,046 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-01-30 01:05:24,046 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:05:24,046 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2018-01-30 01:05:24,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-30 01:05:24,047 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:05:24,047 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:05:24,047 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-01-30 01:05:24,047 INFO L82 PathProgramCache]: Analyzing trace with hash 392251898, now seen corresponding path program 1 times [2018-01-30 01:05:24,047 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:05:24,047 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:05:24,048 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:24,048 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:05:24,048 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:05:24,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:05:24,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:05:24,191 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:05:24,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 01:05:24,191 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 01:05:24,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 01:05:24,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-30 01:05:24,192 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 9 states. [2018-01-30 01:05:24,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:05:24,329 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2018-01-30 01:05:24,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 01:05:24,330 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-01-30 01:05:24,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:05:24,330 INFO L225 Difference]: With dead ends: 98 [2018-01-30 01:05:24,330 INFO L226 Difference]: Without dead ends: 95 [2018-01-30 01:05:24,331 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-30 01:05:24,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-30 01:05:24,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 78. [2018-01-30 01:05:24,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-30 01:05:24,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2018-01-30 01:05:24,335 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 33 [2018-01-30 01:05:24,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:05:24,335 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2018-01-30 01:05:24,335 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 01:05:24,335 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2018-01-30 01:05:24,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-30 01:05:24,336 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:05:24,337 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, 1, 1, 1, 1, 1] [2018-01-30 01:05:24,337 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-01-30 01:05:24,337 INFO L82 PathProgramCache]: Analyzing trace with hash -378168851, now seen corresponding path program 1 times [2018-01-30 01:05:24,337 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:05:24,337 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:05:24,338 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:24,338 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:05:24,338 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:05:24,348 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:05:24,368 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 01:05:24,369 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:05:24,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:05:24,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:05:24,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:05:24,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:05:24,369 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand 3 states. [2018-01-30 01:05:24,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:05:24,395 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2018-01-30 01:05:24,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:05:24,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-01-30 01:05:24,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:05:24,397 INFO L225 Difference]: With dead ends: 127 [2018-01-30 01:05:24,397 INFO L226 Difference]: Without dead ends: 80 [2018-01-30 01:05:24,398 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 01:05:24,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-30 01:05:24,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-30 01:05:24,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-30 01:05:24,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2018-01-30 01:05:24,405 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 44 [2018-01-30 01:05:24,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:05:24,405 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2018-01-30 01:05:24,405 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:05:24,405 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2018-01-30 01:05:24,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-30 01:05:24,407 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:05:24,407 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:05:24,407 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-01-30 01:05:24,407 INFO L82 PathProgramCache]: Analyzing trace with hash 164873217, now seen corresponding path program 1 times [2018-01-30 01:05:24,407 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:05:24,407 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:05:24,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:24,408 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:05:24,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:05:24,423 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:05:24,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-30 01:05:24,482 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:05:24,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 01:05:24,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 01:05:24,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 01:05:24,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 01:05:24,483 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 7 states. [2018-01-30 01:05:24,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:05:24,551 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2018-01-30 01:05:24,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 01:05:24,552 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-01-30 01:05:24,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:05:24,553 INFO L225 Difference]: With dead ends: 83 [2018-01-30 01:05:24,553 INFO L226 Difference]: Without dead ends: 82 [2018-01-30 01:05:24,553 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-30 01:05:24,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-30 01:05:24,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2018-01-30 01:05:24,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-30 01:05:24,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2018-01-30 01:05:24,557 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 46 [2018-01-30 01:05:24,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:05:24,558 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2018-01-30 01:05:24,558 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 01:05:24,558 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2018-01-30 01:05:24,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-30 01:05:24,559 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:05:24,559 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:05:24,559 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-01-30 01:05:24,560 INFO L82 PathProgramCache]: Analyzing trace with hash 164873219, now seen corresponding path program 1 times [2018-01-30 01:05:24,560 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:05:24,560 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:05:24,561 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:24,561 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:05:24,561 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:05:24,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:05:24,905 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 01:05:24,906 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:05:24,906 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 01:05:24,916 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:05:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:05:24,968 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:05:25,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-01-30 01:05:25,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-30 01:05:25,027 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimArr_1 term size 6 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:270) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:283) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:396) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-30 01:05:25,031 INFO L168 Benchmark]: Toolchain (without parser) took 83438.97 ms. Allocated memory was 308.3 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 267.0 MB in the beginning and 1.8 GB in the end (delta: -1.5 GB). Peak memory consumption was 454.2 MB. Max. memory is 5.3 GB. [2018-01-30 01:05:25,032 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 308.3 MB. Free memory is still 273.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 01:05:25,033 INFO L168 Benchmark]: CACSL2BoogieTranslator took 204.23 ms. Allocated memory is still 308.3 MB. Free memory was 267.0 MB in the beginning and 257.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-30 01:05:25,033 INFO L168 Benchmark]: Boogie Preprocessor took 31.87 ms. Allocated memory is still 308.3 MB. Free memory was 257.0 MB in the beginning and 255.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-30 01:05:25,033 INFO L168 Benchmark]: RCFGBuilder took 316.47 ms. Allocated memory is still 308.3 MB. Free memory was 255.0 MB in the beginning and 232.1 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 5.3 GB. [2018-01-30 01:05:25,034 INFO L168 Benchmark]: IcfgTransformer took 79644.66 ms. Allocated memory was 308.3 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 232.1 MB in the beginning and 540.1 MB in the end (delta: -308.0 MB). Peak memory consumption was 1.5 GB. Max. memory is 5.3 GB. [2018-01-30 01:05:25,034 INFO L168 Benchmark]: TraceAbstraction took 3233.70 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 116.4 MB). Free memory was 540.1 MB in the beginning and 1.8 GB in the end (delta: -1.2 GB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 01:05:25,036 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.16 ms. Allocated memory is still 308.3 MB. Free memory is still 273.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 204.23 ms. Allocated memory is still 308.3 MB. Free memory was 267.0 MB in the beginning and 257.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.87 ms. Allocated memory is still 308.3 MB. Free memory was 257.0 MB in the beginning and 255.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 316.47 ms. Allocated memory is still 308.3 MB. Free memory was 255.0 MB in the beginning and 232.1 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 5.3 GB. * IcfgTransformer took 79644.66 ms. Allocated memory was 308.3 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 232.1 MB in the beginning and 540.1 MB in the end (delta: -308.0 MB). Peak memory consumption was 1.5 GB. Max. memory is 5.3 GB. * TraceAbstraction took 3233.70 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 116.4 MB). Free memory was 540.1 MB in the beginning and 1.8 GB in the end (delta: -1.2 GB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 83 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 2370 LocStat_NO_SUPPORTING_DISEQUALITIES : 1424 LocStat_NO_DISJUNCTIONS : -166 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 110 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 170 TransStat_NO_SUPPORTING_DISEQUALITIES : 16 TransStat_NO_DISJUNCTIONS : 117 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.027108 RENAME_VARIABLES(MILLISECONDS) : 0.546477 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.001575 PROJECTAWAY(MILLISECONDS) : 0.248726 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.069422 DISJOIN(MILLISECONDS) : 0.640895 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.586629 ADD_EQUALITY(MILLISECONDS) : 0.013059 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007688 #CONJOIN_DISJUNCTIVE : 1660 #RENAME_VARIABLES : 3649 #UNFREEZE : 0 #CONJOIN : 2232 #PROJECTAWAY : 2003 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 378 #RENAME_VARIABLES_DISJUNCTIVE : 3503 #ADD_EQUALITY : 172 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 14 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int] : 3 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_0 : 3 COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : 3 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] : 7 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_1 term size 6 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimArr_1 term size 6: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-30_01-05-25-046.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-01-30_01-05-25-046.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-01-30_01-05-25-046.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-01-30_01-05-25-046.csv Received shutdown request...