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-acfac67 [2018-01-29 00:48:50,606 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 00:48:50,608 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 00:48:50,625 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 00:48:50,625 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 00:48:50,626 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 00:48:50,627 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 00:48:50,629 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 00:48:50,631 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 00:48:50,632 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 00:48:50,633 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 00:48:50,633 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 00:48:50,634 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 00:48:50,635 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 00:48:50,636 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 00:48:50,639 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 00:48:50,641 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 00:48:50,643 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 00:48:50,645 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 00:48:50,646 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 00:48:50,649 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 00:48:50,649 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 00:48:50,649 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 00:48:50,650 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 00:48:50,651 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 00:48:50,653 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 00:48:50,653 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 00:48:50,654 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 00:48:50,654 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 00:48:50,654 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 00:48:50,655 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 00:48:50,655 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-29 00:48:50,664 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 00:48:50,664 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 00:48:50,665 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 00:48:50,665 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 00:48:50,665 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 00:48:50,665 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 00:48:50,665 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 00:48:50,666 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 00:48:50,666 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 00:48:50,666 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 00:48:50,667 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 00:48:50,667 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 00:48:50,667 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 00:48:50,667 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 00:48:50,667 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 00:48:50,667 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 00:48:50,668 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 00:48:50,668 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 00:48:50,668 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 00:48:50,668 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 00:48:50,668 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 00:48:50,669 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 00:48:50,669 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 00:48:50,669 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 00:48:50,669 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 00:48:50,669 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 00:48:50,670 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 00:48:50,670 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 00:48:50,670 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 00:48:50,670 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 00:48:50,670 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 00:48:50,671 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 00:48:50,671 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 00:48:50,672 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 00:48:50,711 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 00:48:50,724 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 00:48:50,729 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 00:48:50,730 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 00:48:50,731 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 00:48:50,732 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-29 00:48:50,878 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 00:48:50,886 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-29 00:48:50,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 00:48:50,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 00:48:50,896 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 00:48:50,897 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 12:48:50" (1/1) ... [2018-01-29 00:48:50,900 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 29.01 12:48:50, skipping insertion in model container [2018-01-29 00:48:50,901 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 12:48:50" (1/1) ... [2018-01-29 00:48:50,920 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 00:48:50,940 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 00:48:51,059 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 00:48:51,075 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 00:48:51,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 12:48:51 WrapperNode [2018-01-29 00:48:51,082 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 00:48:51,083 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 00:48:51,083 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 00:48:51,084 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 00:48:51,096 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 12:48:51" (1/1) ... [2018-01-29 00:48:51,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 12:48:51" (1/1) ... [2018-01-29 00:48:51,104 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 12:48:51" (1/1) ... [2018-01-29 00:48:51,105 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 12:48:51" (1/1) ... [2018-01-29 00:48:51,107 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 12:48:51" (1/1) ... [2018-01-29 00:48:51,111 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 12:48:51" (1/1) ... [2018-01-29 00:48:51,112 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 12:48:51" (1/1) ... [2018-01-29 00:48:51,113 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 00:48:51,114 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 00:48:51,114 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 00:48:51,114 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 00:48:51,115 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 12:48:51" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 00:48:51,171 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 00:48:51,171 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 00:48:51,171 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-29 00:48:51,172 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 00:48:51,172 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-29 00:48:51,172 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-29 00:48:51,172 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 00:48:51,172 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 00:48:51,172 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 00:48:51,172 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-29 00:48:51,172 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 00:48:51,172 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 00:48:51,172 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 00:48:51,371 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 00:48:51,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 12:48:51 BoogieIcfgContainer [2018-01-29 00:48:51,372 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 00:48:51,372 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-29 00:48:51,372 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-29 00:48:51,373 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-29 00:48:51,376 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 12:48:51" (1/1) ... [2018-01-29 00:48:51,384 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-29 00:48:51,385 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-29 00:48:51,385 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-29 00:48:51,441 INFO L218 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-29 00:48:51,491 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-29 00:49:00,773 INFO L311 AbstractInterpreter]: Visited 70 different actions 440 times. Merged at 46 different actions 244 times. Widened at 1 different actions 1 times. Found 21 fixpoints after 5 different actions. Largest state had 36 variables. [2018-01-29 00:49:00,776 INFO L226 apSepIcfgTransformer]: finished equality analysis [2018-01-29 00:49:00,789 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 1 [2018-01-29 00:49:00,790 INFO L238 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-29 00:49:00,790 INFO L239 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-29 00:49:00,791 INFO L241 apSepIcfgTransformer]: select infos: Set: ((select (select |v_#memory_int_1| v_foo_~b.base_2) (+ v_foo_~b.offset_2 v_foo_~i~1_6)), at (SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~1 * 1, 1); srcloc: L18')) [2018-01-29 00:49:00,795 INFO L544 PartitionManager]: partitioning result: [2018-01-29 00:49:00,795 INFO L549 PartitionManager]: location blocks for array group [#memory_int] [2018-01-29 00:49:00,796 INFO L558 PartitionManager]: at dimension 0 [2018-01-29 00:49:00,796 INFO L559 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-29 00:49:00,796 INFO L560 PartitionManager]: # location blocks :1 [2018-01-29 00:49:00,796 INFO L558 PartitionManager]: at dimension 1 [2018-01-29 00:49:00,796 INFO L559 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-29 00:49:00,797 INFO L560 PartitionManager]: # location blocks :1 [2018-01-29 00:49:00,798 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-29 00:49:00,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 29.01 12:49:00 BasicIcfg [2018-01-29 00:49:00,813 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-29 00:49:00,814 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 00:49:00,814 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 00:49:00,818 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 00:49:00,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 12:48:50" (1/4) ... [2018-01-29 00:49:00,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@494df0b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 12:49:00, skipping insertion in model container [2018-01-29 00:49:00,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 12:48:51" (2/4) ... [2018-01-29 00:49:00,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@494df0b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 12:49:00, skipping insertion in model container [2018-01-29 00:49:00,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 12:48:51" (3/4) ... [2018-01-29 00:49:00,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@494df0b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 12:49:00, skipping insertion in model container [2018-01-29 00:49:00,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 29.01 12:49:00" (4/4) ... [2018-01-29 00:49:00,823 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-29 00:49:00,833 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 00:49:00,842 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-29 00:49:00,942 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 00:49:00,942 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 00:49:00,942 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 00:49:00,943 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 00:49:00,943 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 00:49:00,943 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 00:49:00,943 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 00:49:00,943 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 00:49:00,944 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 00:49:00,958 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-01-29 00:49:00,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-29 00:49:00,964 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:00,965 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:00,965 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:00,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1068910584, now seen corresponding path program 1 times [2018-01-29 00:49:00,972 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:00,973 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:01,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:01,022 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:49:01,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:01,063 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:01,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:49:01,123 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 00:49:01,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-29 00:49:01,125 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 00:49:01,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 00:49:01,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 00:49:01,136 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 3 states. [2018-01-29 00:49:01,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:01,233 INFO L93 Difference]: Finished difference Result 133 states and 160 transitions. [2018-01-29 00:49:01,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 00:49:01,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-01-29 00:49:01,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:01,247 INFO L225 Difference]: With dead ends: 133 [2018-01-29 00:49:01,247 INFO L226 Difference]: Without dead ends: 78 [2018-01-29 00:49:01,252 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 00:49:01,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-29 00:49:01,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2018-01-29 00:49:01,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-29 00:49:01,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-01-29 00:49:01,301 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 9 [2018-01-29 00:49:01,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:01,301 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-01-29 00:49:01,301 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 00:49:01,302 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-01-29 00:49:01,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-29 00:49:01,303 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:01,303 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:01,303 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:01,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1115648547, now seen corresponding path program 1 times [2018-01-29 00:49:01,303 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:01,303 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:01,304 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:01,305 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:49:01,305 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:01,319 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:01,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:49:01,424 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 00:49:01,424 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 00:49:01,425 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 00:49:01,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 00:49:01,426 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-29 00:49:01,426 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 7 states. [2018-01-29 00:49:01,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:01,642 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2018-01-29 00:49:01,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 00:49:01,642 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-01-29 00:49:01,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:01,647 INFO L225 Difference]: With dead ends: 125 [2018-01-29 00:49:01,647 INFO L226 Difference]: Without dead ends: 124 [2018-01-29 00:49:01,648 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-29 00:49:01,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-29 00:49:01,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 67. [2018-01-29 00:49:01,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-29 00:49:01,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-01-29 00:49:01,659 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 18 [2018-01-29 00:49:01,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:01,659 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-01-29 00:49:01,660 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 00:49:01,660 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-01-29 00:49:01,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-29 00:49:01,661 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:01,661 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:01,661 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:01,661 INFO L82 PathProgramCache]: Analyzing trace with hash -225366126, now seen corresponding path program 1 times [2018-01-29 00:49:01,661 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:01,662 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:01,663 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:01,663 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:49:01,663 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:01,676 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:01,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:49:01,735 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 00:49:01,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 00:49:01,735 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 00:49:01,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 00:49:01,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 00:49:01,736 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 5 states. [2018-01-29 00:49:01,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:01,818 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-01-29 00:49:01,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 00:49:01,818 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-29 00:49:01,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:01,819 INFO L225 Difference]: With dead ends: 67 [2018-01-29 00:49:01,820 INFO L226 Difference]: Without dead ends: 66 [2018-01-29 00:49:01,820 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-29 00:49:01,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-29 00:49:01,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-01-29 00:49:01,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-29 00:49:01,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2018-01-29 00:49:01,827 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 19 [2018-01-29 00:49:01,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:01,828 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-01-29 00:49:01,828 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 00:49:01,828 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2018-01-29 00:49:01,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-29 00:49:01,829 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:01,829 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:01,829 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:01,829 INFO L82 PathProgramCache]: Analyzing trace with hash -225366124, now seen corresponding path program 1 times [2018-01-29 00:49:01,830 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:01,830 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:01,831 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:01,831 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:49:01,831 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:01,842 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:02,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:49:02,081 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 00:49:02,081 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 00:49:02,081 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 00:49:02,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 00:49:02,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-29 00:49:02,082 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 6 states. [2018-01-29 00:49:02,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:02,170 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-01-29 00:49:02,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 00:49:02,170 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-29 00:49:02,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:02,171 INFO L225 Difference]: With dead ends: 75 [2018-01-29 00:49:02,171 INFO L226 Difference]: Without dead ends: 74 [2018-01-29 00:49:02,172 INFO L533 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-29 00:49:02,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-29 00:49:02,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 67. [2018-01-29 00:49:02,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-29 00:49:02,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-01-29 00:49:02,180 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 19 [2018-01-29 00:49:02,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:02,181 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-01-29 00:49:02,181 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 00:49:02,181 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-01-29 00:49:02,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-29 00:49:02,182 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:02,182 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:02,182 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:02,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1537306562, now seen corresponding path program 1 times [2018-01-29 00:49:02,183 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:02,183 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:02,184 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:02,184 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:49:02,184 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:02,191 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:02,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:49:02,237 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:02,237 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:02,251 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:49:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:02,280 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:02,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:49:02,402 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 00:49:02,402 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2018-01-29 00:49:02,402 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 00:49:02,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 00:49:02,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-29 00:49:02,403 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 8 states. [2018-01-29 00:49:02,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:02,608 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2018-01-29 00:49:02,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 00:49:02,608 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-29 00:49:02,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:02,609 INFO L225 Difference]: With dead ends: 106 [2018-01-29 00:49:02,610 INFO L226 Difference]: Without dead ends: 85 [2018-01-29 00:49:02,610 INFO L533 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-29 00:49:02,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-29 00:49:02,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 75. [2018-01-29 00:49:02,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-29 00:49:02,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2018-01-29 00:49:02,620 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 19 [2018-01-29 00:49:02,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:02,620 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2018-01-29 00:49:02,620 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 00:49:02,620 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2018-01-29 00:49:02,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-29 00:49:02,622 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:02,623 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:02,623 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:02,623 INFO L82 PathProgramCache]: Analyzing trace with hash 184823418, now seen corresponding path program 1 times [2018-01-29 00:49:02,623 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:02,623 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:02,624 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:02,625 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:49:02,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:02,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:02,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:49:02,668 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:02,668 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:02,676 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:49:02,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:02,691 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:02,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:49:02,744 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:02,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-01-29 00:49:02,744 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 00:49:02,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 00:49:02,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 00:49:02,745 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand 5 states. [2018-01-29 00:49:02,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:02,808 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2018-01-29 00:49:02,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 00:49:02,808 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-01-29 00:49:02,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:02,809 INFO L225 Difference]: With dead ends: 96 [2018-01-29 00:49:02,809 INFO L226 Difference]: Without dead ends: 95 [2018-01-29 00:49:02,809 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-29 00:49:02,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-29 00:49:02,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2018-01-29 00:49:02,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-29 00:49:02,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2018-01-29 00:49:02,818 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 27 [2018-01-29 00:49:02,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:02,819 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2018-01-29 00:49:02,819 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 00:49:02,819 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2018-01-29 00:49:02,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-29 00:49:02,820 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:02,820 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:02,820 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:02,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1434559127, now seen corresponding path program 1 times [2018-01-29 00:49:02,820 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:02,820 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:02,821 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:02,821 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:49:02,821 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:02,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:02,832 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:03,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:49:03,061 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:03,061 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:03,074 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:49:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:03,090 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:03,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 00:49:03,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 00:49:03,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 00:49:03,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 00:49:03,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:49:03,196 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:03,196 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-01-29 00:49:03,196 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 00:49:03,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 00:49:03,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-29 00:49:03,197 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 9 states. [2018-01-29 00:49:03,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:03,417 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2018-01-29 00:49:03,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 00:49:03,418 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-01-29 00:49:03,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:03,420 INFO L225 Difference]: With dead ends: 95 [2018-01-29 00:49:03,420 INFO L226 Difference]: Without dead ends: 94 [2018-01-29 00:49:03,420 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-01-29 00:49:03,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-29 00:49:03,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2018-01-29 00:49:03,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-29 00:49:03,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2018-01-29 00:49:03,429 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 28 [2018-01-29 00:49:03,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:03,429 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2018-01-29 00:49:03,429 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 00:49:03,430 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2018-01-29 00:49:03,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-29 00:49:03,431 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:03,431 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:03,431 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:03,431 INFO L82 PathProgramCache]: Analyzing trace with hash -123801987, now seen corresponding path program 2 times [2018-01-29 00:49:03,432 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:03,432 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:03,433 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:03,433 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:49:03,433 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:03,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:03,521 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:49:03,521 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:03,522 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:03,528 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 00:49:03,538 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:03,542 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:03,543 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:49:03,545 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:03,655 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:49:03,676 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 00:49:03,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 16 [2018-01-29 00:49:03,677 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-29 00:49:03,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-29 00:49:03,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-01-29 00:49:03,677 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 16 states. [2018-01-29 00:49:03,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:03,922 INFO L93 Difference]: Finished difference Result 196 states and 214 transitions. [2018-01-29 00:49:03,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-29 00:49:03,922 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2018-01-29 00:49:03,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:03,923 INFO L225 Difference]: With dead ends: 196 [2018-01-29 00:49:03,923 INFO L226 Difference]: Without dead ends: 126 [2018-01-29 00:49:03,924 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2018-01-29 00:49:03,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-29 00:49:03,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 112. [2018-01-29 00:49:03,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-29 00:49:03,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2018-01-29 00:49:03,931 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 36 [2018-01-29 00:49:03,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:03,931 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2018-01-29 00:49:03,931 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-29 00:49:03,931 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2018-01-29 00:49:03,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-29 00:49:03,933 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:03,933 INFO L330 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:03,933 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:03,933 INFO L82 PathProgramCache]: Analyzing trace with hash 729468996, now seen corresponding path program 1 times [2018-01-29 00:49:03,933 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:03,933 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:03,934 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:03,934 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:49:03,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:03,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:03,943 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:03,985 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:49:03,986 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:03,986 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:03,994 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:49:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:04,005 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:04,027 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:49:04,049 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:04,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-01-29 00:49:04,050 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 00:49:04,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 00:49:04,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-29 00:49:04,050 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand 9 states. [2018-01-29 00:49:04,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:04,127 INFO L93 Difference]: Finished difference Result 157 states and 173 transitions. [2018-01-29 00:49:04,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 00:49:04,127 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-01-29 00:49:04,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:04,129 INFO L225 Difference]: With dead ends: 157 [2018-01-29 00:49:04,129 INFO L226 Difference]: Without dead ends: 137 [2018-01-29 00:49:04,129 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-01-29 00:49:04,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-29 00:49:04,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 122. [2018-01-29 00:49:04,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-29 00:49:04,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2018-01-29 00:49:04,140 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 37 [2018-01-29 00:49:04,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:04,141 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2018-01-29 00:49:04,141 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 00:49:04,141 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2018-01-29 00:49:04,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-29 00:49:04,143 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:04,143 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:04,143 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:04,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1381672071, now seen corresponding path program 1 times [2018-01-29 00:49:04,143 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:04,144 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:04,144 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:04,145 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:49:04,145 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:04,156 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:04,228 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-29 00:49:04,228 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:04,228 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:04,233 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:49:04,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:04,245 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:04,257 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-29 00:49:04,277 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:04,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-01-29 00:49:04,278 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 00:49:04,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 00:49:04,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-29 00:49:04,278 INFO L87 Difference]: Start difference. First operand 122 states and 134 transitions. Second operand 7 states. [2018-01-29 00:49:04,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:04,368 INFO L93 Difference]: Finished difference Result 152 states and 168 transitions. [2018-01-29 00:49:04,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 00:49:04,368 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-01-29 00:49:04,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:04,369 INFO L225 Difference]: With dead ends: 152 [2018-01-29 00:49:04,369 INFO L226 Difference]: Without dead ends: 151 [2018-01-29 00:49:04,370 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-01-29 00:49:04,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-01-29 00:49:04,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 130. [2018-01-29 00:49:04,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-29 00:49:04,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2018-01-29 00:49:04,378 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 46 [2018-01-29 00:49:04,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:04,378 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2018-01-29 00:49:04,378 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 00:49:04,378 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2018-01-29 00:49:04,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-29 00:49:04,379 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:04,380 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:04,380 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:04,380 INFO L82 PathProgramCache]: Analyzing trace with hash -117838294, now seen corresponding path program 1 times [2018-01-29 00:49:04,380 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:04,380 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:04,381 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:04,381 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:49:04,381 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:04,390 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:04,658 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-29 00:49:04,658 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:04,658 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:04,668 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:49:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:04,684 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:04,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 00:49:04,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 00:49:04,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 00:49:04,692 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 00:49:04,777 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-29 00:49:04,798 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:04,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-01-29 00:49:04,799 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-29 00:49:04,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-29 00:49:04,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-01-29 00:49:04,799 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 13 states. [2018-01-29 00:49:05,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:05,049 INFO L93 Difference]: Finished difference Result 151 states and 167 transitions. [2018-01-29 00:49:05,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-29 00:49:05,049 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2018-01-29 00:49:05,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:05,050 INFO L225 Difference]: With dead ends: 151 [2018-01-29 00:49:05,050 INFO L226 Difference]: Without dead ends: 150 [2018-01-29 00:49:05,051 INFO L533 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-29 00:49:05,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-29 00:49:05,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 131. [2018-01-29 00:49:05,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-01-29 00:49:05,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 144 transitions. [2018-01-29 00:49:05,057 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 144 transitions. Word has length 47 [2018-01-29 00:49:05,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:05,058 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 144 transitions. [2018-01-29 00:49:05,058 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-29 00:49:05,058 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 144 transitions. [2018-01-29 00:49:05,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-29 00:49:05,058 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:05,058 INFO L330 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:05,059 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:05,059 INFO L82 PathProgramCache]: Analyzing trace with hash 154524538, now seen corresponding path program 2 times [2018-01-29 00:49:05,059 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:05,059 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:05,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:05,060 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:49:05,060 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:05,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:05,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:05,135 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:49:05,135 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:05,135 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:05,145 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 00:49:05,152 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:05,155 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:49:05,156 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:05,215 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-01-29 00:49:05,249 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 00:49:05,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2018-01-29 00:49:05,250 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-29 00:49:05,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-29 00:49:05,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=100, Unknown=1, NotChecked=0, Total=132 [2018-01-29 00:49:05,250 INFO L87 Difference]: Start difference. First operand 131 states and 144 transitions. Second operand 12 states. [2018-01-29 00:49:05,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:05,710 INFO L93 Difference]: Finished difference Result 174 states and 195 transitions. [2018-01-29 00:49:05,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-29 00:49:05,710 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-01-29 00:49:05,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:05,712 INFO L225 Difference]: With dead ends: 174 [2018-01-29 00:49:05,712 INFO L226 Difference]: Without dead ends: 143 [2018-01-29 00:49:05,713 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=363, Unknown=1, NotChecked=0, Total=506 [2018-01-29 00:49:05,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-29 00:49:05,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 133. [2018-01-29 00:49:05,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-29 00:49:05,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 147 transitions. [2018-01-29 00:49:05,722 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 147 transitions. Word has length 47 [2018-01-29 00:49:05,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:05,723 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 147 transitions. [2018-01-29 00:49:05,723 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-29 00:49:05,723 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 147 transitions. [2018-01-29 00:49:05,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-29 00:49:05,724 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:05,724 INFO L330 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:05,724 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:05,724 INFO L82 PathProgramCache]: Analyzing trace with hash -739772656, now seen corresponding path program 2 times [2018-01-29 00:49:05,724 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:05,724 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:05,725 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:05,725 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:49:05,726 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:05,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:05,734 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:05,889 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-29 00:49:05,889 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:05,889 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:05,897 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 00:49:05,904 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:05,911 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:05,913 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:49:05,915 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:06,060 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 36 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:49:06,080 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:06,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 25 [2018-01-29 00:49:06,080 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-29 00:49:06,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-29 00:49:06,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2018-01-29 00:49:06,081 INFO L87 Difference]: Start difference. First operand 133 states and 147 transitions. Second operand 25 states. [2018-01-29 00:49:06,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:06,754 INFO L93 Difference]: Finished difference Result 275 states and 303 transitions. [2018-01-29 00:49:06,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-29 00:49:06,754 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 55 [2018-01-29 00:49:06,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:06,756 INFO L225 Difference]: With dead ends: 275 [2018-01-29 00:49:06,756 INFO L226 Difference]: Without dead ends: 194 [2018-01-29 00:49:06,757 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=359, Invalid=1621, Unknown=0, NotChecked=0, Total=1980 [2018-01-29 00:49:06,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-29 00:49:06,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 170. [2018-01-29 00:49:06,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-01-29 00:49:06,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 186 transitions. [2018-01-29 00:49:06,768 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 186 transitions. Word has length 55 [2018-01-29 00:49:06,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:06,768 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 186 transitions. [2018-01-29 00:49:06,768 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-29 00:49:06,768 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 186 transitions. [2018-01-29 00:49:06,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-29 00:49:06,769 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:06,769 INFO L330 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:06,769 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:06,769 INFO L82 PathProgramCache]: Analyzing trace with hash 245732012, now seen corresponding path program 1 times [2018-01-29 00:49:06,769 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:06,769 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:06,770 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:06,770 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:49:06,770 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:06,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:06,840 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-01-29 00:49:06,840 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:06,840 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:06,846 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:49:06,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:06,858 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:06,957 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 00:49:06,979 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:06,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11] total 15 [2018-01-29 00:49:06,979 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-29 00:49:06,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-29 00:49:06,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-01-29 00:49:06,980 INFO L87 Difference]: Start difference. First operand 170 states and 186 transitions. Second operand 15 states. [2018-01-29 00:49:07,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:07,168 INFO L93 Difference]: Finished difference Result 209 states and 231 transitions. [2018-01-29 00:49:07,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-29 00:49:07,169 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2018-01-29 00:49:07,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:07,170 INFO L225 Difference]: With dead ends: 209 [2018-01-29 00:49:07,170 INFO L226 Difference]: Without dead ends: 197 [2018-01-29 00:49:07,171 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2018-01-29 00:49:07,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-01-29 00:49:07,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 187. [2018-01-29 00:49:07,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-29 00:49:07,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 205 transitions. [2018-01-29 00:49:07,181 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 205 transitions. Word has length 59 [2018-01-29 00:49:07,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:07,181 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 205 transitions. [2018-01-29 00:49:07,181 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-29 00:49:07,181 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 205 transitions. [2018-01-29 00:49:07,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-29 00:49:07,182 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:07,182 INFO L330 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:07,182 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:07,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1928929082, now seen corresponding path program 3 times [2018-01-29 00:49:07,182 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:07,182 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:07,183 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:07,183 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:49:07,183 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:07,191 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:07,311 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-29 00:49:07,311 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:07,312 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:07,316 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 00:49:07,322 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:49:07,326 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:49:07,328 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:49:07,329 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:49:07,331 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:07,488 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-29 00:49:07,509 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:07,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14] total 21 [2018-01-29 00:49:07,509 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-29 00:49:07,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-29 00:49:07,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2018-01-29 00:49:07,510 INFO L87 Difference]: Start difference. First operand 187 states and 205 transitions. Second operand 22 states. [2018-01-29 00:49:08,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:08,350 INFO L93 Difference]: Finished difference Result 295 states and 324 transitions. [2018-01-29 00:49:08,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-01-29 00:49:08,350 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 65 [2018-01-29 00:49:08,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:08,352 INFO L225 Difference]: With dead ends: 295 [2018-01-29 00:49:08,352 INFO L226 Difference]: Without dead ends: 294 [2018-01-29 00:49:08,353 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=377, Invalid=2379, Unknown=0, NotChecked=0, Total=2756 [2018-01-29 00:49:08,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-01-29 00:49:08,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 234. [2018-01-29 00:49:08,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-01-29 00:49:08,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 257 transitions. [2018-01-29 00:49:08,368 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 257 transitions. Word has length 65 [2018-01-29 00:49:08,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:08,368 INFO L432 AbstractCegarLoop]: Abstraction has 234 states and 257 transitions. [2018-01-29 00:49:08,368 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-29 00:49:08,369 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 257 transitions. [2018-01-29 00:49:08,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-29 00:49:08,370 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:08,370 INFO L330 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:08,370 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:08,370 INFO L82 PathProgramCache]: Analyzing trace with hash 332741067, now seen corresponding path program 2 times [2018-01-29 00:49:08,370 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:08,370 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:08,371 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:08,371 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:49:08,371 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:08,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:08,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:08,847 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-29 00:49:08,847 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:08,847 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:08,852 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 00:49:08,859 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:08,864 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:08,865 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:49:08,867 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:08,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 00:49:08,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 00:49:08,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 00:49:08,873 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 00:49:09,012 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-29 00:49:09,033 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:09,033 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-01-29 00:49:09,033 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-29 00:49:09,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-29 00:49:09,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2018-01-29 00:49:09,034 INFO L87 Difference]: Start difference. First operand 234 states and 257 transitions. Second operand 23 states. [2018-01-29 00:49:09,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:09,432 INFO L93 Difference]: Finished difference Result 292 states and 321 transitions. [2018-01-29 00:49:09,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-29 00:49:09,433 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 66 [2018-01-29 00:49:09,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:09,435 INFO L225 Difference]: With dead ends: 292 [2018-01-29 00:49:09,435 INFO L226 Difference]: Without dead ends: 291 [2018-01-29 00:49:09,436 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=226, Invalid=896, Unknown=0, NotChecked=0, Total=1122 [2018-01-29 00:49:09,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-01-29 00:49:09,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 244. [2018-01-29 00:49:09,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-01-29 00:49:09,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 268 transitions. [2018-01-29 00:49:09,455 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 268 transitions. Word has length 66 [2018-01-29 00:49:09,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:09,456 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 268 transitions. [2018-01-29 00:49:09,456 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-29 00:49:09,456 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 268 transitions. [2018-01-29 00:49:09,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-29 00:49:09,457 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:09,457 INFO L330 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:09,457 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:09,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1158666688, now seen corresponding path program 3 times [2018-01-29 00:49:09,458 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:09,458 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:09,459 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:09,459 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:49:09,459 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:09,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:09,470 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:10,033 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 45 proven. 26 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-29 00:49:10,033 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:10,033 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:10,039 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 00:49:10,047 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:49:10,050 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:49:10,053 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:49:10,054 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:49:10,056 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:10,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 00:49:10,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 00:49:10,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 00:49:10,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 00:49:10,306 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-01-29 00:49:10,326 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:10,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2018-01-29 00:49:10,326 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-29 00:49:10,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-29 00:49:10,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2018-01-29 00:49:10,327 INFO L87 Difference]: Start difference. First operand 244 states and 268 transitions. Second operand 29 states. [2018-01-29 00:49:10,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:10,940 INFO L93 Difference]: Finished difference Result 263 states and 286 transitions. [2018-01-29 00:49:10,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-29 00:49:10,940 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 75 [2018-01-29 00:49:10,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:10,941 INFO L225 Difference]: With dead ends: 263 [2018-01-29 00:49:10,941 INFO L226 Difference]: Without dead ends: 262 [2018-01-29 00:49:10,942 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=357, Invalid=1623, Unknown=0, NotChecked=0, Total=1980 [2018-01-29 00:49:10,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-01-29 00:49:10,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 213. [2018-01-29 00:49:10,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-01-29 00:49:10,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 232 transitions. [2018-01-29 00:49:10,955 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 232 transitions. Word has length 75 [2018-01-29 00:49:10,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:10,955 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 232 transitions. [2018-01-29 00:49:10,955 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-29 00:49:10,956 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 232 transitions. [2018-01-29 00:49:10,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-01-29 00:49:10,956 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:10,956 INFO L330 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:10,956 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:10,957 INFO L82 PathProgramCache]: Analyzing trace with hash -337153039, now seen corresponding path program 2 times [2018-01-29 00:49:10,957 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:10,957 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:10,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:10,958 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:49:10,958 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:10,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:11,042 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-01-29 00:49:11,042 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:11,042 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:11,053 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 00:49:11,060 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:11,068 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:11,070 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:49:11,072 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:11,225 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-29 00:49:11,255 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:11,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13] total 19 [2018-01-29 00:49:11,256 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-29 00:49:11,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-29 00:49:11,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2018-01-29 00:49:11,256 INFO L87 Difference]: Start difference. First operand 213 states and 232 transitions. Second operand 19 states. [2018-01-29 00:49:11,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:11,522 INFO L93 Difference]: Finished difference Result 251 states and 276 transitions. [2018-01-29 00:49:11,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-29 00:49:11,523 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 76 [2018-01-29 00:49:11,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:11,524 INFO L225 Difference]: With dead ends: 251 [2018-01-29 00:49:11,524 INFO L226 Difference]: Without dead ends: 211 [2018-01-29 00:49:11,525 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=250, Invalid=940, Unknown=0, NotChecked=0, Total=1190 [2018-01-29 00:49:11,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-01-29 00:49:11,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 176. [2018-01-29 00:49:11,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-01-29 00:49:11,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 192 transitions. [2018-01-29 00:49:11,538 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 192 transitions. Word has length 76 [2018-01-29 00:49:11,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:11,539 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 192 transitions. [2018-01-29 00:49:11,539 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-29 00:49:11,539 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 192 transitions. [2018-01-29 00:49:11,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-29 00:49:11,540 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:11,540 INFO L330 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-29 00:49:11,540 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:11,541 INFO L82 PathProgramCache]: Analyzing trace with hash -291573701, now seen corresponding path program 4 times [2018-01-29 00:49:11,541 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:11,541 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:11,541 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:11,542 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:49:11,542 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:11,554 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:11,717 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-29 00:49:11,717 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:11,717 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:11,722 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 00:49:11,737 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:49:11,738 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:11,826 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-29 00:49:11,846 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:11,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 25 [2018-01-29 00:49:11,846 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-29 00:49:11,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-29 00:49:11,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2018-01-29 00:49:11,847 INFO L87 Difference]: Start difference. First operand 176 states and 192 transitions. Second operand 26 states. [2018-01-29 00:49:12,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:12,788 INFO L93 Difference]: Finished difference Result 386 states and 419 transitions. [2018-01-29 00:49:12,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-01-29 00:49:12,789 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 84 [2018-01-29 00:49:12,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:12,790 INFO L225 Difference]: With dead ends: 386 [2018-01-29 00:49:12,790 INFO L226 Difference]: Without dead ends: 385 [2018-01-29 00:49:12,791 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1149 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=504, Invalid=3278, Unknown=0, NotChecked=0, Total=3782 [2018-01-29 00:49:12,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-01-29 00:49:12,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 251. [2018-01-29 00:49:12,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-01-29 00:49:12,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 277 transitions. [2018-01-29 00:49:12,805 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 277 transitions. Word has length 84 [2018-01-29 00:49:12,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:12,805 INFO L432 AbstractCegarLoop]: Abstraction has 251 states and 277 transitions. [2018-01-29 00:49:12,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-29 00:49:12,805 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 277 transitions. [2018-01-29 00:49:12,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-01-29 00:49:12,806 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:12,806 INFO L330 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:12,806 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:12,806 INFO L82 PathProgramCache]: Analyzing trace with hash -448849674, now seen corresponding path program 4 times [2018-01-29 00:49:12,806 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:12,806 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:12,807 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:12,807 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:49:12,807 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:12,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:13,101 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 23 proven. 50 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-01-29 00:49:13,101 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:13,101 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:13,107 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 00:49:13,128 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:49:13,131 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:13,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 00:49:13,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 00:49:13,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 00:49:13,147 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 00:49:13,442 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-01-29 00:49:13,463 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:13,463 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2018-01-29 00:49:13,463 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-29 00:49:13,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-29 00:49:13,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2018-01-29 00:49:13,464 INFO L87 Difference]: Start difference. First operand 251 states and 277 transitions. Second operand 29 states. [2018-01-29 00:49:15,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:15,644 INFO L93 Difference]: Finished difference Result 374 states and 406 transitions. [2018-01-29 00:49:15,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-01-29 00:49:15,644 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 85 [2018-01-29 00:49:15,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:15,647 INFO L225 Difference]: With dead ends: 374 [2018-01-29 00:49:15,647 INFO L226 Difference]: Without dead ends: 373 [2018-01-29 00:49:15,649 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1759 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=763, Invalid=5557, Unknown=0, NotChecked=0, Total=6320 [2018-01-29 00:49:15,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-01-29 00:49:15,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 220. [2018-01-29 00:49:15,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-01-29 00:49:15,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 240 transitions. [2018-01-29 00:49:15,666 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 240 transitions. Word has length 85 [2018-01-29 00:49:15,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:15,667 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 240 transitions. [2018-01-29 00:49:15,667 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-29 00:49:15,667 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 240 transitions. [2018-01-29 00:49:15,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-01-29 00:49:15,668 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:15,668 INFO L330 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:15,669 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:15,669 INFO L82 PathProgramCache]: Analyzing trace with hash 36527359, now seen corresponding path program 5 times [2018-01-29 00:49:15,669 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:15,669 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:15,670 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:15,670 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:49:15,670 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:15,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:15,681 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:16,001 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 30 proven. 86 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-01-29 00:49:16,001 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:16,001 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:16,006 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 00:49:16,013 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:16,015 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:16,017 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:16,020 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:16,022 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:16,026 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:16,027 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:49:16,029 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:16,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 00:49:16,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 00:49:16,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 00:49:16,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 00:49:16,303 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-01-29 00:49:16,323 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:16,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 32 [2018-01-29 00:49:16,323 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-29 00:49:16,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-29 00:49:16,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=954, Unknown=0, NotChecked=0, Total=1056 [2018-01-29 00:49:16,324 INFO L87 Difference]: Start difference. First operand 220 states and 240 transitions. Second operand 33 states. [2018-01-29 00:49:18,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:18,685 INFO L93 Difference]: Finished difference Result 505 states and 547 transitions. [2018-01-29 00:49:18,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-01-29 00:49:18,686 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 104 [2018-01-29 00:49:18,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:18,688 INFO L225 Difference]: With dead ends: 505 [2018-01-29 00:49:18,688 INFO L226 Difference]: Without dead ends: 503 [2018-01-29 00:49:18,691 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2424 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=934, Invalid=7622, Unknown=0, NotChecked=0, Total=8556 [2018-01-29 00:49:18,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-01-29 00:49:18,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 248. [2018-01-29 00:49:18,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-01-29 00:49:18,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 270 transitions. [2018-01-29 00:49:18,704 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 270 transitions. Word has length 104 [2018-01-29 00:49:18,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:18,704 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 270 transitions. [2018-01-29 00:49:18,704 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-29 00:49:18,705 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 270 transitions. [2018-01-29 00:49:18,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-01-29 00:49:18,705 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:18,706 INFO L330 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-29 00:49:18,706 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:18,706 INFO L82 PathProgramCache]: Analyzing trace with hash -705075217, now seen corresponding path program 5 times [2018-01-29 00:49:18,706 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:18,706 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:18,707 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:18,707 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:49:18,707 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:18,716 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:18,983 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-29 00:49:18,983 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:18,983 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:18,989 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 00:49:18,999 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:19,001 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:19,004 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:19,007 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:19,011 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:19,015 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:19,020 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:19,021 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:49:19,024 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:19,173 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-29 00:49:19,193 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:19,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 33 [2018-01-29 00:49:19,193 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-29 00:49:19,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-29 00:49:19,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1014, Unknown=0, NotChecked=0, Total=1122 [2018-01-29 00:49:19,194 INFO L87 Difference]: Start difference. First operand 248 states and 270 transitions. Second operand 34 states. [2018-01-29 00:49:21,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:21,001 INFO L93 Difference]: Finished difference Result 665 states and 720 transitions. [2018-01-29 00:49:21,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-01-29 00:49:21,001 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 122 [2018-01-29 00:49:21,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:21,003 INFO L225 Difference]: With dead ends: 665 [2018-01-29 00:49:21,003 INFO L226 Difference]: Without dead ends: 664 [2018-01-29 00:49:21,005 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2521 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=749, Invalid=7083, Unknown=0, NotChecked=0, Total=7832 [2018-01-29 00:49:21,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2018-01-29 00:49:21,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 332. [2018-01-29 00:49:21,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-01-29 00:49:21,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 364 transitions. [2018-01-29 00:49:21,022 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 364 transitions. Word has length 122 [2018-01-29 00:49:21,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:21,022 INFO L432 AbstractCegarLoop]: Abstraction has 332 states and 364 transitions. [2018-01-29 00:49:21,022 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-29 00:49:21,022 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 364 transitions. [2018-01-29 00:49:21,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-01-29 00:49:21,023 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:21,023 INFO L330 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:21,023 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:21,023 INFO L82 PathProgramCache]: Analyzing trace with hash -382494782, now seen corresponding path program 6 times [2018-01-29 00:49:21,023 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:21,023 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:21,024 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:21,024 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:49:21,024 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:21,034 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:21,558 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 108 proven. 132 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-01-29 00:49:21,558 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:21,558 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:21,565 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-29 00:49:21,575 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:49:21,585 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:49:21,588 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:49:21,591 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:49:21,595 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:49:21,598 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:49:21,602 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:49:21,603 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:49:21,606 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:21,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 00:49:21,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 00:49:21,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 00:49:21,612 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 00:49:22,013 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 37 proven. 132 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-01-29 00:49:22,034 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:22,034 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20] total 42 [2018-01-29 00:49:22,034 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-01-29 00:49:22,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-01-29 00:49:22,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1585, Unknown=0, NotChecked=0, Total=1806 [2018-01-29 00:49:22,035 INFO L87 Difference]: Start difference. First operand 332 states and 364 transitions. Second operand 43 states. [2018-01-29 00:49:23,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:23,164 INFO L93 Difference]: Finished difference Result 467 states and 507 transitions. [2018-01-29 00:49:23,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-29 00:49:23,165 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 123 [2018-01-29 00:49:23,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:23,167 INFO L225 Difference]: With dead ends: 467 [2018-01-29 00:49:23,167 INFO L226 Difference]: Without dead ends: 466 [2018-01-29 00:49:23,168 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=736, Invalid=3956, Unknown=0, NotChecked=0, Total=4692 [2018-01-29 00:49:23,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-01-29 00:49:23,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 283. [2018-01-29 00:49:23,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-01-29 00:49:23,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 308 transitions. [2018-01-29 00:49:23,182 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 308 transitions. Word has length 123 [2018-01-29 00:49:23,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:23,183 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 308 transitions. [2018-01-29 00:49:23,183 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-01-29 00:49:23,183 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 308 transitions. [2018-01-29 00:49:23,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-01-29 00:49:23,184 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:23,184 INFO L330 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:23,184 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:23,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1091959176, now seen corresponding path program 7 times [2018-01-29 00:49:23,184 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:23,184 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:23,185 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:23,185 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:49:23,185 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:23,195 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:23,576 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 0 proven. 159 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-01-29 00:49:23,577 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:23,577 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:23,581 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:49:23,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:23,602 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:23,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 00:49:23,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 00:49:23,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 00:49:23,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 00:49:23,955 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 0 proven. 159 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-01-29 00:49:23,975 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:23,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2018-01-29 00:49:23,976 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-29 00:49:23,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-29 00:49:23,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1012, Unknown=0, NotChecked=0, Total=1190 [2018-01-29 00:49:23,977 INFO L87 Difference]: Start difference. First operand 283 states and 308 transitions. Second operand 35 states. [2018-01-29 00:49:25,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:25,232 INFO L93 Difference]: Finished difference Result 657 states and 710 transitions. [2018-01-29 00:49:25,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-29 00:49:25,232 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 133 [2018-01-29 00:49:25,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:25,234 INFO L225 Difference]: With dead ends: 657 [2018-01-29 00:49:25,235 INFO L226 Difference]: Without dead ends: 656 [2018-01-29 00:49:25,236 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=493, Invalid=2477, Unknown=0, NotChecked=0, Total=2970 [2018-01-29 00:49:25,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2018-01-29 00:49:25,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 284. [2018-01-29 00:49:25,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-01-29 00:49:25,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 309 transitions. [2018-01-29 00:49:25,260 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 309 transitions. Word has length 133 [2018-01-29 00:49:25,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:25,260 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 309 transitions. [2018-01-29 00:49:25,260 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-29 00:49:25,260 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 309 transitions. [2018-01-29 00:49:25,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-01-29 00:49:25,262 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:25,262 INFO L330 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-29 00:49:25,262 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:25,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1092215134, now seen corresponding path program 6 times [2018-01-29 00:49:25,262 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:25,263 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:25,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:25,263 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:49:25,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:25,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:25,761 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-29 00:49:25,761 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:25,761 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:25,766 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-29 00:49:25,776 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:49:25,778 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:49:25,781 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:49:25,784 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:49:25,787 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:49:25,791 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:49:25,794 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:49:25,798 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:49:25,799 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:49:25,803 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:25,878 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-29 00:49:25,898 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:25,898 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 24 [2018-01-29 00:49:25,899 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-29 00:49:25,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-29 00:49:25,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2018-01-29 00:49:25,899 INFO L87 Difference]: Start difference. First operand 284 states and 309 transitions. Second operand 25 states. [2018-01-29 00:49:26,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:26,330 INFO L93 Difference]: Finished difference Result 429 states and 467 transitions. [2018-01-29 00:49:26,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-29 00:49:26,330 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 141 [2018-01-29 00:49:26,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:26,331 INFO L225 Difference]: With dead ends: 429 [2018-01-29 00:49:26,331 INFO L226 Difference]: Without dead ends: 428 [2018-01-29 00:49:26,332 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=386, Invalid=1594, Unknown=0, NotChecked=0, Total=1980 [2018-01-29 00:49:26,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-01-29 00:49:26,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 369. [2018-01-29 00:49:26,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-01-29 00:49:26,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 404 transitions. [2018-01-29 00:49:26,347 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 404 transitions. Word has length 141 [2018-01-29 00:49:26,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:26,347 INFO L432 AbstractCegarLoop]: Abstraction has 369 states and 404 transitions. [2018-01-29 00:49:26,347 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-29 00:49:26,347 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 404 transitions. [2018-01-29 00:49:26,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-01-29 00:49:26,348 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:26,348 INFO L330 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:26,348 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:26,349 INFO L82 PathProgramCache]: Analyzing trace with hash -501068749, now seen corresponding path program 8 times [2018-01-29 00:49:26,349 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:26,349 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:26,349 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:26,350 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:49:26,350 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:26,364 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:26,942 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 44 proven. 188 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2018-01-29 00:49:26,942 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:26,942 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:26,948 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 00:49:26,957 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:26,970 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:26,972 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:49:26,976 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:26,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 00:49:26,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 00:49:26,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 00:49:26,984 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 00:49:27,400 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-01-29 00:49:27,420 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:27,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 40 [2018-01-29 00:49:27,421 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-29 00:49:27,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-29 00:49:27,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1496, Unknown=0, NotChecked=0, Total=1640 [2018-01-29 00:49:27,422 INFO L87 Difference]: Start difference. First operand 369 states and 404 transitions. Second operand 41 states. [2018-01-29 00:49:31,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:31,311 INFO L93 Difference]: Finished difference Result 845 states and 915 transitions. [2018-01-29 00:49:31,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-01-29 00:49:31,312 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 142 [2018-01-29 00:49:31,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:31,314 INFO L225 Difference]: With dead ends: 845 [2018-01-29 00:49:31,314 INFO L226 Difference]: Without dead ends: 843 [2018-01-29 00:49:31,316 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4238 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1342, Invalid=13178, Unknown=0, NotChecked=0, Total=14520 [2018-01-29 00:49:31,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2018-01-29 00:49:31,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 320. [2018-01-29 00:49:31,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-01-29 00:49:31,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 348 transitions. [2018-01-29 00:49:31,333 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 348 transitions. Word has length 142 [2018-01-29 00:49:31,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:31,334 INFO L432 AbstractCegarLoop]: Abstraction has 320 states and 348 transitions. [2018-01-29 00:49:31,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-29 00:49:31,334 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 348 transitions. [2018-01-29 00:49:31,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-01-29 00:49:31,334 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:31,335 INFO L330 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-29 00:49:31,335 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:31,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1165341789, now seen corresponding path program 7 times [2018-01-29 00:49:31,335 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:31,335 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:31,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:31,336 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:49:31,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:31,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:31,669 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-29 00:49:31,669 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:31,669 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:31,674 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:49:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:31,698 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:31,869 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-29 00:49:31,888 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:31,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18] total 39 [2018-01-29 00:49:31,889 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-29 00:49:31,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-29 00:49:31,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1395, Unknown=0, NotChecked=0, Total=1560 [2018-01-29 00:49:31,890 INFO L87 Difference]: Start difference. First operand 320 states and 348 transitions. Second operand 40 states. [2018-01-29 00:49:32,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:32,978 INFO L93 Difference]: Finished difference Result 912 states and 986 transitions. [2018-01-29 00:49:32,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-29 00:49:32,978 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 160 [2018-01-29 00:49:32,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:32,981 INFO L225 Difference]: With dead ends: 912 [2018-01-29 00:49:32,982 INFO L226 Difference]: Without dead ends: 911 [2018-01-29 00:49:32,982 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1201 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=559, Invalid=3731, Unknown=0, NotChecked=0, Total=4290 [2018-01-29 00:49:32,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2018-01-29 00:49:33,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 328. [2018-01-29 00:49:33,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-01-29 00:49:33,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 357 transitions. [2018-01-29 00:49:33,001 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 357 transitions. Word has length 160 [2018-01-29 00:49:33,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:33,002 INFO L432 AbstractCegarLoop]: Abstraction has 328 states and 357 transitions. [2018-01-29 00:49:33,002 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-29 00:49:33,002 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 357 transitions. [2018-01-29 00:49:33,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-01-29 00:49:33,003 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:33,003 INFO L330 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:33,003 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:33,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1765856626, now seen corresponding path program 9 times [2018-01-29 00:49:33,003 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:33,003 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:33,004 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:33,004 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:49:33,004 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:33,013 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:33,557 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 51 proven. 254 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2018-01-29 00:49:33,557 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:33,557 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:33,562 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 00:49:33,571 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:49:33,573 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:49:33,576 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:49:33,578 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:49:33,581 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:49:33,584 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:49:33,587 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:49:33,590 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:49:33,592 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:49:33,595 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:33,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 00:49:33,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 00:49:33,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 00:49:33,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 00:49:34,052 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 51 proven. 254 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2018-01-29 00:49:34,072 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:34,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2018-01-29 00:49:34,073 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-01-29 00:49:34,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-01-29 00:49:34,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=1860, Unknown=0, NotChecked=0, Total=2162 [2018-01-29 00:49:34,073 INFO L87 Difference]: Start difference. First operand 328 states and 357 transitions. Second operand 47 states. [2018-01-29 00:49:34,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:34,692 INFO L93 Difference]: Finished difference Result 501 states and 546 transitions. [2018-01-29 00:49:34,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-29 00:49:34,692 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 161 [2018-01-29 00:49:34,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:34,695 INFO L225 Difference]: With dead ends: 501 [2018-01-29 00:49:34,695 INFO L226 Difference]: Without dead ends: 499 [2018-01-29 00:49:34,696 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1543 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=790, Invalid=3902, Unknown=0, NotChecked=0, Total=4692 [2018-01-29 00:49:34,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-01-29 00:49:34,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 355. [2018-01-29 00:49:34,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-01-29 00:49:34,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 386 transitions. [2018-01-29 00:49:34,726 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 386 transitions. Word has length 161 [2018-01-29 00:49:34,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:34,726 INFO L432 AbstractCegarLoop]: Abstraction has 355 states and 386 transitions. [2018-01-29 00:49:34,726 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-01-29 00:49:34,727 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 386 transitions. [2018-01-29 00:49:34,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-01-29 00:49:34,728 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:34,728 INFO L330 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:34,728 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:34,729 INFO L82 PathProgramCache]: Analyzing trace with hash -991764284, now seen corresponding path program 10 times [2018-01-29 00:49:34,729 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:34,729 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:34,730 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:34,730 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:49:34,730 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:34,745 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:35,471 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 109 proven. 328 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2018-01-29 00:49:35,471 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:35,472 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:35,476 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 00:49:35,503 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:49:35,507 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:35,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 00:49:35,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 00:49:35,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 00:49:35,512 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 00:49:36,099 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 0 proven. 284 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-01-29 00:49:36,119 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:36,119 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 22] total 48 [2018-01-29 00:49:36,120 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-01-29 00:49:36,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-01-29 00:49:36,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=2156, Unknown=0, NotChecked=0, Total=2352 [2018-01-29 00:49:36,120 INFO L87 Difference]: Start difference. First operand 355 states and 386 transitions. Second operand 49 states. [2018-01-29 00:49:41,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:41,711 INFO L93 Difference]: Finished difference Result 1185 states and 1283 transitions. [2018-01-29 00:49:41,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-01-29 00:49:41,711 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 171 [2018-01-29 00:49:41,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:41,714 INFO L225 Difference]: With dead ends: 1185 [2018-01-29 00:49:41,714 INFO L226 Difference]: Without dead ends: 1184 [2018-01-29 00:49:41,716 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6098 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1726, Invalid=18580, Unknown=0, NotChecked=0, Total=20306 [2018-01-29 00:49:41,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2018-01-29 00:49:41,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 458. [2018-01-29 00:49:41,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-01-29 00:49:41,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 501 transitions. [2018-01-29 00:49:41,758 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 501 transitions. Word has length 171 [2018-01-29 00:49:41,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:41,758 INFO L432 AbstractCegarLoop]: Abstraction has 458 states and 501 transitions. [2018-01-29 00:49:41,758 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-01-29 00:49:41,758 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 501 transitions. [2018-01-29 00:49:41,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-01-29 00:49:41,760 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:41,760 INFO L330 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-29 00:49:41,760 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:41,761 INFO L82 PathProgramCache]: Analyzing trace with hash 434745258, now seen corresponding path program 8 times [2018-01-29 00:49:41,761 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:41,761 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:41,761 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:41,762 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:49:41,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:41,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:42,381 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-29 00:49:42,381 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:42,381 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:42,386 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 00:49:42,396 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:42,412 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:42,415 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:49:42,418 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:42,666 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-29 00:49:42,686 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:42,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 20] total 45 [2018-01-29 00:49:42,686 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-01-29 00:49:42,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-01-29 00:49:42,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1890, Unknown=0, NotChecked=0, Total=2070 [2018-01-29 00:49:42,687 INFO L87 Difference]: Start difference. First operand 458 states and 501 transitions. Second operand 46 states. [2018-01-29 00:49:46,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:46,084 INFO L93 Difference]: Finished difference Result 1281 states and 1387 transitions. [2018-01-29 00:49:46,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-01-29 00:49:46,084 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 179 [2018-01-29 00:49:46,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:46,088 INFO L225 Difference]: With dead ends: 1281 [2018-01-29 00:49:46,088 INFO L226 Difference]: Without dead ends: 1280 [2018-01-29 00:49:46,091 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5296 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1211, Invalid=14289, Unknown=0, NotChecked=0, Total=15500 [2018-01-29 00:49:46,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2018-01-29 00:49:46,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 391. [2018-01-29 00:49:46,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-01-29 00:49:46,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 425 transitions. [2018-01-29 00:49:46,123 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 425 transitions. Word has length 179 [2018-01-29 00:49:46,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:46,123 INFO L432 AbstractCegarLoop]: Abstraction has 391 states and 425 transitions. [2018-01-29 00:49:46,123 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-01-29 00:49:46,123 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 425 transitions. [2018-01-29 00:49:46,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-01-29 00:49:46,125 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:46,125 INFO L330 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:49:46,125 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:46,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1859389809, now seen corresponding path program 11 times [2018-01-29 00:49:46,126 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:46,126 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:46,126 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:46,127 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:49:46,127 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:46,143 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:47,286 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 125 proven. 414 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2018-01-29 00:49:47,286 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:47,287 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:47,292 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 00:49:47,302 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:47,305 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:47,308 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:47,312 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:47,315 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:47,318 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:47,323 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:47,328 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:47,334 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:47,340 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:49:47,342 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:49:47,347 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:47,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 00:49:47,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 00:49:47,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 00:49:47,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 00:49:48,178 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2018-01-29 00:49:48,199 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:48,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24] total 52 [2018-01-29 00:49:48,200 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-01-29 00:49:48,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-01-29 00:49:48,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=2532, Unknown=0, NotChecked=0, Total=2756 [2018-01-29 00:49:48,200 INFO L87 Difference]: Start difference. First operand 391 states and 425 transitions. Second operand 53 states. [2018-01-29 00:49:54,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:54,488 INFO L93 Difference]: Finished difference Result 1427 states and 1545 transitions. [2018-01-29 00:49:54,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-01-29 00:49:54,489 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 190 [2018-01-29 00:49:54,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:54,492 INFO L225 Difference]: With dead ends: 1427 [2018-01-29 00:49:54,492 INFO L226 Difference]: Without dead ends: 1426 [2018-01-29 00:49:54,493 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7399 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1981, Invalid=22511, Unknown=0, NotChecked=0, Total=24492 [2018-01-29 00:49:54,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2018-01-29 00:49:54,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 503. [2018-01-29 00:49:54,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2018-01-29 00:49:54,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 550 transitions. [2018-01-29 00:49:54,537 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 550 transitions. Word has length 190 [2018-01-29 00:49:54,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:54,538 INFO L432 AbstractCegarLoop]: Abstraction has 503 states and 550 transitions. [2018-01-29 00:49:54,538 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-01-29 00:49:54,538 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 550 transitions. [2018-01-29 00:49:54,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-01-29 00:49:54,539 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:54,539 INFO L330 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-29 00:49:54,540 INFO L371 AbstractCegarLoop]: === Iteration 32 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:54,540 INFO L82 PathProgramCache]: Analyzing trace with hash 644995927, now seen corresponding path program 9 times [2018-01-29 00:49:54,540 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:54,540 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:54,541 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:54,541 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:49:54,541 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:54,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:54,556 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:55,124 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-29 00:49:55,125 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:55,125 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:49:55,130 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 00:49:55,143 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:49:55,149 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:49:55,152 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:49:55,155 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:49:55,159 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:49:55,163 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:49:55,167 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:49:55,171 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:49:55,176 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:49:55,181 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 00:49:55,182 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:49:55,187 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:55,390 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-29 00:49:55,410 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:55,410 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 33 [2018-01-29 00:49:55,411 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-29 00:49:55,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-29 00:49:55,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=931, Unknown=0, NotChecked=0, Total=1122 [2018-01-29 00:49:55,412 INFO L87 Difference]: Start difference. First operand 503 states and 550 transitions. Second operand 34 states. [2018-01-29 00:49:56,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:49:56,445 INFO L93 Difference]: Finished difference Result 688 states and 748 transitions. [2018-01-29 00:49:56,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-01-29 00:49:56,446 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 198 [2018-01-29 00:49:56,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:49:56,449 INFO L225 Difference]: With dead ends: 688 [2018-01-29 00:49:56,449 INFO L226 Difference]: Without dead ends: 687 [2018-01-29 00:49:56,450 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1235 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=738, Invalid=3294, Unknown=0, NotChecked=0, Total=4032 [2018-01-29 00:49:56,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-01-29 00:49:56,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 419. [2018-01-29 00:49:56,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-01-29 00:49:56,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 455 transitions. [2018-01-29 00:49:56,489 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 455 transitions. Word has length 198 [2018-01-29 00:49:56,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:49:56,490 INFO L432 AbstractCegarLoop]: Abstraction has 419 states and 455 transitions. [2018-01-29 00:49:56,490 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-29 00:49:56,490 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 455 transitions. [2018-01-29 00:49:56,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-01-29 00:49:56,492 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:49:56,492 INFO L330 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-29 00:49:56,492 INFO L371 AbstractCegarLoop]: === Iteration 33 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:49:56,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1693773537, now seen corresponding path program 10 times [2018-01-29 00:49:56,492 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:49:56,493 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:49:56,493 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:56,493 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:49:56,493 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:49:56,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:49:56,509 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:49:57,191 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-29 00:49:57,191 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:49:57,191 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-29 00:49:57,197 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 00:49:57,235 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:49:57,240 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:49:57,589 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-29 00:49:57,609 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:49:57,609 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 22] total 51 [2018-01-29 00:49:57,610 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-01-29 00:49:57,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-01-29 00:49:57,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=2419, Unknown=0, NotChecked=0, Total=2652 [2018-01-29 00:49:57,610 INFO L87 Difference]: Start difference. First operand 419 states and 455 transitions. Second operand 52 states. [2018-01-29 00:50:01,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:50:01,599 INFO L93 Difference]: Finished difference Result 1695 states and 1835 transitions. [2018-01-29 00:50:01,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-01-29 00:50:01,599 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 208 [2018-01-29 00:50:01,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:50:01,605 INFO L225 Difference]: With dead ends: 1695 [2018-01-29 00:50:01,605 INFO L226 Difference]: Without dead ends: 1694 [2018-01-29 00:50:01,608 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6908 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1494, Invalid=18246, Unknown=0, NotChecked=0, Total=19740 [2018-01-29 00:50:01,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1694 states. [2018-01-29 00:50:01,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1694 to 539. [2018-01-29 00:50:01,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-01-29 00:50:01,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 589 transitions. [2018-01-29 00:50:01,662 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 589 transitions. Word has length 208 [2018-01-29 00:50:01,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:50:01,663 INFO L432 AbstractCegarLoop]: Abstraction has 539 states and 589 transitions. [2018-01-29 00:50:01,663 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-01-29 00:50:01,663 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 589 transitions. [2018-01-29 00:50:01,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-01-29 00:50:01,665 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:50:01,665 INFO L330 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:50:01,665 INFO L371 AbstractCegarLoop]: === Iteration 34 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:50:01,665 INFO L82 PathProgramCache]: Analyzing trace with hash 967372560, now seen corresponding path program 12 times [2018-01-29 00:50:01,665 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:50:01,666 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:50:01,666 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:50:01,666 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:50:01,666 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:50:01,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:50:01,682 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:50:02,857 INFO L134 CoverageAnalysis]: Checked inductivity of 935 backedges. 65 proven. 510 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2018-01-29 00:50:02,858 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:50:02,858 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-29 00:50:02,877 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-29 00:50:02,890 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:50:02,893 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:50:02,896 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:50:02,898 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:50:02,902 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:50:02,905 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:50:02,908 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:50:02,912 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:50:02,922 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:50:02,928 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:50:02,944 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:50:02,956 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:50:02,962 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:50:02,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 00:50:02,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 00:50:02,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 00:50:02,982 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 00:50:03,970 INFO L134 CoverageAnalysis]: Checked inductivity of 935 backedges. 0 proven. 445 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-01-29 00:50:03,994 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:50:03,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26] total 54 [2018-01-29 00:50:03,995 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-01-29 00:50:03,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-01-29 00:50:03,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=2652, Unknown=0, NotChecked=0, Total=2970 [2018-01-29 00:50:03,995 INFO L87 Difference]: Start difference. First operand 539 states and 589 transitions. Second operand 55 states. [2018-01-29 00:50:09,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:50:09,869 INFO L93 Difference]: Finished difference Result 1692 states and 1832 transitions. [2018-01-29 00:50:09,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-01-29 00:50:09,870 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 209 [2018-01-29 00:50:09,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:50:09,873 INFO L225 Difference]: With dead ends: 1692 [2018-01-29 00:50:09,873 INFO L226 Difference]: Without dead ends: 1691 [2018-01-29 00:50:09,875 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8643 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=4052, Invalid=24340, Unknown=0, NotChecked=0, Total=28392 [2018-01-29 00:50:09,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2018-01-29 00:50:09,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 455. [2018-01-29 00:50:09,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-01-29 00:50:09,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 494 transitions. [2018-01-29 00:50:09,908 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 494 transitions. Word has length 209 [2018-01-29 00:50:09,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:50:09,908 INFO L432 AbstractCegarLoop]: Abstraction has 455 states and 494 transitions. [2018-01-29 00:50:09,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-01-29 00:50:09,908 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 494 transitions. [2018-01-29 00:50:09,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-01-29 00:50:09,909 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:50:09,909 INFO L330 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-29 00:50:09,910 INFO L371 AbstractCegarLoop]: === Iteration 35 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:50:09,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1076474324, now seen corresponding path program 11 times [2018-01-29 00:50:09,910 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:50:09,910 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:50:09,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:50:09,910 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:50:09,911 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:50:09,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:50:09,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:50:10,638 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-29 00:50:10,638 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:50:10,638 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-29 00:50:10,643 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 00:50:10,651 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:50:10,654 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:50:10,656 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:50:10,659 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:50:10,662 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:50:10,665 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:50:10,669 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:50:10,673 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:50:10,677 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:50:10,682 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:50:10,687 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:50:10,694 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 00:50:10,696 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:50:10,701 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:50:11,198 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-29 00:50:11,218 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:50:11,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 24] total 65 [2018-01-29 00:50:11,218 INFO L409 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-01-29 00:50:11,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-01-29 00:50:11,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=3975, Unknown=0, NotChecked=0, Total=4290 [2018-01-29 00:50:11,219 INFO L87 Difference]: Start difference. First operand 455 states and 494 transitions. Second operand 66 states. [2018-01-29 00:50:16,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:50:16,942 INFO L93 Difference]: Finished difference Result 1985 states and 2149 transitions. [2018-01-29 00:50:16,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-01-29 00:50:16,942 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 227 [2018-01-29 00:50:16,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:50:16,946 INFO L225 Difference]: With dead ends: 1985 [2018-01-29 00:50:16,946 INFO L226 Difference]: Without dead ends: 1984 [2018-01-29 00:50:16,948 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9561 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1933, Invalid=24473, Unknown=0, NotChecked=0, Total=26406 [2018-01-29 00:50:16,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1984 states. [2018-01-29 00:50:16,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1984 to 584. [2018-01-29 00:50:16,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2018-01-29 00:50:16,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 638 transitions. [2018-01-29 00:50:16,985 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 638 transitions. Word has length 227 [2018-01-29 00:50:16,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:50:16,985 INFO L432 AbstractCegarLoop]: Abstraction has 584 states and 638 transitions. [2018-01-29 00:50:16,985 INFO L433 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-01-29 00:50:16,985 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 638 transitions. [2018-01-29 00:50:16,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-01-29 00:50:16,986 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:50:16,987 INFO L330 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:50:16,987 INFO L371 AbstractCegarLoop]: === Iteration 36 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:50:16,987 INFO L82 PathProgramCache]: Analyzing trace with hash 989034789, now seen corresponding path program 13 times [2018-01-29 00:50:16,987 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:50:16,987 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:50:16,987 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:50:16,988 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:50:16,988 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:50:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:50:17,000 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:50:18,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1133 backedges. 435 proven. 698 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 00:50:18,666 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:50:18,666 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-29 00:50:18,671 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:50:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:50:18,708 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:50:18,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 00:50:18,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 00:50:18,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 00:50:18,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 00:50:19,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1133 backedges. 0 proven. 539 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2018-01-29 00:50:19,955 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:50:19,955 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 27] total 77 [2018-01-29 00:50:19,956 INFO L409 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-01-29 00:50:19,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-01-29 00:50:19,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=402, Invalid=5604, Unknown=0, NotChecked=0, Total=6006 [2018-01-29 00:50:19,956 INFO L87 Difference]: Start difference. First operand 584 states and 638 transitions. Second operand 78 states. [2018-01-29 00:50:30,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:50:30,151 INFO L93 Difference]: Finished difference Result 1982 states and 2146 transitions. [2018-01-29 00:50:30,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-01-29 00:50:30,151 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 228 [2018-01-29 00:50:30,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:50:30,155 INFO L225 Difference]: With dead ends: 1982 [2018-01-29 00:50:30,156 INFO L226 Difference]: Without dead ends: 1981 [2018-01-29 00:50:30,158 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 202 SyntacticMatches, 1 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12382 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=2729, Invalid=37071, Unknown=0, NotChecked=0, Total=39800 [2018-01-29 00:50:30,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2018-01-29 00:50:30,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 491. [2018-01-29 00:50:30,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2018-01-29 00:50:30,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 533 transitions. [2018-01-29 00:50:30,229 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 533 transitions. Word has length 228 [2018-01-29 00:50:30,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:50:30,230 INFO L432 AbstractCegarLoop]: Abstraction has 491 states and 533 transitions. [2018-01-29 00:50:30,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-01-29 00:50:30,230 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 533 transitions. [2018-01-29 00:50:30,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-01-29 00:50:30,231 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:50:30,232 INFO L330 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:50:30,232 INFO L371 AbstractCegarLoop]: === Iteration 37 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:50:30,232 INFO L82 PathProgramCache]: Analyzing trace with hash 15889173, now seen corresponding path program 12 times [2018-01-29 00:50:30,232 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:50:30,232 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:50:30,233 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:50:30,233 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 00:50:30,233 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:50:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:50:30,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 00:50:31,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1338 backedges. 0 proven. 799 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2018-01-29 00:50:31,140 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 00:50:31,140 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 00:50:31,145 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-29 00:50:31,158 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:50:31,161 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:50:31,163 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:50:31,166 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:50:31,169 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:50:31,173 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:50:31,176 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:50:31,180 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:50:31,184 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:50:31,189 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:50:31,194 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:50:31,202 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:50:31,209 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 00:50:31,210 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 00:50:31,214 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 00:50:31,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1338 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2018-01-29 00:50:31,720 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 00:50:31,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 30] total 62 [2018-01-29 00:50:31,721 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-01-29 00:50:31,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-01-29 00:50:31,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=3465, Unknown=0, NotChecked=0, Total=3906 [2018-01-29 00:50:31,721 INFO L87 Difference]: Start difference. First operand 491 states and 533 transitions. Second operand 63 states. [2018-01-29 00:50:35,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 00:50:35,945 INFO L93 Difference]: Finished difference Result 2299 states and 2489 transitions. [2018-01-29 00:50:35,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-01-29 00:50:35,945 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 246 [2018-01-29 00:50:35,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 00:50:35,950 INFO L225 Difference]: With dead ends: 2299 [2018-01-29 00:50:35,950 INFO L226 Difference]: Without dead ends: 2298 [2018-01-29 00:50:35,952 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12421 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5027, Invalid=27915, Unknown=0, NotChecked=0, Total=32942 [2018-01-29 00:50:35,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2298 states. [2018-01-29 00:50:35,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2298 to 629. [2018-01-29 00:50:35,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2018-01-29 00:50:35,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 687 transitions. [2018-01-29 00:50:35,994 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 687 transitions. Word has length 246 [2018-01-29 00:50:35,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 00:50:35,994 INFO L432 AbstractCegarLoop]: Abstraction has 629 states and 687 transitions. [2018-01-29 00:50:35,994 INFO L433 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-01-29 00:50:35,994 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 687 transitions. [2018-01-29 00:50:35,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-01-29 00:50:35,996 INFO L322 BasicCegarLoop]: Found error trace [2018-01-29 00:50:35,996 INFO L330 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 00:50:35,996 INFO L371 AbstractCegarLoop]: === Iteration 38 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-29 00:50:35,997 INFO L82 PathProgramCache]: Analyzing trace with hash 492564828, now seen corresponding path program 14 times [2018-01-29 00:50:35,997 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 00:50:35,997 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 00:50:35,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:50:35,997 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 00:50:35,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 00:50:36,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 00:50:36,008 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-01-29 00:50:36,340 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-29 00:50:36,345 WARN L185 ceAbstractionStarter]: Timeout [2018-01-29 00:50:36,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 12:50:36 BasicIcfg [2018-01-29 00:50:36,345 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 00:50:36,346 INFO L168 Benchmark]: Toolchain (without parser) took 105467.07 ms. Allocated memory was 303.0 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 263.9 MB in the beginning and 1.0 GB in the end (delta: -750.4 MB). Peak memory consumption was 973.5 MB. Max. memory is 5.3 GB. [2018-01-29 00:50:36,347 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 303.0 MB. Free memory is still 267.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 00:50:36,347 INFO L168 Benchmark]: CACSL2BoogieTranslator took 195.35 ms. Allocated memory is still 303.0 MB. Free memory was 261.9 MB in the beginning and 253.9 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-01-29 00:50:36,347 INFO L168 Benchmark]: Boogie Preprocessor took 30.35 ms. Allocated memory is still 303.0 MB. Free memory was 253.9 MB in the beginning and 252.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-29 00:50:36,348 INFO L168 Benchmark]: RCFGBuilder took 257.70 ms. Allocated memory is still 303.0 MB. Free memory was 252.0 MB in the beginning and 235.0 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-29 00:50:36,348 INFO L168 Benchmark]: IcfgTransformer took 9440.87 ms. Allocated memory was 303.0 MB in the beginning and 993.0 MB in the end (delta: 690.0 MB). Free memory was 235.0 MB in the beginning and 179.8 MB in the end (delta: 55.2 MB). Peak memory consumption was 745.2 MB. Max. memory is 5.3 GB. [2018-01-29 00:50:36,348 INFO L168 Benchmark]: TraceAbstraction took 95531.52 ms. Allocated memory was 993.0 MB in the beginning and 2.0 GB in the end (delta: 1.0 GB). Free memory was 179.8 MB in the beginning and 1.0 GB in the end (delta: -834.5 MB). Peak memory consumption was 199.4 MB. Max. memory is 5.3 GB. [2018-01-29 00:50:36,350 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.23 ms. Allocated memory is still 303.0 MB. Free memory is still 267.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 195.35 ms. Allocated memory is still 303.0 MB. Free memory was 261.9 MB in the beginning and 253.9 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.35 ms. Allocated memory is still 303.0 MB. Free memory was 253.9 MB in the beginning and 252.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 257.70 ms. Allocated memory is still 303.0 MB. Free memory was 252.0 MB in the beginning and 235.0 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * IcfgTransformer took 9440.87 ms. Allocated memory was 303.0 MB in the beginning and 993.0 MB in the end (delta: 690.0 MB). Free memory was 235.0 MB in the beginning and 179.8 MB in the end (delta: 55.2 MB). Peak memory consumption was 745.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 95531.52 ms. Allocated memory was 993.0 MB in the beginning and 2.0 GB in the end (delta: 1.0 GB). Free memory was 179.8 MB in the beginning and 1.0 GB in the end (delta: -834.5 MB). Peak memory consumption was 199.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 59 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 797 LocStat_NO_SUPPORTING_DISEQUALITIES : 409 LocStat_NO_DISJUNCTIONS : -118 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 79 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 95 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 80 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.300077 RENAME_VARIABLES(MILLISECONDS) : 0.296328 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.259373 PROJECTAWAY(MILLISECONDS) : 1.540362 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.109138 DISJOIN(MILLISECONDS) : 0.221183 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.326206 ADD_EQUALITY(MILLISECONDS) : 0.025210 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.029831 #CONJOIN_DISJUNCTIVE : 667 #RENAME_VARIABLES : 1481 #UNFREEZE : 0 #CONJOIN : 935 #PROJECTAWAY : 882 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 214 #RENAME_VARIABLES_DISJUNCTIVE : 1464 #ADD_EQUALITY : 95 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: HeapSeparatorStatistics COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_0 : 1 COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : 1 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_1 : 1 COUNT_BLOCKS_for_[#memory_int]_at_dim_1 : 1 COUNT_ARRAY_READS for [#memory_int] : 1 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while BasicCegarLoop was analyzing trace of length 248 with TraceHistMax 13, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 5 known predicates. - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 18). Cancelled while BasicCegarLoop was analyzing trace of length 248 with TraceHistMax 13, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 5 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while BasicCegarLoop was analyzing trace of length 248 with TraceHistMax 13, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 5 known predicates. - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 27). Cancelled while BasicCegarLoop was analyzing trace of length 248 with TraceHistMax 13, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 5 known predicates. - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 23). Cancelled while BasicCegarLoop was analyzing trace of length 248 with TraceHistMax 13, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 5 known predicates. - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 30). Cancelled while BasicCegarLoop was analyzing trace of length 248 with TraceHistMax 13, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 5 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 61 locations, 6 error locations. TIMEOUT Result, 95.4s OverallTime, 38 OverallIterations, 13 TraceHistogramMax, 67.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2071 SDtfs, 17221 SDslu, 32816 SDs, 0 SdLazy, 64260 SolverSat, 4035 SolverUnsat, 29 SolverUnknown, 0 SolverNotchecked, 26.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5803 GetRequests, 3381 SyntacticMatches, 12 SemanticMatches, 2410 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89718 ImplicationChecksByTransitivity, 52.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=629occurred in iteration=37, 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, 37 MinimizatonAttempts, 12908 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 23.6s InterpolantComputationTime, 7653 NumberOfCodeBlocks, 7578 NumberOfCodeBlocksAsserted, 166 NumberOfCheckSat, 7583 ConstructedInterpolants, 2 QuantifiedInterpolants, 9424773 SizeOfPredicates, 425 NumberOfNonLiveVariables, 6151 ConjunctsInSsa, 853 ConjunctsInUnsatCore, 70 InterpolantComputations, 7 PerfectInterpolantSequences, 10886/23898 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-29_00-50-36-361.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-29_00-50-36-361.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-29_00-50-36-361.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-29_00-50-36-361.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-29_00-50-36-361.csv Completed graceful shutdown