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/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-29 00:48:45,927 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 00:48:45,929 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 00:48:45,944 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 00:48:45,944 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 00:48:45,946 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 00:48:45,947 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 00:48:45,948 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 00:48:45,950 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 00:48:45,951 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 00:48:45,952 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 00:48:45,953 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 00:48:45,954 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 00:48:45,955 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 00:48:45,956 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 00:48:45,958 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 00:48:45,961 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 00:48:45,963 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 00:48:45,964 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 00:48:45,966 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 00:48:45,968 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 00:48:45,968 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 00:48:45,969 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 00:48:45,970 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 00:48:45,971 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 00:48:45,972 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 00:48:45,972 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 00:48:45,973 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 00:48:45,973 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 00:48:45,973 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 00:48:45,974 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 00:48:45,975 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-29 00:48:45,983 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 00:48:45,983 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 00:48:45,984 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 00:48:45,984 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 00:48:45,984 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 00:48:45,984 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 00:48:45,984 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 00:48:45,985 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 00:48:45,985 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 00:48:45,985 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 00:48:45,985 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 00:48:45,985 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 00:48:45,986 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 00:48:45,986 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 00:48:45,986 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 00:48:45,986 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 00:48:45,986 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 00:48:45,986 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 00:48:45,986 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 00:48:45,986 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 00:48:45,987 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 00:48:45,987 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 00:48:45,987 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 00:48:45,987 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 00:48:45,987 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 00:48:45,987 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 00:48:45,988 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 00:48:45,988 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 00:48:45,988 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 00:48:45,988 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 00:48:45,988 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 00:48:45,988 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 00:48:45,989 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 00:48:45,989 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 00:48:46,024 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 00:48:46,035 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 00:48:46,038 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 00:48:46,039 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 00:48:46,040 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 00:48:46,041 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-01-29 00:48:46,144 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 00:48:46,150 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-29 00:48:46,151 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 00:48:46,151 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 00:48:46,157 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 00:48:46,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 12:48:46" (1/1) ... [2018-01-29 00:48:46,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7189c3d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 12:48:46, skipping insertion in model container [2018-01-29 00:48:46,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 12:48:46" (1/1) ... [2018-01-29 00:48:46,175 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 00:48:46,190 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 00:48:46,308 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 00:48:46,324 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 00:48:46,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 12:48:46 WrapperNode [2018-01-29 00:48:46,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 00:48:46,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 00:48:46,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 00:48:46,332 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 00:48:46,343 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 12:48:46" (1/1) ... [2018-01-29 00:48:46,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 12:48:46" (1/1) ... [2018-01-29 00:48:46,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 12:48:46" (1/1) ... [2018-01-29 00:48:46,353 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 12:48:46" (1/1) ... [2018-01-29 00:48:46,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 12:48:46" (1/1) ... [2018-01-29 00:48:46,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 12:48:46" (1/1) ... [2018-01-29 00:48:46,362 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 12:48:46" (1/1) ... [2018-01-29 00:48:46,365 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 00:48:46,366 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 00:48:46,366 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 00:48:46,366 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 00:48:46,367 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 12:48:46" (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-29 00:48:46,418 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 00:48:46,419 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 00:48:46,419 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-29 00:48:46,419 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 00:48:46,419 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-29 00:48:46,419 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-29 00:48:46,419 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 00:48:46,420 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 00:48:46,420 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 00:48:46,420 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-29 00:48:46,420 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 00:48:46,420 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 00:48:46,420 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 00:48:46,631 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 00:48:46,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 12:48:46 BoogieIcfgContainer [2018-01-29 00:48:46,632 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 00:48:46,632 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-29 00:48:46,632 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-29 00:48:46,633 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-29 00:48:46,636 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 12:48:46" (1/1) ... [2018-01-29 00:48:46,643 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-29 00:48:46,643 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-29 00:48:46,644 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-29 00:48:46,701 INFO L218 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-29 00:48:46,763 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-29 00:48:56,736 INFO L311 AbstractInterpreter]: Visited 70 different actions 440 times. Merged at 46 different actions 244 times. Widened at 1 different actions 1 times. Found 21 fixpoints after 5 different actions. Largest state had 36 variables. [2018-01-29 00:48:56,739 INFO L226 apSepIcfgTransformer]: finished equality analysis [2018-01-29 00:48:56,753 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 1 [2018-01-29 00:48:56,754 INFO L238 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-29 00:48:56,754 INFO L239 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-29 00:48:56,754 INFO L241 apSepIcfgTransformer]: select infos: Set: ((select (select |v_#memory_int_1| v_foo_~b.base_2) (+ v_foo_~b.offset_2 v_foo_~i~1_6)), at (SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~1 * 1, 1); srcloc: L18')) [2018-01-29 00:48:56,758 INFO L544 PartitionManager]: partitioning result: [2018-01-29 00:48:56,758 INFO L549 PartitionManager]: location blocks for array group [#memory_int] [2018-01-29 00:48:56,758 INFO L558 PartitionManager]: at dimension 0 [2018-01-29 00:48:56,758 INFO L559 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-29 00:48:56,758 INFO L560 PartitionManager]: # location blocks :1 [2018-01-29 00:48:56,759 INFO L558 PartitionManager]: at dimension 1 [2018-01-29 00:48:56,759 INFO L559 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-29 00:48:56,759 INFO L560 PartitionManager]: # location blocks :1 [2018-01-29 00:48:56,759 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-29 00:48:56,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 29.01 12:48:56 BasicIcfg [2018-01-29 00:48:56,772 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-29 00:48:56,773 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 00:48:56,773 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 00:48:56,775 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 00:48:56,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 12:48:46" (1/4) ... [2018-01-29 00:48:56,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f8496cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 12:48:56, skipping insertion in model container [2018-01-29 00:48:56,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 12:48:46" (2/4) ... [2018-01-29 00:48:56,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f8496cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 12:48:56, skipping insertion in model container [2018-01-29 00:48:56,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 12:48:46" (3/4) ... [2018-01-29 00:48:56,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f8496cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 12:48:56, skipping insertion in model container [2018-01-29 00:48:56,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 29.01 12:48:56" (4/4) ... [2018-01-29 00:48:56,778 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-29 00:48:56,785 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 00:48:56,792 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-29 00:48:56,895 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 00:48:56,896 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 00:48:56,896 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 00:48:56,896 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 00:48:56,896 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 00:48:56,896 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 00:48:56,896 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 00:48:56,896 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 00:48:56,897 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 00:48:56,907 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-01-29 00:48:56,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-29 00:48:56,912 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:48:56,912 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:48:56,912 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:48:56,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1068910584, now seen corresponding path program 1 times [2018-01-29 00:48:56,917 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:48:56,918 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:48:56,959 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:48:56,959 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:48:56,959 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:48:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:48:56,999 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:48:57,052 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-29 00:48:57,054 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 00:48:57,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-29 00:48:57,055 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 00:48:57,063 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 00:48:57,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 00:48:57,066 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 3 states. [2018-01-29 00:48:57,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:48:57,210 INFO L93 Difference]: Finished difference Result 133 states and 160 transitions. [2018-01-29 00:48:57,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 00:48:57,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-01-29 00:48:57,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:48:57,222 INFO L225 Difference]: With dead ends: 133 [2018-01-29 00:48:57,222 INFO L226 Difference]: Without dead ends: 78 [2018-01-29 00:48:57,226 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 00:48:57,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-29 00:48:57,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2018-01-29 00:48:57,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-29 00:48:57,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-01-29 00:48:57,265 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 9 [2018-01-29 00:48:57,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:48:57,265 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-01-29 00:48:57,265 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 00:48:57,266 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-01-29 00:48:57,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-29 00:48:57,267 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:48:57,267 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:48:57,267 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:48:57,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1115648547, now seen corresponding path program 1 times [2018-01-29 00:48:57,267 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:48:57,267 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:48:57,268 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:48:57,269 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:48:57,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:48:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:48:57,285 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:48:57,444 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-29 00:48:57,444 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 00:48:57,444 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 00:48:57,446 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 00:48:57,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 00:48:57,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-29 00:48:57,447 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 7 states. [2018-01-29 00:48:57,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:48:57,665 INFO L93 Difference]: Finished difference Result 172 states and 188 transitions. [2018-01-29 00:48:57,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 00:48:57,665 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-01-29 00:48:57,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:48:57,669 INFO L225 Difference]: With dead ends: 172 [2018-01-29 00:48:57,670 INFO L226 Difference]: Without dead ends: 121 [2018-01-29 00:48:57,671 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-29 00:48:57,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-29 00:48:57,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 88. [2018-01-29 00:48:57,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-29 00:48:57,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2018-01-29 00:48:57,683 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 18 [2018-01-29 00:48:57,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:48:57,684 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2018-01-29 00:48:57,684 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 00:48:57,684 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2018-01-29 00:48:57,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-29 00:48:57,685 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:48:57,685 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:48:57,685 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:48:57,686 INFO L82 PathProgramCache]: Analyzing trace with hash -225366126, now seen corresponding path program 1 times [2018-01-29 00:48:57,686 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:48:57,686 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:48:57,687 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:48:57,687 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:48:57,687 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:48:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:48:57,698 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:48:57,746 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-29 00:48:57,746 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 00:48:57,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 00:48:57,747 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 00:48:57,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 00:48:57,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 00:48:57,747 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand 5 states. [2018-01-29 00:48:57,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:48:57,809 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2018-01-29 00:48:57,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 00:48:57,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-29 00:48:57,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:48:57,811 INFO L225 Difference]: With dead ends: 88 [2018-01-29 00:48:57,811 INFO L226 Difference]: Without dead ends: 87 [2018-01-29 00:48:57,812 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-29 00:48:57,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-29 00:48:57,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-01-29 00:48:57,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-29 00:48:57,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2018-01-29 00:48:57,825 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 19 [2018-01-29 00:48:57,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:48:57,825 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2018-01-29 00:48:57,825 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 00:48:57,826 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2018-01-29 00:48:57,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-29 00:48:57,826 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:48:57,826 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:48:57,827 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:48:57,827 INFO L82 PathProgramCache]: Analyzing trace with hash -225366124, now seen corresponding path program 1 times [2018-01-29 00:48:57,827 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:48:57,827 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:48:57,828 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:48:57,828 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:48:57,828 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:48:57,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:48:57,838 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:48:57,964 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-29 00:48:57,964 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 00:48:57,965 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 00:48:57,965 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 00:48:57,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 00:48:57,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-29 00:48:57,966 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand 6 states. [2018-01-29 00:48:58,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:48:58,081 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2018-01-29 00:48:58,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 00:48:58,082 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-29 00:48:58,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:48:58,084 INFO L225 Difference]: With dead ends: 101 [2018-01-29 00:48:58,084 INFO L226 Difference]: Without dead ends: 100 [2018-01-29 00:48:58,085 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-29 00:48:58,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-29 00:48:58,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2018-01-29 00:48:58,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-29 00:48:58,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2018-01-29 00:48:58,099 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 19 [2018-01-29 00:48:58,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:48:58,100 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2018-01-29 00:48:58,100 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 00:48:58,100 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-01-29 00:48:58,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-29 00:48:58,101 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:48:58,101 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:48:58,101 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:48:58,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1537306562, now seen corresponding path program 1 times [2018-01-29 00:48:58,102 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:48:58,102 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:48:58,103 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:48:58,103 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:48:58,103 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:48:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:48:58,111 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:48:58,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:48:58,152 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:48:58,152 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-29 00:48:58,165 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:48:58,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:48:58,198 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:48:58,259 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-29 00:48:58,282 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 00:48:58,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2018-01-29 00:48:58,282 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 00:48:58,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 00:48:58,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-29 00:48:58,283 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 8 states. [2018-01-29 00:48:58,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:48:58,413 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2018-01-29 00:48:58,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 00:48:58,414 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-29 00:48:58,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:48:58,415 INFO L225 Difference]: With dead ends: 127 [2018-01-29 00:48:58,415 INFO L226 Difference]: Without dead ends: 106 [2018-01-29 00:48:58,416 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-01-29 00:48:58,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-29 00:48:58,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 96. [2018-01-29 00:48:58,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-29 00:48:58,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2018-01-29 00:48:58,427 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 19 [2018-01-29 00:48:58,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:48:58,428 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2018-01-29 00:48:58,428 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 00:48:58,428 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2018-01-29 00:48:58,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-29 00:48:58,429 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:48:58,429 INFO L330 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-29 00:48:58,429 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:48:58,429 INFO L82 PathProgramCache]: Analyzing trace with hash 184823418, now seen corresponding path program 1 times [2018-01-29 00:48:58,430 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:48:58,430 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:48:58,431 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:48:58,431 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:48:58,431 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:48:58,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:48:58,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:48:58,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:48:58,482 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:48:58,482 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:48:58,488 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:48:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:48:58,500 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:48:58,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:48:58,549 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:48:58,549 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-01-29 00:48:58,550 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 00:48:58,550 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 00:48:58,550 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 00:48:58,551 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 5 states. [2018-01-29 00:48:58,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:48:58,609 INFO L93 Difference]: Finished difference Result 133 states and 147 transitions. [2018-01-29 00:48:58,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 00:48:58,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-01-29 00:48:58,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:48:58,611 INFO L225 Difference]: With dead ends: 133 [2018-01-29 00:48:58,611 INFO L226 Difference]: Without dead ends: 132 [2018-01-29 00:48:58,612 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-29 00:48:58,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-29 00:48:58,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 112. [2018-01-29 00:48:58,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-29 00:48:58,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2018-01-29 00:48:58,623 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 27 [2018-01-29 00:48:58,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:48:58,624 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2018-01-29 00:48:58,624 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 00:48:58,624 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2018-01-29 00:48:58,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-29 00:48:58,625 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:48:58,625 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:48:58,626 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:48:58,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1434559127, now seen corresponding path program 1 times [2018-01-29 00:48:58,626 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:48:58,626 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:48:58,627 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:48:58,627 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:48:58,627 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:48:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:48:58,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:48:58,837 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:48:58,837 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:48:58,837 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:48:58,842 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:48:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:48:58,856 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:48:58,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 00:48:58,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 00:48:58,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 00:48:58,912 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 00:48:58,977 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:48:59,010 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:48:59,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-01-29 00:48:59,011 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 00:48:59,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 00:48:59,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-29 00:48:59,011 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand 9 states. [2018-01-29 00:48:59,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:48:59,146 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2018-01-29 00:48:59,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 00:48:59,147 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-01-29 00:48:59,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:48:59,148 INFO L225 Difference]: With dead ends: 132 [2018-01-29 00:48:59,148 INFO L226 Difference]: Without dead ends: 131 [2018-01-29 00:48:59,148 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-01-29 00:48:59,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-29 00:48:59,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 114. [2018-01-29 00:48:59,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-29 00:48:59,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 126 transitions. [2018-01-29 00:48:59,159 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 126 transitions. Word has length 28 [2018-01-29 00:48:59,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:48:59,160 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 126 transitions. [2018-01-29 00:48:59,160 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 00:48:59,160 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 126 transitions. [2018-01-29 00:48:59,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-29 00:48:59,161 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:48:59,162 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:48:59,162 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:48:59,162 INFO L82 PathProgramCache]: Analyzing trace with hash -123801987, now seen corresponding path program 2 times [2018-01-29 00:48:59,162 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:48:59,162 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:48:59,163 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:48:59,163 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:48:59,163 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:48:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:48:59,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:48:59,311 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:48:59,311 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:48:59,311 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:48:59,319 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 00:48:59,327 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:48:59,332 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:48:59,338 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:48:59,341 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:48:59,474 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:48:59,495 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 00:48:59,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2018-01-29 00:48:59,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-29 00:48:59,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-29 00:48:59,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-01-29 00:48:59,496 INFO L87 Difference]: Start difference. First operand 114 states and 126 transitions. Second operand 18 states. [2018-01-29 00:48:59,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:48:59,647 INFO L93 Difference]: Finished difference Result 202 states and 221 transitions. [2018-01-29 00:48:59,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-29 00:48:59,675 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2018-01-29 00:48:59,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:48:59,677 INFO L225 Difference]: With dead ends: 202 [2018-01-29 00:48:59,677 INFO L226 Difference]: Without dead ends: 120 [2018-01-29 00:48:59,678 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=490, Unknown=0, NotChecked=0, Total=650 [2018-01-29 00:48:59,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-29 00:48:59,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 112. [2018-01-29 00:48:59,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-29 00:48:59,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2018-01-29 00:48:59,685 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 36 [2018-01-29 00:48:59,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:48:59,685 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2018-01-29 00:48:59,685 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-29 00:48:59,686 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2018-01-29 00:48:59,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-29 00:48:59,687 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:48:59,687 INFO L330 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:48:59,687 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:48:59,687 INFO L82 PathProgramCache]: Analyzing trace with hash 729468996, now seen corresponding path program 1 times [2018-01-29 00:48:59,688 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:48:59,688 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:48:59,688 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:48:59,689 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:48:59,689 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:48:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:48:59,697 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:48:59,732 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:48:59,732 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:48:59,732 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:48:59,737 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:48:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:48:59,746 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:48:59,759 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:48:59,779 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:48:59,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-01-29 00:48:59,780 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 00:48:59,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 00:48:59,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-29 00:48:59,780 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 9 states. [2018-01-29 00:48:59,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:48:59,872 INFO L93 Difference]: Finished difference Result 157 states and 172 transitions. [2018-01-29 00:48:59,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 00:48:59,873 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-01-29 00:48:59,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:48:59,874 INFO L225 Difference]: With dead ends: 157 [2018-01-29 00:48:59,874 INFO L226 Difference]: Without dead ends: 137 [2018-01-29 00:48:59,874 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-01-29 00:48:59,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-29 00:48:59,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 122. [2018-01-29 00:48:59,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-29 00:48:59,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2018-01-29 00:48:59,882 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 37 [2018-01-29 00:48:59,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:48:59,882 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2018-01-29 00:48:59,882 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 00:48:59,882 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2018-01-29 00:48:59,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-29 00:48:59,884 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:48:59,884 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:48:59,885 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:48:59,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1381672071, now seen corresponding path program 1 times [2018-01-29 00:48:59,885 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:48:59,885 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:48:59,885 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:48:59,886 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:48:59,886 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:48:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:48:59,897 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:48:59,975 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-29 00:48:59,976 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:48:59,976 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:48:59,983 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:48:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:48:59,996 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:00,007 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-29 00:49:00,040 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:00,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-01-29 00:49:00,041 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 00:49:00,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 00:49:00,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-29 00:49:00,041 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand 7 states. [2018-01-29 00:49:00,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:00,145 INFO L93 Difference]: Finished difference Result 149 states and 164 transitions. [2018-01-29 00:49:00,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 00:49:00,145 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-01-29 00:49:00,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:00,146 INFO L225 Difference]: With dead ends: 149 [2018-01-29 00:49:00,146 INFO L226 Difference]: Without dead ends: 148 [2018-01-29 00:49:00,146 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-01-29 00:49:00,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-29 00:49:00,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 130. [2018-01-29 00:49:00,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-29 00:49:00,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2018-01-29 00:49:00,153 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 46 [2018-01-29 00:49:00,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:00,153 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2018-01-29 00:49:00,153 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 00:49:00,153 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2018-01-29 00:49:00,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-29 00:49:00,155 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:00,155 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:00,155 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:00,155 INFO L82 PathProgramCache]: Analyzing trace with hash -117838294, now seen corresponding path program 1 times [2018-01-29 00:49:00,155 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:00,155 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:00,156 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:00,156 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:49:00,156 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:00,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:00,361 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-29 00:49:00,361 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:00,361 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:00,369 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:49:00,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:00,381 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:00,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 00:49:00,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 00:49:00,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 00:49:00,389 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 00:49:00,451 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-29 00:49:00,472 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:00,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-01-29 00:49:00,472 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-29 00:49:00,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-29 00:49:00,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-01-29 00:49:00,473 INFO L87 Difference]: Start difference. First operand 130 states and 142 transitions. Second operand 13 states. [2018-01-29 00:49:00,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:00,724 INFO L93 Difference]: Finished difference Result 148 states and 163 transitions. [2018-01-29 00:49:00,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-29 00:49:00,726 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2018-01-29 00:49:00,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:00,728 INFO L225 Difference]: With dead ends: 148 [2018-01-29 00:49:00,728 INFO L226 Difference]: Without dead ends: 147 [2018-01-29 00:49:00,729 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2018-01-29 00:49:00,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-01-29 00:49:00,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 131. [2018-01-29 00:49:00,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-01-29 00:49:00,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 143 transitions. [2018-01-29 00:49:00,738 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 143 transitions. Word has length 47 [2018-01-29 00:49:00,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:00,739 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 143 transitions. [2018-01-29 00:49:00,739 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-29 00:49:00,739 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 143 transitions. [2018-01-29 00:49:00,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-29 00:49:00,740 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:00,740 INFO L330 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:00,740 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:00,740 INFO L82 PathProgramCache]: Analyzing trace with hash 154524538, now seen corresponding path program 2 times [2018-01-29 00:49:00,740 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:00,741 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:00,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:00,741 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:49:00,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:00,750 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:00,811 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:49:00,811 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:00,811 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:00,819 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 00:49:00,827 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:00,831 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:49:00,833 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:00,949 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-01-29 00:49:00,970 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 00:49:00,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2018-01-29 00:49:00,972 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-29 00:49:00,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-29 00:49:00,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=100, Unknown=1, NotChecked=0, Total=132 [2018-01-29 00:49:00,973 INFO L87 Difference]: Start difference. First operand 131 states and 143 transitions. Second operand 12 states. [2018-01-29 00:49:01,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:01,340 INFO L93 Difference]: Finished difference Result 174 states and 194 transitions. [2018-01-29 00:49:01,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-29 00:49:01,341 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-01-29 00:49:01,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:01,342 INFO L225 Difference]: With dead ends: 174 [2018-01-29 00:49:01,342 INFO L226 Difference]: Without dead ends: 143 [2018-01-29 00:49:01,343 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=363, Unknown=1, NotChecked=0, Total=506 [2018-01-29 00:49:01,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-29 00:49:01,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 133. [2018-01-29 00:49:01,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-29 00:49:01,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 146 transitions. [2018-01-29 00:49:01,352 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 146 transitions. Word has length 47 [2018-01-29 00:49:01,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:01,353 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 146 transitions. [2018-01-29 00:49:01,353 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-29 00:49:01,353 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 146 transitions. [2018-01-29 00:49:01,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-29 00:49:01,354 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:01,354 INFO L330 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:01,354 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:01,354 INFO L82 PathProgramCache]: Analyzing trace with hash -739772656, now seen corresponding path program 2 times [2018-01-29 00:49:01,354 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:01,354 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:01,355 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:01,355 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:49:01,355 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:01,364 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:01,488 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-29 00:49:01,489 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:01,489 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:01,498 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 00:49:01,506 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:01,512 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:01,522 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:49:01,525 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:01,719 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 36 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:49:01,740 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:01,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 25 [2018-01-29 00:49:01,740 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-29 00:49:01,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-29 00:49:01,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2018-01-29 00:49:01,741 INFO L87 Difference]: Start difference. First operand 133 states and 146 transitions. Second operand 25 states. [2018-01-29 00:49:02,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:02,501 INFO L93 Difference]: Finished difference Result 272 states and 299 transitions. [2018-01-29 00:49:02,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-29 00:49:02,502 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 55 [2018-01-29 00:49:02,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:02,503 INFO L225 Difference]: With dead ends: 272 [2018-01-29 00:49:02,503 INFO L226 Difference]: Without dead ends: 191 [2018-01-29 00:49:02,504 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=359, Invalid=1621, Unknown=0, NotChecked=0, Total=1980 [2018-01-29 00:49:02,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-01-29 00:49:02,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 170. [2018-01-29 00:49:02,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-01-29 00:49:02,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 185 transitions. [2018-01-29 00:49:02,515 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 185 transitions. Word has length 55 [2018-01-29 00:49:02,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:02,515 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 185 transitions. [2018-01-29 00:49:02,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-29 00:49:02,515 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 185 transitions. [2018-01-29 00:49:02,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-29 00:49:02,516 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:02,517 INFO L330 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:02,517 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:02,517 INFO L82 PathProgramCache]: Analyzing trace with hash 245732012, now seen corresponding path program 1 times [2018-01-29 00:49:02,517 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:02,517 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:02,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:02,518 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:49:02,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:02,524 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:02,603 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-01-29 00:49:02,603 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:02,604 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:02,612 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:49:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:02,624 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:02,696 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 00:49:02,717 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:02,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11] total 15 [2018-01-29 00:49:02,718 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-29 00:49:02,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-29 00:49:02,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-01-29 00:49:02,718 INFO L87 Difference]: Start difference. First operand 170 states and 185 transitions. Second operand 15 states. [2018-01-29 00:49:02,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:02,883 INFO L93 Difference]: Finished difference Result 209 states and 230 transitions. [2018-01-29 00:49:02,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-29 00:49:02,883 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2018-01-29 00:49:02,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:02,885 INFO L225 Difference]: With dead ends: 209 [2018-01-29 00:49:02,885 INFO L226 Difference]: Without dead ends: 197 [2018-01-29 00:49:02,886 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2018-01-29 00:49:02,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-01-29 00:49:02,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 187. [2018-01-29 00:49:02,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-29 00:49:02,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 204 transitions. [2018-01-29 00:49:02,897 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 204 transitions. Word has length 59 [2018-01-29 00:49:02,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:02,897 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 204 transitions. [2018-01-29 00:49:02,897 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-29 00:49:02,897 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 204 transitions. [2018-01-29 00:49:02,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-29 00:49:02,898 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:02,898 INFO L330 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:02,898 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:02,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1928929082, now seen corresponding path program 3 times [2018-01-29 00:49:02,898 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:02,898 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:02,899 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:02,899 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:49:02,899 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:02,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:03,025 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-29 00:49:03,026 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:03,026 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:03,031 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 00:49:03,037 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:49:03,039 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:49:03,040 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:49:03,042 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:03,150 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-29 00:49:03,171 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:03,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2018-01-29 00:49:03,171 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-29 00:49:03,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-29 00:49:03,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-01-29 00:49:03,172 INFO L87 Difference]: Start difference. First operand 187 states and 204 transitions. Second operand 18 states. [2018-01-29 00:49:03,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:03,781 INFO L93 Difference]: Finished difference Result 225 states and 252 transitions. [2018-01-29 00:49:03,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-29 00:49:03,781 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 65 [2018-01-29 00:49:03,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:03,783 INFO L225 Difference]: With dead ends: 225 [2018-01-29 00:49:03,783 INFO L226 Difference]: Without dead ends: 224 [2018-01-29 00:49:03,784 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=261, Invalid=929, Unknown=0, NotChecked=0, Total=1190 [2018-01-29 00:49:03,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-01-29 00:49:03,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 186. [2018-01-29 00:49:03,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-01-29 00:49:03,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 203 transitions. [2018-01-29 00:49:03,801 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 203 transitions. Word has length 65 [2018-01-29 00:49:03,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:03,801 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 203 transitions. [2018-01-29 00:49:03,801 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-29 00:49:03,801 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 203 transitions. [2018-01-29 00:49:03,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-29 00:49:03,802 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:03,803 INFO L330 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:03,803 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:03,803 INFO L82 PathProgramCache]: Analyzing trace with hash 332741067, now seen corresponding path program 2 times [2018-01-29 00:49:03,803 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:03,803 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:03,804 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:03,804 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:49:03,804 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:03,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:04,138 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-29 00:49:04,138 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:04,138 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:04,149 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 00:49:04,156 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:04,163 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:04,164 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:49:04,167 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:04,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 00:49:04,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 00:49:04,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 00:49:04,173 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 00:49:04,405 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-29 00:49:04,426 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:04,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-01-29 00:49:04,427 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-29 00:49:04,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-29 00:49:04,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2018-01-29 00:49:04,427 INFO L87 Difference]: Start difference. First operand 186 states and 203 transitions. Second operand 23 states. [2018-01-29 00:49:04,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:04,930 INFO L93 Difference]: Finished difference Result 224 states and 250 transitions. [2018-01-29 00:49:04,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-29 00:49:04,931 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 66 [2018-01-29 00:49:04,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:04,932 INFO L225 Difference]: With dead ends: 224 [2018-01-29 00:49:04,932 INFO L226 Difference]: Without dead ends: 223 [2018-01-29 00:49:04,933 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=226, Invalid=896, Unknown=0, NotChecked=0, Total=1122 [2018-01-29 00:49:04,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-01-29 00:49:04,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 195. [2018-01-29 00:49:04,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-01-29 00:49:04,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 213 transitions. [2018-01-29 00:49:04,947 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 213 transitions. Word has length 66 [2018-01-29 00:49:04,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:04,947 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 213 transitions. [2018-01-29 00:49:04,947 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-29 00:49:04,947 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 213 transitions. [2018-01-29 00:49:04,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-29 00:49:04,948 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:04,948 INFO L330 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:04,948 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:04,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1158666688, now seen corresponding path program 3 times [2018-01-29 00:49:04,948 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:04,949 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:04,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:04,949 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:49:04,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:04,960 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:05,359 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 45 proven. 26 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-29 00:49:05,360 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:05,360 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:05,365 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 00:49:05,372 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:49:05,374 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:49:05,377 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:49:05,378 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:49:05,379 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:05,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 00:49:05,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 00:49:05,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 00:49:05,385 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 00:49:05,638 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-01-29 00:49:05,663 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:05,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2018-01-29 00:49:05,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-29 00:49:05,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-29 00:49:05,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2018-01-29 00:49:05,664 INFO L87 Difference]: Start difference. First operand 195 states and 213 transitions. Second operand 29 states. [2018-01-29 00:49:06,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:06,287 INFO L93 Difference]: Finished difference Result 259 states and 281 transitions. [2018-01-29 00:49:06,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-29 00:49:06,287 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 75 [2018-01-29 00:49:06,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:06,289 INFO L225 Difference]: With dead ends: 259 [2018-01-29 00:49:06,289 INFO L226 Difference]: Without dead ends: 258 [2018-01-29 00:49:06,290 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=357, Invalid=1623, Unknown=0, NotChecked=0, Total=1980 [2018-01-29 00:49:06,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-01-29 00:49:06,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 212. [2018-01-29 00:49:06,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-01-29 00:49:06,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 230 transitions. [2018-01-29 00:49:06,302 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 230 transitions. Word has length 75 [2018-01-29 00:49:06,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:06,302 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 230 transitions. [2018-01-29 00:49:06,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-29 00:49:06,302 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 230 transitions. [2018-01-29 00:49:06,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-01-29 00:49:06,303 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:06,303 INFO L330 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:06,303 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:06,303 INFO L82 PathProgramCache]: Analyzing trace with hash -337153039, now seen corresponding path program 2 times [2018-01-29 00:49:06,303 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:06,304 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:06,304 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:06,304 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:49:06,304 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:06,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:06,311 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:06,392 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-01-29 00:49:06,392 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:06,392 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:06,398 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 00:49:06,404 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:06,409 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:06,410 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:49:06,412 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:06,510 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-29 00:49:06,530 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:06,530 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13] total 19 [2018-01-29 00:49:06,531 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-29 00:49:06,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-29 00:49:06,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2018-01-29 00:49:06,531 INFO L87 Difference]: Start difference. First operand 212 states and 230 transitions. Second operand 19 states. [2018-01-29 00:49:06,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:06,784 INFO L93 Difference]: Finished difference Result 250 states and 274 transitions. [2018-01-29 00:49:06,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-29 00:49:06,785 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 76 [2018-01-29 00:49:06,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:06,786 INFO L225 Difference]: With dead ends: 250 [2018-01-29 00:49:06,786 INFO L226 Difference]: Without dead ends: 210 [2018-01-29 00:49:06,786 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=250, Invalid=940, Unknown=0, NotChecked=0, Total=1190 [2018-01-29 00:49:06,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-01-29 00:49:06,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 175. [2018-01-29 00:49:06,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-01-29 00:49:06,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 190 transitions. [2018-01-29 00:49:06,797 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 190 transitions. Word has length 76 [2018-01-29 00:49:06,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:06,797 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 190 transitions. [2018-01-29 00:49:06,797 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-29 00:49:06,797 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 190 transitions. [2018-01-29 00:49:06,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-01-29 00:49:06,798 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:06,798 INFO L330 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:06,798 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:06,798 INFO L82 PathProgramCache]: Analyzing trace with hash -448849674, now seen corresponding path program 4 times [2018-01-29 00:49:06,798 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:06,798 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:06,799 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:06,799 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:49:06,799 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:06,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:07,108 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 23 proven. 50 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-01-29 00:49:07,109 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:07,109 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:07,114 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 00:49:07,136 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:49:07,138 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:07,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 00:49:07,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 00:49:07,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 00:49:07,161 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 00:49:07,499 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-01-29 00:49:07,520 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:07,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2018-01-29 00:49:07,520 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-29 00:49:07,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-29 00:49:07,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2018-01-29 00:49:07,521 INFO L87 Difference]: Start difference. First operand 175 states and 190 transitions. Second operand 29 states. [2018-01-29 00:49:09,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:09,406 INFO L93 Difference]: Finished difference Result 366 states and 396 transitions. [2018-01-29 00:49:09,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-01-29 00:49:09,406 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 85 [2018-01-29 00:49:09,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:09,408 INFO L225 Difference]: With dead ends: 366 [2018-01-29 00:49:09,408 INFO L226 Difference]: Without dead ends: 365 [2018-01-29 00:49:09,409 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1759 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=763, Invalid=5557, Unknown=0, NotChecked=0, Total=6320 [2018-01-29 00:49:09,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-01-29 00:49:09,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 211. [2018-01-29 00:49:09,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-01-29 00:49:09,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 229 transitions. [2018-01-29 00:49:09,427 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 229 transitions. Word has length 85 [2018-01-29 00:49:09,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:09,428 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 229 transitions. [2018-01-29 00:49:09,428 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-29 00:49:09,428 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 229 transitions. [2018-01-29 00:49:09,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-01-29 00:49:09,429 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:09,430 INFO L330 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:09,430 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:09,430 INFO L82 PathProgramCache]: Analyzing trace with hash 36527359, now seen corresponding path program 5 times [2018-01-29 00:49:09,430 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:09,430 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:09,431 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:09,431 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:49:09,431 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:09,445 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:09,828 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 30 proven. 86 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-01-29 00:49:09,831 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:09,831 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:09,838 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 00:49:09,845 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:09,848 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:09,855 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:09,858 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:09,862 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:09,866 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:09,867 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:49:09,869 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:09,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 00:49:09,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 00:49:09,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 00:49:09,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 00:49:10,161 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-01-29 00:49:10,181 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:10,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 32 [2018-01-29 00:49:10,182 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-29 00:49:10,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-29 00:49:10,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=954, Unknown=0, NotChecked=0, Total=1056 [2018-01-29 00:49:10,183 INFO L87 Difference]: Start difference. First operand 211 states and 229 transitions. Second operand 33 states. [2018-01-29 00:49:12,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:12,712 INFO L93 Difference]: Finished difference Result 500 states and 541 transitions. [2018-01-29 00:49:12,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-01-29 00:49:12,713 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 104 [2018-01-29 00:49:12,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:12,715 INFO L225 Difference]: With dead ends: 500 [2018-01-29 00:49:12,715 INFO L226 Difference]: Without dead ends: 499 [2018-01-29 00:49:12,717 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2424 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=934, Invalid=7622, Unknown=0, NotChecked=0, Total=8556 [2018-01-29 00:49:12,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-01-29 00:49:12,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 247. [2018-01-29 00:49:12,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-01-29 00:49:12,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 268 transitions. [2018-01-29 00:49:12,733 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 268 transitions. Word has length 104 [2018-01-29 00:49:12,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:12,733 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 268 transitions. [2018-01-29 00:49:12,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-29 00:49:12,734 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 268 transitions. [2018-01-29 00:49:12,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-01-29 00:49:12,735 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:12,735 INFO L330 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:12,735 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:12,735 INFO L82 PathProgramCache]: Analyzing trace with hash -382494782, now seen corresponding path program 6 times [2018-01-29 00:49:12,735 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:12,735 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:12,736 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:12,736 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:49:12,736 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:12,748 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:13,628 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 108 proven. 132 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-01-29 00:49:13,628 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:13,628 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:13,634 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-29 00:49:13,644 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:49:13,646 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:49:13,656 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:49:13,664 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:49:13,671 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:49:13,675 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:49:13,678 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:49:13,678 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:49:13,681 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:13,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 00:49:13,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 00:49:13,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 00:49:13,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 00:49:14,075 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 37 proven. 132 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-01-29 00:49:14,095 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:14,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20] total 42 [2018-01-29 00:49:14,095 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-01-29 00:49:14,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-01-29 00:49:14,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1585, Unknown=0, NotChecked=0, Total=1806 [2018-01-29 00:49:14,097 INFO L87 Difference]: Start difference. First operand 247 states and 268 transitions. Second operand 43 states. [2018-01-29 00:49:15,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:15,301 INFO L93 Difference]: Finished difference Result 455 states and 493 transitions. [2018-01-29 00:49:15,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-29 00:49:15,301 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 123 [2018-01-29 00:49:15,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:15,303 INFO L225 Difference]: With dead ends: 455 [2018-01-29 00:49:15,303 INFO L226 Difference]: Without dead ends: 454 [2018-01-29 00:49:15,304 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=736, Invalid=3956, Unknown=0, NotChecked=0, Total=4692 [2018-01-29 00:49:15,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-01-29 00:49:15,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 274. [2018-01-29 00:49:15,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-01-29 00:49:15,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 297 transitions. [2018-01-29 00:49:15,319 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 297 transitions. Word has length 123 [2018-01-29 00:49:15,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:15,319 INFO L432 AbstractCegarLoop]: Abstraction has 274 states and 297 transitions. [2018-01-29 00:49:15,319 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-01-29 00:49:15,319 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 297 transitions. [2018-01-29 00:49:15,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-01-29 00:49:15,320 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:15,320 INFO L330 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:15,320 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:15,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1091959176, now seen corresponding path program 7 times [2018-01-29 00:49:15,321 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:15,321 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:15,321 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:15,321 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:49:15,321 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:15,333 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:15,709 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 0 proven. 159 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-01-29 00:49:15,710 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:15,710 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:15,717 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:49:15,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:15,740 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:15,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 00:49:15,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 00:49:15,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 00:49:15,745 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 00:49:16,047 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 0 proven. 159 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-01-29 00:49:16,067 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:16,068 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2018-01-29 00:49:16,068 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-29 00:49:16,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-29 00:49:16,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1012, Unknown=0, NotChecked=0, Total=1190 [2018-01-29 00:49:16,068 INFO L87 Difference]: Start difference. First operand 274 states and 297 transitions. Second operand 35 states. [2018-01-29 00:49:16,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:16,715 INFO L93 Difference]: Finished difference Result 653 states and 705 transitions. [2018-01-29 00:49:16,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-29 00:49:16,715 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 133 [2018-01-29 00:49:16,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:16,717 INFO L225 Difference]: With dead ends: 653 [2018-01-29 00:49:16,717 INFO L226 Difference]: Without dead ends: 652 [2018-01-29 00:49:16,718 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=493, Invalid=2477, Unknown=0, NotChecked=0, Total=2970 [2018-01-29 00:49:16,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2018-01-29 00:49:16,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 283. [2018-01-29 00:49:16,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-01-29 00:49:16,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 307 transitions. [2018-01-29 00:49:16,740 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 307 transitions. Word has length 133 [2018-01-29 00:49:16,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:16,741 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 307 transitions. [2018-01-29 00:49:16,741 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-29 00:49:16,741 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 307 transitions. [2018-01-29 00:49:16,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-01-29 00:49:16,742 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:16,742 INFO L330 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:16,742 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:16,743 INFO L82 PathProgramCache]: Analyzing trace with hash -501068749, now seen corresponding path program 8 times [2018-01-29 00:49:16,743 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:16,743 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:16,744 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:16,744 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:49:16,744 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:16,756 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:17,311 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 44 proven. 188 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2018-01-29 00:49:17,311 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:17,311 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:17,316 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 00:49:17,324 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:17,335 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:17,337 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:49:17,340 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:17,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 00:49:17,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 00:49:17,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 00:49:17,358 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 00:49:17,774 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-01-29 00:49:17,794 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:17,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 40 [2018-01-29 00:49:17,795 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-29 00:49:17,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-29 00:49:17,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1496, Unknown=0, NotChecked=0, Total=1640 [2018-01-29 00:49:17,796 INFO L87 Difference]: Start difference. First operand 283 states and 307 transitions. Second operand 41 states. [2018-01-29 00:49:21,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:21,480 INFO L93 Difference]: Finished difference Result 840 states and 909 transitions. [2018-01-29 00:49:21,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-01-29 00:49:21,480 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 142 [2018-01-29 00:49:21,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:21,483 INFO L225 Difference]: With dead ends: 840 [2018-01-29 00:49:21,483 INFO L226 Difference]: Without dead ends: 839 [2018-01-29 00:49:21,487 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4238 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1342, Invalid=13178, Unknown=0, NotChecked=0, Total=14520 [2018-01-29 00:49:21,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-01-29 00:49:21,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 319. [2018-01-29 00:49:21,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-01-29 00:49:21,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 346 transitions. [2018-01-29 00:49:21,516 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 346 transitions. Word has length 142 [2018-01-29 00:49:21,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:21,517 INFO L432 AbstractCegarLoop]: Abstraction has 319 states and 346 transitions. [2018-01-29 00:49:21,517 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-29 00:49:21,517 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 346 transitions. [2018-01-29 00:49:21,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-01-29 00:49:21,518 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:21,518 INFO L330 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:21,519 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:21,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1765856626, now seen corresponding path program 9 times [2018-01-29 00:49:21,519 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:21,519 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:21,520 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:21,520 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:49:21,520 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:21,537 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:22,308 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 51 proven. 254 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2018-01-29 00:49:22,308 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:22,308 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:22,313 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 00:49:22,321 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:49:22,323 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:49:22,326 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:49:22,328 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:49:22,331 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:49:22,334 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:49:22,337 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:49:22,340 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:49:22,341 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:49:22,345 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:22,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 00:49:22,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 00:49:22,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 00:49:22,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 00:49:22,790 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 51 proven. 254 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2018-01-29 00:49:22,811 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:22,811 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2018-01-29 00:49:22,811 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-01-29 00:49:22,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-01-29 00:49:22,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=1860, Unknown=0, NotChecked=0, Total=2162 [2018-01-29 00:49:22,812 INFO L87 Difference]: Start difference. First operand 319 states and 346 transitions. Second operand 47 states. [2018-01-29 00:49:23,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:23,609 INFO L93 Difference]: Finished difference Result 480 states and 522 transitions. [2018-01-29 00:49:23,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-29 00:49:23,609 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 161 [2018-01-29 00:49:23,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:23,611 INFO L225 Difference]: With dead ends: 480 [2018-01-29 00:49:23,611 INFO L226 Difference]: Without dead ends: 479 [2018-01-29 00:49:23,612 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1543 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=790, Invalid=3902, Unknown=0, NotChecked=0, Total=4692 [2018-01-29 00:49:23,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-01-29 00:49:23,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 346. [2018-01-29 00:49:23,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-01-29 00:49:23,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 375 transitions. [2018-01-29 00:49:23,629 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 375 transitions. Word has length 161 [2018-01-29 00:49:23,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:23,630 INFO L432 AbstractCegarLoop]: Abstraction has 346 states and 375 transitions. [2018-01-29 00:49:23,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-01-29 00:49:23,630 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 375 transitions. [2018-01-29 00:49:23,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-01-29 00:49:23,631 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:23,631 INFO L330 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:23,632 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:23,632 INFO L82 PathProgramCache]: Analyzing trace with hash -991764284, now seen corresponding path program 10 times [2018-01-29 00:49:23,632 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:23,632 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:23,632 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:23,633 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:49:23,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:23,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:23,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:24,275 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 109 proven. 328 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2018-01-29 00:49:24,276 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:24,276 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:24,281 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 00:49:24,308 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:49:24,311 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:24,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 00:49:24,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 00:49:24,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 00:49:24,316 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 00:49:24,910 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 0 proven. 284 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-01-29 00:49:24,930 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:24,930 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 22] total 48 [2018-01-29 00:49:24,930 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-01-29 00:49:24,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-01-29 00:49:24,931 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=2156, Unknown=0, NotChecked=0, Total=2352 [2018-01-29 00:49:24,931 INFO L87 Difference]: Start difference. First operand 346 states and 375 transitions. Second operand 49 states. [2018-01-29 00:49:30,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:30,065 INFO L93 Difference]: Finished difference Result 1180 states and 1277 transitions. [2018-01-29 00:49:30,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-01-29 00:49:30,066 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 171 [2018-01-29 00:49:30,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:30,069 INFO L225 Difference]: With dead ends: 1180 [2018-01-29 00:49:30,069 INFO L226 Difference]: Without dead ends: 1179 [2018-01-29 00:49:30,070 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6098 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1726, Invalid=18580, Unknown=0, NotChecked=0, Total=20306 [2018-01-29 00:49:30,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2018-01-29 00:49:30,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 382. [2018-01-29 00:49:30,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-01-29 00:49:30,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 414 transitions. [2018-01-29 00:49:30,093 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 414 transitions. Word has length 171 [2018-01-29 00:49:30,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:30,093 INFO L432 AbstractCegarLoop]: Abstraction has 382 states and 414 transitions. [2018-01-29 00:49:30,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-01-29 00:49:30,094 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 414 transitions. [2018-01-29 00:49:30,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-01-29 00:49:30,094 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:30,095 INFO L330 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:30,095 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:30,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1859389809, now seen corresponding path program 11 times [2018-01-29 00:49:30,095 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:30,095 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:30,095 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:30,096 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:49:30,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:30,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:30,764 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 125 proven. 414 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2018-01-29 00:49:30,764 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:30,764 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:30,769 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 00:49:30,778 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:30,781 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:30,783 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:30,785 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:30,788 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:30,791 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:30,794 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:30,798 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:30,802 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:30,807 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:30,809 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:49:30,812 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:30,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 00:49:30,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 00:49:30,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 00:49:30,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 00:49:31,468 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2018-01-29 00:49:31,488 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:31,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 23] total 52 [2018-01-29 00:49:31,489 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-01-29 00:49:31,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-01-29 00:49:31,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=2533, Unknown=0, NotChecked=0, Total=2756 [2018-01-29 00:49:31,490 INFO L87 Difference]: Start difference. First operand 382 states and 414 transitions. Second operand 53 states. [2018-01-29 00:49:37,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:37,761 INFO L93 Difference]: Finished difference Result 1422 states and 1539 transitions. [2018-01-29 00:49:37,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-01-29 00:49:37,761 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 190 [2018-01-29 00:49:37,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:37,765 INFO L225 Difference]: With dead ends: 1422 [2018-01-29 00:49:37,765 INFO L226 Difference]: Without dead ends: 1421 [2018-01-29 00:49:37,767 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7273 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1993, Invalid=22187, Unknown=0, NotChecked=0, Total=24180 [2018-01-29 00:49:37,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2018-01-29 00:49:37,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 418. [2018-01-29 00:49:37,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-01-29 00:49:37,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 453 transitions. [2018-01-29 00:49:37,792 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 453 transitions. Word has length 190 [2018-01-29 00:49:37,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:37,792 INFO L432 AbstractCegarLoop]: Abstraction has 418 states and 453 transitions. [2018-01-29 00:49:37,793 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-01-29 00:49:37,793 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 453 transitions. [2018-01-29 00:49:37,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-01-29 00:49:37,794 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:37,794 INFO L330 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:37,794 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:37,794 INFO L82 PathProgramCache]: Analyzing trace with hash 967372560, now seen corresponding path program 12 times [2018-01-29 00:49:37,794 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:37,794 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:37,795 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:37,795 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:49:37,795 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:37,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:38,602 INFO L134 CoverageAnalysis]: Checked inductivity of 935 backedges. 65 proven. 510 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2018-01-29 00:49:38,602 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:38,602 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:38,607 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-29 00:49:38,616 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:49:38,619 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:49:38,621 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:49:38,624 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:49:38,626 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:49:38,629 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:49:38,632 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:49:38,635 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:49:38,639 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:49:38,642 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:49:38,647 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:49:38,649 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:49:38,652 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:38,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 00:49:38,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 00:49:38,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 00:49:38,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 00:49:39,352 INFO L134 CoverageAnalysis]: Checked inductivity of 935 backedges. 0 proven. 445 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-01-29 00:49:39,372 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:39,373 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26] total 54 [2018-01-29 00:49:39,373 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-01-29 00:49:39,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-01-29 00:49:39,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=2652, Unknown=0, NotChecked=0, Total=2970 [2018-01-29 00:49:39,374 INFO L87 Difference]: Start difference. First operand 418 states and 453 transitions. Second operand 55 states. [2018-01-29 00:49:44,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:44,967 INFO L93 Difference]: Finished difference Result 1688 states and 1827 transitions. [2018-01-29 00:49:44,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-01-29 00:49:44,967 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 209 [2018-01-29 00:49:44,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:44,972 INFO L225 Difference]: With dead ends: 1688 [2018-01-29 00:49:44,972 INFO L226 Difference]: Without dead ends: 1687 [2018-01-29 00:49:44,975 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8643 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=4052, Invalid=24340, Unknown=0, NotChecked=0, Total=28392 [2018-01-29 00:49:44,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1687 states. [2018-01-29 00:49:45,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1687 to 454. [2018-01-29 00:49:45,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2018-01-29 00:49:45,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 492 transitions. [2018-01-29 00:49:45,018 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 492 transitions. Word has length 209 [2018-01-29 00:49:45,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:45,019 INFO L432 AbstractCegarLoop]: Abstraction has 454 states and 492 transitions. [2018-01-29 00:49:45,019 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-01-29 00:49:45,019 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 492 transitions. [2018-01-29 00:49:45,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-01-29 00:49:45,021 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:45,021 INFO L330 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:45,022 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:45,022 INFO L82 PathProgramCache]: Analyzing trace with hash 989034789, now seen corresponding path program 13 times [2018-01-29 00:49:45,022 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:45,022 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:45,023 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:45,023 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:49:45,023 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:45,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:45,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:46,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1133 backedges. 435 proven. 698 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:49:46,989 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:46,989 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:46,994 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:49:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:47,029 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:47,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 00:49:47,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 00:49:47,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 00:49:47,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 00:49:48,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1133 backedges. 0 proven. 539 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2018-01-29 00:49:48,221 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:48,221 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 27] total 77 [2018-01-29 00:49:48,222 INFO L409 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-01-29 00:49:48,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-01-29 00:49:48,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=402, Invalid=5604, Unknown=0, NotChecked=0, Total=6006 [2018-01-29 00:49:48,223 INFO L87 Difference]: Start difference. First operand 454 states and 492 transitions. Second operand 78 states. [2018-01-29 00:49:58,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:58,567 INFO L93 Difference]: Finished difference Result 1978 states and 2141 transitions. [2018-01-29 00:49:58,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-01-29 00:49:58,567 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 228 [2018-01-29 00:49:58,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:58,571 INFO L225 Difference]: With dead ends: 1978 [2018-01-29 00:49:58,571 INFO L226 Difference]: Without dead ends: 1977 [2018-01-29 00:49:58,574 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 202 SyntacticMatches, 1 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12382 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=2729, Invalid=37071, Unknown=0, NotChecked=0, Total=39800 [2018-01-29 00:49:58,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2018-01-29 00:49:58,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 490. [2018-01-29 00:49:58,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-01-29 00:49:58,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 531 transitions. [2018-01-29 00:49:58,610 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 531 transitions. Word has length 228 [2018-01-29 00:49:58,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:58,610 INFO L432 AbstractCegarLoop]: Abstraction has 490 states and 531 transitions. [2018-01-29 00:49:58,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-01-29 00:49:58,610 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 531 transitions. [2018-01-29 00:49:58,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-01-29 00:49:58,611 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:58,612 INFO L330 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:58,612 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:58,612 INFO L82 PathProgramCache]: Analyzing trace with hash 492564828, now seen corresponding path program 14 times [2018-01-29 00:49:58,612 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:58,612 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:58,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:58,613 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:49:58,613 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:58,627 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:59,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1350 backedges. 0 proven. 642 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2018-01-29 00:49:59,868 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:59,868 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:59,873 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 00:49:59,883 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:59,902 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:59,905 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:49:59,910 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:59,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 00:49:59,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 00:49:59,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 00:49:59,932 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 00:50:00,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1350 backedges. 0 proven. 642 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2018-01-29 00:50:00,687 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:50:00,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 58 [2018-01-29 00:50:00,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-01-29 00:50:00,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-01-29 00:50:00,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=2950, Unknown=0, NotChecked=0, Total=3422 [2018-01-29 00:50:00,688 INFO L87 Difference]: Start difference. First operand 490 states and 531 transitions. Second operand 59 states. [2018-01-29 00:50:03,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:50:03,249 INFO L93 Difference]: Finished difference Result 2105 states and 2277 transitions. [2018-01-29 00:50:03,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-01-29 00:50:03,249 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 247 [2018-01-29 00:50:03,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:50:03,254 INFO L225 Difference]: With dead ends: 2105 [2018-01-29 00:50:03,254 INFO L226 Difference]: Without dead ends: 2104 [2018-01-29 00:50:03,256 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2559 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1270, Invalid=8042, Unknown=0, NotChecked=0, Total=9312 [2018-01-29 00:50:03,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2104 states. [2018-01-29 00:50:03,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2104 to 499. [2018-01-29 00:50:03,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2018-01-29 00:50:03,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 541 transitions. [2018-01-29 00:50:03,312 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 541 transitions. Word has length 247 [2018-01-29 00:50:03,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:50:03,313 INFO L432 AbstractCegarLoop]: Abstraction has 499 states and 541 transitions. [2018-01-29 00:50:03,313 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-01-29 00:50:03,313 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 541 transitions. [2018-01-29 00:50:03,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-01-29 00:50:03,315 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:50:03,315 INFO L330 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:50:03,315 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:50:03,316 INFO L82 PathProgramCache]: Analyzing trace with hash -442474033, now seen corresponding path program 15 times [2018-01-29 00:50:03,316 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:50:03,316 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:50:03,317 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:50:03,317 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:50:03,317 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:50:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:50:03,339 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:50:04,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1462 backedges. 0 proven. 754 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2018-01-29 00:50:04,619 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:50:04,619 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:50:04,624 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 00:50:04,642 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:50:04,645 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:50:04,648 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:50:04,651 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:50:04,655 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:50:04,658 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:50:04,673 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:50:04,688 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:50:04,697 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:50:04,702 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:50:04,717 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:50:04,725 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:50:04,735 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:50:04,740 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:50:04,745 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:50:04,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 00:50:04,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 00:50:04,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 00:50:04,751 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 00:50:05,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1462 backedges. 86 proven. 734 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2018-01-29 00:50:05,930 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:50:05,930 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 34] total 64 [2018-01-29 00:50:05,930 INFO L409 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-01-29 00:50:05,931 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-01-29 00:50:05,931 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=3750, Unknown=0, NotChecked=0, Total=4160 [2018-01-29 00:50:05,932 INFO L87 Difference]: Start difference. First operand 499 states and 541 transitions. Second operand 65 states. [2018-01-29 00:50:13,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:50:13,540 INFO L93 Difference]: Finished difference Result 2436 states and 2637 transitions. [2018-01-29 00:50:13,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-01-29 00:50:13,540 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 256 [2018-01-29 00:50:13,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:50:13,547 INFO L225 Difference]: With dead ends: 2436 [2018-01-29 00:50:13,547 INFO L226 Difference]: Without dead ends: 2435 [2018-01-29 00:50:13,550 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12802 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=4787, Invalid=32269, Unknown=0, NotChecked=0, Total=37056 [2018-01-29 00:50:13,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2435 states. [2018-01-29 00:50:13,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2435 to 535. [2018-01-29 00:50:13,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-01-29 00:50:13,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 580 transitions. [2018-01-29 00:50:13,610 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 580 transitions. Word has length 256 [2018-01-29 00:50:13,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:50:13,610 INFO L432 AbstractCegarLoop]: Abstraction has 535 states and 580 transitions. [2018-01-29 00:50:13,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-01-29 00:50:13,611 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 580 transitions. [2018-01-29 00:50:13,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-01-29 00:50:13,613 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:50:13,613 INFO L330 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:50:13,613 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:50:13,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1409688846, now seen corresponding path program 16 times [2018-01-29 00:50:13,614 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:50:13,614 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:50:13,615 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:50:13,615 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:50:13,615 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:50:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:50:13,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:50:14,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1707 backedges. 0 proven. 875 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2018-01-29 00:50:14,796 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:50:14,796 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:50:14,800 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 00:50:14,846 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:50:14,852 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:50:14,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 00:50:14,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 00:50:14,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 00:50:14,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 00:50:15,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1707 backedges. 0 proven. 875 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2018-01-29 00:50:15,835 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:50:15,836 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 64 [2018-01-29 00:50:15,836 INFO L409 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-01-29 00:50:15,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-01-29 00:50:15,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=582, Invalid=3578, Unknown=0, NotChecked=0, Total=4160 [2018-01-29 00:50:15,837 INFO L87 Difference]: Start difference. First operand 535 states and 580 transitions. Second operand 65 states. [2018-01-29 00:50:18,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:50:18,467 INFO L93 Difference]: Finished difference Result 2575 states and 2786 transitions. [2018-01-29 00:50:18,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-01-29 00:50:18,468 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 275 [2018-01-29 00:50:18,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:50:18,477 INFO L225 Difference]: With dead ends: 2575 [2018-01-29 00:50:18,477 INFO L226 Difference]: Without dead ends: 2574 [2018-01-29 00:50:18,479 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 243 SyntacticMatches, 2 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3450 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1517, Invalid=10473, Unknown=0, NotChecked=0, Total=11990 [2018-01-29 00:50:18,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2574 states. [2018-01-29 00:50:18,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2574 to 544. [2018-01-29 00:50:18,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-01-29 00:50:18,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 590 transitions. [2018-01-29 00:50:18,555 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 590 transitions. Word has length 275 [2018-01-29 00:50:18,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:50:18,556 INFO L432 AbstractCegarLoop]: Abstraction has 544 states and 590 transitions. [2018-01-29 00:50:18,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-01-29 00:50:18,556 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 590 transitions. [2018-01-29 00:50:18,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-01-29 00:50:18,558 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:50:18,559 INFO L330 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:50:18,559 INFO L371 AbstractCegarLoop]: === Iteration 32 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:50:18,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1923145977, now seen corresponding path program 17 times [2018-01-29 00:50:18,559 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:50:18,559 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:50:18,560 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:50:18,560 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:50:18,560 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:50:18,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:50:18,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:50:19,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1837 backedges. 0 proven. 1005 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2018-01-29 00:50:19,904 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:50:19,904 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:50:19,909 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 00:50:19,920 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:50:19,924 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:50:19,926 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:50:19,929 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:50:19,931 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:50:19,934 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:50:19,937 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:50:19,941 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:50:19,944 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:50:19,948 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:50:19,953 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:50:19,959 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:50:19,965 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:50:19,971 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:50:19,979 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:50:19,988 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:50:19,989 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:50:19,994 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:50:22,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1837 backedges. 1005 proven. 832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:50:22,098 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:50:22,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 62] total 97 [2018-01-29 00:50:22,099 INFO L409 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-01-29 00:50:22,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-01-29 00:50:22,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=815, Invalid=8497, Unknown=0, NotChecked=0, Total=9312 [2018-01-29 00:50:22,100 INFO L87 Difference]: Start difference. First operand 544 states and 590 transitions. Second operand 97 states. [2018-01-29 00:50:37,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:50:37,306 INFO L93 Difference]: Finished difference Result 3165 states and 3444 transitions. [2018-01-29 00:50:37,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-01-29 00:50:37,307 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 284 [2018-01-29 00:50:37,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:50:37,312 INFO L225 Difference]: With dead ends: 3165 [2018-01-29 00:50:37,312 INFO L226 Difference]: Without dead ends: 2725 [2018-01-29 00:50:37,315 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16739 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=6376, Invalid=49084, Unknown=0, NotChecked=0, Total=55460 [2018-01-29 00:50:37,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2725 states. [2018-01-29 00:50:37,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2725 to 2116. [2018-01-29 00:50:37,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2116 states. [2018-01-29 00:50:37,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 2116 states and 2333 transitions. [2018-01-29 00:50:37,760 INFO L78 Accepts]: Start accepts. Automaton has 2116 states and 2333 transitions. Word has length 284 [2018-01-29 00:50:37,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:50:37,760 INFO L432 AbstractCegarLoop]: Abstraction has 2116 states and 2333 transitions. [2018-01-29 00:50:37,760 INFO L433 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-01-29 00:50:37,760 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 2333 transitions. [2018-01-29 00:50:37,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-01-29 00:50:37,764 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:50:37,764 INFO L330 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 16, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:50:37,764 INFO L371 AbstractCegarLoop]: === Iteration 33 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:50:37,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1888813560, now seen corresponding path program 18 times [2018-01-29 00:50:37,765 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:50:37,765 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:50:37,765 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:50:37,766 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:50:37,766 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:50:37,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:50:37,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-01-29 00:50:38,529 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-29 00:50:38,533 WARN L185 ceAbstractionStarter]: Timeout [2018-01-29 00:50:38,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 12:50:38 BasicIcfg [2018-01-29 00:50:38,534 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 00:50:38,535 INFO L168 Benchmark]: Toolchain (without parser) took 112389.65 ms. Allocated memory was 308.3 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 269.2 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 491.5 MB. Max. memory is 5.3 GB. [2018-01-29 00:50:38,535 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 308.3 MB. Free memory is still 274.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 00:50:38,536 INFO L168 Benchmark]: CACSL2BoogieTranslator took 180.58 ms. Allocated memory is still 308.3 MB. Free memory was 268.2 MB in the beginning and 260.1 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. [2018-01-29 00:50:38,536 INFO L168 Benchmark]: Boogie Preprocessor took 33.48 ms. Allocated memory is still 308.3 MB. Free memory was 260.1 MB in the beginning and 258.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-29 00:50:38,536 INFO L168 Benchmark]: RCFGBuilder took 266.34 ms. Allocated memory is still 308.3 MB. Free memory was 258.0 MB in the beginning and 241.0 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-29 00:50:38,536 INFO L168 Benchmark]: IcfgTransformer took 10140.19 ms. Allocated memory was 308.3 MB in the beginning and 1.0 GB in the end (delta: 730.3 MB). Free memory was 241.0 MB in the beginning and 527.9 MB in the end (delta: -286.9 MB). Peak memory consumption was 443.4 MB. Max. memory is 5.3 GB. [2018-01-29 00:50:38,537 INFO L168 Benchmark]: TraceAbstraction took 101760.90 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 930.1 MB). Free memory was 527.9 MB in the beginning and 1.4 GB in the end (delta: -910.2 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. [2018-01-29 00:50:38,539 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 308.3 MB. Free memory is still 274.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 180.58 ms. Allocated memory is still 308.3 MB. Free memory was 268.2 MB in the beginning and 260.1 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.48 ms. Allocated memory is still 308.3 MB. Free memory was 260.1 MB in the beginning and 258.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 266.34 ms. Allocated memory is still 308.3 MB. Free memory was 258.0 MB in the beginning and 241.0 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * IcfgTransformer took 10140.19 ms. Allocated memory was 308.3 MB in the beginning and 1.0 GB in the end (delta: 730.3 MB). Free memory was 241.0 MB in the beginning and 527.9 MB in the end (delta: -286.9 MB). Peak memory consumption was 443.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 101760.90 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 930.1 MB). Free memory was 527.9 MB in the beginning and 1.4 GB in the end (delta: -910.2 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 59 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 797 LocStat_NO_SUPPORTING_DISEQUALITIES : 409 LocStat_NO_DISJUNCTIONS : -118 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 79 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 95 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 80 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.351427 RENAME_VARIABLES(MILLISECONDS) : 0.247443 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.312787 PROJECTAWAY(MILLISECONDS) : 1.559493 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.094845 DISJOIN(MILLISECONDS) : 0.217608 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.275552 ADD_EQUALITY(MILLISECONDS) : 0.035352 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.053582 #CONJOIN_DISJUNCTIVE : 667 #RENAME_VARIABLES : 1481 #UNFREEZE : 0 #CONJOIN : 935 #PROJECTAWAY : 882 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 214 #RENAME_VARIABLES_DISJUNCTIVE : 1464 #ADD_EQUALITY : 95 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: HeapSeparatorStatistics COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_0 : 1 COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : 1 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_1 : 1 COUNT_BLOCKS_for_[#memory_int]_at_dim_1 : 1 COUNT_ARRAY_READS for [#memory_int] : 1 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while BasicCegarLoop was analyzing trace of length 304 with TraceHistMax 17, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 18). Cancelled while BasicCegarLoop was analyzing trace of length 304 with TraceHistMax 17, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while BasicCegarLoop was analyzing trace of length 304 with TraceHistMax 17, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 27). Cancelled while BasicCegarLoop was analyzing trace of length 304 with TraceHistMax 17, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 23). Cancelled while BasicCegarLoop was analyzing trace of length 304 with TraceHistMax 17, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 30). Cancelled while BasicCegarLoop was analyzing trace of length 304 with TraceHistMax 17, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 61 locations, 6 error locations. TIMEOUT Result, 101.6s OverallTime, 33 OverallIterations, 17 TraceHistogramMax, 71.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1834 SDtfs, 15938 SDslu, 29690 SDs, 0 SdLazy, 58943 SolverSat, 3908 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4976 GetRequests, 2863 SyntacticMatches, 13 SemanticMatches, 2100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83817 ImplicationChecksByTransitivity, 56.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2116occurred in iteration=32, 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: 1.0s AutomataMinimizationTime, 32 MinimizatonAttempts, 12622 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 25.6s InterpolantComputationTime, 6647 NumberOfCodeBlocks, 6553 NumberOfCodeBlocksAsserted, 136 NumberOfCheckSat, 6587 ConstructedInterpolants, 2 QuantifiedInterpolants, 11959783 SizeOfPredicates, 403 NumberOfNonLiveVariables, 5270 ConjunctsInSsa, 787 ConjunctsInUnsatCore, 60 InterpolantComputations, 7 PerfectInterpolantSequences, 11985/24294 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-29_00-50-38-549.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-01-29_00-50-38-549.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-01-29_00-50-38-549.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-01-29_00-50-38-549.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_00-50-38-549.csv Completed graceful shutdown