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/list-ext-properties/960521-1_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 09:57:32,262 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 09:57:32,265 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 09:57:32,281 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 09:57:32,281 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 09:57:32,282 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 09:57:32,283 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 09:57:32,285 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 09:57:32,288 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 09:57:32,288 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 09:57:32,289 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 09:57:32,289 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 09:57:32,290 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 09:57:32,292 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 09:57:32,292 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 09:57:32,295 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 09:57:32,297 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 09:57:32,299 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 09:57:32,300 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 09:57:32,301 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 09:57:32,303 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 09:57:32,304 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 09:57:32,304 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 09:57:32,305 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 09:57:32,305 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 09:57:32,307 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 09:57:32,307 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 09:57:32,308 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 09:57:32,308 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 09:57:32,308 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 09:57:32,309 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 09:57:32,309 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-31 09:57:32,320 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 09:57:32,320 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 09:57:32,321 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 09:57:32,321 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 09:57:32,321 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 09:57:32,321 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 09:57:32,321 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 09:57:32,322 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 09:57:32,322 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 09:57:32,322 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 09:57:32,323 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 09:57:32,323 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 09:57:32,323 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 09:57:32,323 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 09:57:32,323 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 09:57:32,324 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 09:57:32,324 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 09:57:32,324 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 09:57:32,324 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 09:57:32,324 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 09:57:32,325 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 09:57:32,325 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 09:57:32,325 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 09:57:32,325 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:57:32,325 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 09:57:32,326 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 09:57:32,326 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 09:57:32,326 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 09:57:32,326 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 09:57:32,326 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 09:57:32,327 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 09:57:32,327 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 09:57:32,328 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 09:57:32,328 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 09:57:32,372 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 09:57:32,387 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 09:57:32,391 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 09:57:32,392 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 09:57:32,393 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 09:57:32,394 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_true-valid-memsafety.i [2018-01-31 09:57:32,637 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 09:57:32,644 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-31 09:57:32,646 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 09:57:32,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 09:57:32,653 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 09:57:32,656 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:57:32" (1/1) ... [2018-01-31 09:57:32,660 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64b0c4c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:57:32, skipping insertion in model container [2018-01-31 09:57:32,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:57:32" (1/1) ... [2018-01-31 09:57:32,679 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:57:32,733 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:57:32,879 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:57:32,898 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:57:32,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:57:32 WrapperNode [2018-01-31 09:57:32,907 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 09:57:32,908 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 09:57:32,908 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 09:57:32,908 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 09:57:32,924 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:57:32" (1/1) ... [2018-01-31 09:57:32,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:57:32" (1/1) ... [2018-01-31 09:57:32,937 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:57:32" (1/1) ... [2018-01-31 09:57:32,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:57:32" (1/1) ... [2018-01-31 09:57:32,945 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:57:32" (1/1) ... [2018-01-31 09:57:32,950 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:57:32" (1/1) ... [2018-01-31 09:57:32,951 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:57:32" (1/1) ... [2018-01-31 09:57:32,960 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 09:57:32,961 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 09:57:32,961 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 09:57:32,961 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 09:57:32,962 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:57:32" (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-31 09:57:33,017 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 09:57:33,017 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 09:57:33,017 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-31 09:57:33,017 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 09:57:33,017 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 09:57:33,018 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 09:57:33,018 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 09:57:33,018 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 09:57:33,018 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 09:57:33,018 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-31 09:57:33,018 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-31 09:57:33,018 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 09:57:33,019 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-31 09:57:33,019 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 09:57:33,019 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 09:57:33,019 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 09:57:33,583 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 09:57:33,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:57:33 BoogieIcfgContainer [2018-01-31 09:57:33,584 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 09:57:33,584 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-31 09:57:33,584 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-31 09:57:33,585 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-31 09:57:33,588 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:57:33" (1/1) ... [2018-01-31 09:57:33,595 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-31 09:57:33,595 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-31 09:57:33,596 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-31 09:57:33,641 INFO L162 apSepIcfgTransformer]: finished StoreIndexFreezer, created 13 freeze vars and freeze var literals (each corresponds to one heap write) [2018-01-31 09:57:33,687 INFO L221 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-31 09:57:33,758 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-31 09:58:22,782 INFO L314 AbstractInterpreter]: Visited 88 different actions 382 times. Merged at 56 different actions 190 times. Widened at 1 different actions 5 times. Found 24 fixpoints after 8 different actions. Largest state had 70 variables. [2018-01-31 09:58:22,788 INFO L229 apSepIcfgTransformer]: finished equality analysis [2018-01-31 09:58:22,801 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 5 [2018-01-31 09:58:22,802 INFO L241 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-31 09:58:22,802 INFO L242 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-31 09:58:22,802 INFO L244 apSepIcfgTransformer]: select infos: Set: ((select |v_#memory_int_8| |v_main_#t~post8.base_3|), at (SUMMARY for call write~int(~n, #t~post8.base, #t~post8.offset, 4); srcloc: L638'')) ((select |v_#memory_int_2| v_~b.base_2), at (SUMMARY for call write~int(~n, ~b.base, ~b.offset + ~i~4 * 4, 4); srcloc: L628)) ((select |v_#memory_int_4| v_~a.base_2), at (SUMMARY for call write~int(~n, ~a.base, ~a.offset + ~i~4 * 4, 4); srcloc: L626)) ((select (select |v_#memory_int_12| v_~b.base_15) (+ (* 4 v_~n_20) v_~b.offset_13 (- 8))), at (SUMMARY for call #t~mem11 := read~int(~b.base, ~b.offset + (~n - 2) * 4, 4); srcloc: L640)) ((select (select |v_#memory_int_11| v_~b.base_12) (+ v_~b.offset_11 (- 4))), at (SUMMARY for call #t~mem10 := read~int(~b.base, ~b.offset + -4, 4); srcloc: L639')) [2018-01-31 09:58:22,837 INFO L547 PartitionManager]: partitioning result: [2018-01-31 09:58:22,838 INFO L552 PartitionManager]: location blocks for array group [#memory_int] [2018-01-31 09:58:22,838 INFO L562 PartitionManager]: at dimension 0 [2018-01-31 09:58:22,838 INFO L563 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 4 [2018-01-31 09:58:22,838 INFO L564 PartitionManager]: # location blocks :3 [2018-01-31 09:58:22,838 INFO L562 PartitionManager]: at dimension 1 [2018-01-31 09:58:22,838 INFO L563 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 3 [2018-01-31 09:58:22,838 INFO L564 PartitionManager]: # location blocks :1 [2018-01-31 09:58:22,839 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-31 09:58:22,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 09:58:22 BasicIcfg [2018-01-31 09:58:22,859 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-31 09:58:22,860 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 09:58:22,860 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 09:58:22,863 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 09:58:22,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:57:32" (1/4) ... [2018-01-31 09:58:22,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67aae2bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:58:22, skipping insertion in model container [2018-01-31 09:58:22,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:57:32" (2/4) ... [2018-01-31 09:58:22,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67aae2bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:58:22, skipping insertion in model container [2018-01-31 09:58:22,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:57:33" (3/4) ... [2018-01-31 09:58:22,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67aae2bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:58:22, skipping insertion in model container [2018-01-31 09:58:22,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 09:58:22" (4/4) ... [2018-01-31 09:58:22,867 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-31 09:58:22,877 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 09:58:22,970 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-01-31 09:58:23,008 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 09:58:23,009 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 09:58:23,009 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 09:58:23,009 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 09:58:23,009 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 09:58:23,009 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 09:58:23,009 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 09:58:23,010 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 09:58:23,010 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 09:58:23,025 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2018-01-31 09:58:23,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-31 09:58:23,031 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:58:23,031 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:58:23,031 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr10RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:58:23,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1767156284, now seen corresponding path program 1 times [2018-01-31 09:58:23,036 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:58:23,036 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:58:23,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:58:23,075 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:58:23,075 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:58:23,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:58:23,113 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:58:23,147 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-31 09:58:23,150 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:58:23,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 09:58:23,153 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-31 09:58:23,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-31 09:58:23,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-31 09:58:23,167 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 2 states. [2018-01-31 09:58:23,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:58:23,195 INFO L93 Difference]: Finished difference Result 140 states and 155 transitions. [2018-01-31 09:58:23,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-31 09:58:23,197 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-01-31 09:58:23,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:58:23,207 INFO L225 Difference]: With dead ends: 140 [2018-01-31 09:58:23,207 INFO L226 Difference]: Without dead ends: 76 [2018-01-31 09:58:23,212 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-31 09:58:23,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-31 09:58:23,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-01-31 09:58:23,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-31 09:58:23,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2018-01-31 09:58:23,253 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 11 [2018-01-31 09:58:23,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:58:23,253 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2018-01-31 09:58:23,253 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-31 09:58:23,253 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2018-01-31 09:58:23,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-31 09:58:23,254 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:58:23,255 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:58:23,255 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr10RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:58:23,255 INFO L82 PathProgramCache]: Analyzing trace with hash -984174475, now seen corresponding path program 1 times [2018-01-31 09:58:23,255 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:58:23,255 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:58:23,256 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:58:23,257 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:58:23,257 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:58:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:58:23,292 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:58:23,508 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-31 09:58:23,509 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:58:23,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:58:23,510 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:58:23,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:58:23,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:58:23,513 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 5 states. [2018-01-31 09:58:23,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:58:23,900 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2018-01-31 09:58:23,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:58:23,902 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-31 09:58:23,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:58:23,904 INFO L225 Difference]: With dead ends: 76 [2018-01-31 09:58:23,904 INFO L226 Difference]: Without dead ends: 72 [2018-01-31 09:58:23,905 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:58:23,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-31 09:58:23,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-01-31 09:58:23,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-31 09:58:23,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2018-01-31 09:58:23,913 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 14 [2018-01-31 09:58:23,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:58:23,913 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2018-01-31 09:58:23,914 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:58:23,914 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2018-01-31 09:58:23,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-31 09:58:23,914 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:58:23,915 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:58:23,915 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr10RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:58:23,915 INFO L82 PathProgramCache]: Analyzing trace with hash -984174473, now seen corresponding path program 1 times [2018-01-31 09:58:23,915 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:58:23,915 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:58:23,916 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:58:23,916 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:58:23,917 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:58:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:58:23,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:58:24,102 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-31 09:58:24,102 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:58:24,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:58:24,102 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:58:24,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:58:24,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:58:24,103 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand 6 states. [2018-01-31 09:58:24,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:58:24,413 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2018-01-31 09:58:24,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:58:24,413 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-01-31 09:58:24,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:58:24,416 INFO L225 Difference]: With dead ends: 133 [2018-01-31 09:58:24,416 INFO L226 Difference]: Without dead ends: 132 [2018-01-31 09:58:24,417 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-31 09:58:24,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-31 09:58:24,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 83. [2018-01-31 09:58:24,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-31 09:58:24,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2018-01-31 09:58:24,427 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 14 [2018-01-31 09:58:24,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:58:24,427 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2018-01-31 09:58:24,428 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:58:24,428 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2018-01-31 09:58:24,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-31 09:58:24,429 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:58:24,429 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:58:24,429 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr10RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:58:24,429 INFO L82 PathProgramCache]: Analyzing trace with hash -2094669644, now seen corresponding path program 1 times [2018-01-31 09:58:24,429 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:58:24,429 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:58:24,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:58:24,430 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:58:24,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:58:24,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:58:24,444 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:58:24,918 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-31 09:58:24,919 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:58:24,919 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 09:58:24,919 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 09:58:24,919 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 09:58:24,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:58:24,920 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 8 states. [2018-01-31 09:58:25,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:58:25,327 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2018-01-31 09:58:25,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 09:58:25,331 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-01-31 09:58:25,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:58:25,333 INFO L225 Difference]: With dead ends: 135 [2018-01-31 09:58:25,333 INFO L226 Difference]: Without dead ends: 131 [2018-01-31 09:58:25,333 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-01-31 09:58:25,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-31 09:58:25,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 103. [2018-01-31 09:58:25,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-31 09:58:25,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2018-01-31 09:58:25,344 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 17 [2018-01-31 09:58:25,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:58:25,345 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2018-01-31 09:58:25,345 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 09:58:25,345 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2018-01-31 09:58:25,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-31 09:58:25,346 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:58:25,346 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:58:25,346 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr10RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:58:25,346 INFO L82 PathProgramCache]: Analyzing trace with hash -510249215, now seen corresponding path program 1 times [2018-01-31 09:58:25,347 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:58:25,347 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:58:25,348 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:58:25,348 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:58:25,348 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:58:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:58:25,360 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:58:25,410 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-31 09:58:25,410 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:58:25,410 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 09:58:25,410 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 09:58:25,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 09:58:25,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 09:58:25,411 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand 4 states. [2018-01-31 09:58:25,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:58:25,661 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2018-01-31 09:58:25,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 09:58:25,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-01-31 09:58:25,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:58:25,663 INFO L225 Difference]: With dead ends: 131 [2018-01-31 09:58:25,663 INFO L226 Difference]: Without dead ends: 130 [2018-01-31 09:58:25,663 INFO L554 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-31 09:58:25,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-01-31 09:58:25,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 104. [2018-01-31 09:58:25,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-31 09:58:25,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2018-01-31 09:58:25,674 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 18 [2018-01-31 09:58:25,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:58:25,675 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2018-01-31 09:58:25,675 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 09:58:25,675 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2018-01-31 09:58:25,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-31 09:58:25,676 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:58:25,676 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:58:25,676 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr10RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:58:25,676 INFO L82 PathProgramCache]: Analyzing trace with hash -881806268, now seen corresponding path program 1 times [2018-01-31 09:58:25,677 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:58:25,677 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:58:25,678 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:58:25,678 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:58:25,678 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:58:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:58:25,694 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:58:25,786 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-31 09:58:25,786 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:58:25,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:58:25,786 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 09:58:25,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 09:58:25,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:58:25,787 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand 7 states. [2018-01-31 09:58:25,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:58:25,923 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2018-01-31 09:58:25,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 09:58:25,924 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-01-31 09:58:25,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:58:25,926 INFO L225 Difference]: With dead ends: 104 [2018-01-31 09:58:25,926 INFO L226 Difference]: Without dead ends: 101 [2018-01-31 09:58:25,926 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:58:25,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-31 09:58:25,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-01-31 09:58:25,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-31 09:58:25,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2018-01-31 09:58:25,936 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 21 [2018-01-31 09:58:25,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:58:25,937 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2018-01-31 09:58:25,937 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 09:58:25,937 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2018-01-31 09:58:25,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-31 09:58:25,938 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:58:25,938 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:58:25,938 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr10RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:58:25,938 INFO L82 PathProgramCache]: Analyzing trace with hash -881806266, now seen corresponding path program 1 times [2018-01-31 09:58:25,939 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:58:25,939 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:58:25,939 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:58:25,940 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:58:25,940 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:58:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:58:25,958 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:58:26,218 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-31 09:58:26,219 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:58:26,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:58:26,219 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 09:58:26,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 09:58:26,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:58:26,220 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand 7 states. [2018-01-31 09:58:26,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:58:26,372 INFO L93 Difference]: Finished difference Result 166 states and 177 transitions. [2018-01-31 09:58:26,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:58:26,373 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-01-31 09:58:26,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:58:26,376 INFO L225 Difference]: With dead ends: 166 [2018-01-31 09:58:26,376 INFO L226 Difference]: Without dead ends: 135 [2018-01-31 09:58:26,376 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:58:26,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-31 09:58:26,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 111. [2018-01-31 09:58:26,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-31 09:58:26,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2018-01-31 09:58:26,386 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 21 [2018-01-31 09:58:26,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:58:26,387 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2018-01-31 09:58:26,387 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 09:58:26,387 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2018-01-31 09:58:26,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-31 09:58:26,388 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:58:26,388 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:58:26,388 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr10RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:58:26,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1096715648, now seen corresponding path program 1 times [2018-01-31 09:58:26,388 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:58:26,389 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:58:26,389 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:58:26,389 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:58:26,390 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:58:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:58:26,399 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:58:26,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:58:26,499 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:58:26,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 09:58:26,499 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 09:58:26,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 09:58:26,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:58:26,500 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand 8 states. [2018-01-31 09:58:26,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:58:26,718 INFO L93 Difference]: Finished difference Result 125 states and 132 transitions. [2018-01-31 09:58:26,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 09:58:26,718 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-01-31 09:58:26,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:58:26,719 INFO L225 Difference]: With dead ends: 125 [2018-01-31 09:58:26,719 INFO L226 Difference]: Without dead ends: 124 [2018-01-31 09:58:26,720 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-01-31 09:58:26,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-31 09:58:26,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 110. [2018-01-31 09:58:26,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-01-31 09:58:26,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2018-01-31 09:58:26,731 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 21 [2018-01-31 09:58:26,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:58:26,731 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2018-01-31 09:58:26,731 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 09:58:26,731 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2018-01-31 09:58:26,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-31 09:58:26,732 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:58:26,732 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:58:26,733 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr10RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:58:26,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1703612872, now seen corresponding path program 1 times [2018-01-31 09:58:26,733 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:58:26,733 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:58:26,734 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:58:26,735 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:58:26,735 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:58:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:58:26,751 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:58:27,090 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-31 09:58:27,090 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:58:27,091 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-31 09:58:27,091 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 09:58:27,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 09:58:27,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-31 09:58:27,091 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 10 states. [2018-01-31 09:58:27,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:58:27,417 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2018-01-31 09:58:27,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 09:58:27,419 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-01-31 09:58:27,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:58:27,420 INFO L225 Difference]: With dead ends: 124 [2018-01-31 09:58:27,420 INFO L226 Difference]: Without dead ends: 118 [2018-01-31 09:58:27,420 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2018-01-31 09:58:27,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-31 09:58:27,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 107. [2018-01-31 09:58:27,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-31 09:58:27,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2018-01-31 09:58:27,428 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 117 transitions. Word has length 23 [2018-01-31 09:58:27,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:58:27,429 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 117 transitions. [2018-01-31 09:58:27,429 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 09:58:27,429 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2018-01-31 09:58:27,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-31 09:58:27,430 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:58:27,430 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:58:27,430 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr10RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:58:27,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1701704134, now seen corresponding path program 1 times [2018-01-31 09:58:27,431 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:58:27,431 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:58:27,432 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:58:27,432 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:58:27,432 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:58:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:58:27,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:58:27,525 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-31 09:58:27,526 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:58:27,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 09:58:27,526 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 09:58:27,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 09:58:27,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:58:27,527 INFO L87 Difference]: Start difference. First operand 107 states and 117 transitions. Second operand 8 states. [2018-01-31 09:58:27,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:58:27,684 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2018-01-31 09:58:27,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 09:58:27,684 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-01-31 09:58:27,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:58:27,685 INFO L225 Difference]: With dead ends: 129 [2018-01-31 09:58:27,685 INFO L226 Difference]: Without dead ends: 128 [2018-01-31 09:58:27,685 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-01-31 09:58:27,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-01-31 09:58:27,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 106. [2018-01-31 09:58:27,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-31 09:58:27,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2018-01-31 09:58:27,691 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 23 [2018-01-31 09:58:27,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:58:27,691 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2018-01-31 09:58:27,692 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 09:58:27,692 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2018-01-31 09:58:27,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-31 09:58:27,693 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:58:27,693 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:58:27,693 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr10RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:58:27,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1701704132, now seen corresponding path program 1 times [2018-01-31 09:58:27,693 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:58:27,694 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:58:27,694 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:58:27,694 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:58:27,695 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:58:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:58:27,710 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:58:27,974 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-31 09:58:27,974 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:58:28,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 09:58:28,024 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 09:58:28,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 09:58:28,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:58:28,024 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand 8 states. [2018-01-31 09:58:28,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:58:28,159 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2018-01-31 09:58:28,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 09:58:28,160 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-01-31 09:58:28,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:58:28,160 INFO L225 Difference]: With dead ends: 106 [2018-01-31 09:58:28,161 INFO L226 Difference]: Without dead ends: 104 [2018-01-31 09:58:28,161 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-01-31 09:58:28,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-31 09:58:28,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-01-31 09:58:28,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-31 09:58:28,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2018-01-31 09:58:28,167 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 23 [2018-01-31 09:58:28,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:58:28,167 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2018-01-31 09:58:28,167 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 09:58:28,168 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2018-01-31 09:58:28,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-31 09:58:28,169 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:58:28,169 INFO L351 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] [2018-01-31 09:58:28,169 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr10RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:58:28,169 INFO L82 PathProgramCache]: Analyzing trace with hash -439355893, now seen corresponding path program 1 times [2018-01-31 09:58:28,169 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:58:28,169 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:58:28,170 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:58:28,170 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:58:28,170 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:58:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:58:28,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:58:28,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 09:58:28,372 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:58:28,372 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:58:28,372 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 09:58:28,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 09:58:28,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:58:28,372 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand 7 states. [2018-01-31 09:58:28,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:58:28,566 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2018-01-31 09:58:28,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 09:58:28,567 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-01-31 09:58:28,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:58:28,568 INFO L225 Difference]: With dead ends: 126 [2018-01-31 09:58:28,568 INFO L226 Difference]: Without dead ends: 125 [2018-01-31 09:58:28,568 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-01-31 09:58:28,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-31 09:58:28,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 103. [2018-01-31 09:58:28,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-31 09:58:28,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2018-01-31 09:58:28,575 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 24 [2018-01-31 09:58:28,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:58:28,576 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2018-01-31 09:58:28,576 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 09:58:28,576 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2018-01-31 09:58:28,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-31 09:58:28,578 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:58:28,578 INFO L351 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-31 09:58:28,578 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr10RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:58:28,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1044881376, now seen corresponding path program 1 times [2018-01-31 09:58:28,578 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:58:28,578 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:58:28,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:58:28,579 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:58:28,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:58:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:58:28,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:58:29,106 WARN L146 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 22 DAG size of output 12 [2018-01-31 09:58:29,625 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-31 09:58:29,625 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:58:29,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-31 09:58:29,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-31 09:58:29,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-31 09:58:29,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-01-31 09:58:29,626 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand 15 states. [2018-01-31 09:58:30,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:58:30,757 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2018-01-31 09:58:30,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-31 09:58:30,758 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-01-31 09:58:30,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:58:30,759 INFO L225 Difference]: With dead ends: 112 [2018-01-31 09:58:30,759 INFO L226 Difference]: Without dead ends: 100 [2018-01-31 09:58:30,760 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2018-01-31 09:58:30,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-31 09:58:30,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2018-01-31 09:58:30,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-31 09:58:30,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2018-01-31 09:58:30,767 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 25 [2018-01-31 09:58:30,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:58:30,767 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2018-01-31 09:58:30,767 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-31 09:58:30,767 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-01-31 09:58:30,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-31 09:58:30,768 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:58:30,768 INFO L351 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] [2018-01-31 09:58:30,768 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr10RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:58:30,768 INFO L82 PathProgramCache]: Analyzing trace with hash -735130486, now seen corresponding path program 1 times [2018-01-31 09:58:30,768 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:58:30,769 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:58:30,769 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:58:30,770 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:58:30,770 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:58:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:58:30,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:58:31,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:58:31,005 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:58:31,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-31 09:58:31,005 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-31 09:58:31,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-31 09:58:31,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-01-31 09:58:31,006 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 11 states. [2018-01-31 09:58:31,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:58:31,529 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2018-01-31 09:58:31,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 09:58:31,529 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-01-31 09:58:31,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:58:31,530 INFO L225 Difference]: With dead ends: 100 [2018-01-31 09:58:31,530 INFO L226 Difference]: Without dead ends: 99 [2018-01-31 09:58:31,530 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-01-31 09:58:31,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-31 09:58:31,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2018-01-31 09:58:31,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-31 09:58:31,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2018-01-31 09:58:31,539 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 25 [2018-01-31 09:58:31,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:58:31,539 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2018-01-31 09:58:31,539 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-31 09:58:31,539 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2018-01-31 09:58:31,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-31 09:58:31,540 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:58:31,540 INFO L351 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] [2018-01-31 09:58:31,540 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr10RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:58:31,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1304622716, now seen corresponding path program 1 times [2018-01-31 09:58:31,541 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:58:31,541 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:58:31,541 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:58:31,542 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:58:31,542 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:58:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:58:31,555 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:58:31,625 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:58:31,626 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:58:31,626 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-31 09:58:31,642 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:58:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:58:31,692 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:58:31,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:58:31,798 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 09:58:31,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2018-01-31 09:58:31,798 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 09:58:31,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 09:58:31,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:58:31,799 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand 9 states. [2018-01-31 09:58:32,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:58:32,295 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2018-01-31 09:58:32,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 09:58:32,296 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-01-31 09:58:32,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:58:32,296 INFO L225 Difference]: With dead ends: 109 [2018-01-31 09:58:32,296 INFO L226 Difference]: Without dead ends: 71 [2018-01-31 09:58:32,297 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-01-31 09:58:32,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-31 09:58:32,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2018-01-31 09:58:32,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-31 09:58:32,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-01-31 09:58:32,302 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 27 [2018-01-31 09:58:32,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:58:32,303 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-01-31 09:58:32,303 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 09:58:32,303 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-01-31 09:58:32,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-31 09:58:32,303 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:58:32,304 INFO L351 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] [2018-01-31 09:58:32,304 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr10RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:58:32,304 INFO L82 PathProgramCache]: Analyzing trace with hash -170768867, now seen corresponding path program 1 times [2018-01-31 09:58:32,304 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:58:32,304 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:58:32,305 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:58:32,305 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:58:32,305 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:58:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:58:32,313 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:58:32,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:58:32,568 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:58:32,568 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 09:58:32,568 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 09:58:32,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 09:58:32,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:58:32,569 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 9 states. [2018-01-31 09:58:32,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:58:32,722 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2018-01-31 09:58:32,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 09:58:32,722 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-01-31 09:58:32,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:58:32,723 INFO L225 Difference]: With dead ends: 106 [2018-01-31 09:58:32,723 INFO L226 Difference]: Without dead ends: 78 [2018-01-31 09:58:32,723 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-01-31 09:58:32,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-31 09:58:32,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 69. [2018-01-31 09:58:32,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-31 09:58:32,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-01-31 09:58:32,729 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 28 [2018-01-31 09:58:32,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:58:32,729 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-01-31 09:58:32,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 09:58:32,729 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-01-31 09:58:32,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-31 09:58:32,730 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:58:32,730 INFO L351 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] [2018-01-31 09:58:32,730 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr10RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-31 09:58:32,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1296472497, now seen corresponding path program 1 times [2018-01-31 09:58:32,730 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:58:32,731 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:58:32,731 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:58:32,731 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:58:32,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:58:32,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-31 09:58:32,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-31 09:58:32,788 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-01-31 09:58:32,791 INFO L84 mationBacktranslator]: Skipped ATE [353] [353] ULTIMATE.startENTRY-->L1: Formula: true InVars {} OutVars{~n=v_~n_8, #valid=|v_#valid_7|, ~a.base=v_~a.base_5, ~b.offset=v_~b.offset_4, #NULL.offset=|v_#NULL.offset_2|, ~a.offset=v_~a.offset_4, #NULL.base=|v_#NULL.base_2|, ~b.base=v_~b.base_5} AuxVars[] AssignedVars[~n, #valid, ~a.base, ~b.offset, #NULL.offset, ~a.offset, #NULL.base, ~b.base] [2018-01-31 09:58:32,791 INFO L84 mationBacktranslator]: Skipped ATE [359] [359] L1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-31 09:58:32,791 INFO L84 mationBacktranslator]: Skipped ATE [365] [365] mainENTRY-->L633''''': Formula: (= v_~n_12 1) InVars {} OutVars{~n=v_~n_12} AuxVars[] AssignedVars[~n] [2018-01-31 09:58:32,792 INFO L84 mationBacktranslator]: Skipped ATE [369] [369] L633'''''-->L633: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-31 09:58:32,792 INFO L84 mationBacktranslator]: Skipped ATE [375] [375] L633-->L633': Formula: (and (<= 0 (+ |v_main_#t~nondet4_1| 2147483648)) (<= |v_main_#t~nondet4_1| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] [2018-01-31 09:58:32,792 INFO L84 mationBacktranslator]: Skipped ATE [383] [383] L633'-->L633'''': Formula: (and (not (= |v_main_#t~nondet4_4| 0)) (< v_~n_14 30)) InVars {~n=v_~n_14, main_#t~nondet4=|v_main_#t~nondet4_4|} OutVars{~n=v_~n_14, main_#t~nondet4=|v_main_#t~nondet4_4|} AuxVars[] AssignedVars[] [2018-01-31 09:58:32,795 INFO L84 mationBacktranslator]: Skipped ATE [391] [391] L633''''-->L634: Formula: true InVars {} OutVars{main_#t~nondet4=|v_main_#t~nondet4_5|} AuxVars[] AssignedVars[main_#t~nondet4] [2018-01-31 09:58:32,795 INFO L84 mationBacktranslator]: Skipped ATE [397] [397] L634-->L634': Formula: (= |v_main_#t~post5_1| v_~n_15) InVars {~n=v_~n_15} OutVars{~n=v_~n_15, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[main_#t~post5] [2018-01-31 09:58:32,795 INFO L84 mationBacktranslator]: Skipped ATE [401] [401] L634'-->L634'': Formula: (= v_~n_16 (+ |v_main_#t~post5_2| 1)) InVars {main_#t~post5=|v_main_#t~post5_2|} OutVars{~n=v_~n_16, main_#t~post5=|v_main_#t~post5_2|} AuxVars[] AssignedVars[~n] [2018-01-31 09:58:32,795 INFO L84 mationBacktranslator]: Skipped ATE [405] [405] L634''-->L633''''': Formula: true InVars {} OutVars{main_#t~post5=|v_main_#t~post5_3|} AuxVars[] AssignedVars[main_#t~post5] [2018-01-31 09:58:32,796 INFO L84 mationBacktranslator]: Skipped ATE [369] [369] L633'''''-->L633: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-31 09:58:32,796 INFO L84 mationBacktranslator]: Skipped ATE [375] [375] L633-->L633': Formula: (and (<= 0 (+ |v_main_#t~nondet4_1| 2147483648)) (<= |v_main_#t~nondet4_1| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] [2018-01-31 09:58:32,796 INFO L84 mationBacktranslator]: Skipped ATE [381] [381] L633'-->L633'': Formula: (or (not (< v_~n_13 30)) (= |v_main_#t~nondet4_2| 0)) InVars {~n=v_~n_13, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{~n=v_~n_13, main_#t~nondet4=|v_main_#t~nondet4_2|} AuxVars[] AssignedVars[] [2018-01-31 09:58:32,796 INFO L84 mationBacktranslator]: Skipped ATE [389] [389] L633''-->L633'''''': Formula: true InVars {} OutVars{main_#t~nondet4=|v_main_#t~nondet4_3|} AuxVars[] AssignedVars[main_#t~nondet4] [2018-01-31 09:58:32,796 INFO L84 mationBacktranslator]: Skipped ATE [377] [377] L633''''''-->L636: Formula: (and (not (= 0 |v_main_#t~malloc6.base_1|)) (= |v_#length_7| (store |v_#length_8| |v_main_#t~malloc6.base_1| (* 4 v_~n_17))) (= |v_main_#t~malloc6.offset_1| 0) (= |v_#valid_11| (store |v_#valid_12| |v_main_#t~malloc6.base_1| 1)) (= (select |v_#valid_12| |v_main_#t~malloc6.base_1|) 0)) InVars {~n=v_~n_17, #length=|v_#length_8|, #valid=|v_#valid_12|} OutVars{~n=v_~n_17, #length=|v_#length_7|, main_#t~malloc6.base=|v_main_#t~malloc6.base_1|, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_1|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#valid, #length, main_#t~malloc6.base, main_#t~malloc6.offset] [2018-01-31 09:58:32,796 INFO L84 mationBacktranslator]: Skipped ATE [385] [385] L636-->L637: Formula: (and (= v_~a.offset_8 |v_main_#t~malloc6.offset_2|) (= v_~a.base_9 |v_main_#t~malloc6.base_2|)) InVars {main_#t~malloc6.offset=|v_main_#t~malloc6.offset_2|, main_#t~malloc6.base=|v_main_#t~malloc6.base_2|} OutVars{main_#t~malloc6.base=|v_main_#t~malloc6.base_2|, ~a.offset=v_~a.offset_8, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_2|, ~a.base=v_~a.base_9} AuxVars[] AssignedVars[~a.base, ~a.offset] [2018-01-31 09:58:32,796 INFO L84 mationBacktranslator]: Skipped ATE [393] [393] L637-->L637': Formula: (and (= |v_#valid_13| (store |v_#valid_14| |v_main_#t~malloc7.base_1| 1)) (not (= |v_main_#t~malloc7.base_1| 0)) (= |v_main_#t~malloc7.offset_1| 0) (= |v_#length_9| (store |v_#length_10| |v_main_#t~malloc7.base_1| (* 4 v_~n_18))) (= 0 (select |v_#valid_14| |v_main_#t~malloc7.base_1|))) InVars {~n=v_~n_18, #length=|v_#length_10|, #valid=|v_#valid_14|} OutVars{~n=v_~n_18, #length=|v_#length_9|, main_#t~malloc7.base=|v_main_#t~malloc7.base_1|, main_#t~malloc7.offset=|v_main_#t~malloc7.offset_1|, #valid=|v_#valid_13|} AuxVars[] AssignedVars[main_#t~malloc7.offset, #valid, #length, main_#t~malloc7.base] [2018-01-31 09:58:32,797 INFO L84 mationBacktranslator]: Skipped ATE [399] [399] L637'-->L638: Formula: (and (= v_~b.offset_8 |v_main_#t~malloc7.offset_2|) (= v_~b.base_9 |v_main_#t~malloc7.base_2|)) InVars {main_#t~malloc7.offset=|v_main_#t~malloc7.offset_2|, main_#t~malloc7.base=|v_main_#t~malloc7.base_2|} OutVars{main_#t~malloc7.base=|v_main_#t~malloc7.base_2|, main_#t~malloc7.offset=|v_main_#t~malloc7.offset_2|, ~b.base=v_~b.base_9, ~b.offset=v_~b.offset_8} AuxVars[] AssignedVars[~b.offset, ~b.base] [2018-01-31 09:58:32,797 INFO L84 mationBacktranslator]: Skipped ATE [403] [403] L638-->L638': Formula: (and (= |v_main_#t~post8.offset_1| v_~b.offset_9) (= |v_main_#t~post8.base_1| v_~b.base_10)) InVars {~b.base=v_~b.base_10, ~b.offset=v_~b.offset_9} OutVars{main_#t~post8.base=|v_main_#t~post8.base_1|, main_#t~post8.offset=|v_main_#t~post8.offset_1|, ~b.base=v_~b.base_10, ~b.offset=v_~b.offset_9} AuxVars[] AssignedVars[main_#t~post8.base, main_#t~post8.offset] [2018-01-31 09:58:32,797 INFO L84 mationBacktranslator]: Skipped ATE [407] [407] L638'-->L638'': Formula: (and (= v_~b.base_11 |v_main_#t~post8.base_2|) (= v_~b.offset_10 (+ |v_main_#t~post8.offset_2| 4))) InVars {main_#t~post8.base=|v_main_#t~post8.base_2|, main_#t~post8.offset=|v_main_#t~post8.offset_2|} OutVars{main_#t~post8.base=|v_main_#t~post8.base_2|, ~b.base=v_~b.base_11, main_#t~post8.offset=|v_main_#t~post8.offset_2|, ~b.offset=v_~b.offset_10} AuxVars[] AssignedVars[~b.offset, ~b.base] [2018-01-31 09:58:32,797 INFO L84 mationBacktranslator]: Skipped ATE [409] [409] L638''-->L638''': Formula: (and (and (= |v_#memory_int_part_locs_30_locs_15_1| |v_#memory_int_part_locs_30_locs_15_2|) (= |v_#memory_int_part_locs_36_locs_15_1| |v_#memory_int_part_locs_36_locs_15_2|) (= |v_#memory_int_part_locs_76_locs_15_1| (store |v_#memory_int_part_locs_76_locs_15_2| |v_main_#t~post8.base_3| (store (select |v_#memory_int_part_locs_30_locs_15_2| |v_main_#t~post8.base_3|) |v_main_#t~post8.offset_3| v_~n_19)))) (<= (+ |v_main_#t~post8.offset_3| 4) (select |v_#length_11| |v_main_#t~post8.base_3|)) (<= 0 |v_main_#t~post8.offset_3|) (= 1 (select |v_#valid_15| |v_main_#t~post8.base_3|))) InVars {~n=v_~n_19, #valid=|v_#valid_15|, #memory_int_part_locs_76_locs_15=|v_#memory_int_part_locs_76_locs_15_2|, #memory_int_part_locs_36_locs_15=|v_#memory_int_part_locs_36_locs_15_2|, #length=|v_#length_11|, #memory_int_part_locs_30_locs_15=|v_#memory_int_part_locs_30_locs_15_2|, main_#t~post8.base=|v_main_#t~post8.base_3|, main_#t~post8.offset=|v_main_#t~post8.offset_3|} OutVars{~n=v_~n_19, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_7|, #memory_int_part_locs_76_locs_15=|v_#memory_int_part_locs_76_locs_15_1|, #memory_int_part_locs_36_locs_15=|v_#memory_int_part_locs_36_locs_15_1|, #length=|v_#length_11|, #memory_int_part_locs_30_locs_15=|v_#memory_int_part_locs_30_locs_15_1|, main_#t~post8.base=|v_main_#t~post8.base_3|, main_#t~post8.offset=|v_main_#t~post8.offset_3|} AuxVars[] AssignedVars[#memory_int, #memory_int_part_locs_76_locs_15, #memory_int_part_locs_36_locs_15, #memory_int_part_locs_30_locs_15] [2018-01-31 09:58:32,797 INFO L84 mationBacktranslator]: Skipped ATE [415] [415] L638'''-->L639: Formula: true InVars {} OutVars{main_#t~post8.base=|v_main_#t~post8.base_6|, main_#t~post8.offset=|v_main_#t~post8.offset_5|} AuxVars[] AssignedVars[main_#t~post8.base, main_#t~post8.offset] [2018-01-31 09:58:32,797 INFO L84 mationBacktranslator]: Skipped ATE [417] [417] L639-->L639': Formula: true InVars {} OutVars{#memory_int=|v_#memory_int_9|} AuxVars[] AssignedVars[#memory_int] [2018-01-31 09:58:32,797 INFO L84 mationBacktranslator]: Skipped ATE [421] [421] L639'-->L640: Formula: (and (<= v_~b.offset_11 (select |v_#length_13| v_~b.base_12)) (<= 4 v_~b.offset_11) (= (select (select |v_#memory_int_part_locs_76_locs_15_3| v_~b.base_12) (+ v_~b.offset_11 (- 4))) |v_main_#t~mem10_1|) (= (select |v_#valid_17| v_~b.base_12) 1)) InVars {#memory_int_part_locs_76_locs_15=|v_#memory_int_part_locs_76_locs_15_3|, #length=|v_#length_13|, ~b.base=v_~b.base_12, ~b.offset=v_~b.offset_11, #valid=|v_#valid_17|} OutVars{main_#t~mem10=|v_main_#t~mem10_1|, ~b.offset=v_~b.offset_11, #valid=|v_#valid_17|, #memory_int_part_locs_76_locs_15=|v_#memory_int_part_locs_76_locs_15_3|, #length=|v_#length_13|, ~b.base=v_~b.base_12} AuxVars[] AssignedVars[main_#t~mem10] [2018-01-31 09:58:32,798 INFO L84 mationBacktranslator]: Skipped ATE [429] [429] L640-->L640': Formula: (let ((.cse1 (* 4 v_~n_20))) (let ((.cse0 (+ .cse1 v_~b.offset_13))) (and (<= .cse0 (+ (select |v_#length_15| v_~b.base_15) 4)) (= |v_main_#t~mem11_1| (select (select |v_#memory_int_part_locs_76_locs_15_4| v_~b.base_15) (+ .cse1 v_~b.offset_13 (- 8)))) (<= 8 .cse0) (= 1 (select |v_#valid_19| v_~b.base_15))))) InVars {~n=v_~n_20, ~b.offset=v_~b.offset_13, #valid=|v_#valid_19|, #memory_int_part_locs_76_locs_15=|v_#memory_int_part_locs_76_locs_15_4|, #length=|v_#length_15|, ~b.base=v_~b.base_15} OutVars{~n=v_~n_20, main_#t~mem11=|v_main_#t~mem11_1|, ~b.offset=v_~b.offset_13, #valid=|v_#valid_19|, #memory_int_part_locs_76_locs_15=|v_#memory_int_part_locs_76_locs_15_4|, #length=|v_#length_15|, ~b.base=v_~b.base_15} AuxVars[] AssignedVars[main_#t~mem11] [2018-01-31 09:58:32,798 INFO L84 mationBacktranslator]: Skipped ATE [437] [437] L640'-->L640'': Formula: (not (= (+ |v_main_#t~mem10_2| (* (- 1) |v_main_#t~mem11_2|)) 0)) InVars {main_#t~mem10=|v_main_#t~mem10_2|, main_#t~mem11=|v_main_#t~mem11_2|} OutVars{main_#t~mem10=|v_main_#t~mem10_2|, main_#t~mem11=|v_main_#t~mem11_2|} AuxVars[] AssignedVars[] [2018-01-31 09:58:32,798 INFO L84 mationBacktranslator]: Skipped ATE [445] [445] L640''-->L640''': Formula: true InVars {} OutVars{main_#t~mem10=|v_main_#t~mem10_3|} AuxVars[] AssignedVars[main_#t~mem10] [2018-01-31 09:58:32,798 INFO L84 mationBacktranslator]: Skipped ATE [455] [455] L640'''-->L641: Formula: true InVars {} OutVars{main_#t~mem11=|v_main_#t~mem11_3|} AuxVars[] AssignedVars[main_#t~mem11] [2018-01-31 09:58:32,798 INFO L84 mationBacktranslator]: Skipped ATE [469] [469] L641-->L641': Formula: (let ((.cse0 (= v_~a.base_10 0))) (and (or (not .cse0) (= |v_#valid_22| |v_#valid_21|)) (or (= |v_#valid_21| (store |v_#valid_22| v_~a.base_10 0)) .cse0) (or (= (select |v_#valid_22| v_~a.base_10) 1) .cse0) (= 0 v_~a.offset_9))) InVars {~a.offset=v_~a.offset_9, #valid=|v_#valid_22|, ~a.base=v_~a.base_10} OutVars{~a.offset=v_~a.offset_9, #valid=|v_#valid_21|, ~a.base=v_~a.base_10} AuxVars[] AssignedVars[#valid] [2018-01-31 09:58:32,798 INFO L84 mationBacktranslator]: Skipped ATE [491] [491] L641'-->mainErr8RequiresViolation: Formula: (not (= v_~b.offset_16 0)) InVars {~b.offset=v_~b.offset_16} OutVars{~b.offset=v_~b.offset_16} AuxVars[] AssignedVars[] [2018-01-31 09:58:32,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:58:32 BasicIcfg [2018-01-31 09:58:32,807 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 09:58:32,808 INFO L168 Benchmark]: Toolchain (without parser) took 60170.08 ms. Allocated memory was 308.8 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 268.5 MB in the beginning and 1.2 GB in the end (delta: -937.6 MB). Peak memory consumption was 1.0 GB. Max. memory is 5.3 GB. [2018-01-31 09:58:32,808 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 308.8 MB. Free memory is still 274.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:58:32,808 INFO L168 Benchmark]: CACSL2BoogieTranslator took 261.45 ms. Allocated memory is still 308.8 MB. Free memory was 267.5 MB in the beginning and 257.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:58:32,809 INFO L168 Benchmark]: Boogie Preprocessor took 52.41 ms. Allocated memory is still 308.8 MB. Free memory was 257.6 MB in the beginning and 255.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:58:32,809 INFO L168 Benchmark]: RCFGBuilder took 623.00 ms. Allocated memory is still 308.8 MB. Free memory was 255.6 MB in the beginning and 233.5 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 5.3 GB. [2018-01-31 09:58:32,809 INFO L168 Benchmark]: IcfgTransformer took 49275.01 ms. Allocated memory was 308.8 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 233.5 MB in the beginning and 202.5 MB in the end (delta: 31.0 MB). Peak memory consumption was 1.9 GB. Max. memory is 5.3 GB. [2018-01-31 09:58:32,810 INFO L168 Benchmark]: TraceAbstraction took 9946.63 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 102.8 MB). Free memory was 202.5 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:58:32,815 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 308.8 MB. Free memory is still 274.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 261.45 ms. Allocated memory is still 308.8 MB. Free memory was 267.5 MB in the beginning and 257.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 52.41 ms. Allocated memory is still 308.8 MB. Free memory was 257.6 MB in the beginning and 255.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 623.00 ms. Allocated memory is still 308.8 MB. Free memory was 255.6 MB in the beginning and 233.5 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 5.3 GB. * IcfgTransformer took 49275.01 ms. Allocated memory was 308.8 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 233.5 MB in the beginning and 202.5 MB in the end (delta: 31.0 MB). Peak memory consumption was 1.9 GB. Max. memory is 5.3 GB. * TraceAbstraction took 9946.63 ms. Allocated memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: 102.8 MB). Free memory was 202.5 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 67 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 4 LocStat_NO_SUPPORTING_EQUALITIES : 2255 LocStat_NO_SUPPORTING_DISEQUALITIES : 1881 LocStat_NO_DISJUNCTIONS : -134 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 97 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 255 TransStat_NO_SUPPORTING_DISEQUALITIES : 32 TransStat_NO_DISJUNCTIONS : 112 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 18.826294 RENAME_VARIABLES(MILLISECONDS) : 0.002101 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 18.073914 PROJECTAWAY(MILLISECONDS) : 0.576765 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.076450 DISJOIN(MILLISECONDS) : 1.685303 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.008829 ADD_EQUALITY(MILLISECONDS) : 0.043001 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010042 #CONJOIN_DISJUNCTIVE : 673 #RENAME_VARIABLES : 1509 #UNFREEZE : 0 #CONJOIN : 1195 #PROJECTAWAY : 852 #ADD_WEAK_EQUALITY : 15 #DISJOIN : 205 #RENAME_VARIABLES_DISJUNCTIVE : 1440 #ADD_EQUALITY : 214 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 26 * 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 : 4 COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : 3 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_1 : 3 COUNT_BLOCKS_for_[#memory_int]_at_dim_1 : 1 COUNT_ARRAY_READS for [#memory_int] : 5 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 79 locations, 19 error locations. UNSAFE Result, 9.8s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 5.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 977 SDtfs, 1603 SDslu, 2742 SDs, 0 SdLazy, 2175 SolverSat, 160 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 201 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 220 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 345 ConstructedInterpolants, 0 QuantifiedInterpolants, 52700 SizeOfPredicates, 4 NumberOfNonLiveVariables, 94 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 17 InterpolantComputations, 16 PerfectInterpolantSequences, 16/18 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-31_09-58-32-828.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-01-31_09-58-32-828.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-01-31_09-58-32-828.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-01-31_09-58-32-828.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_09-58-32-828.csv Received shutdown request...