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_true-valid-memsafety_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 09:42:23,047 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 09:42:23,049 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 09:42:23,068 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 09:42:23,068 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 09:42:23,069 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 09:42:23,070 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 09:42:23,073 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 09:42:23,075 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 09:42:23,076 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 09:42:23,078 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 09:42:23,078 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 09:42:23,079 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 09:42:23,080 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 09:42:23,090 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 09:42:23,092 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 09:42:23,096 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 09:42:23,098 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 09:42:23,099 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 09:42:23,100 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 09:42:23,103 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 09:42:23,103 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 09:42:23,103 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 09:42:23,104 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 09:42:23,105 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 09:42:23,106 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 09:42:23,106 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 09:42:23,107 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 09:42:23,107 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 09:42:23,107 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 09:42:23,108 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 09:42:23,108 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 09:42:23,124 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 09:42:23,124 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 09:42:23,125 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 09:42:23,125 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 09:42:23,125 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 09:42:23,125 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 09:42:23,125 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 09:42:23,126 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 09:42:23,126 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 09:42:23,126 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 09:42:23,126 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 09:42:23,127 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 09:42:23,127 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 09:42:23,132 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 09:42:23,132 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 09:42:23,132 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 09:42:23,132 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 09:42:23,132 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 09:42:23,133 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 09:42:23,133 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 09:42:23,133 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 09:42:23,133 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 09:42:23,133 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 09:42:23,133 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:42:23,134 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 09:42:23,134 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 09:42:23,134 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 09:42:23,134 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 09:42:23,134 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 09:42:23,134 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 09:42:23,135 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 09:42:23,135 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 09:42:23,136 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 09:42:23,136 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 09:42:23,183 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 09:42:23,198 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 09:42:23,201 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 09:42:23,202 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 09:42:23,202 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 09:42:23,203 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-01-31 09:42:23,316 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 09:42:23,326 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-31 09:42:23,327 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 09:42:23,327 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 09:42:23,334 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 09:42:23,335 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:42:23" (1/1) ... [2018-01-31 09:42:23,339 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44c0a7d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:42:23, skipping insertion in model container [2018-01-31 09:42:23,339 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:42:23" (1/1) ... [2018-01-31 09:42:23,357 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:42:23,375 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:42:23,512 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:42:23,529 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:42:23,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:42:23 WrapperNode [2018-01-31 09:42:23,537 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 09:42:23,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 09:42:23,540 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 09:42:23,540 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 09:42:23,556 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:42:23" (1/1) ... [2018-01-31 09:42:23,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:42:23" (1/1) ... [2018-01-31 09:42:23,567 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:42:23" (1/1) ... [2018-01-31 09:42:23,567 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:42:23" (1/1) ... [2018-01-31 09:42:23,572 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:42:23" (1/1) ... [2018-01-31 09:42:23,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:42:23" (1/1) ... [2018-01-31 09:42:23,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:42:23" (1/1) ... [2018-01-31 09:42:23,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 09:42:23,591 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 09:42:23,591 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 09:42:23,592 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 09:42:23,593 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:42:23" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:42:23,659 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 09:42:23,659 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 09:42:23,659 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-31 09:42:23,659 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 09:42:23,660 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 09:42:23,660 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 09:42:23,660 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 09:42:23,660 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 09:42:23,660 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 09:42:23,660 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-31 09:42:23,661 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 09:42:23,661 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 09:42:23,661 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 09:42:24,140 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 09:42:24,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:42:24 BoogieIcfgContainer [2018-01-31 09:42:24,141 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 09:42:24,141 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-31 09:42:24,141 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-31 09:42:24,144 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-31 09:42:24,146 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:42:24" (1/1) ... [2018-01-31 09:42:24,153 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-31 09:42:24,154 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-31 09:42:24,154 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-31 09:42:24,196 INFO L162 apSepIcfgTransformer]: finished StoreIndexFreezer, created 6 freeze vars and freeze var literals (each corresponds to one heap write) [2018-01-31 09:42:24,226 INFO L221 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-31 09:42:24,291 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-31 09:42:41,375 INFO L314 AbstractInterpreter]: Visited 70 different actions 513 times. Merged at 46 different actions 279 times. Widened at 2 different actions 2 times. Found 35 fixpoints after 9 different actions. Largest state had 39 variables. [2018-01-31 09:42:41,383 INFO L229 apSepIcfgTransformer]: finished equality analysis [2018-01-31 09:42:41,427 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 1 [2018-01-31 09:42:41,428 INFO L241 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-31 09:42:41,430 INFO L242 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-31 09:42:41,431 INFO L244 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-31 09:42:41,435 INFO L547 PartitionManager]: partitioning result: [2018-01-31 09:42:41,436 INFO L552 PartitionManager]: location blocks for array group [#memory_int] [2018-01-31 09:42:41,436 INFO L562 PartitionManager]: at dimension 0 [2018-01-31 09:42:41,436 INFO L563 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-31 09:42:41,436 INFO L564 PartitionManager]: # location blocks :1 [2018-01-31 09:42:41,437 INFO L562 PartitionManager]: at dimension 1 [2018-01-31 09:42:41,437 INFO L563 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-31 09:42:41,437 INFO L564 PartitionManager]: # location blocks :1 [2018-01-31 09:42:41,438 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-31 09:42:41,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 09:42:41 BasicIcfg [2018-01-31 09:42:41,461 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-31 09:42:41,465 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 09:42:41,465 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 09:42:41,468 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 09:42:41,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:42:23" (1/4) ... [2018-01-31 09:42:41,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b02b3a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:42:41, skipping insertion in model container [2018-01-31 09:42:41,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:42:23" (2/4) ... [2018-01-31 09:42:41,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b02b3a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:42:41, skipping insertion in model container [2018-01-31 09:42:41,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:42:24" (3/4) ... [2018-01-31 09:42:41,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b02b3a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:42:41, skipping insertion in model container [2018-01-31 09:42:41,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 09:42:41" (4/4) ... [2018-01-31 09:42:41,472 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-31 09:42:41,483 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 09:42:41,491 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-31 09:42:41,626 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 09:42:41,627 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 09:42:41,627 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 09:42:41,627 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 09:42:41,627 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 09:42:41,627 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 09:42:41,627 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 09:42:41,628 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 09:42:41,628 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 09:42:41,647 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-01-31 09:42:41,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-31 09:42:41,653 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:42:41,654 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:42:41,654 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:42:41,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1068910584, now seen corresponding path program 1 times [2018-01-31 09:42:41,662 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:42:41,663 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:42:41,709 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:41,709 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:42:41,709 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:42:41,760 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:42:41,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:42:41,875 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:42:41,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 09:42:41,877 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 09:42:41,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 09:42:41,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:42:41,887 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 3 states. [2018-01-31 09:42:42,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:42:42,066 INFO L93 Difference]: Finished difference Result 133 states and 160 transitions. [2018-01-31 09:42:42,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 09:42:42,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-01-31 09:42:42,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:42:42,083 INFO L225 Difference]: With dead ends: 133 [2018-01-31 09:42:42,083 INFO L226 Difference]: Without dead ends: 78 [2018-01-31 09:42:42,087 INFO L554 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-31 09:42:42,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-31 09:42:42,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2018-01-31 09:42:42,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-31 09:42:42,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-01-31 09:42:42,131 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 9 [2018-01-31 09:42:42,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:42:42,131 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-01-31 09:42:42,132 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 09:42:42,132 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-01-31 09:42:42,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-31 09:42:42,134 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:42:42,134 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:42:42,134 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:42:42,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1115648547, now seen corresponding path program 1 times [2018-01-31 09:42:42,134 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:42:42,135 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:42:42,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:42,136 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:42:42,136 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:42:42,150 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:42:42,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:42:42,499 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:42:42,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:42:42,501 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 09:42:42,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 09:42:42,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:42:42,503 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 7 states. [2018-01-31 09:42:42,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:42:42,858 INFO L93 Difference]: Finished difference Result 172 states and 188 transitions. [2018-01-31 09:42:42,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:42:42,859 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-01-31 09:42:42,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:42:42,864 INFO L225 Difference]: With dead ends: 172 [2018-01-31 09:42:42,864 INFO L226 Difference]: Without dead ends: 121 [2018-01-31 09:42:42,865 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:42:42,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-31 09:42:42,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 88. [2018-01-31 09:42:42,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-31 09:42:42,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2018-01-31 09:42:42,879 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 18 [2018-01-31 09:42:42,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:42:42,879 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2018-01-31 09:42:42,879 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 09:42:42,879 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2018-01-31 09:42:42,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-31 09:42:42,881 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:42:42,881 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:42:42,882 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:42:42,882 INFO L82 PathProgramCache]: Analyzing trace with hash -225366126, now seen corresponding path program 1 times [2018-01-31 09:42:42,882 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:42:42,882 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:42:42,883 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:42,883 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:42:42,883 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:42:42,892 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:42:42,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:42:42,973 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:42:42,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:42:42,977 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:42:42,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:42:42,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:42:42,978 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand 5 states. [2018-01-31 09:42:43,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:42:43,075 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2018-01-31 09:42:43,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 09:42:43,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-31 09:42:43,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:42:43,076 INFO L225 Difference]: With dead ends: 88 [2018-01-31 09:42:43,077 INFO L226 Difference]: Without dead ends: 87 [2018-01-31 09:42:43,077 INFO L554 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-31 09:42:43,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-31 09:42:43,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-01-31 09:42:43,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-31 09:42:43,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2018-01-31 09:42:43,087 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 19 [2018-01-31 09:42:43,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:42:43,088 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2018-01-31 09:42:43,088 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:42:43,088 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2018-01-31 09:42:43,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-31 09:42:43,089 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:42:43,089 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:42:43,089 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:42:43,089 INFO L82 PathProgramCache]: Analyzing trace with hash -225366124, now seen corresponding path program 1 times [2018-01-31 09:42:43,089 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:42:43,089 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:42:43,090 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:43,091 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:42:43,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:42:43,102 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:42:43,647 WARN L146 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 17 DAG size of output 12 [2018-01-31 09:42:43,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:42:43,650 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:42:43,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:42:43,650 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:42:43,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:42:43,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:42:43,651 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand 6 states. [2018-01-31 09:42:44,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:42:44,054 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2018-01-31 09:42:44,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:42:44,055 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-31 09:42:44,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:42:44,056 INFO L225 Difference]: With dead ends: 101 [2018-01-31 09:42:44,056 INFO L226 Difference]: Without dead ends: 100 [2018-01-31 09:42:44,056 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:42:44,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-31 09:42:44,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2018-01-31 09:42:44,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-31 09:42:44,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2018-01-31 09:42:44,072 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 19 [2018-01-31 09:42:44,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:42:44,072 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2018-01-31 09:42:44,072 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:42:44,072 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-01-31 09:42:44,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-31 09:42:44,073 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:42:44,073 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:42:44,074 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:42:44,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1537306562, now seen corresponding path program 1 times [2018-01-31 09:42:44,074 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:42:44,074 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:42:44,075 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:44,075 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:42:44,075 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:42:44,082 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:42:44,181 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-31 09:42:44,181 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:42:44,181 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:42:44,197 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:42:44,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:42:44,217 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:42:44,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:42:44,291 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 09:42:44,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2018-01-31 09:42:44,292 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 09:42:44,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 09:42:44,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:42:44,293 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 8 states. [2018-01-31 09:42:44,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:42:44,431 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2018-01-31 09:42:44,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 09:42:44,432 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-31 09:42:44,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:42:44,433 INFO L225 Difference]: With dead ends: 127 [2018-01-31 09:42:44,433 INFO L226 Difference]: Without dead ends: 106 [2018-01-31 09:42:44,433 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-01-31 09:42:44,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-31 09:42:44,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 96. [2018-01-31 09:42:44,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-31 09:42:44,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2018-01-31 09:42:44,443 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 19 [2018-01-31 09:42:44,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:42:44,444 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2018-01-31 09:42:44,444 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 09:42:44,444 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2018-01-31 09:42:44,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-31 09:42:44,445 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:42:44,445 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:42:44,445 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:42:44,445 INFO L82 PathProgramCache]: Analyzing trace with hash 184823418, now seen corresponding path program 1 times [2018-01-31 09:42:44,445 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:42:44,446 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:42:44,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:44,446 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:42:44,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:42:44,462 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:42:44,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:42:44,564 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:42:44,564 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-31 09:42:44,570 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:42:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:42:44,583 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:42:44,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:42:44,889 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 09:42:44,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2018-01-31 09:42:44,889 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-31 09:42:44,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-31 09:42:44,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-01-31 09:42:44,890 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 14 states. [2018-01-31 09:42:45,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:42:45,408 INFO L93 Difference]: Finished difference Result 175 states and 191 transitions. [2018-01-31 09:42:45,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 09:42:45,409 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2018-01-31 09:42:45,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:42:45,409 INFO L225 Difference]: With dead ends: 175 [2018-01-31 09:42:45,410 INFO L226 Difference]: Without dead ends: 102 [2018-01-31 09:42:45,410 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-01-31 09:42:45,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-31 09:42:45,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 94. [2018-01-31 09:42:45,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-31 09:42:45,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2018-01-31 09:42:45,426 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 27 [2018-01-31 09:42:45,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:42:45,426 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2018-01-31 09:42:45,426 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-31 09:42:45,426 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2018-01-31 09:42:45,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-31 09:42:45,428 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:42:45,429 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:42:45,429 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:42:45,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1232886480, now seen corresponding path program 1 times [2018-01-31 09:42:45,430 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:42:45,430 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:42:45,431 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:45,431 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:42:45,431 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:42:45,447 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:42:45,548 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-31 09:42:45,548 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:42:45,548 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-31 09:42:45,554 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:42:45,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:42:45,567 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:42:45,577 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-31 09:42:45,608 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:42:45,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-01-31 09:42:45,608 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:42:45,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:42:45,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:42:45,609 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand 5 states. [2018-01-31 09:42:45,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:42:45,665 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2018-01-31 09:42:45,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:42:45,665 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-01-31 09:42:45,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:42:45,666 INFO L225 Difference]: With dead ends: 115 [2018-01-31 09:42:45,666 INFO L226 Difference]: Without dead ends: 114 [2018-01-31 09:42:45,667 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 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-31 09:42:45,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-31 09:42:45,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2018-01-31 09:42:45,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-31 09:42:45,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2018-01-31 09:42:45,676 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 37 [2018-01-31 09:42:45,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:42:45,676 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2018-01-31 09:42:45,677 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:42:45,677 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2018-01-31 09:42:45,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-31 09:42:45,678 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:42:45,678 INFO L351 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-31 09:42:45,678 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:42:45,679 INFO L82 PathProgramCache]: Analyzing trace with hash 729468996, now seen corresponding path program 1 times [2018-01-31 09:42:45,679 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:42:45,679 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:42:45,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:45,680 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:42:45,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:42:45,691 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:42:45,848 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-31 09:42:45,848 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:42:45,848 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-31 09:42:45,854 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:42:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:42:45,877 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:42:45,964 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-31 09:42:45,983 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:42:45,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-01-31 09:42:45,988 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 09:42:45,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 09:42:45,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:42:45,989 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 9 states. [2018-01-31 09:42:46,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:42:46,132 INFO L93 Difference]: Finished difference Result 147 states and 161 transitions. [2018-01-31 09:42:46,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 09:42:46,132 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-01-31 09:42:46,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:42:46,133 INFO L225 Difference]: With dead ends: 147 [2018-01-31 09:42:46,133 INFO L226 Difference]: Without dead ends: 127 [2018-01-31 09:42:46,133 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-01-31 09:42:46,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-31 09:42:46,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 112. [2018-01-31 09:42:46,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-31 09:42:46,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2018-01-31 09:42:46,147 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 37 [2018-01-31 09:42:46,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:42:46,147 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2018-01-31 09:42:46,147 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 09:42:46,148 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2018-01-31 09:42:46,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-31 09:42:46,150 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:42:46,150 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2018-01-31 09:42:46,150 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:42:46,151 INFO L82 PathProgramCache]: Analyzing trace with hash 435225249, now seen corresponding path program 1 times [2018-01-31 09:42:46,151 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:42:46,151 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:42:46,152 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:46,152 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:42:46,152 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:46,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:42:46,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:42:46,428 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-31 09:42:46,429 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:42:46,469 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-31 09:42:46,474 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:42:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:42:46,504 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:42:46,543 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-31 09:42:46,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:42:46,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:42:46,591 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 09:42:46,660 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-31 09:42:46,680 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:42:46,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-01-31 09:42:46,680 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 09:42:46,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 09:42:46,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:42:46,681 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand 9 states. [2018-01-31 09:42:46,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:42:46,845 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2018-01-31 09:42:46,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 09:42:46,846 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-01-31 09:42:46,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:42:46,847 INFO L225 Difference]: With dead ends: 124 [2018-01-31 09:42:46,847 INFO L226 Difference]: Without dead ends: 123 [2018-01-31 09:42:46,848 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 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-31 09:42:46,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-31 09:42:46,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 113. [2018-01-31 09:42:46,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-31 09:42:46,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 123 transitions. [2018-01-31 09:42:46,858 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 123 transitions. Word has length 38 [2018-01-31 09:42:46,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:42:46,858 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 123 transitions. [2018-01-31 09:42:46,858 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 09:42:46,858 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 123 transitions. [2018-01-31 09:42:46,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-31 09:42:46,860 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:42:46,860 INFO L351 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-31 09:42:46,860 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:42:46,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1381672071, now seen corresponding path program 2 times [2018-01-31 09:42:46,861 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:42:46,861 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:42:46,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:46,862 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:42:46,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:42:46,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:42:47,138 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:42:47,138 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:42:47,138 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-31 09:42:47,144 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:42:47,152 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:42:47,156 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:42:47,157 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:42:47,160 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:42:47,265 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 09:42:47,285 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:42:47,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2018-01-31 09:42:47,286 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-31 09:42:47,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-31 09:42:47,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2018-01-31 09:42:47,286 INFO L87 Difference]: Start difference. First operand 113 states and 123 transitions. Second operand 19 states. [2018-01-31 09:42:47,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:42:47,685 INFO L93 Difference]: Finished difference Result 225 states and 244 transitions. [2018-01-31 09:42:47,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-31 09:42:47,686 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 46 [2018-01-31 09:42:47,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:42:47,687 INFO L225 Difference]: With dead ends: 225 [2018-01-31 09:42:47,687 INFO L226 Difference]: Without dead ends: 155 [2018-01-31 09:42:47,688 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=759, Unknown=0, NotChecked=0, Total=930 [2018-01-31 09:42:47,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-01-31 09:42:47,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 141. [2018-01-31 09:42:47,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-01-31 09:42:47,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2018-01-31 09:42:47,698 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 46 [2018-01-31 09:42:47,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:42:47,698 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2018-01-31 09:42:47,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-31 09:42:47,698 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2018-01-31 09:42:47,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-31 09:42:47,700 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:42:47,700 INFO L351 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-31 09:42:47,700 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:42:47,701 INFO L82 PathProgramCache]: Analyzing trace with hash 154524538, now seen corresponding path program 2 times [2018-01-31 09:42:47,701 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:42:47,701 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:42:47,702 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:47,702 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:42:47,702 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:42:47,710 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:42:47,789 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-31 09:42:47,789 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:42:47,789 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-31 09:42:47,796 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:42:47,803 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:42:47,803 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:42:47,805 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:42:47,886 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-31 09:42:47,919 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 09:42:47,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2018-01-31 09:42:47,920 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-31 09:42:47,920 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-31 09:42:47,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=100, Unknown=1, NotChecked=0, Total=132 [2018-01-31 09:42:47,921 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand 12 states. [2018-01-31 09:42:48,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:42:48,409 INFO L93 Difference]: Finished difference Result 184 states and 203 transitions. [2018-01-31 09:42:48,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-31 09:42:48,409 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-01-31 09:42:48,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:42:48,410 INFO L225 Difference]: With dead ends: 184 [2018-01-31 09:42:48,411 INFO L226 Difference]: Without dead ends: 153 [2018-01-31 09:42:48,411 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=363, Unknown=1, NotChecked=0, Total=506 [2018-01-31 09:42:48,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-01-31 09:42:48,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 143. [2018-01-31 09:42:48,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-31 09:42:48,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 155 transitions. [2018-01-31 09:42:48,424 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 155 transitions. Word has length 47 [2018-01-31 09:42:48,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:42:48,424 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 155 transitions. [2018-01-31 09:42:48,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-31 09:42:48,425 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 155 transitions. [2018-01-31 09:42:48,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-31 09:42:48,427 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:42:48,427 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:42:48,427 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:42:48,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1717163537, now seen corresponding path program 3 times [2018-01-31 09:42:48,427 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:42:48,427 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:42:48,428 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:48,428 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:42:48,429 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:42:48,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:42:48,520 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-31 09:42:48,520 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:42:48,520 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-31 09:42:48,526 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 09:42:48,535 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:42:48,543 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 09:42:48,543 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:42:48,546 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:42:48,692 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-31 09:42:48,712 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:42:48,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 15 [2018-01-31 09:42:48,712 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-31 09:42:48,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-31 09:42:48,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-01-31 09:42:48,713 INFO L87 Difference]: Start difference. First operand 143 states and 155 transitions. Second operand 16 states. [2018-01-31 09:42:49,022 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 19 DAG size of output 18 [2018-01-31 09:42:49,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:42:49,321 INFO L93 Difference]: Finished difference Result 172 states and 189 transitions. [2018-01-31 09:42:49,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-31 09:42:49,321 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2018-01-31 09:42:49,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:42:49,322 INFO L225 Difference]: With dead ends: 172 [2018-01-31 09:42:49,322 INFO L226 Difference]: Without dead ends: 171 [2018-01-31 09:42:49,323 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2018-01-31 09:42:49,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-01-31 09:42:49,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 142. [2018-01-31 09:42:49,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-31 09:42:49,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 154 transitions. [2018-01-31 09:42:49,336 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 154 transitions. Word has length 56 [2018-01-31 09:42:49,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:42:49,336 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 154 transitions. [2018-01-31 09:42:49,337 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-31 09:42:49,337 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 154 transitions. [2018-01-31 09:42:49,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-31 09:42:49,338 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:42:49,338 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:42:49,338 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:42:49,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1692462560, now seen corresponding path program 2 times [2018-01-31 09:42:49,338 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:42:49,338 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:42:49,339 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:49,339 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:42:49,340 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:49,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:42:49,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:42:49,711 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-31 09:42:49,712 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:42:49,712 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-31 09:42:49,721 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:42:49,731 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:42:49,740 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:42:49,742 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:42:49,745 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:42:49,756 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-31 09:42:49,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 09:42:49,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 09:42:49,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 09:42:49,939 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-31 09:42:49,958 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:42:49,959 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2018-01-31 09:42:49,959 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-31 09:42:49,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-31 09:42:49,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2018-01-31 09:42:49,959 INFO L87 Difference]: Start difference. First operand 142 states and 154 transitions. Second operand 20 states. [2018-01-31 09:42:50,257 WARN L143 SmtUtils]: Spent 147ms on a formula simplification that was a NOOP. DAG size: 14 [2018-01-31 09:42:51,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:42:51,205 INFO L93 Difference]: Finished difference Result 170 states and 187 transitions. [2018-01-31 09:42:51,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-31 09:42:51,205 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 57 [2018-01-31 09:42:51,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:42:51,206 INFO L225 Difference]: With dead ends: 170 [2018-01-31 09:42:51,206 INFO L226 Difference]: Without dead ends: 169 [2018-01-31 09:42:51,207 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=254, Invalid=1006, Unknown=0, NotChecked=0, Total=1260 [2018-01-31 09:42:51,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-01-31 09:42:51,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 128. [2018-01-31 09:42:51,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-01-31 09:42:51,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-01-31 09:42:51,217 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 57 [2018-01-31 09:42:51,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:42:51,218 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-01-31 09:42:51,218 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-31 09:42:51,218 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-01-31 09:42:51,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-31 09:42:51,219 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:42:51,219 INFO L351 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-31 09:42:51,219 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:42:51,219 INFO L82 PathProgramCache]: Analyzing trace with hash 245732012, now seen corresponding path program 1 times [2018-01-31 09:42:51,219 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:42:51,219 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:42:51,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:51,220 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:42:51,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:42:51,234 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:42:51,300 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-31 09:42:51,300 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:42:51,301 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-31 09:42:51,312 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:42:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:42:51,324 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:42:51,394 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-31 09:42:51,414 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:42:51,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11] total 15 [2018-01-31 09:42:51,414 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-31 09:42:51,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-31 09:42:51,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-01-31 09:42:51,415 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 15 states. [2018-01-31 09:42:51,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:42:51,636 INFO L93 Difference]: Finished difference Result 167 states and 183 transitions. [2018-01-31 09:42:51,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-31 09:42:51,675 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2018-01-31 09:42:51,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:42:51,676 INFO L225 Difference]: With dead ends: 167 [2018-01-31 09:42:51,676 INFO L226 Difference]: Without dead ends: 155 [2018-01-31 09:42:51,676 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2018-01-31 09:42:51,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-01-31 09:42:51,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 145. [2018-01-31 09:42:51,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-01-31 09:42:51,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 157 transitions. [2018-01-31 09:42:51,692 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 157 transitions. Word has length 59 [2018-01-31 09:42:51,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:42:51,692 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 157 transitions. [2018-01-31 09:42:51,692 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-31 09:42:51,692 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 157 transitions. [2018-01-31 09:42:51,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-01-31 09:42:51,694 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:42:51,694 INFO L351 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-31 09:42:51,694 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-31 09:42:51,694 INFO L82 PathProgramCache]: Analyzing trace with hash -337153039, now seen corresponding path program 2 times [2018-01-31 09:42:51,694 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:42:51,694 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:42:51,695 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:51,695 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:42:51,695 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:42:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:42:51,716 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:42:51,835 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-31 09:42:51,836 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:42:51,836 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-31 09:42:51,843 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:42:51,849 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:42:51,857 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:42:51,858 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:42:51,859 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:42:51,959 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-31 09:42:51,979 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:42:51,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13] total 19 [2018-01-31 09:42:51,980 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-31 09:42:51,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-31 09:42:51,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2018-01-31 09:42:51,980 INFO L87 Difference]: Start difference. First operand 145 states and 157 transitions. Second operand 19 states. [2018-01-31 09:42:52,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:42:52,586 INFO L93 Difference]: Finished difference Result 183 states and 201 transitions. [2018-01-31 09:42:52,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-31 09:42:52,587 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 76 [2018-01-31 09:42:52,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:42:52,587 INFO L225 Difference]: With dead ends: 183 [2018-01-31 09:42:52,587 INFO L226 Difference]: Without dead ends: 0 [2018-01-31 09:42:52,589 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=250, Invalid=940, Unknown=0, NotChecked=0, Total=1190 [2018-01-31 09:42:52,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-31 09:42:52,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-31 09:42:52,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-31 09:42:52,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-31 09:42:52,590 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2018-01-31 09:42:52,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:42:52,590 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-31 09:42:52,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-31 09:42:52,590 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-31 09:42:52,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-31 09:42:52,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-31 09:42:52,619 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-31 09:42:52,638 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-31 09:42:52,644 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-31 09:42:52,995 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 36 DAG size of output 24 [2018-01-31 09:42:53,501 WARN L146 SmtUtils]: Spent 396ms on a formula simplification. DAG size of input: 75 DAG size of output 54 [2018-01-31 09:42:53,549 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 37) no Hoare annotation was computed. [2018-01-31 09:42:53,550 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 37) no Hoare annotation was computed. [2018-01-31 09:42:53,550 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 37) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-31 09:42:53,550 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 37) no Hoare annotation was computed. [2018-01-31 09:42:53,550 INFO L399 ceAbstractionStarter]: For program point fooFINAL(lines 14 21) no Hoare annotation was computed. [2018-01-31 09:42:53,550 INFO L399 ceAbstractionStarter]: For program point L17''''(line 17) no Hoare annotation was computed. [2018-01-31 09:42:53,550 INFO L399 ceAbstractionStarter]: For program point fooEXIT(lines 14 21) no Hoare annotation was computed. [2018-01-31 09:42:53,550 INFO L399 ceAbstractionStarter]: For program point L18'''(line 18) no Hoare annotation was computed. [2018-01-31 09:42:53,551 INFO L399 ceAbstractionStarter]: For program point L17'''''(line 17) no Hoare annotation was computed. [2018-01-31 09:42:53,551 INFO L399 ceAbstractionStarter]: For program point L17'''(lines 17 19) no Hoare annotation was computed. [2018-01-31 09:42:53,551 INFO L402 ceAbstractionStarter]: At program point fooENTRY(lines 14 21) the Hoare annotation is: true [2018-01-31 09:42:53,551 INFO L399 ceAbstractionStarter]: For program point L17'''''''(lines 17 19) no Hoare annotation was computed. [2018-01-31 09:42:53,551 INFO L399 ceAbstractionStarter]: For program point fooErr2RequiresViolation(lines 1 37) no Hoare annotation was computed. [2018-01-31 09:42:53,551 INFO L399 ceAbstractionStarter]: For program point L14(lines 14 21) no Hoare annotation was computed. [2018-01-31 09:42:53,551 INFO L399 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2018-01-31 09:42:53,551 INFO L399 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-01-31 09:42:53,551 INFO L399 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2018-01-31 09:42:53,551 INFO L399 ceAbstractionStarter]: For program point fooErr1RequiresViolation(lines 1 37) no Hoare annotation was computed. [2018-01-31 09:42:53,552 INFO L399 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-01-31 09:42:53,552 INFO L395 ceAbstractionStarter]: At program point L17''''''(lines 17 19) the Hoare annotation is: (let ((.cse1 (not (= (select |#valid| |foo_#in~b.base|) 1))) (.cse2 (< 0 |foo_#in~b.offset|)) (.cse3 (< |foo_#in~b.offset| 0)) (.cse5 (= foo_~i~1 0)) (.cse4 (not (= 32 (select |#length| |foo_#in~b.base|))))) (and (let ((.cse0 (= foo_~size 0))) (or (and .cse0 (= 1 foo_~i~1)) .cse1 (not (= 0 |foo_#in~size|)) .cse2 .cse3 .cse4 (and .cse0 .cse5))) (or .cse1 .cse2 .cse3 (< 1 |foo_#in~size|) (and (<= foo_~size 1) (<= foo_~i~1 2)) .cse4) (let ((.cse8 (= 1 (select |#valid| foo_~b.base))) (.cse9 (<= 0 foo_~b.offset)) (.cse7 (select |#length| foo_~b.base)) (.cse6 (<= foo_~b.offset 0)) (.cse10 (<= foo_~size 31))) (or .cse1 .cse2 .cse3 (and .cse6 (= 32 .cse7) .cse8 .cse9 .cse10 .cse5) .cse4 (and .cse8 .cse9 (= .cse7 32) .cse6 .cse10 (<= 1 foo_~i~1)) (< 31 (+ |foo_#in~b.offset| |foo_#in~size|)))))) [2018-01-31 09:42:53,552 INFO L399 ceAbstractionStarter]: For program point L18''(line 18) no Hoare annotation was computed. [2018-01-31 09:42:53,552 INFO L399 ceAbstractionStarter]: For program point L17'(lines 17 19) no Hoare annotation was computed. [2018-01-31 09:42:53,552 INFO L399 ceAbstractionStarter]: For program point L18'(line 18) no Hoare annotation was computed. [2018-01-31 09:42:53,552 INFO L399 ceAbstractionStarter]: For program point fooErr0AssertViolation(line 18) no Hoare annotation was computed. [2018-01-31 09:42:53,552 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 37) the Hoare annotation is: true [2018-01-31 09:42:53,553 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 37) no Hoare annotation was computed. [2018-01-31 09:42:53,553 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 37) the Hoare annotation is: true [2018-01-31 09:42:53,553 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 37) no Hoare annotation was computed. [2018-01-31 09:42:53,553 INFO L399 ceAbstractionStarter]: For program point L25'''''(line 25) no Hoare annotation was computed. [2018-01-31 09:42:53,553 INFO L399 ceAbstractionStarter]: For program point mainErr0AssertViolation(line 27) no Hoare annotation was computed. [2018-01-31 09:42:53,554 INFO L399 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 23 35) no Hoare annotation was computed. [2018-01-31 09:42:53,554 INFO L399 ceAbstractionStarter]: For program point mainErr1AssertViolation(line 30) no Hoare annotation was computed. [2018-01-31 09:42:53,554 INFO L399 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-01-31 09:42:53,554 INFO L399 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-01-31 09:42:53,554 INFO L399 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-01-31 09:42:53,554 INFO L399 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. [2018-01-31 09:42:53,554 INFO L399 ceAbstractionStarter]: For program point L26''''''(lines 26 28) no Hoare annotation was computed. [2018-01-31 09:42:53,554 INFO L399 ceAbstractionStarter]: For program point L25'''(line 25) no Hoare annotation was computed. [2018-01-31 09:42:53,554 INFO L399 ceAbstractionStarter]: For program point L29(lines 29 33) no Hoare annotation was computed. [2018-01-31 09:42:53,554 INFO L399 ceAbstractionStarter]: For program point L27''''(line 27) no Hoare annotation was computed. [2018-01-31 09:42:53,555 INFO L395 ceAbstractionStarter]: At program point L27'(line 27) the Hoare annotation is: (let ((.cse0 (= 32 (select |#length| |main_~#mask~3.base|))) (.cse1 (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|)) (.cse2 (<= 0 |main_~#mask~3.offset|)) (.cse3 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse4 (<= |main_~#mask~3.offset| 0))) (or (and .cse0 .cse1 (= 0 main_~i~3) .cse2 .cse3 .cse4) (and (<= 1 main_~i~3) .cse0 .cse1 .cse2 .cse3 .cse4 (<= main_~i~3 31)))) [2018-01-31 09:42:53,555 INFO L399 ceAbstractionStarter]: For program point L25'(line 25) no Hoare annotation was computed. [2018-01-31 09:42:53,555 INFO L399 ceAbstractionStarter]: For program point L27'''(line 27) no Hoare annotation was computed. [2018-01-31 09:42:53,555 INFO L399 ceAbstractionStarter]: For program point L29'''(line 29) no Hoare annotation was computed. [2018-01-31 09:42:53,555 INFO L399 ceAbstractionStarter]: For program point L29''''''(lines 29 33) no Hoare annotation was computed. [2018-01-31 09:42:53,555 INFO L399 ceAbstractionStarter]: For program point L25''''(line 25) no Hoare annotation was computed. [2018-01-31 09:42:53,555 INFO L399 ceAbstractionStarter]: For program point L26''''(line 26) no Hoare annotation was computed. [2018-01-31 09:42:53,555 INFO L399 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-01-31 09:42:53,555 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 23 35) no Hoare annotation was computed. [2018-01-31 09:42:53,556 INFO L399 ceAbstractionStarter]: For program point L25''(line 25) no Hoare annotation was computed. [2018-01-31 09:42:53,556 INFO L399 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-01-31 09:42:53,556 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 23 35) no Hoare annotation was computed. [2018-01-31 09:42:53,556 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 23 35) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-31 09:42:53,556 INFO L399 ceAbstractionStarter]: For program point L29''''(line 29) no Hoare annotation was computed. [2018-01-31 09:42:53,556 INFO L399 ceAbstractionStarter]: For program point L29''(lines 29 33) no Hoare annotation was computed. [2018-01-31 09:42:53,556 INFO L399 ceAbstractionStarter]: For program point L26''(lines 26 28) no Hoare annotation was computed. [2018-01-31 09:42:53,556 INFO L399 ceAbstractionStarter]: For program point L27''(line 27) no Hoare annotation was computed. [2018-01-31 09:42:53,556 INFO L395 ceAbstractionStarter]: At program point L26'''''(lines 26 28) the Hoare annotation is: (let ((.cse0 (= 32 (select |#length| |main_~#mask~3.base|))) (.cse1 (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|)) (.cse2 (<= 0 |main_~#mask~3.offset|)) (.cse3 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse4 (<= |main_~#mask~3.offset| 0))) (or (and (<= 1 main_~i~3) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 (= main_~i~3 0) .cse3 .cse4))) [2018-01-31 09:42:53,556 INFO L395 ceAbstractionStarter]: At program point L29'''''(lines 29 33) the Hoare annotation is: (let ((.cse0 (= 32 (select |#length| |main_~#mask~3.base|))) (.cse1 (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|)) (.cse2 (<= 0 |main_~#mask~3.offset|)) (.cse3 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse4 (<= |main_~#mask~3.offset| 0))) (or (and (<= 1 main_~i~3) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 (= main_~i~3 0) .cse3 .cse4))) [2018-01-31 09:42:53,556 INFO L399 ceAbstractionStarter]: For program point L30'(lines 30 32) no Hoare annotation was computed. [2018-01-31 09:42:53,557 INFO L399 ceAbstractionStarter]: For program point L26'''(line 26) no Hoare annotation was computed. [2018-01-31 09:42:53,561 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:42:53,562 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:42:53,565 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:42:53,565 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:42:53,569 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:42:53,570 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:42:53,570 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:42:53,570 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:42:53,570 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:42:53,573 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:42:53,573 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:42:53,573 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:42:53,574 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:42:53,574 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:42:53,578 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:42:53,579 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:42:53,580 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:42:53,580 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:42:53,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:42:53 BasicIcfg [2018-01-31 09:42:53,582 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 09:42:53,583 INFO L168 Benchmark]: Toolchain (without parser) took 30265.90 ms. Allocated memory was 300.4 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 261.1 MB in the beginning and 888.5 MB in the end (delta: -627.3 MB). Peak memory consumption was 640.4 MB. Max. memory is 5.3 GB. [2018-01-31 09:42:53,587 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 300.4 MB. Free memory is still 265.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:42:53,588 INFO L168 Benchmark]: CACSL2BoogieTranslator took 210.78 ms. Allocated memory is still 300.4 MB. Free memory was 259.1 MB in the beginning and 251.2 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:42:53,588 INFO L168 Benchmark]: Boogie Preprocessor took 53.02 ms. Allocated memory is still 300.4 MB. Free memory was 251.2 MB in the beginning and 249.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:42:53,588 INFO L168 Benchmark]: RCFGBuilder took 549.59 ms. Allocated memory is still 300.4 MB. Free memory was 249.2 MB in the beginning and 232.2 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:42:53,589 INFO L168 Benchmark]: IcfgTransformer took 17320.50 ms. Allocated memory was 300.4 MB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Free memory was 232.2 MB in the beginning and 843.8 MB in the end (delta: -611.6 MB). Peak memory consumption was 418.1 MB. Max. memory is 5.3 GB. [2018-01-31 09:42:53,589 INFO L168 Benchmark]: TraceAbstraction took 12117.03 ms. Allocated memory was 1.3 GB in the beginning and 1.6 GB in the end (delta: 238.0 MB). Free memory was 843.8 MB in the beginning and 888.5 MB in the end (delta: -44.7 MB). Peak memory consumption was 193.3 MB. Max. memory is 5.3 GB. [2018-01-31 09:42:53,591 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 300.4 MB. Free memory is still 265.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 210.78 ms. Allocated memory is still 300.4 MB. Free memory was 259.1 MB in the beginning and 251.2 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 53.02 ms. Allocated memory is still 300.4 MB. Free memory was 251.2 MB in the beginning and 249.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 549.59 ms. Allocated memory is still 300.4 MB. Free memory was 249.2 MB in the beginning and 232.2 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * IcfgTransformer took 17320.50 ms. Allocated memory was 300.4 MB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Free memory was 232.2 MB in the beginning and 843.8 MB in the end (delta: -611.6 MB). Peak memory consumption was 418.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 12117.03 ms. Allocated memory was 1.3 GB in the beginning and 1.6 GB in the end (delta: 238.0 MB). Free memory was 843.8 MB in the beginning and 888.5 MB in the end (delta: -44.7 MB). Peak memory consumption was 193.3 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 : 1006 LocStat_NO_SUPPORTING_DISEQUALITIES : 461 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 : 102 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 80 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.826314 RENAME_VARIABLES(MILLISECONDS) : 0.248368 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.788844 PROJECTAWAY(MILLISECONDS) : 0.428014 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.087622 DISJOIN(MILLISECONDS) : 0.384627 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.278710 ADD_EQUALITY(MILLISECONDS) : 0.025008 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.025176 #CONJOIN_DISJUNCTIVE : 789 #RENAME_VARIABLES : 1740 #UNFREEZE : 0 #CONJOIN : 1080 #PROJECTAWAY : 1013 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 207 #RENAME_VARIABLES_DISJUNCTIVE : 1719 #ADD_EQUALITY : 102 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int] : 1 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 23]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 30]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 26]: Loop Invariant [2018-01-31 09:42:53,596 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:42:53,596 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:42:53,597 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:42:53,598 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((1 <= i && 32 == unknown-#length-unknown[mask]) && \old(\valid)[mask := 1] == \valid) && 0 <= mask) && 0 == \old(\valid)[mask]) && mask <= 0) || (((((32 == unknown-#length-unknown[mask] && \old(\valid)[mask := 1] == \valid) && 0 <= mask) && i == 0) && 0 == \old(\valid)[mask]) && mask <= 0) - InvariantResult [Line: 17]: Loop Invariant [2018-01-31 09:42:53,601 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:42:53,601 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:42:53,601 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:42:53,601 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:42:53,602 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:42:53,604 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:42:53,604 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:42:53,604 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:42:53,604 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:42:53,604 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((size == 0 && 1 == i) || !(\valid[b] == 1)) || !(0 == \old(size))) || 0 < b) || b < 0) || !(32 == unknown-#length-unknown[b])) || (size == 0 && i == 0)) && (((((!(\valid[b] == 1) || 0 < b) || b < 0) || 1 < \old(size)) || (size <= 1 && i <= 2)) || !(32 == unknown-#length-unknown[b]))) && ((((((!(\valid[b] == 1) || 0 < b) || b < 0) || (((((b <= 0 && 32 == unknown-#length-unknown[b]) && 1 == \valid[b]) && 0 <= b) && size <= 31) && i == 0)) || !(32 == unknown-#length-unknown[b])) || (((((1 == \valid[b] && 0 <= b) && unknown-#length-unknown[b] == 32) && b <= 0) && size <= 31) && 1 <= i)) || 31 < b + \old(size)) - InvariantResult [Line: 29]: Loop Invariant [2018-01-31 09:42:53,605 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:42:53,606 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:42:53,607 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 09:42:53,607 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((1 <= i && 32 == unknown-#length-unknown[mask]) && \old(\valid)[mask := 1] == \valid) && 0 <= mask) && 0 == \old(\valid)[mask]) && mask <= 0) || (((((32 == unknown-#length-unknown[mask] && \old(\valid)[mask := 1] == \valid) && 0 <= mask) && i == 0) && 0 == \old(\valid)[mask]) && mask <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 61 locations, 6 error locations. SAFE Result, 11.9s OverallTime, 15 OverallIterations, 6 TraceHistogramMax, 5.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 781 SDtfs, 1347 SDslu, 4065 SDs, 0 SdLazy, 2266 SolverSat, 183 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 693 GetRequests, 444 SyntacticMatches, 7 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 829 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 217 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 29 PreInvPairs, 51 NumberOfFragments, 316 HoareAnnotationTreeSize, 29 FomulaSimplifications, 1365 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 9 FomulaSimplificationsInter, 1171 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1063 NumberOfCodeBlocks, 1014 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1037 ConstructedInterpolants, 2 QuantifiedInterpolants, 240190 SizeOfPredicates, 60 NumberOfNonLiveVariables, 790 ConjunctsInSsa, 115 ConjunctsInUnsatCore, 26 InterpolantComputations, 7 PerfectInterpolantSequences, 352/704 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-31_09-42-53-612.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-01-31_09-42-53-612.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-01-31_09-42-53-612.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-01-31_09-42-53-612.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_09-42-53-612.csv Received shutdown request...