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/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 01:18:51,772 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 01:18:51,773 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 01:18:51,786 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 01:18:51,786 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 01:18:51,787 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 01:18:51,788 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 01:18:51,790 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 01:18:51,792 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 01:18:51,793 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 01:18:51,793 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 01:18:51,793 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 01:18:51,794 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 01:18:51,795 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 01:18:51,796 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 01:18:51,798 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 01:18:51,800 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 01:18:51,802 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 01:18:51,804 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 01:18:51,805 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 01:18:51,807 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 01:18:51,808 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 01:18:51,808 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 01:18:51,809 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 01:18:51,810 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 01:18:51,811 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 01:18:51,811 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 01:18:51,812 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 01:18:51,812 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 01:18:51,812 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 01:18:51,813 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 01:18:51,813 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:18:51,823 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 01:18:51,823 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 01:18:51,824 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 01:18:51,824 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 01:18:51,824 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 01:18:51,825 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 01:18:51,825 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 01:18:51,825 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 01:18:51,826 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 01:18:51,826 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 01:18:51,826 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 01:18:51,826 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 01:18:51,826 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 01:18:51,826 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 01:18:51,827 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 01:18:51,827 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 01:18:51,827 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 01:18:51,827 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 01:18:51,827 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 01:18:51,828 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 01:18:51,828 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 01:18:51,828 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 01:18:51,828 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 01:18:51,828 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 01:18:51,829 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 01:18:51,829 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 01:18:51,829 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 01:18:51,829 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 01:18:51,829 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 01:18:51,830 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 01:18:51,830 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 01:18:51,830 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 01:18:51,831 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 01:18:51,831 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 01:18:51,864 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 01:18:51,877 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 01:18:51,881 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 01:18:51,882 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 01:18:51,883 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 01:18:51,883 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-01-30 01:18:52,069 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 01:18:52,076 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-30 01:18:52,077 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 01:18:52,077 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 01:18:52,084 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 01:18:52,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:18:52" (1/1) ... [2018-01-30 01:18:52,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@275d1893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:18:52, skipping insertion in model container [2018-01-30 01:18:52,089 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:18:52" (1/1) ... [2018-01-30 01:18:52,106 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:18:52,147 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:18:52,264 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:18:52,286 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:18:52,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:18:52 WrapperNode [2018-01-30 01:18:52,294 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 01:18:52,295 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 01:18:52,295 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 01:18:52,295 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 01:18:52,306 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:18:52" (1/1) ... [2018-01-30 01:18:52,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:18:52" (1/1) ... [2018-01-30 01:18:52,317 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:18:52" (1/1) ... [2018-01-30 01:18:52,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:18:52" (1/1) ... [2018-01-30 01:18:52,322 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:18:52" (1/1) ... [2018-01-30 01:18:52,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:18:52" (1/1) ... [2018-01-30 01:18:52,325 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:18:52" (1/1) ... [2018-01-30 01:18:52,327 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 01:18:52,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 01:18:52,327 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 01:18:52,327 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 01:18:52,328 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:18:52" (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:18:52,371 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 01:18:52,372 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 01:18:52,372 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrspn [2018-01-30 01:18:52,372 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 01:18:52,372 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-30 01:18:52,372 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-30 01:18:52,372 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 01:18:52,372 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 01:18:52,372 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 01:18:52,372 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 01:18:52,372 INFO L128 BoogieDeclarations]: Found specification of procedure cstrspn [2018-01-30 01:18:52,373 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 01:18:52,373 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 01:18:52,373 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 01:18:52,589 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 01:18:52,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:18:52 BoogieIcfgContainer [2018-01-30 01:18:52,657 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 01:18:52,658 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-30 01:18:52,658 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-30 01:18:52,659 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-30 01:18:52,661 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:18:52" (1/1) ... [2018-01-30 01:18:52,668 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-30 01:18:52,668 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-30 01:18:52,669 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-30 01:18:52,703 INFO L162 apSepIcfgTransformer]: finished StoreIndexFreezer, created 9 freeze vars and freeze var literals (each corresponds to one heap write) [2018-01-30 01:18:52,738 INFO L221 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-30 01:18:52,801 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-30 01:19:27,837 INFO L311 AbstractInterpreter]: Visited 76 different actions 439 times. Merged at 46 different actions 238 times. Never widened. Found 30 fixpoints after 7 different actions. Largest state had 58 variables. [2018-01-30 01:19:27,839 INFO L229 apSepIcfgTransformer]: finished equality analysis [2018-01-30 01:19:27,849 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 4 [2018-01-30 01:19:27,849 INFO L241 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-30 01:19:27,849 INFO L242 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-30 01:19:27,850 INFO L244 apSepIcfgTransformer]: select infos: Set: ((select (select |v_#memory_int_8| |v_cstrspn_#t~post0.base_3|) |v_cstrspn_#t~post0.offset_3|), at (SUMMARY for call #t~mem1 := read~int(#t~post0.base, #t~post0.offset, 1); srcloc: L546')) ((select (select |v_#memory_int_7| |v_cstrspn_#t~post2.base_3|) |v_cstrspn_#t~post2.offset_3|), at (SUMMARY for call #t~mem3 := read~int(#t~post2.base, #t~post2.offset, 1); srcloc: L547''')) ((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: L563')) ((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: L563)) [2018-01-30 01:19:27,877 INFO L547 PartitionManager]: partitioning result: [2018-01-30 01:19:27,877 INFO L552 PartitionManager]: location blocks for array group [#memory_int] [2018-01-30 01:19:27,878 INFO L561 PartitionManager]: at dimension 0 [2018-01-30 01:19:27,878 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 3 [2018-01-30 01:19:27,878 INFO L563 PartitionManager]: # location blocks :3 [2018-01-30 01:19:27,878 INFO L561 PartitionManager]: at dimension 1 [2018-01-30 01:19:27,878 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-01-30 01:19:27,878 INFO L563 PartitionManager]: # location blocks :1 [2018-01-30 01:19:27,879 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-30 01:19:27,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 01:19:27 BasicIcfg [2018-01-30 01:19:27,895 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-30 01:19:27,896 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 01:19:27,897 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 01:19:27,968 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 01:19:27,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 01:18:52" (1/4) ... [2018-01-30 01:19:27,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65283e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:19:27, skipping insertion in model container [2018-01-30 01:19:27,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:18:52" (2/4) ... [2018-01-30 01:19:27,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65283e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:19:27, skipping insertion in model container [2018-01-30 01:19:27,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:18:52" (3/4) ... [2018-01-30 01:19:27,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65283e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 01:19:27, skipping insertion in model container [2018-01-30 01:19:27,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 01:19:27" (4/4) ... [2018-01-30 01:19:27,971 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-30 01:19:27,977 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 01:19:27,983 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-30 01:19:28,014 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 01:19:28,014 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 01:19:28,014 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 01:19:28,014 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 01:19:28,014 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 01:19:28,014 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 01:19:28,015 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 01:19:28,015 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 01:19:28,015 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 01:19:28,026 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states. [2018-01-30 01:19:28,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-30 01:19:28,031 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:19:28,032 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:19:28,032 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-30 01:19:28,035 INFO L82 PathProgramCache]: Analyzing trace with hash -780815606, now seen corresponding path program 1 times [2018-01-30 01:19:28,037 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:19:28,037 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:19:28,080 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:19:28,080 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:19:28,080 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:19:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:19:28,139 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:19:28,242 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:19:28,245 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:19:28,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:19:28,247 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:19:28,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:19:28,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:19:28,283 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 4 states. [2018-01-30 01:19:28,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:19:28,405 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2018-01-30 01:19:28,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:19:28,407 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-30 01:19:28,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:19:28,420 INFO L225 Difference]: With dead ends: 83 [2018-01-30 01:19:28,420 INFO L226 Difference]: Without dead ends: 65 [2018-01-30 01:19:28,424 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:19:28,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-30 01:19:28,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-01-30 01:19:28,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-30 01:19:28,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-01-30 01:19:28,461 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 15 [2018-01-30 01:19:28,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:19:28,462 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-01-30 01:19:28,462 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:19:28,462 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-01-30 01:19:28,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-30 01:19:28,463 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:19:28,463 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:19:28,463 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-30 01:19:28,463 INFO L82 PathProgramCache]: Analyzing trace with hash -780815604, now seen corresponding path program 1 times [2018-01-30 01:19:28,463 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:19:28,463 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:19:28,464 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:19:28,464 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:19:28,464 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:19:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:19:28,476 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:19:28,609 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:19:28,609 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:19:28,610 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:19:28,611 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:19:28,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:19:28,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:19:28,612 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 6 states. [2018-01-30 01:19:28,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:19:28,700 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-01-30 01:19:28,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:19:28,701 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-30 01:19:28,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:19:28,702 INFO L225 Difference]: With dead ends: 65 [2018-01-30 01:19:28,702 INFO L226 Difference]: Without dead ends: 64 [2018-01-30 01:19:28,703 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:19:28,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-30 01:19:28,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-01-30 01:19:28,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-30 01:19:28,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-01-30 01:19:28,712 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 15 [2018-01-30 01:19:28,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:19:28,712 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-01-30 01:19:28,712 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:19:28,713 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-01-30 01:19:28,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-30 01:19:28,713 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:19:28,714 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:19:28,714 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-30 01:19:28,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1564520289, now seen corresponding path program 1 times [2018-01-30 01:19:28,714 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:19:28,714 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:19:28,715 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:19:28,716 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:19:28,716 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:19:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:19:28,729 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:19:28,761 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:19:28,762 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:19:28,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:19:28,762 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:19:28,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:19:28,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:19:28,762 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 4 states. [2018-01-30 01:19:28,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:19:28,811 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-01-30 01:19:28,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:19:28,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-30 01:19:28,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:19:28,812 INFO L225 Difference]: With dead ends: 64 [2018-01-30 01:19:28,812 INFO L226 Difference]: Without dead ends: 63 [2018-01-30 01:19:28,812 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:19:28,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-30 01:19:28,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-01-30 01:19:28,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-30 01:19:28,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-01-30 01:19:28,817 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 16 [2018-01-30 01:19:28,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:19:28,817 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-01-30 01:19:28,818 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:19:28,818 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-01-30 01:19:28,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-30 01:19:28,818 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:19:28,818 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:19:28,818 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-30 01:19:28,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1564520291, now seen corresponding path program 1 times [2018-01-30 01:19:28,819 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:19:28,819 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:19:28,819 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:19:28,819 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:19:28,819 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:19:28,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:19:28,828 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:19:28,903 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:19:28,904 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:19:28,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:19:28,904 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:19:28,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:19:28,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:19:28,905 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 5 states. [2018-01-30 01:19:28,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:19:28,937 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-01-30 01:19:28,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:19:28,937 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-30 01:19:28,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:19:28,938 INFO L225 Difference]: With dead ends: 63 [2018-01-30 01:19:28,938 INFO L226 Difference]: Without dead ends: 62 [2018-01-30 01:19:28,939 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:19:28,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-30 01:19:28,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-01-30 01:19:28,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-30 01:19:28,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2018-01-30 01:19:28,945 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 16 [2018-01-30 01:19:28,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:19:28,946 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2018-01-30 01:19:28,946 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 01:19:28,946 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2018-01-30 01:19:28,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-30 01:19:28,947 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:19:28,947 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:19:28,947 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-30 01:19:28,948 INFO L82 PathProgramCache]: Analyzing trace with hash -664631567, now seen corresponding path program 1 times [2018-01-30 01:19:28,948 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:19:28,948 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:19:28,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:19:28,949 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:19:28,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:19:28,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:19:28,973 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:19:29,105 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:19:29,105 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:19:29,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:19:29,106 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:19:29,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:19:29,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:19:29,106 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 6 states. [2018-01-30 01:19:29,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:19:29,313 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2018-01-30 01:19:29,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 01:19:29,313 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-30 01:19:29,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:19:29,314 INFO L225 Difference]: With dead ends: 62 [2018-01-30 01:19:29,315 INFO L226 Difference]: Without dead ends: 49 [2018-01-30 01:19:29,315 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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:19:29,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-30 01:19:29,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-30 01:19:29,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-30 01:19:29,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-01-30 01:19:29,320 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 24 [2018-01-30 01:19:29,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:19:29,320 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-01-30 01:19:29,321 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:19:29,321 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-01-30 01:19:29,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-30 01:19:29,322 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:19:29,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] [2018-01-30 01:19:29,322 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-30 01:19:29,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1743904363, now seen corresponding path program 1 times [2018-01-30 01:19:29,322 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:19:29,322 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:19:29,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:19:29,323 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:19:29,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:19:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:19:29,332 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:19:29,387 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:19:29,387 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:19:29,388 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 01:19:29,388 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 01:19:29,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 01:19:29,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 01:19:29,389 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 7 states. [2018-01-30 01:19:29,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:19:29,463 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-01-30 01:19:29,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 01:19:29,463 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-01-30 01:19:29,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:19:29,464 INFO L225 Difference]: With dead ends: 49 [2018-01-30 01:19:29,464 INFO L226 Difference]: Without dead ends: 48 [2018-01-30 01:19:29,464 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 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:19:29,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-30 01:19:29,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-30 01:19:29,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-30 01:19:29,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-01-30 01:19:29,468 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 26 [2018-01-30 01:19:29,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:19:29,468 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-01-30 01:19:29,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 01:19:29,468 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-01-30 01:19:29,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-30 01:19:29,469 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:19:29,469 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:19:29,469 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-30 01:19:29,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1743904361, now seen corresponding path program 1 times [2018-01-30 01:19:29,469 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:19:29,469 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:19:29,470 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:19:29,470 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:19:29,470 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:19:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:19:29,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:19:29,631 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:19:29,631 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:19:29,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-30 01:19:29,631 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 01:19:29,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 01:19:29,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-30 01:19:29,632 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 10 states. [2018-01-30 01:19:29,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:19:29,816 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-01-30 01:19:29,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 01:19:29,816 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-01-30 01:19:29,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:19:29,817 INFO L225 Difference]: With dead ends: 54 [2018-01-30 01:19:29,817 INFO L226 Difference]: Without dead ends: 53 [2018-01-30 01:19:29,818 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-01-30 01:19:29,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-30 01:19:29,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-01-30 01:19:29,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-30 01:19:29,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-01-30 01:19:29,824 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 26 [2018-01-30 01:19:29,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:19:29,825 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-01-30 01:19:29,825 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 01:19:29,825 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-01-30 01:19:29,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-30 01:19:29,826 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:19:29,826 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, 1] [2018-01-30 01:19:29,826 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-30 01:19:29,826 INFO L82 PathProgramCache]: Analyzing trace with hash 525505057, now seen corresponding path program 1 times [2018-01-30 01:19:29,827 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:19:29,827 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:19:29,827 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:19:29,828 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:19:29,828 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:19:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:19:29,840 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:19:29,935 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:19:29,935 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:19:29,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 01:19:29,936 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 01:19:29,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 01:19:29,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 01:19:29,937 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 7 states. [2018-01-30 01:19:30,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:19:30,011 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-01-30 01:19:30,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 01:19:30,011 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-01-30 01:19:30,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:19:30,012 INFO L225 Difference]: With dead ends: 55 [2018-01-30 01:19:30,012 INFO L226 Difference]: Without dead ends: 54 [2018-01-30 01:19:30,013 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 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:19:30,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-30 01:19:30,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2018-01-30 01:19:30,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-30 01:19:30,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-01-30 01:19:30,018 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 34 [2018-01-30 01:19:30,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:19:30,019 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-01-30 01:19:30,019 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 01:19:30,019 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-01-30 01:19:30,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-30 01:19:30,020 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:19:30,020 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, 1] [2018-01-30 01:19:30,020 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-30 01:19:30,021 INFO L82 PathProgramCache]: Analyzing trace with hash 525505059, now seen corresponding path program 1 times [2018-01-30 01:19:30,021 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:19:30,021 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:19:30,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:19:30,022 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:19:30,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:19:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:19:30,035 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:19:30,232 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:19:30,232 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:19:30,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-30 01:19:30,232 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 01:19:30,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 01:19:30,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-30 01:19:30,233 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 10 states. [2018-01-30 01:19:30,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:19:30,348 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-01-30 01:19:30,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 01:19:30,348 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-01-30 01:19:30,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:19:30,349 INFO L225 Difference]: With dead ends: 58 [2018-01-30 01:19:30,349 INFO L226 Difference]: Without dead ends: 57 [2018-01-30 01:19:30,349 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-01-30 01:19:30,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-30 01:19:30,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2018-01-30 01:19:30,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-30 01:19:30,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-01-30 01:19:30,354 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 34 [2018-01-30 01:19:30,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:19:30,354 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-01-30 01:19:30,354 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 01:19:30,355 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-01-30 01:19:30,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-30 01:19:30,355 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:19:30,355 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:19:30,356 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-30 01:19:30,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1281144453, now seen corresponding path program 1 times [2018-01-30 01:19:30,356 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:19:30,356 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:19:30,357 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:19:30,357 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:19:30,357 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:19:30,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:19:30,375 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:19:30,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:19:30,673 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:19:30,673 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:19:30,680 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:19:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:19:30,723 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:19:30,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-30 01:19:30,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:19:30,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 01:19:30,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2018-01-30 01:19:30,829 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 13 treesize of output 11 [2018-01-30 01:19:30,844 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-30 01:19:30,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 01:19:30,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:19:30,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 01:19:30,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2018-01-30 01:19:31,164 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 20 treesize of output 16 [2018-01-30 01:19:31,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-30 01:19:31,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 01:19:31,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 01:19:31,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-30 01:19:31,201 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-30 01:19:31,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:19:31,345 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:19:31,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 25 [2018-01-30 01:19:31,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-30 01:19:31,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-30 01:19:31,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=583, Unknown=3, NotChecked=0, Total=650 [2018-01-30 01:19:31,346 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 26 states. [2018-01-30 01:19:32,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:19:32,951 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2018-01-30 01:19:32,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-30 01:19:32,951 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 42 [2018-01-30 01:19:32,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:19:32,952 INFO L225 Difference]: With dead ends: 79 [2018-01-30 01:19:32,953 INFO L226 Difference]: Without dead ends: 78 [2018-01-30 01:19:32,953 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=243, Invalid=1394, Unknown=3, NotChecked=0, Total=1640 [2018-01-30 01:19:32,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-30 01:19:32,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2018-01-30 01:19:32,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-30 01:19:32,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-01-30 01:19:32,964 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 42 [2018-01-30 01:19:32,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:19:32,965 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-01-30 01:19:32,965 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-30 01:19:32,965 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-01-30 01:19:32,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-30 01:19:32,966 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:19:32,967 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:19:32,967 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-30 01:19:32,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1058368890, now seen corresponding path program 1 times [2018-01-30 01:19:32,967 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:19:32,967 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:19:32,968 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:19:32,968 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:19:32,968 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:19:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:19:32,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:19:33,414 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:19:33,414 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:19:33,452 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:19:33,460 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:19:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:19:33,488 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:19:33,495 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:19:33,498 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:19:33,502 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:19:33,505 INFO L168 Benchmark]: Toolchain (without parser) took 41435.26 ms. Allocated memory was 307.2 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 267.3 MB in the beginning and 985.7 MB in the end (delta: -718.5 MB). Peak memory consumption was 819.8 MB. Max. memory is 5.3 GB. [2018-01-30 01:19:33,506 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 307.2 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 01:19:33,506 INFO L168 Benchmark]: CACSL2BoogieTranslator took 217.72 ms. Allocated memory is still 307.2 MB. Free memory was 266.3 MB in the beginning and 256.0 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:19:33,507 INFO L168 Benchmark]: Boogie Preprocessor took 31.66 ms. Allocated memory is still 307.2 MB. Free memory was 256.0 MB in the beginning and 254.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:19:33,507 INFO L168 Benchmark]: RCFGBuilder took 330.65 ms. Allocated memory is still 307.2 MB. Free memory was 254.0 MB in the beginning and 234.4 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 5.3 GB. [2018-01-30 01:19:33,507 INFO L168 Benchmark]: IcfgTransformer took 35237.59 ms. Allocated memory was 307.2 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 234.4 MB in the beginning and 587.7 MB in the end (delta: -353.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. [2018-01-30 01:19:33,508 INFO L168 Benchmark]: TraceAbstraction took 5608.03 ms. Allocated memory was 1.7 GB in the beginning and 1.8 GB in the end (delta: 115.9 MB). Free memory was 587.7 MB in the beginning and 985.7 MB in the end (delta: -398.0 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 01:19:33,509 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 307.2 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 217.72 ms. Allocated memory is still 307.2 MB. Free memory was 266.3 MB in the beginning and 256.0 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.66 ms. Allocated memory is still 307.2 MB. Free memory was 256.0 MB in the beginning and 254.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 330.65 ms. Allocated memory is still 307.2 MB. Free memory was 254.0 MB in the beginning and 234.4 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 5.3 GB. * IcfgTransformer took 35237.59 ms. Allocated memory was 307.2 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 234.4 MB in the beginning and 587.7 MB in the end (delta: -353.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. * TraceAbstraction took 5608.03 ms. Allocated memory was 1.7 GB in the beginning and 1.8 GB in the end (delta: 115.9 MB). Free memory was 587.7 MB in the beginning and 985.7 MB in the end (delta: -398.0 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 64 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 1663 LocStat_NO_SUPPORTING_DISEQUALITIES : 957 LocStat_NO_DISJUNCTIONS : -128 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 85 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 148 TransStat_NO_SUPPORTING_DISEQUALITIES : 11 TransStat_NO_DISJUNCTIONS : 88 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2.191100 RENAME_VARIABLES(MILLISECONDS) : 0.009361 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.370574 PROJECTAWAY(MILLISECONDS) : 1.388004 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.048598 DISJOIN(MILLISECONDS) : 0.310467 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.019342 ADD_EQUALITY(MILLISECONDS) : 0.008117 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008658 #CONJOIN_DISJUNCTIVE : 675 #RENAME_VARIABLES : 1425 #UNFREEZE : 0 #CONJOIN : 924 #PROJECTAWAY : 835 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 147 #RENAME_VARIABLES_DISJUNCTIVE : 1404 #ADD_EQUALITY : 150 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 9 * 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] : 4 * 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/openbsd_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-19-33-519.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_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-19-33-519.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_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-19-33-519.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_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-19-33-519.csv Received shutdown request...