java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 02:34:20,606 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 02:34:20,608 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 02:34:20,621 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 02:34:20,622 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 02:34:20,623 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 02:34:20,624 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 02:34:20,626 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 02:34:20,628 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 02:34:20,629 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 02:34:20,630 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 02:34:20,630 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 02:34:20,631 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 02:34:20,633 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 02:34:20,634 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 02:34:20,636 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 02:34:20,639 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 02:34:20,641 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 02:34:20,642 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 02:34:20,644 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 02:34:20,646 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 02:34:20,646 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 02:34:20,647 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 02:34:20,648 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 02:34:20,649 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 02:34:20,650 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 02:34:20,650 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 02:34:20,651 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 02:34:20,651 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 02:34:20,652 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 02:34:20,653 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 02:34:20,654 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 02:34:20,664 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 02:34:20,665 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 02:34:20,665 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 02:34:20,666 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 02:34:20,666 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 02:34:20,666 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 02:34:20,666 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 02:34:20,667 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 02:34:20,667 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 02:34:20,668 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 02:34:20,668 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 02:34:20,668 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 02:34:20,668 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 02:34:20,668 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 02:34:20,668 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 02:34:20,669 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 02:34:20,669 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 02:34:20,669 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 02:34:20,669 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 02:34:20,669 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 02:34:20,670 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 02:34:20,670 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 02:34:20,670 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 02:34:20,670 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 02:34:20,670 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 02:34:20,671 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 02:34:20,671 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 02:34:20,671 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 02:34:20,671 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 02:34:20,671 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 02:34:20,672 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 02:34:20,672 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 02:34:20,673 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 02:34:20,673 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 02:34:20,735 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 02:34:20,756 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 02:34:20,761 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 02:34:20,763 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 02:34:20,764 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 02:34:20,765 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c [2018-01-30 02:34:20,908 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 02:34:20,918 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-30 02:34:20,918 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 02:34:20,919 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 02:34:20,926 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 02:34:20,927 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:34:20" (1/1) ... [2018-01-30 02:34:20,929 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b80f5ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:34:20, skipping insertion in model container [2018-01-30 02:34:20,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:34:20" (1/1) ... [2018-01-30 02:34:20,949 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 02:34:20,969 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 02:34:21,108 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 02:34:21,132 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 02:34:21,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:34:21 WrapperNode [2018-01-30 02:34:21,139 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 02:34:21,140 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 02:34:21,140 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 02:34:21,140 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 02:34:21,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:34:21" (1/1) ... [2018-01-30 02:34:21,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:34:21" (1/1) ... [2018-01-30 02:34:21,163 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:34:21" (1/1) ... [2018-01-30 02:34:21,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:34:21" (1/1) ... [2018-01-30 02:34:21,166 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:34:21" (1/1) ... [2018-01-30 02:34:21,169 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:34:21" (1/1) ... [2018-01-30 02:34:21,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:34:21" (1/1) ... [2018-01-30 02:34:21,172 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 02:34:21,172 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 02:34:21,173 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 02:34:21,173 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 02:34:21,174 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:34:21" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 02:34:21,225 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 02:34:21,225 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 02:34:21,225 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-30 02:34:21,226 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 02:34:21,226 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-30 02:34:21,226 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-30 02:34:21,226 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 02:34:21,226 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 02:34:21,226 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 02:34:21,226 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-30 02:34:21,226 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 02:34:21,226 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 02:34:21,226 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 02:34:21,423 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 02:34:21,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:34:21 BoogieIcfgContainer [2018-01-30 02:34:21,445 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 02:34:21,445 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-30 02:34:21,445 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-30 02:34:21,447 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-30 02:34:21,449 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:34:21" (1/1) ... [2018-01-30 02:34:21,456 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-30 02:34:21,457 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-30 02:34:21,457 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-30 02:34:21,494 INFO L162 apSepIcfgTransformer]: finished StoreIndexFreezer, created 6 freeze vars and freeze var literals (each corresponds to one heap write) [2018-01-30 02:34:21,515 INFO L221 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-30 02:34:21,583 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-30 02:34:33,450 INFO L311 AbstractInterpreter]: Visited 70 different actions 440 times. Merged at 46 different actions 244 times. Widened at 1 different actions 1 times. Found 21 fixpoints after 5 different actions. Largest state had 39 variables. [2018-01-30 02:34:33,453 INFO L229 apSepIcfgTransformer]: finished equality analysis [2018-01-30 02:34:33,465 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 1 [2018-01-30 02:34:33,465 INFO L241 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-30 02:34:33,466 INFO L242 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-30 02:34:33,466 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-30 02:34:33,470 INFO L547 PartitionManager]: partitioning result: [2018-01-30 02:34:33,471 INFO L552 PartitionManager]: location blocks for array group [#memory_int] [2018-01-30 02:34:33,471 INFO L561 PartitionManager]: at dimension 0 [2018-01-30 02:34:33,471 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-30 02:34:33,471 INFO L563 PartitionManager]: # location blocks :1 [2018-01-30 02:34:33,471 INFO L561 PartitionManager]: at dimension 1 [2018-01-30 02:34:33,471 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-30 02:34:33,471 INFO L563 PartitionManager]: # location blocks :1 [2018-01-30 02:34:33,472 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-30 02:34:33,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 02:34:33 BasicIcfg [2018-01-30 02:34:33,488 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-30 02:34:33,489 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 02:34:33,489 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 02:34:33,491 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 02:34:33,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 02:34:20" (1/4) ... [2018-01-30 02:34:33,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d54d37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:34:33, skipping insertion in model container [2018-01-30 02:34:33,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:34:21" (2/4) ... [2018-01-30 02:34:33,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d54d37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:34:33, skipping insertion in model container [2018-01-30 02:34:33,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:34:21" (3/4) ... [2018-01-30 02:34:33,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d54d37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 02:34:33, skipping insertion in model container [2018-01-30 02:34:33,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 02:34:33" (4/4) ... [2018-01-30 02:34:33,495 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-30 02:34:33,503 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 02:34:33,509 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-30 02:34:33,613 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 02:34:33,613 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 02:34:33,613 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 02:34:33,613 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 02:34:33,613 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 02:34:33,614 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 02:34:33,614 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 02:34:33,614 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 02:34:33,615 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 02:34:33,630 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-01-30 02:34:33,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-30 02:34:33,637 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:33,638 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:33,638 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:33,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1068910584, now seen corresponding path program 1 times [2018-01-30 02:34:33,645 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:33,646 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:33,707 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:33,708 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:34:33,708 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:33,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:33,762 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:33,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:34:33,848 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:34:33,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 02:34:33,850 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 02:34:33,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 02:34:33,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:34:33,865 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 3 states. [2018-01-30 02:34:33,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:33,973 INFO L93 Difference]: Finished difference Result 133 states and 160 transitions. [2018-01-30 02:34:33,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 02:34:33,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-01-30 02:34:33,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:33,989 INFO L225 Difference]: With dead ends: 133 [2018-01-30 02:34:33,989 INFO L226 Difference]: Without dead ends: 78 [2018-01-30 02:34:33,993 INFO L553 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-30 02:34:34,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-30 02:34:34,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2018-01-30 02:34:34,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-30 02:34:34,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-01-30 02:34:34,046 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 9 [2018-01-30 02:34:34,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:34,046 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-01-30 02:34:34,047 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 02:34:34,047 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-01-30 02:34:34,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-30 02:34:34,048 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:34,048 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:34,048 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:34,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1115648547, now seen corresponding path program 1 times [2018-01-30 02:34:34,048 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:34,049 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:34,050 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:34,050 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:34:34,050 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:34,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:34,065 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:34,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:34:34,172 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:34:34,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:34:34,174 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 02:34:34,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 02:34:34,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-30 02:34:34,175 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 7 states. [2018-01-30 02:34:34,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:34,394 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2018-01-30 02:34:34,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 02:34:34,395 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-01-30 02:34:34,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:34,400 INFO L225 Difference]: With dead ends: 125 [2018-01-30 02:34:34,400 INFO L226 Difference]: Without dead ends: 124 [2018-01-30 02:34:34,401 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-30 02:34:34,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-30 02:34:34,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 67. [2018-01-30 02:34:34,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-30 02:34:34,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-01-30 02:34:34,411 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 18 [2018-01-30 02:34:34,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:34,412 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-01-30 02:34:34,412 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 02:34:34,412 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-01-30 02:34:34,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-30 02:34:34,413 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:34,413 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:34,413 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:34,413 INFO L82 PathProgramCache]: Analyzing trace with hash -225366126, now seen corresponding path program 1 times [2018-01-30 02:34:34,413 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:34,414 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:34,415 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:34,415 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:34:34,415 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:34,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:34,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:34:34,478 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:34:34,478 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:34:34,478 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 02:34:34,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 02:34:34,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:34:34,479 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 5 states. [2018-01-30 02:34:34,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:34,571 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-01-30 02:34:34,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 02:34:34,572 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-30 02:34:34,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:34,573 INFO L225 Difference]: With dead ends: 67 [2018-01-30 02:34:34,573 INFO L226 Difference]: Without dead ends: 66 [2018-01-30 02:34:34,573 INFO L553 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-30 02:34:34,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-30 02:34:34,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-01-30 02:34:34,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-30 02:34:34,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2018-01-30 02:34:34,579 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 19 [2018-01-30 02:34:34,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:34,579 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-01-30 02:34:34,579 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 02:34:34,580 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2018-01-30 02:34:34,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-30 02:34:34,580 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:34,580 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:34,580 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:34,581 INFO L82 PathProgramCache]: Analyzing trace with hash -225366124, now seen corresponding path program 1 times [2018-01-30 02:34:34,581 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:34,581 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:34,581 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:34,582 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:34:34,582 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:34,592 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:34,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:34:34,792 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:34:34,792 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 02:34:34,792 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:34:34,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:34:34,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:34:34,793 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 6 states. [2018-01-30 02:34:35,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:35,052 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-01-30 02:34:35,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 02:34:35,052 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-30 02:34:35,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:35,054 INFO L225 Difference]: With dead ends: 75 [2018-01-30 02:34:35,054 INFO L226 Difference]: Without dead ends: 74 [2018-01-30 02:34:35,054 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-30 02:34:35,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-30 02:34:35,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 67. [2018-01-30 02:34:35,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-30 02:34:35,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-01-30 02:34:35,062 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 19 [2018-01-30 02:34:35,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:35,062 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-01-30 02:34:35,063 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:34:35,063 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-01-30 02:34:35,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-30 02:34:35,063 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:35,063 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:35,063 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:35,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1537306562, now seen corresponding path program 1 times [2018-01-30 02:34:35,064 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:35,064 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:35,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:35,065 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:34:35,065 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:35,070 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:35,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:34:35,208 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:34:35,208 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:34:35,221 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:34:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:35,251 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:34:35,275 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-30 02:34:35,307 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 02:34:35,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2018-01-30 02:34:35,307 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 02:34:35,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 02:34:35,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-30 02:34:35,308 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 8 states. [2018-01-30 02:34:35,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:35,511 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2018-01-30 02:34:35,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:34:35,511 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-30 02:34:35,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:35,512 INFO L225 Difference]: With dead ends: 106 [2018-01-30 02:34:35,512 INFO L226 Difference]: Without dead ends: 85 [2018-01-30 02:34:35,513 INFO L553 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-30 02:34:35,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-30 02:34:35,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 75. [2018-01-30 02:34:35,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-30 02:34:35,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2018-01-30 02:34:35,519 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 19 [2018-01-30 02:34:35,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:35,519 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2018-01-30 02:34:35,519 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 02:34:35,520 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2018-01-30 02:34:35,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-30 02:34:35,522 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:35,522 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:35,522 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:35,522 INFO L82 PathProgramCache]: Analyzing trace with hash 184823418, now seen corresponding path program 1 times [2018-01-30 02:34:35,522 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:35,522 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:35,523 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:35,523 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:34:35,523 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:35,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:35,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:34:35,589 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:34:35,589 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:34:35,601 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:34:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:35,613 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:34:35,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:34:35,644 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:34:35,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-01-30 02:34:35,645 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 02:34:35,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 02:34:35,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:34:35,645 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand 5 states. [2018-01-30 02:34:35,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:35,690 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2018-01-30 02:34:35,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 02:34:35,691 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-01-30 02:34:35,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:35,692 INFO L225 Difference]: With dead ends: 96 [2018-01-30 02:34:35,692 INFO L226 Difference]: Without dead ends: 95 [2018-01-30 02:34:35,692 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-30 02:34:35,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-30 02:34:35,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2018-01-30 02:34:35,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-30 02:34:35,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2018-01-30 02:34:35,701 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 27 [2018-01-30 02:34:35,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:35,702 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2018-01-30 02:34:35,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 02:34:35,702 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2018-01-30 02:34:35,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-30 02:34:35,703 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:35,703 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:35,703 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:35,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1434559127, now seen corresponding path program 1 times [2018-01-30 02:34:35,703 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:35,703 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:35,704 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:35,704 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:34:35,704 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:35,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:35,716 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:35,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:34:35,935 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:34:35,935 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-30 02:34:35,940 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:34:35,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:35,954 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:34:35,981 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-30 02:34:35,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:34:35,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:34:35,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 02:34:36,072 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:34:36,095 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:34:36,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-01-30 02:34:36,095 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 02:34:36,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 02:34:36,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-30 02:34:36,096 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 9 states. [2018-01-30 02:34:36,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:36,239 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2018-01-30 02:34:36,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:34:36,240 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-01-30 02:34:36,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:36,240 INFO L225 Difference]: With dead ends: 95 [2018-01-30 02:34:36,241 INFO L226 Difference]: Without dead ends: 94 [2018-01-30 02:34:36,241 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-01-30 02:34:36,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-30 02:34:36,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2018-01-30 02:34:36,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-30 02:34:36,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2018-01-30 02:34:36,248 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 28 [2018-01-30 02:34:36,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:36,249 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2018-01-30 02:34:36,249 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 02:34:36,249 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2018-01-30 02:34:36,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-30 02:34:36,250 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:36,251 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:36,251 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:36,251 INFO L82 PathProgramCache]: Analyzing trace with hash -123801987, now seen corresponding path program 2 times [2018-01-30 02:34:36,251 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:36,251 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:36,252 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:36,252 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:34:36,252 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:36,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:36,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:36,374 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:34:36,375 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:34:36,375 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-30 02:34:36,387 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 02:34:36,397 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:34:36,401 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:34:36,402 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:34:36,404 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:34:36,546 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:34:36,569 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 02:34:36,569 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 16 [2018-01-30 02:34:36,569 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-30 02:34:36,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-30 02:34:36,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-01-30 02:34:36,570 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 16 states. [2018-01-30 02:34:36,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:36,836 INFO L93 Difference]: Finished difference Result 196 states and 214 transitions. [2018-01-30 02:34:36,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-30 02:34:36,837 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2018-01-30 02:34:36,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:36,838 INFO L225 Difference]: With dead ends: 196 [2018-01-30 02:34:36,838 INFO L226 Difference]: Without dead ends: 126 [2018-01-30 02:34:36,839 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2018-01-30 02:34:36,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-30 02:34:36,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 112. [2018-01-30 02:34:36,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-30 02:34:36,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2018-01-30 02:34:36,862 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 36 [2018-01-30 02:34:36,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:36,862 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2018-01-30 02:34:36,862 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-30 02:34:36,863 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2018-01-30 02:34:36,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-30 02:34:36,866 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:36,866 INFO L350 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-30 02:34:36,866 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:36,867 INFO L82 PathProgramCache]: Analyzing trace with hash 729468996, now seen corresponding path program 1 times [2018-01-30 02:34:36,867 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:36,867 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:36,868 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:36,868 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:34:36,868 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:36,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:36,888 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:36,924 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-30 02:34:36,924 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:34:36,924 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-30 02:34:36,931 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:34:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:36,941 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:34:36,959 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-30 02:34:36,989 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:34:36,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-01-30 02:34:36,990 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 02:34:36,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 02:34:36,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-30 02:34:36,991 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand 9 states. [2018-01-30 02:34:37,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:37,146 INFO L93 Difference]: Finished difference Result 157 states and 173 transitions. [2018-01-30 02:34:37,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:34:37,150 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-01-30 02:34:37,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:37,151 INFO L225 Difference]: With dead ends: 157 [2018-01-30 02:34:37,152 INFO L226 Difference]: Without dead ends: 137 [2018-01-30 02:34:37,152 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-01-30 02:34:37,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-30 02:34:37,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 122. [2018-01-30 02:34:37,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-30 02:34:37,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2018-01-30 02:34:37,168 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 37 [2018-01-30 02:34:37,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:37,168 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2018-01-30 02:34:37,168 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 02:34:37,168 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2018-01-30 02:34:37,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-30 02:34:37,170 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:37,171 INFO L350 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-30 02:34:37,171 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:37,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1381672071, now seen corresponding path program 1 times [2018-01-30 02:34:37,171 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:37,171 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:37,172 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:37,172 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:34:37,172 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:37,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:37,341 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 02:34:37,342 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:34:37,342 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-30 02:34:37,349 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:34:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:37,360 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:34:37,370 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 02:34:37,391 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:34:37,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-01-30 02:34:37,392 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 02:34:37,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 02:34:37,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 02:34:37,392 INFO L87 Difference]: Start difference. First operand 122 states and 134 transitions. Second operand 7 states. [2018-01-30 02:34:37,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:37,520 INFO L93 Difference]: Finished difference Result 152 states and 168 transitions. [2018-01-30 02:34:37,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:34:37,520 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-01-30 02:34:37,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:37,521 INFO L225 Difference]: With dead ends: 152 [2018-01-30 02:34:37,521 INFO L226 Difference]: Without dead ends: 151 [2018-01-30 02:34:37,522 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-01-30 02:34:37,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-01-30 02:34:37,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 130. [2018-01-30 02:34:37,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-30 02:34:37,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2018-01-30 02:34:37,531 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 46 [2018-01-30 02:34:37,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:37,531 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2018-01-30 02:34:37,531 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 02:34:37,531 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2018-01-30 02:34:37,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-30 02:34:37,532 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:37,532 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:37,532 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:37,533 INFO L82 PathProgramCache]: Analyzing trace with hash -117838294, now seen corresponding path program 1 times [2018-01-30 02:34:37,533 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:37,533 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:37,533 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:37,534 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:34:37,534 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:37,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:37,769 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 02:34:37,769 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:34:37,769 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-30 02:34:37,774 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:34:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:37,788 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:34:37,791 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-30 02:34:37,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:34:37,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:34:37,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 02:34:37,855 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 02:34:37,876 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:34:37,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-01-30 02:34:37,876 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-30 02:34:37,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-30 02:34:37,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-01-30 02:34:37,877 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 13 states. [2018-01-30 02:34:38,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:38,113 INFO L93 Difference]: Finished difference Result 151 states and 167 transitions. [2018-01-30 02:34:38,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 02:34:38,113 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2018-01-30 02:34:38,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:38,114 INFO L225 Difference]: With dead ends: 151 [2018-01-30 02:34:38,115 INFO L226 Difference]: Without dead ends: 150 [2018-01-30 02:34:38,115 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2018-01-30 02:34:38,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-30 02:34:38,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 131. [2018-01-30 02:34:38,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-01-30 02:34:38,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 144 transitions. [2018-01-30 02:34:38,124 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 144 transitions. Word has length 47 [2018-01-30 02:34:38,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:38,124 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 144 transitions. [2018-01-30 02:34:38,124 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-30 02:34:38,124 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 144 transitions. [2018-01-30 02:34:38,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-30 02:34:38,125 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:38,125 INFO L350 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-30 02:34:38,125 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:38,125 INFO L82 PathProgramCache]: Analyzing trace with hash 154524538, now seen corresponding path program 2 times [2018-01-30 02:34:38,125 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:38,126 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:38,126 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:38,126 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:34:38,126 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:38,134 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:38,202 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-30 02:34:38,202 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:34:38,202 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-30 02:34:38,208 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 02:34:38,216 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:34:38,217 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:34:38,220 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:34:38,290 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-30 02:34:38,326 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 02:34:38,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2018-01-30 02:34:38,327 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-30 02:34:38,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-30 02:34:38,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=100, Unknown=1, NotChecked=0, Total=132 [2018-01-30 02:34:38,328 INFO L87 Difference]: Start difference. First operand 131 states and 144 transitions. Second operand 12 states. [2018-01-30 02:34:38,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:38,989 INFO L93 Difference]: Finished difference Result 174 states and 195 transitions. [2018-01-30 02:34:38,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-30 02:34:38,989 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-01-30 02:34:38,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:38,990 INFO L225 Difference]: With dead ends: 174 [2018-01-30 02:34:38,991 INFO L226 Difference]: Without dead ends: 143 [2018-01-30 02:34:38,991 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=363, Unknown=1, NotChecked=0, Total=506 [2018-01-30 02:34:38,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-30 02:34:39,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 133. [2018-01-30 02:34:39,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-30 02:34:39,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 147 transitions. [2018-01-30 02:34:39,003 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 147 transitions. Word has length 47 [2018-01-30 02:34:39,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:39,004 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 147 transitions. [2018-01-30 02:34:39,004 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-30 02:34:39,004 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 147 transitions. [2018-01-30 02:34:39,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-30 02:34:39,005 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:39,006 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:39,006 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:39,006 INFO L82 PathProgramCache]: Analyzing trace with hash -739772656, now seen corresponding path program 2 times [2018-01-30 02:34:39,006 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:39,006 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:39,008 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:39,008 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:34:39,008 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:39,030 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:39,502 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-30 02:34:39,503 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:34:39,503 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-30 02:34:39,516 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 02:34:39,527 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:34:39,545 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:34:39,549 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:34:39,552 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:34:40,037 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 36 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:34:40,058 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:34:40,058 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 25 [2018-01-30 02:34:40,059 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-30 02:34:40,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-30 02:34:40,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2018-01-30 02:34:40,059 INFO L87 Difference]: Start difference. First operand 133 states and 147 transitions. Second operand 25 states. [2018-01-30 02:34:40,429 WARN L143 SmtUtils]: Spent 121ms on a formula simplification that was a NOOP. DAG size: 17 [2018-01-30 02:34:41,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:41,017 INFO L93 Difference]: Finished difference Result 275 states and 303 transitions. [2018-01-30 02:34:41,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-30 02:34:41,018 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 55 [2018-01-30 02:34:41,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:41,019 INFO L225 Difference]: With dead ends: 275 [2018-01-30 02:34:41,019 INFO L226 Difference]: Without dead ends: 194 [2018-01-30 02:34:41,020 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=359, Invalid=1621, Unknown=0, NotChecked=0, Total=1980 [2018-01-30 02:34:41,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-30 02:34:41,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 170. [2018-01-30 02:34:41,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-01-30 02:34:41,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 186 transitions. [2018-01-30 02:34:41,031 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 186 transitions. Word has length 55 [2018-01-30 02:34:41,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:41,032 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 186 transitions. [2018-01-30 02:34:41,032 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-30 02:34:41,032 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 186 transitions. [2018-01-30 02:34:41,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-30 02:34:41,033 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:41,033 INFO L350 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-30 02:34:41,034 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:41,034 INFO L82 PathProgramCache]: Analyzing trace with hash 245732012, now seen corresponding path program 1 times [2018-01-30 02:34:41,034 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:41,034 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:41,035 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:41,035 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:34:41,035 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:41,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:41,108 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-30 02:34:41,108 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:34:41,108 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-30 02:34:41,120 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:34:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:41,138 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:34:41,383 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-30 02:34:41,405 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:34:41,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11] total 15 [2018-01-30 02:34:41,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-30 02:34:41,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-30 02:34:41,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-01-30 02:34:41,406 INFO L87 Difference]: Start difference. First operand 170 states and 186 transitions. Second operand 15 states. [2018-01-30 02:34:41,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:41,620 INFO L93 Difference]: Finished difference Result 209 states and 231 transitions. [2018-01-30 02:34:41,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-30 02:34:41,621 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2018-01-30 02:34:41,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:41,621 INFO L225 Difference]: With dead ends: 209 [2018-01-30 02:34:41,622 INFO L226 Difference]: Without dead ends: 197 [2018-01-30 02:34:41,622 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2018-01-30 02:34:41,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-01-30 02:34:41,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 187. [2018-01-30 02:34:41,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-30 02:34:41,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 205 transitions. [2018-01-30 02:34:41,634 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 205 transitions. Word has length 59 [2018-01-30 02:34:41,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:41,634 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 205 transitions. [2018-01-30 02:34:41,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-30 02:34:41,634 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 205 transitions. [2018-01-30 02:34:41,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-30 02:34:41,635 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:41,635 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:41,635 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:41,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1928929082, now seen corresponding path program 3 times [2018-01-30 02:34:41,636 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:41,636 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:41,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:41,637 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:34:41,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:41,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:41,752 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-30 02:34:41,752 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:34:41,752 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-30 02:34:41,757 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 02:34:41,763 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:34:41,766 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:34:41,769 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:34:41,770 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:34:41,772 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:34:41,961 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-30 02:34:41,981 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:34:41,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14] total 21 [2018-01-30 02:34:41,982 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-30 02:34:41,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-30 02:34:41,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2018-01-30 02:34:41,982 INFO L87 Difference]: Start difference. First operand 187 states and 205 transitions. Second operand 22 states. [2018-01-30 02:34:43,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:43,069 INFO L93 Difference]: Finished difference Result 295 states and 324 transitions. [2018-01-30 02:34:43,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-01-30 02:34:43,070 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 65 [2018-01-30 02:34:43,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:43,072 INFO L225 Difference]: With dead ends: 295 [2018-01-30 02:34:43,072 INFO L226 Difference]: Without dead ends: 294 [2018-01-30 02:34:43,073 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=377, Invalid=2379, Unknown=0, NotChecked=0, Total=2756 [2018-01-30 02:34:43,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-01-30 02:34:43,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 234. [2018-01-30 02:34:43,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-01-30 02:34:43,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 257 transitions. [2018-01-30 02:34:43,091 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 257 transitions. Word has length 65 [2018-01-30 02:34:43,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:43,092 INFO L432 AbstractCegarLoop]: Abstraction has 234 states and 257 transitions. [2018-01-30 02:34:43,092 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-30 02:34:43,092 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 257 transitions. [2018-01-30 02:34:43,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-30 02:34:43,093 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:43,093 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:43,094 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:43,094 INFO L82 PathProgramCache]: Analyzing trace with hash 332741067, now seen corresponding path program 2 times [2018-01-30 02:34:43,094 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:43,094 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:43,095 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:43,095 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:34:43,095 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:43,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:43,404 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-30 02:34:43,404 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:34:43,404 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:34:43,409 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 02:34:43,415 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:34:43,421 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:34:43,422 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:34:43,424 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:34:43,426 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-30 02:34:43,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:34:43,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:34:43,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 02:34:43,703 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-30 02:34:43,740 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:34:43,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-01-30 02:34:43,740 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-30 02:34:43,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-30 02:34:43,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2018-01-30 02:34:43,741 INFO L87 Difference]: Start difference. First operand 234 states and 257 transitions. Second operand 23 states. [2018-01-30 02:34:44,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:44,144 INFO L93 Difference]: Finished difference Result 292 states and 321 transitions. [2018-01-30 02:34:44,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-30 02:34:44,144 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 66 [2018-01-30 02:34:44,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:44,146 INFO L225 Difference]: With dead ends: 292 [2018-01-30 02:34:44,146 INFO L226 Difference]: Without dead ends: 291 [2018-01-30 02:34:44,146 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=226, Invalid=896, Unknown=0, NotChecked=0, Total=1122 [2018-01-30 02:34:44,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-01-30 02:34:44,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 244. [2018-01-30 02:34:44,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-01-30 02:34:44,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 268 transitions. [2018-01-30 02:34:44,162 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 268 transitions. Word has length 66 [2018-01-30 02:34:44,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:44,162 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 268 transitions. [2018-01-30 02:34:44,162 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-30 02:34:44,162 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 268 transitions. [2018-01-30 02:34:44,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-30 02:34:44,163 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:44,163 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:44,163 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:44,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1158666688, now seen corresponding path program 3 times [2018-01-30 02:34:44,164 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:44,164 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:44,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:44,164 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:34:44,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:44,173 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:44,595 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 45 proven. 26 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-30 02:34:44,595 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:34:44,595 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:34:44,601 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 02:34:44,609 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:34:44,612 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:34:44,616 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:34:44,617 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:34:44,619 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:34:44,622 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-30 02:34:44,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:34:44,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:34:44,626 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 02:34:44,887 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-01-30 02:34:44,908 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:34:44,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2018-01-30 02:34:44,909 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-30 02:34:44,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-30 02:34:44,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2018-01-30 02:34:44,909 INFO L87 Difference]: Start difference. First operand 244 states and 268 transitions. Second operand 29 states. [2018-01-30 02:34:45,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:45,850 INFO L93 Difference]: Finished difference Result 263 states and 286 transitions. [2018-01-30 02:34:45,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-30 02:34:45,850 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 75 [2018-01-30 02:34:45,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:45,852 INFO L225 Difference]: With dead ends: 263 [2018-01-30 02:34:45,852 INFO L226 Difference]: Without dead ends: 262 [2018-01-30 02:34:45,853 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=357, Invalid=1623, Unknown=0, NotChecked=0, Total=1980 [2018-01-30 02:34:45,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-01-30 02:34:45,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 213. [2018-01-30 02:34:45,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-01-30 02:34:45,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 232 transitions. [2018-01-30 02:34:45,866 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 232 transitions. Word has length 75 [2018-01-30 02:34:45,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:45,866 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 232 transitions. [2018-01-30 02:34:45,866 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-30 02:34:45,866 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 232 transitions. [2018-01-30 02:34:45,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-01-30 02:34:45,867 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:45,867 INFO L350 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-30 02:34:45,867 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:45,867 INFO L82 PathProgramCache]: Analyzing trace with hash -337153039, now seen corresponding path program 2 times [2018-01-30 02:34:45,867 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:45,867 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:45,868 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:45,868 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:34:45,868 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:45,876 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:45,937 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-30 02:34:45,938 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:34:45,938 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:34:45,943 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 02:34:45,950 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:34:45,956 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:34:45,958 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:34:45,960 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:34:46,059 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-30 02:34:46,080 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:34:46,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13] total 19 [2018-01-30 02:34:46,081 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-30 02:34:46,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-30 02:34:46,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2018-01-30 02:34:46,081 INFO L87 Difference]: Start difference. First operand 213 states and 232 transitions. Second operand 19 states. [2018-01-30 02:34:46,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:46,395 INFO L93 Difference]: Finished difference Result 251 states and 276 transitions. [2018-01-30 02:34:46,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-30 02:34:46,396 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 76 [2018-01-30 02:34:46,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:46,397 INFO L225 Difference]: With dead ends: 251 [2018-01-30 02:34:46,397 INFO L226 Difference]: Without dead ends: 211 [2018-01-30 02:34:46,398 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=250, Invalid=940, Unknown=0, NotChecked=0, Total=1190 [2018-01-30 02:34:46,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-01-30 02:34:46,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 176. [2018-01-30 02:34:46,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-01-30 02:34:46,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 192 transitions. [2018-01-30 02:34:46,412 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 192 transitions. Word has length 76 [2018-01-30 02:34:46,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:46,413 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 192 transitions. [2018-01-30 02:34:46,413 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-30 02:34:46,413 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 192 transitions. [2018-01-30 02:34:46,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-30 02:34:46,414 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:46,414 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:46,414 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:46,414 INFO L82 PathProgramCache]: Analyzing trace with hash -291573701, now seen corresponding path program 4 times [2018-01-30 02:34:46,415 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:46,415 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:46,415 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:46,416 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:34:46,416 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:46,429 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:46,629 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-01-30 02:34:46,630 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:34:46,630 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:34:46,637 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 02:34:46,654 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:34:46,657 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:34:46,781 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-01-30 02:34:46,815 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:34:46,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 25 [2018-01-30 02:34:46,816 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-30 02:34:46,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-30 02:34:46,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2018-01-30 02:34:46,816 INFO L87 Difference]: Start difference. First operand 176 states and 192 transitions. Second operand 26 states. [2018-01-30 02:34:48,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:48,144 INFO L93 Difference]: Finished difference Result 386 states and 419 transitions. [2018-01-30 02:34:48,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-01-30 02:34:48,145 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 84 [2018-01-30 02:34:48,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:48,146 INFO L225 Difference]: With dead ends: 386 [2018-01-30 02:34:48,146 INFO L226 Difference]: Without dead ends: 385 [2018-01-30 02:34:48,147 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1149 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=504, Invalid=3278, Unknown=0, NotChecked=0, Total=3782 [2018-01-30 02:34:48,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-01-30 02:34:48,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 251. [2018-01-30 02:34:48,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-01-30 02:34:48,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 277 transitions. [2018-01-30 02:34:48,161 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 277 transitions. Word has length 84 [2018-01-30 02:34:48,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:48,161 INFO L432 AbstractCegarLoop]: Abstraction has 251 states and 277 transitions. [2018-01-30 02:34:48,161 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-30 02:34:48,162 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 277 transitions. [2018-01-30 02:34:48,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-01-30 02:34:48,162 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:48,162 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:48,162 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:48,163 INFO L82 PathProgramCache]: Analyzing trace with hash -448849674, now seen corresponding path program 4 times [2018-01-30 02:34:48,163 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:48,163 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:48,163 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:48,163 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:34:48,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:48,171 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:48,515 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 23 proven. 50 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-01-30 02:34:48,515 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:34:48,515 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:34:48,520 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 02:34:48,538 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:34:48,540 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:34:48,555 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-30 02:34:48,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:34:48,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:34:48,632 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 02:34:48,995 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-01-30 02:34:49,023 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:34:49,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2018-01-30 02:34:49,024 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-30 02:34:49,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-30 02:34:49,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2018-01-30 02:34:49,025 INFO L87 Difference]: Start difference. First operand 251 states and 277 transitions. Second operand 29 states. [2018-01-30 02:34:51,976 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 25 DAG size of output 22 [2018-01-30 02:34:52,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:52,053 INFO L93 Difference]: Finished difference Result 374 states and 406 transitions. [2018-01-30 02:34:52,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-01-30 02:34:52,053 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 85 [2018-01-30 02:34:52,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:52,055 INFO L225 Difference]: With dead ends: 374 [2018-01-30 02:34:52,055 INFO L226 Difference]: Without dead ends: 373 [2018-01-30 02:34:52,057 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1759 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=763, Invalid=5557, Unknown=0, NotChecked=0, Total=6320 [2018-01-30 02:34:52,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-01-30 02:34:52,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 220. [2018-01-30 02:34:52,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-01-30 02:34:52,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 240 transitions. [2018-01-30 02:34:52,075 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 240 transitions. Word has length 85 [2018-01-30 02:34:52,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:52,076 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 240 transitions. [2018-01-30 02:34:52,076 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-30 02:34:52,076 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 240 transitions. [2018-01-30 02:34:52,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-01-30 02:34:52,077 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:52,077 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:52,077 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:52,078 INFO L82 PathProgramCache]: Analyzing trace with hash 36527359, now seen corresponding path program 5 times [2018-01-30 02:34:52,078 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:52,078 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:52,079 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:52,079 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:34:52,079 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:52,090 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:52,624 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 30 proven. 86 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-01-30 02:34:52,625 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:34:52,625 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:34:52,632 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 02:34:52,640 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:34:52,643 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:34:52,646 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:34:52,649 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:34:52,652 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:34:52,656 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:34:52,658 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:34:52,661 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:34:52,664 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-30 02:34:52,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:34:52,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:34:52,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 02:34:52,951 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-01-30 02:34:52,972 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:34:52,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 32 [2018-01-30 02:34:52,972 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-30 02:34:52,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-30 02:34:52,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=954, Unknown=0, NotChecked=0, Total=1056 [2018-01-30 02:34:52,973 INFO L87 Difference]: Start difference. First operand 220 states and 240 transitions. Second operand 33 states. [2018-01-30 02:34:56,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:56,181 INFO L93 Difference]: Finished difference Result 505 states and 547 transitions. [2018-01-30 02:34:56,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-01-30 02:34:56,181 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 104 [2018-01-30 02:34:56,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:56,183 INFO L225 Difference]: With dead ends: 505 [2018-01-30 02:34:56,183 INFO L226 Difference]: Without dead ends: 503 [2018-01-30 02:34:56,185 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2424 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=934, Invalid=7622, Unknown=0, NotChecked=0, Total=8556 [2018-01-30 02:34:56,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-01-30 02:34:56,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 248. [2018-01-30 02:34:56,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-01-30 02:34:56,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 270 transitions. [2018-01-30 02:34:56,198 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 270 transitions. Word has length 104 [2018-01-30 02:34:56,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:56,199 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 270 transitions. [2018-01-30 02:34:56,199 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-30 02:34:56,199 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 270 transitions. [2018-01-30 02:34:56,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-01-30 02:34:56,200 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:56,201 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:56,201 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:56,201 INFO L82 PathProgramCache]: Analyzing trace with hash -705075217, now seen corresponding path program 5 times [2018-01-30 02:34:56,201 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:56,201 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:56,203 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:56,203 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:34:56,204 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:56,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:56,620 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 163 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-01-30 02:34:56,668 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:34:56,668 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:34:56,675 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 02:34:56,684 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:34:56,686 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:34:56,689 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:34:56,700 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:34:56,714 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:34:56,722 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:34:56,726 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:34:56,727 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:34:56,730 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:34:56,892 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-01-30 02:34:56,913 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:34:56,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 33 [2018-01-30 02:34:56,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-30 02:34:56,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-30 02:34:56,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1014, Unknown=0, NotChecked=0, Total=1122 [2018-01-30 02:34:56,914 INFO L87 Difference]: Start difference. First operand 248 states and 270 transitions. Second operand 34 states. [2018-01-30 02:34:59,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:59,250 INFO L93 Difference]: Finished difference Result 665 states and 720 transitions. [2018-01-30 02:34:59,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-01-30 02:34:59,250 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 122 [2018-01-30 02:34:59,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:59,252 INFO L225 Difference]: With dead ends: 665 [2018-01-30 02:34:59,252 INFO L226 Difference]: Without dead ends: 664 [2018-01-30 02:34:59,254 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2521 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=749, Invalid=7083, Unknown=0, NotChecked=0, Total=7832 [2018-01-30 02:34:59,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2018-01-30 02:34:59,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 332. [2018-01-30 02:34:59,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-01-30 02:34:59,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 364 transitions. [2018-01-30 02:34:59,271 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 364 transitions. Word has length 122 [2018-01-30 02:34:59,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:59,271 INFO L432 AbstractCegarLoop]: Abstraction has 332 states and 364 transitions. [2018-01-30 02:34:59,271 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-30 02:34:59,271 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 364 transitions. [2018-01-30 02:34:59,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-01-30 02:34:59,272 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:59,272 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:59,272 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:59,273 INFO L82 PathProgramCache]: Analyzing trace with hash -382494782, now seen corresponding path program 6 times [2018-01-30 02:34:59,273 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:59,273 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:59,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:59,274 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:34:59,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:59,287 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:59,861 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 108 proven. 132 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-01-30 02:34:59,862 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:34:59,862 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:34:59,869 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 02:34:59,877 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:34:59,887 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:34:59,889 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:34:59,892 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:34:59,895 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:34:59,897 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:34:59,900 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:34:59,901 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:34:59,904 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:34:59,906 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-30 02:34:59,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:34:59,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:34:59,910 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 02:35:00,398 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 37 proven. 132 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-01-30 02:35:00,419 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:35:00,419 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20] total 42 [2018-01-30 02:35:00,420 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-01-30 02:35:00,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-01-30 02:35:00,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1585, Unknown=0, NotChecked=0, Total=1806 [2018-01-30 02:35:00,421 INFO L87 Difference]: Start difference. First operand 332 states and 364 transitions. Second operand 43 states. [2018-01-30 02:35:01,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:35:01,895 INFO L93 Difference]: Finished difference Result 467 states and 507 transitions. [2018-01-30 02:35:01,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-30 02:35:01,896 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 123 [2018-01-30 02:35:01,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:35:01,898 INFO L225 Difference]: With dead ends: 467 [2018-01-30 02:35:01,899 INFO L226 Difference]: Without dead ends: 466 [2018-01-30 02:35:01,901 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=736, Invalid=3956, Unknown=0, NotChecked=0, Total=4692 [2018-01-30 02:35:01,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-01-30 02:35:01,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 283. [2018-01-30 02:35:01,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-01-30 02:35:01,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 308 transitions. [2018-01-30 02:35:01,923 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 308 transitions. Word has length 123 [2018-01-30 02:35:01,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:35:01,924 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 308 transitions. [2018-01-30 02:35:01,924 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-01-30 02:35:01,924 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 308 transitions. [2018-01-30 02:35:01,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-01-30 02:35:01,925 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:35:01,926 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:35:01,926 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:35:01,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1091959176, now seen corresponding path program 7 times [2018-01-30 02:35:01,926 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:35:01,926 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:35:01,927 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:35:01,927 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:35:01,927 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:35:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:35:01,942 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:35:02,611 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 0 proven. 159 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-01-30 02:35:02,612 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:35:02,612 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:35:02,617 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:35:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:35:02,640 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:35:02,643 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-30 02:35:02,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:35:02,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:35:02,646 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 02:35:03,009 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 0 proven. 159 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-01-30 02:35:03,030 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:35:03,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2018-01-30 02:35:03,031 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-30 02:35:03,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-30 02:35:03,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1012, Unknown=0, NotChecked=0, Total=1190 [2018-01-30 02:35:03,032 INFO L87 Difference]: Start difference. First operand 283 states and 308 transitions. Second operand 35 states. [2018-01-30 02:35:04,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:35:04,229 INFO L93 Difference]: Finished difference Result 657 states and 710 transitions. [2018-01-30 02:35:04,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-30 02:35:04,229 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 133 [2018-01-30 02:35:04,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:35:04,232 INFO L225 Difference]: With dead ends: 657 [2018-01-30 02:35:04,232 INFO L226 Difference]: Without dead ends: 656 [2018-01-30 02:35:04,233 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=493, Invalid=2477, Unknown=0, NotChecked=0, Total=2970 [2018-01-30 02:35:04,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2018-01-30 02:35:04,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 284. [2018-01-30 02:35:04,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-01-30 02:35:04,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 309 transitions. [2018-01-30 02:35:04,253 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 309 transitions. Word has length 133 [2018-01-30 02:35:04,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:35:04,253 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 309 transitions. [2018-01-30 02:35:04,253 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-30 02:35:04,254 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 309 transitions. [2018-01-30 02:35:04,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-01-30 02:35:04,254 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:35:04,254 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:35:04,254 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:35:04,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1092215134, now seen corresponding path program 6 times [2018-01-30 02:35:04,255 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:35:04,255 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:35:04,255 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:35:04,256 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:35:04,256 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:35:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:35:04,266 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:35:04,698 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2018-01-30 02:35:04,698 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:35:04,698 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:35:04,703 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 02:35:04,711 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:35:04,713 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:35:04,716 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:35:04,718 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:35:04,721 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:35:04,724 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:35:04,727 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:35:04,730 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:35:04,731 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:35:04,735 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:35:04,810 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2018-01-30 02:35:04,831 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:35:04,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 24 [2018-01-30 02:35:04,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-30 02:35:04,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-30 02:35:04,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2018-01-30 02:35:04,832 INFO L87 Difference]: Start difference. First operand 284 states and 309 transitions. Second operand 25 states. [2018-01-30 02:35:05,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:35:05,475 INFO L93 Difference]: Finished difference Result 429 states and 467 transitions. [2018-01-30 02:35:05,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-30 02:35:05,475 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 141 [2018-01-30 02:35:05,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:35:05,477 INFO L225 Difference]: With dead ends: 429 [2018-01-30 02:35:05,477 INFO L226 Difference]: Without dead ends: 428 [2018-01-30 02:35:05,477 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=386, Invalid=1594, Unknown=0, NotChecked=0, Total=1980 [2018-01-30 02:35:05,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-01-30 02:35:05,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 369. [2018-01-30 02:35:05,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-01-30 02:35:05,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 404 transitions. [2018-01-30 02:35:05,505 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 404 transitions. Word has length 141 [2018-01-30 02:35:05,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:35:05,505 INFO L432 AbstractCegarLoop]: Abstraction has 369 states and 404 transitions. [2018-01-30 02:35:05,505 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-30 02:35:05,505 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 404 transitions. [2018-01-30 02:35:05,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-01-30 02:35:05,507 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:35:05,507 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:35:05,507 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:35:05,507 INFO L82 PathProgramCache]: Analyzing trace with hash -501068749, now seen corresponding path program 8 times [2018-01-30 02:35:05,508 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:35:05,508 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:35:05,508 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:35:05,509 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:35:05,509 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:35:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:35:05,522 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:35:06,081 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 44 proven. 188 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2018-01-30 02:35:06,081 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:35:06,081 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:35:06,088 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 02:35:06,097 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:35:06,109 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:35:06,111 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:35:06,114 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:35:06,117 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-30 02:35:06,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:35:06,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:35:06,120 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 02:35:06,816 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-01-30 02:35:06,847 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:35:06,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 40 [2018-01-30 02:35:06,848 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-30 02:35:06,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-30 02:35:06,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1496, Unknown=0, NotChecked=0, Total=1640 [2018-01-30 02:35:06,849 INFO L87 Difference]: Start difference. First operand 369 states and 404 transitions. Second operand 41 states. [2018-01-30 02:35:08,623 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 35 DAG size of output 26 [2018-01-30 02:35:11,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:35:11,855 INFO L93 Difference]: Finished difference Result 845 states and 915 transitions. [2018-01-30 02:35:11,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-01-30 02:35:11,855 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 142 [2018-01-30 02:35:11,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:35:11,858 INFO L225 Difference]: With dead ends: 845 [2018-01-30 02:35:11,858 INFO L226 Difference]: Without dead ends: 843 [2018-01-30 02:35:11,860 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4238 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1342, Invalid=13178, Unknown=0, NotChecked=0, Total=14520 [2018-01-30 02:35:11,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2018-01-30 02:35:11,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 320. [2018-01-30 02:35:11,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-01-30 02:35:11,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 348 transitions. [2018-01-30 02:35:11,884 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 348 transitions. Word has length 142 [2018-01-30 02:35:11,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:35:11,884 INFO L432 AbstractCegarLoop]: Abstraction has 320 states and 348 transitions. [2018-01-30 02:35:11,885 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-30 02:35:11,885 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 348 transitions. [2018-01-30 02:35:11,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-01-30 02:35:11,886 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:35:11,886 INFO L350 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:35:11,886 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:35:11,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1165341789, now seen corresponding path program 7 times [2018-01-30 02:35:11,887 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:35:11,887 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:35:11,887 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:35:11,888 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:35:11,888 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:35:11,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:35:11,905 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:35:12,428 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2018-01-30 02:35:12,429 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:35:12,429 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:35:12,435 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:35:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:35:12,464 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:35:12,660 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2018-01-30 02:35:12,680 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:35:12,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18] total 39 [2018-01-30 02:35:12,681 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-30 02:35:12,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-30 02:35:12,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1395, Unknown=0, NotChecked=0, Total=1560 [2018-01-30 02:35:12,681 INFO L87 Difference]: Start difference. First operand 320 states and 348 transitions. Second operand 40 states. [2018-01-30 02:35:13,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:35:13,995 INFO L93 Difference]: Finished difference Result 912 states and 986 transitions. [2018-01-30 02:35:13,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-30 02:35:13,996 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 160 [2018-01-30 02:35:13,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:35:13,998 INFO L225 Difference]: With dead ends: 912 [2018-01-30 02:35:13,998 INFO L226 Difference]: Without dead ends: 911 [2018-01-30 02:35:13,999 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1201 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=559, Invalid=3731, Unknown=0, NotChecked=0, Total=4290 [2018-01-30 02:35:14,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2018-01-30 02:35:14,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 328. [2018-01-30 02:35:14,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-01-30 02:35:14,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 357 transitions. [2018-01-30 02:35:14,031 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 357 transitions. Word has length 160 [2018-01-30 02:35:14,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:35:14,031 INFO L432 AbstractCegarLoop]: Abstraction has 328 states and 357 transitions. [2018-01-30 02:35:14,031 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-30 02:35:14,032 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 357 transitions. [2018-01-30 02:35:14,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-01-30 02:35:14,033 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:35:14,033 INFO L350 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:35:14,033 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:35:14,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1765856626, now seen corresponding path program 9 times [2018-01-30 02:35:14,034 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:35:14,034 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:35:14,035 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:35:14,035 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:35:14,035 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:35:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:35:14,050 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:35:14,677 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 51 proven. 254 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2018-01-30 02:35:14,677 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:35:14,678 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:35:14,690 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 02:35:14,706 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:35:14,709 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:35:14,712 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:35:14,716 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:35:14,719 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:35:14,722 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:35:14,725 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:35:14,729 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:35:14,730 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:35:14,734 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:35:14,736 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-30 02:35:14,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:35:14,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:35:14,739 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 02:35:15,352 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 51 proven. 254 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2018-01-30 02:35:15,386 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:35:15,386 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2018-01-30 02:35:15,386 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-01-30 02:35:15,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-01-30 02:35:15,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=1860, Unknown=0, NotChecked=0, Total=2162 [2018-01-30 02:35:15,387 INFO L87 Difference]: Start difference. First operand 328 states and 357 transitions. Second operand 47 states. [2018-01-30 02:35:16,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:35:16,092 INFO L93 Difference]: Finished difference Result 501 states and 546 transitions. [2018-01-30 02:35:16,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-30 02:35:16,092 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 161 [2018-01-30 02:35:16,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:35:16,094 INFO L225 Difference]: With dead ends: 501 [2018-01-30 02:35:16,094 INFO L226 Difference]: Without dead ends: 499 [2018-01-30 02:35:16,094 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1543 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=790, Invalid=3902, Unknown=0, NotChecked=0, Total=4692 [2018-01-30 02:35:16,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-01-30 02:35:16,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 355. [2018-01-30 02:35:16,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-01-30 02:35:16,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 386 transitions. [2018-01-30 02:35:16,113 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 386 transitions. Word has length 161 [2018-01-30 02:35:16,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:35:16,114 INFO L432 AbstractCegarLoop]: Abstraction has 355 states and 386 transitions. [2018-01-30 02:35:16,114 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-01-30 02:35:16,114 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 386 transitions. [2018-01-30 02:35:16,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-01-30 02:35:16,115 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:35:16,115 INFO L350 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:35:16,115 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:35:16,115 INFO L82 PathProgramCache]: Analyzing trace with hash -991764284, now seen corresponding path program 10 times [2018-01-30 02:35:16,115 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:35:16,115 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:35:16,116 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:35:16,116 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:35:16,116 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:35:16,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:35:16,130 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:35:17,022 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 109 proven. 328 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2018-01-30 02:35:17,022 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:35:17,023 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:35:17,028 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 02:35:17,065 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:35:17,069 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:35:17,072 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-30 02:35:17,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:35:17,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:35:17,076 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 02:35:17,760 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 0 proven. 284 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-01-30 02:35:17,781 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:35:17,781 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 22] total 48 [2018-01-30 02:35:17,781 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-01-30 02:35:17,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-01-30 02:35:17,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=2156, Unknown=0, NotChecked=0, Total=2352 [2018-01-30 02:35:17,782 INFO L87 Difference]: Start difference. First operand 355 states and 386 transitions. Second operand 49 states. [2018-01-30 02:35:24,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:35:24,807 INFO L93 Difference]: Finished difference Result 1185 states and 1283 transitions. [2018-01-30 02:35:24,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-01-30 02:35:24,807 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 171 [2018-01-30 02:35:24,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:35:24,810 INFO L225 Difference]: With dead ends: 1185 [2018-01-30 02:35:24,810 INFO L226 Difference]: Without dead ends: 1184 [2018-01-30 02:35:24,813 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6098 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1726, Invalid=18580, Unknown=0, NotChecked=0, Total=20306 [2018-01-30 02:35:24,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2018-01-30 02:35:24,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 458. [2018-01-30 02:35:24,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-01-30 02:35:24,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 501 transitions. [2018-01-30 02:35:24,854 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 501 transitions. Word has length 171 [2018-01-30 02:35:24,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:35:24,855 INFO L432 AbstractCegarLoop]: Abstraction has 458 states and 501 transitions. [2018-01-30 02:35:24,855 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-01-30 02:35:24,855 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 501 transitions. [2018-01-30 02:35:24,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-01-30 02:35:24,857 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:35:24,857 INFO L350 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:35:24,857 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:35:24,857 INFO L82 PathProgramCache]: Analyzing trace with hash 434745258, now seen corresponding path program 8 times [2018-01-30 02:35:24,858 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:35:24,858 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:35:24,858 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:35:24,859 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:35:24,859 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:35:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:35:24,878 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:35:25,753 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 0 proven. 379 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2018-01-30 02:35:25,753 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:35:25,753 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:35:25,758 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 02:35:25,768 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:35:25,785 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:35:25,788 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:35:25,793 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:35:26,095 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-01-30 02:35:26,116 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:35:26,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 20] total 45 [2018-01-30 02:35:26,117 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-01-30 02:35:26,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-01-30 02:35:26,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1890, Unknown=0, NotChecked=0, Total=2070 [2018-01-30 02:35:26,118 INFO L87 Difference]: Start difference. First operand 458 states and 501 transitions. Second operand 46 states. [2018-01-30 02:35:30,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:35:30,569 INFO L93 Difference]: Finished difference Result 1281 states and 1387 transitions. [2018-01-30 02:35:30,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-01-30 02:35:30,569 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 179 [2018-01-30 02:35:30,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:35:30,573 INFO L225 Difference]: With dead ends: 1281 [2018-01-30 02:35:30,573 INFO L226 Difference]: Without dead ends: 1280 [2018-01-30 02:35:30,574 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5296 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1211, Invalid=14289, Unknown=0, NotChecked=0, Total=15500 [2018-01-30 02:35:30,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2018-01-30 02:35:30,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 391. [2018-01-30 02:35:30,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-01-30 02:35:30,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 425 transitions. [2018-01-30 02:35:30,615 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 425 transitions. Word has length 179 [2018-01-30 02:35:30,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:35:30,615 INFO L432 AbstractCegarLoop]: Abstraction has 391 states and 425 transitions. [2018-01-30 02:35:30,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-01-30 02:35:30,616 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 425 transitions. [2018-01-30 02:35:30,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-01-30 02:35:30,617 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:35:30,617 INFO L350 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:35:30,617 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:35:30,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1859389809, now seen corresponding path program 11 times [2018-01-30 02:35:30,618 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:35:30,618 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:35:30,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:35:30,619 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:35:30,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:35:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:35:30,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:35:31,787 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 125 proven. 414 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2018-01-30 02:35:31,787 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:35:31,787 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:35:31,792 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 02:35:31,801 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:35:31,803 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:35:31,806 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:35:31,808 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:35:31,811 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:35:31,814 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:35:31,818 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:35:31,822 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:35:31,826 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:35:31,831 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:35:31,833 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:35:31,837 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:35:31,840 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-30 02:35:31,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:35:31,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:35:31,856 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 02:35:32,576 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2018-01-30 02:35:32,597 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:35:32,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24] total 52 [2018-01-30 02:35:32,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-01-30 02:35:32,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-01-30 02:35:32,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=2532, Unknown=0, NotChecked=0, Total=2756 [2018-01-30 02:35:32,598 INFO L87 Difference]: Start difference. First operand 391 states and 425 transitions. Second operand 53 states. [2018-01-30 02:35:39,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:35:39,885 INFO L93 Difference]: Finished difference Result 1427 states and 1545 transitions. [2018-01-30 02:35:39,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-01-30 02:35:39,885 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 190 [2018-01-30 02:35:39,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:35:39,889 INFO L225 Difference]: With dead ends: 1427 [2018-01-30 02:35:39,889 INFO L226 Difference]: Without dead ends: 1426 [2018-01-30 02:35:39,891 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7399 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1981, Invalid=22511, Unknown=0, NotChecked=0, Total=24492 [2018-01-30 02:35:39,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2018-01-30 02:35:39,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 503. [2018-01-30 02:35:39,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2018-01-30 02:35:39,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 550 transitions. [2018-01-30 02:35:39,937 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 550 transitions. Word has length 190 [2018-01-30 02:35:39,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:35:39,937 INFO L432 AbstractCegarLoop]: Abstraction has 503 states and 550 transitions. [2018-01-30 02:35:39,937 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-01-30 02:35:39,938 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 550 transitions. [2018-01-30 02:35:39,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-01-30 02:35:39,940 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:35:39,940 INFO L350 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:35:39,940 INFO L371 AbstractCegarLoop]: === Iteration 32 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:35:39,940 INFO L82 PathProgramCache]: Analyzing trace with hash 644995927, now seen corresponding path program 9 times [2018-01-30 02:35:39,940 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:35:39,941 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:35:39,941 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:35:39,941 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:35:39,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:35:39,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:35:39,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:35:40,815 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 7 proven. 540 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2018-01-30 02:35:40,816 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:35:40,816 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:35:40,820 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 02:35:40,832 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:35:40,834 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:35:40,837 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:35:40,840 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:35:40,843 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:35:40,846 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:35:40,849 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:35:40,853 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:35:40,857 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:35:40,862 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:35:40,863 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:35:40,866 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:35:40,991 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 0 proven. 471 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2018-01-30 02:35:41,025 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:35:41,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 33 [2018-01-30 02:35:41,025 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-30 02:35:41,026 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-30 02:35:41,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=931, Unknown=0, NotChecked=0, Total=1122 [2018-01-30 02:35:41,026 INFO L87 Difference]: Start difference. First operand 503 states and 550 transitions. Second operand 34 states. [2018-01-30 02:35:41,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:35:41,968 INFO L93 Difference]: Finished difference Result 688 states and 748 transitions. [2018-01-30 02:35:41,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-01-30 02:35:41,968 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 198 [2018-01-30 02:35:41,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:35:41,970 INFO L225 Difference]: With dead ends: 688 [2018-01-30 02:35:41,970 INFO L226 Difference]: Without dead ends: 687 [2018-01-30 02:35:41,971 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1235 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=738, Invalid=3294, Unknown=0, NotChecked=0, Total=4032 [2018-01-30 02:35:41,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-01-30 02:35:42,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 419. [2018-01-30 02:35:42,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-01-30 02:35:42,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 455 transitions. [2018-01-30 02:35:42,012 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 455 transitions. Word has length 198 [2018-01-30 02:35:42,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:35:42,012 INFO L432 AbstractCegarLoop]: Abstraction has 419 states and 455 transitions. [2018-01-30 02:35:42,012 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-30 02:35:42,013 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 455 transitions. [2018-01-30 02:35:42,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-01-30 02:35:42,014 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:35:42,015 INFO L350 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:35:42,015 INFO L371 AbstractCegarLoop]: === Iteration 33 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:35:42,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1693773537, now seen corresponding path program 10 times [2018-01-30 02:35:42,015 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:35:42,015 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:35:42,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:35:42,016 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:35:42,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:35:42,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:35:42,032 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:35:42,756 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 565 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2018-01-30 02:35:42,756 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:35:42,756 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:35:42,761 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 02:35:42,800 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:35:42,804 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:35:43,206 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-01-30 02:35:43,227 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:35:43,227 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 22] total 51 [2018-01-30 02:35:43,227 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-01-30 02:35:43,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-01-30 02:35:43,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=2419, Unknown=0, NotChecked=0, Total=2652 [2018-01-30 02:35:43,228 INFO L87 Difference]: Start difference. First operand 419 states and 455 transitions. Second operand 52 states. [2018-01-30 02:35:47,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:35:47,920 INFO L93 Difference]: Finished difference Result 1695 states and 1835 transitions. [2018-01-30 02:35:47,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-01-30 02:35:47,921 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 208 [2018-01-30 02:35:47,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:35:47,925 INFO L225 Difference]: With dead ends: 1695 [2018-01-30 02:35:47,925 INFO L226 Difference]: Without dead ends: 1694 [2018-01-30 02:35:47,927 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6908 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1494, Invalid=18246, Unknown=0, NotChecked=0, Total=19740 [2018-01-30 02:35:47,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1694 states. [2018-01-30 02:35:47,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1694 to 539. [2018-01-30 02:35:47,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-01-30 02:35:47,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 589 transitions. [2018-01-30 02:35:47,962 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 589 transitions. Word has length 208 [2018-01-30 02:35:47,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:35:47,963 INFO L432 AbstractCegarLoop]: Abstraction has 539 states and 589 transitions. [2018-01-30 02:35:47,963 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-01-30 02:35:47,963 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 589 transitions. [2018-01-30 02:35:47,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-01-30 02:35:47,965 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:35:47,965 INFO L350 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:35:47,965 INFO L371 AbstractCegarLoop]: === Iteration 34 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:35:47,965 INFO L82 PathProgramCache]: Analyzing trace with hash 967372560, now seen corresponding path program 12 times [2018-01-30 02:35:47,965 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:35:47,965 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:35:47,966 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:35:47,966 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:35:47,966 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:35:47,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:35:47,976 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:35:48,767 INFO L134 CoverageAnalysis]: Checked inductivity of 935 backedges. 65 proven. 510 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2018-01-30 02:35:48,768 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:35:48,768 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:35:48,781 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 02:35:48,796 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:35:48,812 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:35:48,828 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:35:48,844 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:35:48,860 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:35:48,876 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:35:48,892 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:35:48,908 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:35:48,924 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:35:48,940 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:35:48,956 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:35:48,969 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:35:48,975 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:35:48,991 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-30 02:35:48,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:35:49,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:35:49,071 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 02:35:50,238 INFO L134 CoverageAnalysis]: Checked inductivity of 935 backedges. 0 proven. 445 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-01-30 02:35:50,259 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:35:50,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26] total 54 [2018-01-30 02:35:50,259 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-01-30 02:35:50,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-01-30 02:35:50,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=2652, Unknown=0, NotChecked=0, Total=2970 [2018-01-30 02:35:50,260 INFO L87 Difference]: Start difference. First operand 539 states and 589 transitions. Second operand 55 states. [2018-01-30 02:35:56,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:35:56,883 INFO L93 Difference]: Finished difference Result 1692 states and 1832 transitions. [2018-01-30 02:35:56,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-01-30 02:35:56,883 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 209 [2018-01-30 02:35:56,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:35:56,889 INFO L225 Difference]: With dead ends: 1692 [2018-01-30 02:35:56,890 INFO L226 Difference]: Without dead ends: 1691 [2018-01-30 02:35:56,894 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8643 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=4052, Invalid=24340, Unknown=0, NotChecked=0, Total=28392 [2018-01-30 02:35:56,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2018-01-30 02:35:56,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 455. [2018-01-30 02:35:56,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-01-30 02:35:56,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 494 transitions. [2018-01-30 02:35:56,943 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 494 transitions. Word has length 209 [2018-01-30 02:35:56,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:35:56,944 INFO L432 AbstractCegarLoop]: Abstraction has 455 states and 494 transitions. [2018-01-30 02:35:56,944 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-01-30 02:35:56,944 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 494 transitions. [2018-01-30 02:35:56,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-01-30 02:35:56,945 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:35:56,946 INFO L350 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:35:56,946 INFO L371 AbstractCegarLoop]: === Iteration 35 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:35:56,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1076474324, now seen corresponding path program 11 times [2018-01-30 02:35:56,946 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:35:56,946 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:35:56,947 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:35:56,947 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:35:56,947 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:35:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:35:56,969 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:35:58,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 125 proven. 887 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-01-30 02:35:58,245 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:35:58,245 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:35:58,251 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 02:35:58,263 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:35:58,278 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:35:58,293 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:35:58,296 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:35:58,300 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:35:58,303 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:35:58,308 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:35:58,312 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:35:58,317 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:35:58,323 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:35:58,329 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:35:58,336 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:35:58,338 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:35:58,343 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:35:59,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2018-01-30 02:35:59,862 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:35:59,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 24] total 65 [2018-01-30 02:35:59,862 INFO L409 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-01-30 02:35:59,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-01-30 02:35:59,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=3975, Unknown=0, NotChecked=0, Total=4290 [2018-01-30 02:35:59,863 INFO L87 Difference]: Start difference. First operand 455 states and 494 transitions. Second operand 66 states. [2018-01-30 02:36:06,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:36:06,572 INFO L93 Difference]: Finished difference Result 1985 states and 2149 transitions. [2018-01-30 02:36:06,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-01-30 02:36:06,572 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 227 [2018-01-30 02:36:06,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:36:06,577 INFO L225 Difference]: With dead ends: 1985 [2018-01-30 02:36:06,577 INFO L226 Difference]: Without dead ends: 1984 [2018-01-30 02:36:06,579 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9561 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1933, Invalid=24473, Unknown=0, NotChecked=0, Total=26406 [2018-01-30 02:36:06,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1984 states. [2018-01-30 02:36:06,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1984 to 584. [2018-01-30 02:36:06,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2018-01-30 02:36:06,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 638 transitions. [2018-01-30 02:36:06,616 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 638 transitions. Word has length 227 [2018-01-30 02:36:06,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:36:06,616 INFO L432 AbstractCegarLoop]: Abstraction has 584 states and 638 transitions. [2018-01-30 02:36:06,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-01-30 02:36:06,617 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 638 transitions. [2018-01-30 02:36:06,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-01-30 02:36:06,618 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:36:06,618 INFO L350 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:36:06,618 INFO L371 AbstractCegarLoop]: === Iteration 36 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:36:06,618 INFO L82 PathProgramCache]: Analyzing trace with hash 989034789, now seen corresponding path program 13 times [2018-01-30 02:36:06,618 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:36:06,618 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:36:06,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:36:06,619 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:36:06,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:36:06,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:36:06,633 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:36:07,446 WARN L143 SmtUtils]: Spent 120ms on a formula simplification that was a NOOP. DAG size: 12 [2018-01-30 02:36:08,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1133 backedges. 435 proven. 698 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:36:08,913 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:36:08,913 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:36:08,918 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:36:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:36:08,971 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:36:08,974 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-30 02:36:08,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:36:09,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:36:09,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 02:36:10,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1133 backedges. 0 proven. 539 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2018-01-30 02:36:10,466 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:36:10,466 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 27] total 77 [2018-01-30 02:36:10,466 INFO L409 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-01-30 02:36:10,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-01-30 02:36:10,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=402, Invalid=5604, Unknown=0, NotChecked=0, Total=6006 [2018-01-30 02:36:10,467 INFO L87 Difference]: Start difference. First operand 584 states and 638 transitions. Second operand 78 states. Received shutdown request... [2018-01-30 02:36:13,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-01-30 02:36:13,791 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 02:36:13,796 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 02:36:13,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 02:36:13 BasicIcfg [2018-01-30 02:36:13,797 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 02:36:13,798 INFO L168 Benchmark]: Toolchain (without parser) took 112888.83 ms. Allocated memory was 299.9 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 260.8 MB in the beginning and 788.0 MB in the end (delta: -527.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. [2018-01-30 02:36:13,799 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 299.9 MB. Free memory is still 264.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 02:36:13,799 INFO L168 Benchmark]: CACSL2BoogieTranslator took 221.34 ms. Allocated memory is still 299.9 MB. Free memory was 258.8 MB in the beginning and 250.8 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-01-30 02:36:13,799 INFO L168 Benchmark]: Boogie Preprocessor took 31.97 ms. Allocated memory is still 299.9 MB. Free memory was 250.8 MB in the beginning and 248.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-30 02:36:13,800 INFO L168 Benchmark]: RCFGBuilder took 272.65 ms. Allocated memory is still 299.9 MB. Free memory was 248.8 MB in the beginning and 231.8 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-30 02:36:13,800 INFO L168 Benchmark]: IcfgTransformer took 12042.49 ms. Allocated memory was 299.9 MB in the beginning and 1.1 GB in the end (delta: 832.0 MB). Free memory was 231.8 MB in the beginning and 255.4 MB in the end (delta: -23.6 MB). Peak memory consumption was 808.5 MB. Max. memory is 5.3 GB. [2018-01-30 02:36:13,800 INFO L168 Benchmark]: TraceAbstraction took 100308.46 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 865.1 MB). Free memory was 255.4 MB in the beginning and 788.0 MB in the end (delta: -532.6 MB). Peak memory consumption was 332.5 MB. Max. memory is 5.3 GB. [2018-01-30 02:36:13,804 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.26 ms. Allocated memory is still 299.9 MB. Free memory is still 264.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 221.34 ms. Allocated memory is still 299.9 MB. Free memory was 258.8 MB in the beginning and 250.8 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.97 ms. Allocated memory is still 299.9 MB. Free memory was 250.8 MB in the beginning and 248.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 272.65 ms. Allocated memory is still 299.9 MB. Free memory was 248.8 MB in the beginning and 231.8 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * IcfgTransformer took 12042.49 ms. Allocated memory was 299.9 MB in the beginning and 1.1 GB in the end (delta: 832.0 MB). Free memory was 231.8 MB in the beginning and 255.4 MB in the end (delta: -23.6 MB). Peak memory consumption was 808.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 100308.46 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 865.1 MB). Free memory was 255.4 MB in the beginning and 788.0 MB in the end (delta: -532.6 MB). Peak memory consumption was 332.5 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 : 1005 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.680667 RENAME_VARIABLES(MILLISECONDS) : 0.233904 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.646378 PROJECTAWAY(MILLISECONDS) : 0.415040 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.120590 DISJOIN(MILLISECONDS) : 0.258216 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.253447 ADD_EQUALITY(MILLISECONDS) : 0.032460 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.056187 #CONJOIN_DISJUNCTIVE : 667 #RENAME_VARIABLES : 1481 #UNFREEZE : 0 #CONJOIN : 942 #PROJECTAWAY : 882 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 214 #RENAME_VARIABLES_DISJUNCTIVE : 1464 #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.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while BasicCegarLoop was constructing difference of abstraction (584states) and interpolant automaton (currently 45 states, 78 states before enhancement), while ReachableStatesComputation was computing reachable states (399 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 18). Cancelled while BasicCegarLoop was constructing difference of abstraction (584states) and interpolant automaton (currently 45 states, 78 states before enhancement), while ReachableStatesComputation was computing reachable states (399 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while BasicCegarLoop was constructing difference of abstraction (584states) and interpolant automaton (currently 45 states, 78 states before enhancement), while ReachableStatesComputation was computing reachable states (399 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 27). Cancelled while BasicCegarLoop was constructing difference of abstraction (584states) and interpolant automaton (currently 45 states, 78 states before enhancement), while ReachableStatesComputation was computing reachable states (399 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 23). Cancelled while BasicCegarLoop was constructing difference of abstraction (584states) and interpolant automaton (currently 45 states, 78 states before enhancement), while ReachableStatesComputation was computing reachable states (399 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 30). Cancelled while BasicCegarLoop was constructing difference of abstraction (584states) and interpolant automaton (currently 45 states, 78 states before enhancement), while ReachableStatesComputation was computing reachable states (399 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 61 locations, 6 error locations. TIMEOUT Result, 100.1s OverallTime, 36 OverallIterations, 12 TraceHistogramMax, 67.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2008 SDtfs, 14312 SDslu, 30441 SDs, 0 SdLazy, 55858 SolverSat, 3172 SolverUnsat, 29 SolverUnknown, 0 SolverNotchecked, 27.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5324 GetRequests, 3163 SyntacticMatches, 12 SemanticMatches, 2149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69080 ImplicationChecksByTransitivity, 55.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=584occurred in iteration=35, 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.7s AutomataMinimizationTime, 35 MinimizatonAttempts, 9749 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 27.9s InterpolantComputationTime, 7161 NumberOfCodeBlocks, 7086 NumberOfCodeBlocksAsserted, 152 NumberOfCheckSat, 7093 ConstructedInterpolants, 2 QuantifiedInterpolants, 8724563 SizeOfPredicates, 399 NumberOfNonLiveVariables, 5760 ConjunctsInSsa, 821 ConjunctsInUnsatCore, 68 InterpolantComputations, 7 PerfectInterpolantSequences, 9639/21222 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-30_02-36-13-826.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-01-30_02-36-13-826.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-01-30_02-36-13-826.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-01-30_02-36-13-826.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_02-36-13-826.csv Completed graceful shutdown