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/cstrpbrk-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 01:02:52,645 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 01:02:52,647 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 01:02:52,664 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 01:02:52,664 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 01:02:52,665 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 01:02:52,666 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 01:02:52,668 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 01:02:52,670 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 01:02:52,671 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 01:02:52,672 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 01:02:52,672 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 01:02:52,673 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 01:02:52,675 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 01:02:52,676 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 01:02:52,678 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 01:02:52,680 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 01:02:52,682 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 01:02:52,684 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 01:02:52,685 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 01:02:52,687 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 01:02:52,687 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 01:02:52,687 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 01:02:52,689 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 01:02:52,689 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 01:02:52,691 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 01:02:52,691 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 01:02:52,692 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 01:02:52,692 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 01:02:52,692 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 01:02:52,692 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 01:02:52,693 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:02:52,703 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 01:02:52,703 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 01:02:52,704 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 01:02:52,704 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 01:02:52,704 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 01:02:52,704 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 01:02:52,705 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 01:02:52,705 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 01:02:52,705 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 01:02:52,706 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 01:02:52,706 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 01:02:52,706 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 01:02:52,706 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 01:02:52,706 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 01:02:52,706 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 01:02:52,707 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 01:02:52,707 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 01:02:52,707 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 01:02:52,707 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 01:02:52,707 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 01:02:52,708 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 01:02:52,708 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 01:02:52,708 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 01:02:52,708 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 01:02:52,708 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 01:02:52,708 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 01:02:52,709 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 01:02:52,709 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 01:02:52,709 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 01:02:52,709 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 01:02:52,709 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 01:02:52,710 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 01:02:52,710 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 01:02:52,711 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 01:02:52,747 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 01:02:52,760 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 01:02:52,764 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 01:02:52,766 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 01:02:52,766 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 01:02:52,767 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-01-30 01:02:52,926 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 01:02:52,933 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-30 01:02:52,934 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 01:02:52,934 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 01:02:52,941 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 01:02:52,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:02:52" (1/1) ... [2018-01-30 01:02:52,945 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67990aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:02:52, skipping insertion in model container [2018-01-30 01:02:52,945 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:02:52" (1/1) ... [2018-01-30 01:02:52,966 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:02:53,008 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:02:53,130 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:02:53,147 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:02:53,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:02:53 WrapperNode [2018-01-30 01:02:53,154 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 01:02:53,154 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 01:02:53,154 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 01:02:53,154 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 01:02:53,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:02:53" (1/1) ... [2018-01-30 01:02:53,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:02:53" (1/1) ... [2018-01-30 01:02:53,179 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:02:53" (1/1) ... [2018-01-30 01:02:53,179 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:02:53" (1/1) ... [2018-01-30 01:02:53,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:02:53" (1/1) ... [2018-01-30 01:02:53,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:02:53" (1/1) ... [2018-01-30 01:02:53,188 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:02:53" (1/1) ... [2018-01-30 01:02:53,189 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 01:02:53,190 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 01:02:53,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 01:02:53,190 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 01:02:53,191 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:02:53" (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:02:53,240 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 01:02:53,240 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 01:02:53,241 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrpbrk [2018-01-30 01:02:53,241 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 01:02:53,241 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-30 01:02:53,241 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-30 01:02:53,241 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 01:02:53,242 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 01:02:53,242 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 01:02:53,242 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 01:02:53,242 INFO L128 BoogieDeclarations]: Found specification of procedure cstrpbrk [2018-01-30 01:02:53,242 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 01:02:53,242 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 01:02:53,243 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 01:02:53,549 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 01:02:53,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:02:53 BoogieIcfgContainer [2018-01-30 01:02:53,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 01:02:53,551 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-30 01:02:53,551 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-30 01:02:53,552 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-30 01:02:53,554 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:02:53" (1/1) ... [2018-01-30 01:02:53,561 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-30 01:02:53,561 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-30 01:02:53,562 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-30 01:02:53,608 INFO L162 apSepIcfgTransformer]: finished StoreIndexFreezer, created 9 freeze vars and freeze var literals (each corresponds to one heap write) [2018-01-30 01:02:53,642 INFO L221 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-30 01:02:53,715 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-30 01:03:56,437 INFO L311 AbstractInterpreter]: Visited 100 different actions 1090 times. Merged at 66 different actions 637 times. Widened at 1 different actions 2 times. Found 81 fixpoints after 16 different actions. Largest state had 62 variables. [2018-01-30 01:03:56,440 INFO L229 apSepIcfgTransformer]: finished equality analysis [2018-01-30 01:03:56,452 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 7 [2018-01-30 01:03:56,453 INFO L241 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-30 01:03:56,453 INFO L242 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-30 01:03:56,453 INFO L244 apSepIcfgTransformer]: select infos: Set: ((select (select |v_#memory_int_3| v_cstrpbrk_~s~2.base_3) v_cstrpbrk_~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_5| v_cstrpbrk_~s~2.base_11) v_cstrpbrk_~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_11| 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_4| v_cstrpbrk_~s~2.base_6) v_cstrpbrk_~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_9| 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_2| v_cstrpbrk_~sc1~2.base_6) v_cstrpbrk_~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_1| v_cstrpbrk_~sc1~2.base_3) v_cstrpbrk_~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:03:56,481 INFO L547 PartitionManager]: partitioning result: [2018-01-30 01:03:56,482 INFO L552 PartitionManager]: location blocks for array group [#memory_int] [2018-01-30 01:03:56,482 INFO L561 PartitionManager]: at dimension 0 [2018-01-30 01:03:56,482 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 3 [2018-01-30 01:03:56,482 INFO L563 PartitionManager]: # location blocks :3 [2018-01-30 01:03:56,482 INFO L561 PartitionManager]: at dimension 1 [2018-01-30 01:03:56,482 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-01-30 01:03:56,482 INFO L563 PartitionManager]: # location blocks :1 [2018-01-30 01:03:56,575 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-30 01:03:56,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 01:03:56 BasicIcfg [2018-01-30 01:03:56,593 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-30 01:03:56,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 01:03:56,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 01:03:56,597 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 01:03:56,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 01:02:52" (1/4) ... [2018-01-30 01:03:56,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f482ed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:03:56, skipping insertion in model container [2018-01-30 01:03:56,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:02:53" (2/4) ... [2018-01-30 01:03:56,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f482ed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:03:56, skipping insertion in model container [2018-01-30 01:03:56,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:02:53" (3/4) ... [2018-01-30 01:03:56,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f482ed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 01:03:56, skipping insertion in model container [2018-01-30 01:03:56,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 01:03:56" (4/4) ... [2018-01-30 01:03:56,600 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-30 01:03:56,606 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 01:03:56,612 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-30 01:03:56,639 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 01:03:56,639 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 01:03:56,639 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 01:03:56,639 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 01:03:56,640 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 01:03:56,640 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 01:03:56,640 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 01:03:56,640 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 01:03:56,640 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 01:03:56,651 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2018-01-30 01:03:56,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-30 01:03:56,656 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:03:56,657 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:03:56,657 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:03:56,660 INFO L82 PathProgramCache]: Analyzing trace with hash 162455402, now seen corresponding path program 1 times [2018-01-30 01:03:56,662 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:03:56,662 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:03:56,701 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:03:56,701 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:03:56,701 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:03:56,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:03:56,748 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:03:56,831 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:03:56,833 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:03:56,833 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:03:56,834 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:03:56,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:03:56,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:03:56,843 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 4 states. [2018-01-30 01:03:56,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:03:56,961 INFO L93 Difference]: Finished difference Result 147 states and 162 transitions. [2018-01-30 01:03:56,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:03:56,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-30 01:03:56,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:03:56,970 INFO L225 Difference]: With dead ends: 147 [2018-01-30 01:03:56,971 INFO L226 Difference]: Without dead ends: 86 [2018-01-30 01:03:56,973 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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:03:56,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-30 01:03:57,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-01-30 01:03:57,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-30 01:03:57,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2018-01-30 01:03:57,007 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 15 [2018-01-30 01:03:57,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:03:57,008 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2018-01-30 01:03:57,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:03:57,008 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2018-01-30 01:03:57,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-30 01:03:57,008 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:03:57,009 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:03:57,009 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:03:57,009 INFO L82 PathProgramCache]: Analyzing trace with hash 162455404, now seen corresponding path program 1 times [2018-01-30 01:03:57,009 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:03:57,009 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:03:57,010 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:03:57,010 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:03:57,010 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:03:57,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:03:57,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:03:57,141 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:03:57,141 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:03:57,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:03:57,143 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:03:57,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:03:57,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:03:57,143 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand 6 states. [2018-01-30 01:03:57,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:03:57,202 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2018-01-30 01:03:57,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:03:57,203 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-30 01:03:57,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:03:57,204 INFO L225 Difference]: With dead ends: 86 [2018-01-30 01:03:57,204 INFO L226 Difference]: Without dead ends: 85 [2018-01-30 01:03:57,205 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-30 01:03:57,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-30 01:03:57,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-30 01:03:57,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-30 01:03:57,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2018-01-30 01:03:57,213 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 15 [2018-01-30 01:03:57,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:03:57,214 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2018-01-30 01:03:57,214 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:03:57,214 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2018-01-30 01:03:57,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-30 01:03:57,215 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:03:57,215 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:03:57,215 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:03:57,215 INFO L82 PathProgramCache]: Analyzing trace with hash 741150561, now seen corresponding path program 1 times [2018-01-30 01:03:57,215 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:03:57,215 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:03:57,216 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:03:57,216 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:03:57,216 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:03:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:03:57,229 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:03:57,255 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:03:57,255 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:03:57,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:03:57,256 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:03:57,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:03:57,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:03:57,257 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 4 states. [2018-01-30 01:03:57,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:03:57,400 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-01-30 01:03:57,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:03:57,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-30 01:03:57,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:03:57,402 INFO L225 Difference]: With dead ends: 85 [2018-01-30 01:03:57,402 INFO L226 Difference]: Without dead ends: 84 [2018-01-30 01:03:57,402 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:03:57,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-30 01:03:57,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-30 01:03:57,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-30 01:03:57,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2018-01-30 01:03:57,410 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 16 [2018-01-30 01:03:57,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:03:57,411 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2018-01-30 01:03:57,411 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:03:57,411 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2018-01-30 01:03:57,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-30 01:03:57,411 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:03:57,412 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:03:57,412 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:03:57,412 INFO L82 PathProgramCache]: Analyzing trace with hash 741150563, now seen corresponding path program 1 times [2018-01-30 01:03:57,412 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:03:57,412 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:03:57,413 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:03:57,413 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:03:57,414 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:03:57,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:03:57,425 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:03:57,482 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:03:57,482 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:03:57,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:03:57,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:03:57,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:03:57,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:03:57,483 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand 5 states. [2018-01-30 01:03:57,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:03:57,529 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2018-01-30 01:03:57,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:03:57,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-30 01:03:57,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:03:57,530 INFO L225 Difference]: With dead ends: 84 [2018-01-30 01:03:57,530 INFO L226 Difference]: Without dead ends: 83 [2018-01-30 01:03:57,531 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:03:57,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-30 01:03:57,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-01-30 01:03:57,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-30 01:03:57,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-01-30 01:03:57,538 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 16 [2018-01-30 01:03:57,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:03:57,538 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-01-30 01:03:57,538 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 01:03:57,539 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-01-30 01:03:57,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-30 01:03:57,539 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:03:57,540 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 01:03:57,540 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:03:57,540 INFO L82 PathProgramCache]: Analyzing trace with hash 419239665, now seen corresponding path program 1 times [2018-01-30 01:03:57,540 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:03:57,540 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:03:57,541 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:03:57,541 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:03:57,541 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:03:57,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:03:57,556 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:03:57,663 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:03:57,663 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:03:57,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:03:57,664 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:03:57,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:03:57,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:03:57,664 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 6 states. [2018-01-30 01:03:57,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:03:57,896 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2018-01-30 01:03:57,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 01:03:57,897 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-30 01:03:57,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:03:57,898 INFO L225 Difference]: With dead ends: 83 [2018-01-30 01:03:57,898 INFO L226 Difference]: Without dead ends: 69 [2018-01-30 01:03:57,899 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 01:03:57,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-30 01:03:57,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-01-30 01:03:57,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-30 01:03:57,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2018-01-30 01:03:57,906 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 24 [2018-01-30 01:03:57,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:03:57,906 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2018-01-30 01:03:57,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:03:57,907 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2018-01-30 01:03:57,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-30 01:03:57,907 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:03:57,908 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:03:57,908 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:03:57,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1816414242, now seen corresponding path program 1 times [2018-01-30 01:03:57,908 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:03:57,908 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:03:57,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:03:57,909 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:03:57,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:03:57,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:03:57,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:03:57,957 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:03:57,957 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:03:57,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:03:57,957 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:03:57,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:03:57,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:03:57,958 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 6 states. [2018-01-30 01:03:58,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:03:58,033 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2018-01-30 01:03:58,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:03:58,034 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-30 01:03:58,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:03:58,034 INFO L225 Difference]: With dead ends: 73 [2018-01-30 01:03:58,035 INFO L226 Difference]: Without dead ends: 71 [2018-01-30 01:03:58,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:03:58,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-30 01:03:58,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-01-30 01:03:58,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-30 01:03:58,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-01-30 01:03:58,040 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 25 [2018-01-30 01:03:58,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:03:58,040 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-01-30 01:03:58,040 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:03:58,040 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-01-30 01:03:58,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-30 01:03:58,041 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:03:58,041 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:03:58,041 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:03:58,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1816414244, now seen corresponding path program 1 times [2018-01-30 01:03:58,042 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:03:58,042 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:03:58,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:03:58,043 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:03:58,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:03:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:03:58,055 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:03:58,197 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:03:58,197 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:03:58,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 01:03:58,197 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 01:03:58,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 01:03:58,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-30 01:03:58,198 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 9 states. [2018-01-30 01:03:58,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:03:58,311 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2018-01-30 01:03:58,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 01:03:58,311 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-01-30 01:03:58,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:03:58,312 INFO L225 Difference]: With dead ends: 105 [2018-01-30 01:03:58,312 INFO L226 Difference]: Without dead ends: 103 [2018-01-30 01:03:58,313 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-01-30 01:03:58,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-30 01:03:58,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 74. [2018-01-30 01:03:58,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-30 01:03:58,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-01-30 01:03:58,321 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 25 [2018-01-30 01:03:58,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:03:58,321 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-01-30 01:03:58,321 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 01:03:58,321 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-01-30 01:03:58,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-30 01:03:58,322 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:03:58,322 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:03:58,323 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:03:58,323 INFO L82 PathProgramCache]: Analyzing trace with hash -124406480, now seen corresponding path program 1 times [2018-01-30 01:03:58,323 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:03:58,323 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:03:58,324 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:03:58,324 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:03:58,324 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:03:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:03:58,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:03:58,418 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:03:58,418 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:03:58,418 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:03:58,418 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:03:58,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:03:58,419 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:03:58,419 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 6 states. [2018-01-30 01:03:58,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:03:58,479 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-01-30 01:03:58,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:03:58,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-01-30 01:03:58,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:03:58,480 INFO L225 Difference]: With dead ends: 78 [2018-01-30 01:03:58,480 INFO L226 Difference]: Without dead ends: 75 [2018-01-30 01:03:58,481 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:03:58,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-30 01:03:58,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-01-30 01:03:58,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-30 01:03:58,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-01-30 01:03:58,488 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 33 [2018-01-30 01:03:58,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:03:58,488 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-01-30 01:03:58,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:03:58,489 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-01-30 01:03:58,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-30 01:03:58,489 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:03:58,490 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:03:58,490 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:03:58,490 INFO L82 PathProgramCache]: Analyzing trace with hash -124406478, now seen corresponding path program 1 times [2018-01-30 01:03:58,490 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:03:58,490 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:03:58,491 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:03:58,491 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:03:58,491 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:03:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:03:58,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:03:58,607 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:03:58,607 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:03:58,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 01:03:58,608 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 01:03:58,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 01:03:58,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-30 01:03:58,608 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 9 states. [2018-01-30 01:03:58,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:03:58,765 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2018-01-30 01:03:58,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 01:03:58,766 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-01-30 01:03:58,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:03:58,767 INFO L225 Difference]: With dead ends: 103 [2018-01-30 01:03:58,767 INFO L226 Difference]: Without dead ends: 100 [2018-01-30 01:03:58,767 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-30 01:03:58,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-30 01:03:58,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 83. [2018-01-30 01:03:58,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-30 01:03:58,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-01-30 01:03:58,775 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 33 [2018-01-30 01:03:58,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:03:58,775 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-01-30 01:03:58,776 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 01:03:58,776 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-01-30 01:03:58,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-30 01:03:58,777 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:03:58,777 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:03:58,777 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:03:58,778 INFO L82 PathProgramCache]: Analyzing trace with hash -2033440913, now seen corresponding path program 1 times [2018-01-30 01:03:58,778 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:03:58,778 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:03:58,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:03:58,779 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:03:58,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:03:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:03:58,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:03:58,812 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:03:58,812 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:03:58,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:03:58,812 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:03:58,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:03:58,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:03:58,813 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 3 states. [2018-01-30 01:03:58,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:03:58,828 INFO L93 Difference]: Finished difference Result 133 states and 146 transitions. [2018-01-30 01:03:58,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:03:58,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-01-30 01:03:58,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:03:58,829 INFO L225 Difference]: With dead ends: 133 [2018-01-30 01:03:58,830 INFO L226 Difference]: Without dead ends: 85 [2018-01-30 01:03:58,830 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:03:58,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-30 01:03:58,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-30 01:03:58,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-30 01:03:58,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2018-01-30 01:03:58,838 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 44 [2018-01-30 01:03:58,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:03:58,838 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2018-01-30 01:03:58,838 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:03:58,838 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2018-01-30 01:03:58,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-30 01:03:58,839 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:03:58,839 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:03:58,840 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:03:58,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1413679037, now seen corresponding path program 1 times [2018-01-30 01:03:58,840 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:03:58,840 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:03:58,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:03:58,841 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:03:58,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:03:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:03:58,855 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:03:58,961 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:03:58,962 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:03:58,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 01:03:58,962 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 01:03:58,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 01:03:58,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 01:03:58,963 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 7 states. [2018-01-30 01:03:59,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:03:59,074 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-01-30 01:03:59,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 01:03:59,075 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-01-30 01:03:59,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:03:59,076 INFO L225 Difference]: With dead ends: 85 [2018-01-30 01:03:59,076 INFO L226 Difference]: Without dead ends: 84 [2018-01-30 01:03:59,076 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:03:59,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-30 01:03:59,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-30 01:03:59,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-30 01:03:59,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2018-01-30 01:03:59,081 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 46 [2018-01-30 01:03:59,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:03:59,081 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2018-01-30 01:03:59,081 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 01:03:59,081 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2018-01-30 01:03:59,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-30 01:03:59,082 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:03:59,083 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:03:59,083 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-30 01:03:59,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1413679035, now seen corresponding path program 1 times [2018-01-30 01:03:59,083 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:03:59,083 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:03:59,084 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:03:59,084 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:03:59,084 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:03:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:03:59,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:03:59,333 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:03:59,334 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:03:59,334 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:03:59,339 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:03:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:03:59,380 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:03:59,420 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:03:59,434 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:03:59,438 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:03:59,441 INFO L168 Benchmark]: Toolchain (without parser) took 66514.47 ms. Allocated memory was 299.9 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 259.9 MB in the beginning and 1.7 GB in the end (delta: -1.4 GB). Peak memory consumption was 552.0 MB. Max. memory is 5.3 GB. [2018-01-30 01:03:59,442 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 299.9 MB. Free memory is still 265.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 01:03:59,443 INFO L168 Benchmark]: CACSL2BoogieTranslator took 220.45 ms. Allocated memory is still 299.9 MB. Free memory was 258.9 MB in the beginning and 248.7 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-30 01:03:59,443 INFO L168 Benchmark]: Boogie Preprocessor took 35.28 ms. Allocated memory is still 299.9 MB. Free memory was 248.7 MB in the beginning and 246.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-30 01:03:59,443 INFO L168 Benchmark]: RCFGBuilder took 360.39 ms. Allocated memory is still 299.9 MB. Free memory was 246.7 MB in the beginning and 224.1 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. [2018-01-30 01:03:59,444 INFO L168 Benchmark]: IcfgTransformer took 63042.58 ms. Allocated memory was 299.9 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 224.1 MB in the beginning and 2.2 GB in the end (delta: -2.0 GB). Peak memory consumption was 530.7 MB. Max. memory is 5.3 GB. [2018-01-30 01:03:59,444 INFO L168 Benchmark]: TraceAbstraction took 2846.65 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 507.2 MB). Peak memory consumption was 507.2 MB. Max. memory is 5.3 GB. [2018-01-30 01:03:59,446 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.28 ms. Allocated memory is still 299.9 MB. Free memory is still 265.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 220.45 ms. Allocated memory is still 299.9 MB. Free memory was 258.9 MB in the beginning and 248.7 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.28 ms. Allocated memory is still 299.9 MB. Free memory was 248.7 MB in the beginning and 246.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 360.39 ms. Allocated memory is still 299.9 MB. Free memory was 246.7 MB in the beginning and 224.1 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. * IcfgTransformer took 63042.58 ms. Allocated memory was 299.9 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 224.1 MB in the beginning and 2.2 GB in the end (delta: -2.0 GB). Peak memory consumption was 530.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2846.65 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 507.2 MB). Peak memory consumption was 507.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 82 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 2368 LocStat_NO_SUPPORTING_DISEQUALITIES : 1423 LocStat_NO_DISJUNCTIONS : -164 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 109 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 173 TransStat_NO_SUPPORTING_DISEQUALITIES : 16 TransStat_NO_DISJUNCTIONS : 116 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2.122340 RENAME_VARIABLES(MILLISECONDS) : 0.266640 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.009935 PROJECTAWAY(MILLISECONDS) : 0.070504 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.053222 DISJOIN(MILLISECONDS) : 0.392046 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.287998 ADD_EQUALITY(MILLISECONDS) : 0.009501 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008459 #CONJOIN_DISJUNCTIVE : 1629 #RENAME_VARIABLES : 3578 #UNFREEZE : 0 #CONJOIN : 2197 #PROJECTAWAY : 1967 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 397 #RENAME_VARIABLES_DISJUNCTIVE : 3440 #ADD_EQUALITY : 175 #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/cstrpbrk-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-03-59-457.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrpbrk-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-03-59-457.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrpbrk-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-03-59-457.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrpbrk-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-03-59-457.csv Received shutdown request...