java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 02:34:10,906 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 02:34:10,907 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 02:34:10,921 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 02:34:10,921 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 02:34:10,922 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 02:34:10,923 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 02:34:10,925 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 02:34:10,928 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 02:34:10,929 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 02:34:10,930 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 02:34:10,930 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 02:34:10,931 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 02:34:10,933 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 02:34:10,934 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 02:34:10,937 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 02:34:10,939 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 02:34:10,941 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 02:34:10,942 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 02:34:10,944 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 02:34:10,947 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 02:34:10,947 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 02:34:10,947 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 02:34:10,948 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 02:34:10,949 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 02:34:10,951 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 02:34:10,951 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 02:34:10,951 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 02:34:10,952 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 02:34:10,952 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 02:34:10,952 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 02:34:10,953 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 02:34:10,966 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 02:34:10,967 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 02:34:10,967 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 02:34:10,968 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 02:34:10,970 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 02:34:10,970 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 02:34:10,970 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 02:34:10,971 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 02:34:10,971 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 02:34:10,971 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 02:34:10,971 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 02:34:10,972 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 02:34:10,972 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 02:34:10,972 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 02:34:10,972 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 02:34:10,972 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 02:34:10,972 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 02:34:10,973 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 02:34:10,973 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 02:34:10,974 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 02:34:10,974 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 02:34:10,974 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 02:34:10,974 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 02:34:10,974 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 02:34:10,975 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 02:34:10,975 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 02:34:10,975 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 02:34:10,975 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 02:34:10,975 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 02:34:10,976 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 02:34:10,976 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 02:34:10,976 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 02:34:10,977 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 02:34:10,979 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 02:34:11,044 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 02:34:11,060 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 02:34:11,066 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 02:34:11,068 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 02:34:11,069 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 02:34:11,071 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-01-30 02:34:11,198 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 02:34:11,205 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-30 02:34:11,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 02:34:11,206 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 02:34:11,214 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 02:34:11,215 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:34:11" (1/1) ... [2018-01-30 02:34:11,219 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37be2ce7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:34:11, skipping insertion in model container [2018-01-30 02:34:11,220 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:34:11" (1/1) ... [2018-01-30 02:34:11,240 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 02:34:11,260 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 02:34:11,414 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 02:34:11,430 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 02:34:11,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:34:11 WrapperNode [2018-01-30 02:34:11,438 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 02:34:11,439 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 02:34:11,440 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 02:34:11,440 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 02:34:11,457 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:34:11" (1/1) ... [2018-01-30 02:34:11,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:34:11" (1/1) ... [2018-01-30 02:34:11,470 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:34:11" (1/1) ... [2018-01-30 02:34:11,471 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:34:11" (1/1) ... [2018-01-30 02:34:11,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:34:11" (1/1) ... [2018-01-30 02:34:11,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:34:11" (1/1) ... [2018-01-30 02:34:11,485 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:34:11" (1/1) ... [2018-01-30 02:34:11,493 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 02:34:11,494 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 02:34:11,494 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 02:34:11,494 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 02:34:11,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:34:11" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 02:34:11,577 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 02:34:11,577 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 02:34:11,578 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-30 02:34:11,578 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 02:34:11,578 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-30 02:34:11,582 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-30 02:34:11,582 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 02:34:11,583 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 02:34:11,583 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 02:34:11,583 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-30 02:34:11,583 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 02:34:11,583 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 02:34:11,583 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 02:34:11,906 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 02:34:11,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:34:11 BoogieIcfgContainer [2018-01-30 02:34:11,907 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 02:34:11,908 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-30 02:34:11,908 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-30 02:34:11,909 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-30 02:34:11,912 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:34:11" (1/1) ... [2018-01-30 02:34:11,922 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-30 02:34:11,923 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-30 02:34:11,923 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-30 02:34:11,967 INFO L162 apSepIcfgTransformer]: finished StoreIndexFreezer, created 6 freeze vars and freeze var literals (each corresponds to one heap write) [2018-01-30 02:34:11,996 INFO L221 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-30 02:34:12,067 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-30 02:34:23,714 INFO L311 AbstractInterpreter]: Visited 70 different actions 440 times. Merged at 46 different actions 244 times. Widened at 1 different actions 1 times. Found 21 fixpoints after 5 different actions. Largest state had 39 variables. [2018-01-30 02:34:23,718 INFO L229 apSepIcfgTransformer]: finished equality analysis [2018-01-30 02:34:23,731 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 1 [2018-01-30 02:34:23,732 INFO L241 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-30 02:34:23,732 INFO L242 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-30 02:34:23,733 INFO L244 apSepIcfgTransformer]: select infos: Set: ((select (select |v_#memory_int_1| v_foo_~b.base_2) (+ v_foo_~b.offset_2 v_foo_~i~1_6)), at (SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~1 * 1, 1); srcloc: L18')) [2018-01-30 02:34:23,737 INFO L547 PartitionManager]: partitioning result: [2018-01-30 02:34:23,737 INFO L552 PartitionManager]: location blocks for array group [#memory_int] [2018-01-30 02:34:23,737 INFO L561 PartitionManager]: at dimension 0 [2018-01-30 02:34:23,737 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-30 02:34:23,737 INFO L563 PartitionManager]: # location blocks :1 [2018-01-30 02:34:23,738 INFO L561 PartitionManager]: at dimension 1 [2018-01-30 02:34:23,738 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-30 02:34:23,738 INFO L563 PartitionManager]: # location blocks :1 [2018-01-30 02:34:23,739 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-30 02:34:23,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 02:34:23 BasicIcfg [2018-01-30 02:34:23,754 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-30 02:34:23,755 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 02:34:23,756 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 02:34:23,759 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 02:34:23,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 02:34:11" (1/4) ... [2018-01-30 02:34:23,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fa645dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:34:23, skipping insertion in model container [2018-01-30 02:34:23,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:34:11" (2/4) ... [2018-01-30 02:34:23,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fa645dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:34:23, skipping insertion in model container [2018-01-30 02:34:23,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:34:11" (3/4) ... [2018-01-30 02:34:23,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fa645dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 02:34:23, skipping insertion in model container [2018-01-30 02:34:23,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 02:34:23" (4/4) ... [2018-01-30 02:34:23,763 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-30 02:34:23,771 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 02:34:23,778 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-30 02:34:23,910 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 02:34:23,910 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 02:34:23,910 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 02:34:23,910 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 02:34:23,911 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 02:34:23,911 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 02:34:23,911 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 02:34:23,911 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 02:34:23,912 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 02:34:23,929 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-01-30 02:34:23,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-30 02:34:23,937 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:23,938 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:23,938 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:23,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1068910584, now seen corresponding path program 1 times [2018-01-30 02:34:23,947 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:23,947 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:24,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:24,012 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:34:24,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:24,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:24,071 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:24,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:34:24,145 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:34:24,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 02:34:24,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 02:34:24,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 02:34:24,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:34:24,163 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 3 states. [2018-01-30 02:34:24,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:24,276 INFO L93 Difference]: Finished difference Result 133 states and 160 transitions. [2018-01-30 02:34:24,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 02:34:24,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-01-30 02:34:24,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:24,292 INFO L225 Difference]: With dead ends: 133 [2018-01-30 02:34:24,292 INFO L226 Difference]: Without dead ends: 78 [2018-01-30 02:34:24,297 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:34:24,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-30 02:34:24,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2018-01-30 02:34:24,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-30 02:34:24,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-01-30 02:34:24,355 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 9 [2018-01-30 02:34:24,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:24,356 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-01-30 02:34:24,356 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 02:34:24,356 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-01-30 02:34:24,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-30 02:34:24,357 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:24,357 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:24,357 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:24,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1115648547, now seen corresponding path program 1 times [2018-01-30 02:34:24,360 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:24,360 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:24,361 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:24,362 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:34:24,362 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:24,387 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:24,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:34:24,642 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:34:24,642 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:34:24,646 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 02:34:24,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 02:34:24,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-30 02:34:24,649 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 7 states. [2018-01-30 02:34:25,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:25,063 INFO L93 Difference]: Finished difference Result 172 states and 188 transitions. [2018-01-30 02:34:25,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 02:34:25,067 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-01-30 02:34:25,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:25,073 INFO L225 Difference]: With dead ends: 172 [2018-01-30 02:34:25,073 INFO L226 Difference]: Without dead ends: 121 [2018-01-30 02:34:25,075 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-30 02:34:25,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-30 02:34:25,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 88. [2018-01-30 02:34:25,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-30 02:34:25,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2018-01-30 02:34:25,098 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 18 [2018-01-30 02:34:25,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:25,099 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2018-01-30 02:34:25,099 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 02:34:25,099 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2018-01-30 02:34:25,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-30 02:34:25,106 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:25,106 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:25,106 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:25,106 INFO L82 PathProgramCache]: Analyzing trace with hash -225366126, now seen corresponding path program 1 times [2018-01-30 02:34:25,106 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:25,107 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:25,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:25,108 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:34:25,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:25,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:25,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:25,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:34:25,201 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:34:25,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:34:25,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 02:34:25,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 02:34:25,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:34:25,202 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand 5 states. [2018-01-30 02:34:25,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:25,270 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2018-01-30 02:34:25,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 02:34:25,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-30 02:34:25,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:25,272 INFO L225 Difference]: With dead ends: 88 [2018-01-30 02:34:25,272 INFO L226 Difference]: Without dead ends: 87 [2018-01-30 02:34:25,272 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:34:25,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-30 02:34:25,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-01-30 02:34:25,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-30 02:34:25,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2018-01-30 02:34:25,284 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 19 [2018-01-30 02:34:25,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:25,285 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2018-01-30 02:34:25,285 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 02:34:25,285 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2018-01-30 02:34:25,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-30 02:34:25,286 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:25,286 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:25,286 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:25,286 INFO L82 PathProgramCache]: Analyzing trace with hash -225366124, now seen corresponding path program 1 times [2018-01-30 02:34:25,287 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:25,287 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:25,287 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:25,288 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:34:25,288 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:25,300 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:25,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:34:25,485 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:34:25,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 02:34:25,485 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:34:25,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:34:25,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:34:25,486 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand 6 states. [2018-01-30 02:34:25,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:25,617 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2018-01-30 02:34:25,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 02:34:25,620 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-30 02:34:25,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:25,622 INFO L225 Difference]: With dead ends: 101 [2018-01-30 02:34:25,622 INFO L226 Difference]: Without dead ends: 100 [2018-01-30 02:34:25,622 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-30 02:34:25,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-30 02:34:25,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2018-01-30 02:34:25,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-30 02:34:25,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2018-01-30 02:34:25,632 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 19 [2018-01-30 02:34:25,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:25,632 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2018-01-30 02:34:25,632 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:34:25,632 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-01-30 02:34:25,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-30 02:34:25,633 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:25,633 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:25,633 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:25,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1537306562, now seen corresponding path program 1 times [2018-01-30 02:34:25,633 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:25,633 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:25,634 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:25,634 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:34:25,634 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:25,640 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:25,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:34:25,682 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:34:25,682 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:34:25,695 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:34:25,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:25,715 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:34:25,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:34:25,779 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 02:34:25,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2018-01-30 02:34:25,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 02:34:25,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 02:34:25,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-30 02:34:25,780 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 8 states. [2018-01-30 02:34:25,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:25,888 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2018-01-30 02:34:25,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:34:25,888 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-30 02:34:25,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:25,889 INFO L225 Difference]: With dead ends: 127 [2018-01-30 02:34:25,889 INFO L226 Difference]: Without dead ends: 106 [2018-01-30 02:34:25,890 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-01-30 02:34:25,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-30 02:34:25,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 96. [2018-01-30 02:34:25,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-30 02:34:25,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2018-01-30 02:34:25,899 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 19 [2018-01-30 02:34:25,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:25,899 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2018-01-30 02:34:25,899 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 02:34:25,899 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2018-01-30 02:34:25,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-30 02:34:25,900 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:25,900 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:25,900 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:25,901 INFO L82 PathProgramCache]: Analyzing trace with hash 184823418, now seen corresponding path program 1 times [2018-01-30 02:34:25,901 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:25,901 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:25,901 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:25,902 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:34:25,902 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:25,912 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:25,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:34:25,970 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:34:25,970 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:34:25,978 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:34:25,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:25,991 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:34:26,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:34:26,031 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:34:26,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-01-30 02:34:26,031 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 02:34:26,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 02:34:26,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:34:26,032 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 5 states. [2018-01-30 02:34:26,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:26,146 INFO L93 Difference]: Finished difference Result 133 states and 147 transitions. [2018-01-30 02:34:26,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 02:34:26,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-01-30 02:34:26,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:26,147 INFO L225 Difference]: With dead ends: 133 [2018-01-30 02:34:26,147 INFO L226 Difference]: Without dead ends: 132 [2018-01-30 02:34:26,148 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-30 02:34:26,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-30 02:34:26,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 112. [2018-01-30 02:34:26,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-30 02:34:26,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2018-01-30 02:34:26,157 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 27 [2018-01-30 02:34:26,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:26,157 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2018-01-30 02:34:26,158 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 02:34:26,158 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2018-01-30 02:34:26,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-30 02:34:26,159 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:26,159 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:26,159 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:26,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1434559127, now seen corresponding path program 1 times [2018-01-30 02:34:26,160 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:26,160 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:26,161 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:26,161 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:34:26,161 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:26,173 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:26,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:34:26,389 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:34:26,389 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:34:26,395 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:34:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:26,406 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:34:26,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 02:34:26,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:34:26,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:34:26,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 02:34:26,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:34:26,568 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:34:26,568 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-01-30 02:34:26,569 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 02:34:26,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 02:34:26,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-30 02:34:26,569 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand 9 states. [2018-01-30 02:34:26,732 WARN L143 SmtUtils]: Spent 116ms on a formula simplification that was a NOOP. DAG size: 18 [2018-01-30 02:34:27,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:27,013 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2018-01-30 02:34:27,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:34:27,014 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-01-30 02:34:27,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:27,014 INFO L225 Difference]: With dead ends: 132 [2018-01-30 02:34:27,015 INFO L226 Difference]: Without dead ends: 131 [2018-01-30 02:34:27,015 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-01-30 02:34:27,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-30 02:34:27,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 114. [2018-01-30 02:34:27,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-30 02:34:27,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 126 transitions. [2018-01-30 02:34:27,024 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 126 transitions. Word has length 28 [2018-01-30 02:34:27,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:27,025 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 126 transitions. [2018-01-30 02:34:27,025 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 02:34:27,025 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 126 transitions. [2018-01-30 02:34:27,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-30 02:34:27,026 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:27,027 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:27,027 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:27,027 INFO L82 PathProgramCache]: Analyzing trace with hash -123801987, now seen corresponding path program 2 times [2018-01-30 02:34:27,027 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:27,027 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:27,028 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:27,028 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:34:27,028 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:27,042 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:27,161 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:34:27,161 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:34:27,161 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:34:27,185 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 02:34:27,195 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:34:27,199 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:34:27,199 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:34:27,201 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:34:27,391 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:34:27,418 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 02:34:27,419 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2018-01-30 02:34:27,419 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-30 02:34:27,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-30 02:34:27,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-01-30 02:34:27,420 INFO L87 Difference]: Start difference. First operand 114 states and 126 transitions. Second operand 18 states. [2018-01-30 02:34:27,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:27,673 INFO L93 Difference]: Finished difference Result 202 states and 221 transitions. [2018-01-30 02:34:27,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 02:34:27,673 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2018-01-30 02:34:27,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:27,674 INFO L225 Difference]: With dead ends: 202 [2018-01-30 02:34:27,674 INFO L226 Difference]: Without dead ends: 120 [2018-01-30 02:34:27,675 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=490, Unknown=0, NotChecked=0, Total=650 [2018-01-30 02:34:27,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-30 02:34:27,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 112. [2018-01-30 02:34:27,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-30 02:34:27,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2018-01-30 02:34:27,681 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 36 [2018-01-30 02:34:27,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:27,681 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2018-01-30 02:34:27,681 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-30 02:34:27,681 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2018-01-30 02:34:27,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-30 02:34:27,682 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:27,682 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:27,682 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:27,683 INFO L82 PathProgramCache]: Analyzing trace with hash 729468996, now seen corresponding path program 1 times [2018-01-30 02:34:27,683 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:27,683 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:27,683 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:27,684 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:34:27,684 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:27,694 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:27,735 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:34:27,735 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:34:27,735 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:34:27,743 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:34:27,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:27,755 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:34:27,772 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:34:27,807 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:34:27,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-01-30 02:34:27,807 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 02:34:27,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 02:34:27,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-30 02:34:27,808 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 9 states. [2018-01-30 02:34:27,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:27,961 INFO L93 Difference]: Finished difference Result 157 states and 172 transitions. [2018-01-30 02:34:27,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:34:27,961 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-01-30 02:34:27,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:27,963 INFO L225 Difference]: With dead ends: 157 [2018-01-30 02:34:27,963 INFO L226 Difference]: Without dead ends: 137 [2018-01-30 02:34:27,964 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-01-30 02:34:27,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-30 02:34:27,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 122. [2018-01-30 02:34:27,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-30 02:34:27,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2018-01-30 02:34:27,973 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 37 [2018-01-30 02:34:27,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:27,974 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2018-01-30 02:34:27,974 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 02:34:27,974 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2018-01-30 02:34:27,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-30 02:34:27,979 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:27,980 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:27,980 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:27,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1381672071, now seen corresponding path program 1 times [2018-01-30 02:34:27,980 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:27,980 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:27,981 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:27,981 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:34:27,981 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:28,003 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:28,164 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 02:34:28,165 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:34:28,165 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:34:28,170 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:34:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:28,184 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:34:28,218 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 02:34:28,240 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:34:28,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-01-30 02:34:28,240 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 02:34:28,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 02:34:28,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 02:34:28,240 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand 7 states. [2018-01-30 02:34:28,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:28,374 INFO L93 Difference]: Finished difference Result 149 states and 164 transitions. [2018-01-30 02:34:28,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:34:28,374 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-01-30 02:34:28,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:28,375 INFO L225 Difference]: With dead ends: 149 [2018-01-30 02:34:28,376 INFO L226 Difference]: Without dead ends: 148 [2018-01-30 02:34:28,376 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-01-30 02:34:28,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-30 02:34:28,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 130. [2018-01-30 02:34:28,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-30 02:34:28,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2018-01-30 02:34:28,383 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 46 [2018-01-30 02:34:28,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:28,383 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2018-01-30 02:34:28,383 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 02:34:28,383 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2018-01-30 02:34:28,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-30 02:34:28,385 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:28,385 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:28,385 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:28,385 INFO L82 PathProgramCache]: Analyzing trace with hash -117838294, now seen corresponding path program 1 times [2018-01-30 02:34:28,385 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:28,385 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:28,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:28,386 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:34:28,387 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:28,397 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:28,685 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 02:34:28,685 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:34:28,685 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:34:28,693 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:34:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:28,710 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:34:28,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 02:34:28,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:34:28,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:34:28,720 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 02:34:28,830 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-30 02:34:28,852 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:34:28,852 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-01-30 02:34:28,852 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-30 02:34:28,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-30 02:34:28,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-01-30 02:34:28,853 INFO L87 Difference]: Start difference. First operand 130 states and 142 transitions. Second operand 13 states. [2018-01-30 02:34:29,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:29,182 INFO L93 Difference]: Finished difference Result 148 states and 163 transitions. [2018-01-30 02:34:29,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 02:34:29,183 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2018-01-30 02:34:29,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:29,184 INFO L225 Difference]: With dead ends: 148 [2018-01-30 02:34:29,184 INFO L226 Difference]: Without dead ends: 147 [2018-01-30 02:34:29,184 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2018-01-30 02:34:29,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-01-30 02:34:29,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 131. [2018-01-30 02:34:29,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-01-30 02:34:29,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 143 transitions. [2018-01-30 02:34:29,195 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 143 transitions. Word has length 47 [2018-01-30 02:34:29,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:29,195 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 143 transitions. [2018-01-30 02:34:29,195 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-30 02:34:29,195 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 143 transitions. [2018-01-30 02:34:29,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-30 02:34:29,197 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:29,197 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:29,197 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:29,197 INFO L82 PathProgramCache]: Analyzing trace with hash 154524538, now seen corresponding path program 2 times [2018-01-30 02:34:29,197 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:29,198 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:29,198 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:29,199 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:34:29,199 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:29,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:29,208 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:29,297 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:34:29,298 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:34:29,298 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:34:29,303 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 02:34:29,311 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:34:29,312 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:34:29,314 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:34:29,444 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-01-30 02:34:29,479 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 02:34:29,479 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2018-01-30 02:34:29,480 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-30 02:34:29,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-30 02:34:29,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=100, Unknown=1, NotChecked=0, Total=132 [2018-01-30 02:34:29,480 INFO L87 Difference]: Start difference. First operand 131 states and 143 transitions. Second operand 12 states. [2018-01-30 02:34:29,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:29,832 INFO L93 Difference]: Finished difference Result 174 states and 194 transitions. [2018-01-30 02:34:29,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-30 02:34:29,832 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-01-30 02:34:29,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:29,833 INFO L225 Difference]: With dead ends: 174 [2018-01-30 02:34:29,833 INFO L226 Difference]: Without dead ends: 143 [2018-01-30 02:34:29,834 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=363, Unknown=1, NotChecked=0, Total=506 [2018-01-30 02:34:29,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-30 02:34:29,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 133. [2018-01-30 02:34:29,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-30 02:34:29,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 146 transitions. [2018-01-30 02:34:29,844 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 146 transitions. Word has length 47 [2018-01-30 02:34:29,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:29,844 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 146 transitions. [2018-01-30 02:34:29,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-30 02:34:29,844 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 146 transitions. [2018-01-30 02:34:29,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-30 02:34:29,845 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:29,845 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:29,846 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:29,846 INFO L82 PathProgramCache]: Analyzing trace with hash -739772656, now seen corresponding path program 2 times [2018-01-30 02:34:29,846 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:29,846 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:29,847 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:29,847 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:34:29,847 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:29,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:29,859 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:30,027 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-30 02:34:30,027 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:34:30,027 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:34:30,055 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 02:34:30,065 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:34:30,075 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:34:30,078 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:34:30,081 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:34:30,272 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 36 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:34:30,293 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:34:30,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 25 [2018-01-30 02:34:30,293 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-30 02:34:30,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-30 02:34:30,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2018-01-30 02:34:30,294 INFO L87 Difference]: Start difference. First operand 133 states and 146 transitions. Second operand 25 states. [2018-01-30 02:34:31,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:31,145 INFO L93 Difference]: Finished difference Result 272 states and 299 transitions. [2018-01-30 02:34:31,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-30 02:34:31,146 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 55 [2018-01-30 02:34:31,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:31,147 INFO L225 Difference]: With dead ends: 272 [2018-01-30 02:34:31,147 INFO L226 Difference]: Without dead ends: 191 [2018-01-30 02:34:31,148 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=359, Invalid=1621, Unknown=0, NotChecked=0, Total=1980 [2018-01-30 02:34:31,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-01-30 02:34:31,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 170. [2018-01-30 02:34:31,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-01-30 02:34:31,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 185 transitions. [2018-01-30 02:34:31,160 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 185 transitions. Word has length 55 [2018-01-30 02:34:31,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:31,161 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 185 transitions. [2018-01-30 02:34:31,161 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-30 02:34:31,161 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 185 transitions. [2018-01-30 02:34:31,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-30 02:34:31,162 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:31,162 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:31,162 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:31,163 INFO L82 PathProgramCache]: Analyzing trace with hash 245732012, now seen corresponding path program 1 times [2018-01-30 02:34:31,163 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:31,163 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:31,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:31,164 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:34:31,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:31,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:31,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:31,327 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-01-30 02:34:31,327 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:34:31,327 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:34:31,332 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:34:31,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:31,344 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:34:31,436 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 02:34:31,461 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:34:31,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11] total 15 [2018-01-30 02:34:31,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-30 02:34:31,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-30 02:34:31,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-01-30 02:34:31,462 INFO L87 Difference]: Start difference. First operand 170 states and 185 transitions. Second operand 15 states. [2018-01-30 02:34:31,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:31,664 INFO L93 Difference]: Finished difference Result 209 states and 230 transitions. [2018-01-30 02:34:31,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-30 02:34:31,664 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2018-01-30 02:34:31,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:31,666 INFO L225 Difference]: With dead ends: 209 [2018-01-30 02:34:31,666 INFO L226 Difference]: Without dead ends: 197 [2018-01-30 02:34:31,667 INFO L553 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-30 02:34:31,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-01-30 02:34:31,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 187. [2018-01-30 02:34:31,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-30 02:34:31,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 204 transitions. [2018-01-30 02:34:31,681 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 204 transitions. Word has length 59 [2018-01-30 02:34:31,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:31,682 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 204 transitions. [2018-01-30 02:34:31,682 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-30 02:34:31,682 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 204 transitions. [2018-01-30 02:34:31,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-30 02:34:31,683 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:31,683 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:31,684 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:31,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1928929082, now seen corresponding path program 3 times [2018-01-30 02:34:31,684 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:31,684 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:31,685 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:31,685 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:34:31,685 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:31,699 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:31,936 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-30 02:34:31,937 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:34:31,937 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:34:31,942 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 02:34:31,949 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:34:31,953 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:34:31,954 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:34:31,957 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:34:32,089 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:34:32,111 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:34:32,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2018-01-30 02:34:32,112 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-30 02:34:32,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-30 02:34:32,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-01-30 02:34:32,113 INFO L87 Difference]: Start difference. First operand 187 states and 204 transitions. Second operand 18 states. [2018-01-30 02:34:32,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:32,890 INFO L93 Difference]: Finished difference Result 225 states and 252 transitions. [2018-01-30 02:34:32,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-30 02:34:32,890 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 65 [2018-01-30 02:34:32,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:32,892 INFO L225 Difference]: With dead ends: 225 [2018-01-30 02:34:32,892 INFO L226 Difference]: Without dead ends: 224 [2018-01-30 02:34:32,893 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=261, Invalid=929, Unknown=0, NotChecked=0, Total=1190 [2018-01-30 02:34:32,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-01-30 02:34:32,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 186. [2018-01-30 02:34:32,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-01-30 02:34:32,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 203 transitions. [2018-01-30 02:34:32,927 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 203 transitions. Word has length 65 [2018-01-30 02:34:32,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:32,927 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 203 transitions. [2018-01-30 02:34:32,927 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-30 02:34:32,927 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 203 transitions. [2018-01-30 02:34:32,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-30 02:34:32,928 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:32,928 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:32,929 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:32,929 INFO L82 PathProgramCache]: Analyzing trace with hash 332741067, now seen corresponding path program 2 times [2018-01-30 02:34:32,929 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:32,929 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:32,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:32,930 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:34:32,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:32,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:33,397 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-30 02:34:33,398 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:34:33,398 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:34:33,405 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 02:34:33,413 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:34:33,419 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:34:33,421 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:34:33,423 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:34:33,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 02:34:33,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:34:33,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:34:33,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 02:34:33,620 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-30 02:34:33,641 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:34:33,642 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-01-30 02:34:33,642 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-30 02:34:33,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-30 02:34:33,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2018-01-30 02:34:33,642 INFO L87 Difference]: Start difference. First operand 186 states and 203 transitions. Second operand 23 states. [2018-01-30 02:34:34,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:34,059 INFO L93 Difference]: Finished difference Result 224 states and 250 transitions. [2018-01-30 02:34:34,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-30 02:34:34,061 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 66 [2018-01-30 02:34:34,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:34,062 INFO L225 Difference]: With dead ends: 224 [2018-01-30 02:34:34,062 INFO L226 Difference]: Without dead ends: 223 [2018-01-30 02:34:34,063 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=226, Invalid=896, Unknown=0, NotChecked=0, Total=1122 [2018-01-30 02:34:34,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-01-30 02:34:34,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 195. [2018-01-30 02:34:34,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-01-30 02:34:34,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 213 transitions. [2018-01-30 02:34:34,080 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 213 transitions. Word has length 66 [2018-01-30 02:34:34,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:34,080 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 213 transitions. [2018-01-30 02:34:34,080 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-30 02:34:34,080 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 213 transitions. [2018-01-30 02:34:34,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-30 02:34:34,082 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:34,082 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:34,082 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:34,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1158666688, now seen corresponding path program 3 times [2018-01-30 02:34:34,082 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:34,082 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:34,083 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:34,083 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:34:34,083 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:34,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:34,444 WARN L143 SmtUtils]: Spent 102ms on a formula simplification that was a NOOP. DAG size: 11 [2018-01-30 02:34:34,981 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 45 proven. 26 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-30 02:34:34,982 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:34:34,982 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:34:35,013 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 02:34:35,021 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:34:35,024 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:34:35,028 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:34:35,028 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:34:35,031 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:34:35,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 02:34:35,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:34:35,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:34:35,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 02:34:35,497 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-01-30 02:34:35,531 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:34:35,532 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2018-01-30 02:34:35,532 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-30 02:34:35,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-30 02:34:35,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2018-01-30 02:34:35,533 INFO L87 Difference]: Start difference. First operand 195 states and 213 transitions. Second operand 29 states. [2018-01-30 02:34:36,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:36,198 INFO L93 Difference]: Finished difference Result 259 states and 281 transitions. [2018-01-30 02:34:36,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-30 02:34:36,198 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 75 [2018-01-30 02:34:36,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:36,200 INFO L225 Difference]: With dead ends: 259 [2018-01-30 02:34:36,200 INFO L226 Difference]: Without dead ends: 258 [2018-01-30 02:34:36,201 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=357, Invalid=1623, Unknown=0, NotChecked=0, Total=1980 [2018-01-30 02:34:36,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-01-30 02:34:36,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 212. [2018-01-30 02:34:36,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-01-30 02:34:36,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 230 transitions. [2018-01-30 02:34:36,214 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 230 transitions. Word has length 75 [2018-01-30 02:34:36,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:36,214 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 230 transitions. [2018-01-30 02:34:36,214 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-30 02:34:36,214 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 230 transitions. [2018-01-30 02:34:36,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-01-30 02:34:36,215 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:36,215 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:36,216 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:36,216 INFO L82 PathProgramCache]: Analyzing trace with hash -337153039, now seen corresponding path program 2 times [2018-01-30 02:34:36,216 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:36,216 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:36,217 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:36,217 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:34:36,217 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:36,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:36,226 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:36,287 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-01-30 02:34:36,287 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:34:36,287 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:34:36,293 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 02:34:36,298 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:34:36,304 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:34:36,306 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:34:36,308 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:34:36,421 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-30 02:34:36,442 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:34:36,443 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13] total 19 [2018-01-30 02:34:36,443 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-30 02:34:36,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-30 02:34:36,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2018-01-30 02:34:36,443 INFO L87 Difference]: Start difference. First operand 212 states and 230 transitions. Second operand 19 states. [2018-01-30 02:34:36,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:36,738 INFO L93 Difference]: Finished difference Result 250 states and 274 transitions. [2018-01-30 02:34:36,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-30 02:34:36,738 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 76 [2018-01-30 02:34:36,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:36,739 INFO L225 Difference]: With dead ends: 250 [2018-01-30 02:34:36,739 INFO L226 Difference]: Without dead ends: 210 [2018-01-30 02:34:36,740 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=250, Invalid=940, Unknown=0, NotChecked=0, Total=1190 [2018-01-30 02:34:36,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-01-30 02:34:36,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 175. [2018-01-30 02:34:36,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-01-30 02:34:36,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 190 transitions. [2018-01-30 02:34:36,754 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 190 transitions. Word has length 76 [2018-01-30 02:34:36,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:36,756 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 190 transitions. [2018-01-30 02:34:36,756 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-30 02:34:36,757 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 190 transitions. [2018-01-30 02:34:36,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-01-30 02:34:36,758 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:36,758 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:36,758 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:36,758 INFO L82 PathProgramCache]: Analyzing trace with hash -448849674, now seen corresponding path program 4 times [2018-01-30 02:34:36,758 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:36,758 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:36,759 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:36,759 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:34:36,759 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:36,769 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:37,141 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 23 proven. 50 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-01-30 02:34:37,141 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:34:37,141 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:34:37,154 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 02:34:37,178 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:34:37,181 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:34:37,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 02:34:37,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:34:37,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:34:37,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 02:34:37,540 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-01-30 02:34:37,574 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:34:37,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2018-01-30 02:34:37,575 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-30 02:34:37,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-30 02:34:37,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2018-01-30 02:34:37,575 INFO L87 Difference]: Start difference. First operand 175 states and 190 transitions. Second operand 29 states. [2018-01-30 02:34:38,143 WARN L146 SmtUtils]: Spent 187ms on a formula simplification. DAG size of input: 27 DAG size of output 25 [2018-01-30 02:34:38,607 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 29 DAG size of output 25 [2018-01-30 02:34:38,956 WARN L146 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 33 DAG size of output 29 [2018-01-30 02:34:40,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:40,920 INFO L93 Difference]: Finished difference Result 366 states and 396 transitions. [2018-01-30 02:34:40,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-01-30 02:34:40,920 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 85 [2018-01-30 02:34:40,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:40,922 INFO L225 Difference]: With dead ends: 366 [2018-01-30 02:34:40,922 INFO L226 Difference]: Without dead ends: 365 [2018-01-30 02:34:40,924 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1759 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=763, Invalid=5557, Unknown=0, NotChecked=0, Total=6320 [2018-01-30 02:34:40,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-01-30 02:34:40,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 211. [2018-01-30 02:34:40,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-01-30 02:34:40,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 229 transitions. [2018-01-30 02:34:40,943 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 229 transitions. Word has length 85 [2018-01-30 02:34:40,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:40,943 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 229 transitions. [2018-01-30 02:34:40,943 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-30 02:34:40,943 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 229 transitions. [2018-01-30 02:34:40,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-01-30 02:34:40,945 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:40,945 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:40,945 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:40,945 INFO L82 PathProgramCache]: Analyzing trace with hash 36527359, now seen corresponding path program 5 times [2018-01-30 02:34:40,945 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:40,945 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:40,946 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:40,946 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:34:40,946 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:40,959 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:41,547 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 30 proven. 86 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-01-30 02:34:41,547 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:34:41,547 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:34:41,554 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 02:34:41,561 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:34:41,564 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:34:41,567 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:34:41,570 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:34:41,574 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:34:41,578 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:34:41,579 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:34:41,583 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:34:41,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 02:34:41,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:34:41,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:34:41,591 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 02:34:41,976 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-01-30 02:34:42,001 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:34:42,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 32 [2018-01-30 02:34:42,002 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-30 02:34:42,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-30 02:34:42,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=954, Unknown=0, NotChecked=0, Total=1056 [2018-01-30 02:34:42,002 INFO L87 Difference]: Start difference. First operand 211 states and 229 transitions. Second operand 33 states. [2018-01-30 02:34:45,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:45,041 INFO L93 Difference]: Finished difference Result 500 states and 541 transitions. [2018-01-30 02:34:45,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-01-30 02:34:45,041 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 104 [2018-01-30 02:34:45,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:45,043 INFO L225 Difference]: With dead ends: 500 [2018-01-30 02:34:45,044 INFO L226 Difference]: Without dead ends: 499 [2018-01-30 02:34:45,046 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2424 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=934, Invalid=7622, Unknown=0, NotChecked=0, Total=8556 [2018-01-30 02:34:45,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-01-30 02:34:45,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 247. [2018-01-30 02:34:45,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-01-30 02:34:45,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 268 transitions. [2018-01-30 02:34:45,067 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 268 transitions. Word has length 104 [2018-01-30 02:34:45,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:45,067 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 268 transitions. [2018-01-30 02:34:45,067 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-30 02:34:45,067 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 268 transitions. [2018-01-30 02:34:45,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-01-30 02:34:45,068 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:45,068 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:45,068 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:45,069 INFO L82 PathProgramCache]: Analyzing trace with hash -382494782, now seen corresponding path program 6 times [2018-01-30 02:34:45,069 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:45,069 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:45,070 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:45,070 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:34:45,070 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:45,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:45,084 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:45,955 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 108 proven. 132 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-01-30 02:34:45,955 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:34:45,955 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:34:45,962 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 02:34:45,973 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:34:45,977 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:34:45,980 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:34:45,983 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:34:45,987 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:34:45,991 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:34:45,997 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:34:45,998 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:34:46,001 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:34:46,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 02:34:46,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:34:46,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:34:46,009 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 02:34:46,397 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 37 proven. 132 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-01-30 02:34:46,418 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:34:46,419 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20] total 42 [2018-01-30 02:34:46,419 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-01-30 02:34:46,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-01-30 02:34:46,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1585, Unknown=0, NotChecked=0, Total=1806 [2018-01-30 02:34:46,420 INFO L87 Difference]: Start difference. First operand 247 states and 268 transitions. Second operand 43 states. [2018-01-30 02:34:48,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:48,159 INFO L93 Difference]: Finished difference Result 455 states and 493 transitions. [2018-01-30 02:34:48,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-30 02:34:48,159 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 123 [2018-01-30 02:34:48,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:48,162 INFO L225 Difference]: With dead ends: 455 [2018-01-30 02:34:48,162 INFO L226 Difference]: Without dead ends: 454 [2018-01-30 02:34:48,164 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=736, Invalid=3956, Unknown=0, NotChecked=0, Total=4692 [2018-01-30 02:34:48,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-01-30 02:34:48,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 274. [2018-01-30 02:34:48,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-01-30 02:34:48,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 297 transitions. [2018-01-30 02:34:48,179 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 297 transitions. Word has length 123 [2018-01-30 02:34:48,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:48,179 INFO L432 AbstractCegarLoop]: Abstraction has 274 states and 297 transitions. [2018-01-30 02:34:48,179 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-01-30 02:34:48,179 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 297 transitions. [2018-01-30 02:34:48,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-01-30 02:34:48,180 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:48,181 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:48,181 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:48,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1091959176, now seen corresponding path program 7 times [2018-01-30 02:34:48,181 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:48,181 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:48,182 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:48,182 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:34:48,182 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:48,197 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:48,744 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 0 proven. 159 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-01-30 02:34:48,744 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:34:48,744 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:34:48,750 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:34:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:48,775 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:34:48,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 02:34:48,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:34:48,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:34:48,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 02:34:49,255 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 0 proven. 159 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-01-30 02:34:49,276 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:34:49,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2018-01-30 02:34:49,277 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-30 02:34:49,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-30 02:34:49,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1012, Unknown=0, NotChecked=0, Total=1190 [2018-01-30 02:34:49,277 INFO L87 Difference]: Start difference. First operand 274 states and 297 transitions. Second operand 35 states. [2018-01-30 02:34:49,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:49,955 INFO L93 Difference]: Finished difference Result 653 states and 705 transitions. [2018-01-30 02:34:49,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-30 02:34:49,955 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 133 [2018-01-30 02:34:49,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:49,957 INFO L225 Difference]: With dead ends: 653 [2018-01-30 02:34:49,957 INFO L226 Difference]: Without dead ends: 652 [2018-01-30 02:34:49,958 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=493, Invalid=2477, Unknown=0, NotChecked=0, Total=2970 [2018-01-30 02:34:49,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2018-01-30 02:34:49,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 283. [2018-01-30 02:34:49,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-01-30 02:34:49,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 307 transitions. [2018-01-30 02:34:49,973 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 307 transitions. Word has length 133 [2018-01-30 02:34:49,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:49,974 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 307 transitions. [2018-01-30 02:34:49,974 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-30 02:34:49,974 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 307 transitions. [2018-01-30 02:34:49,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-01-30 02:34:49,974 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:49,975 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:49,975 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:49,975 INFO L82 PathProgramCache]: Analyzing trace with hash -501068749, now seen corresponding path program 8 times [2018-01-30 02:34:49,975 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:49,975 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:49,976 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:49,976 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:34:49,976 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:49,990 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:50,743 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 44 proven. 188 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2018-01-30 02:34:50,744 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:34:50,744 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:34:50,749 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 02:34:50,757 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:34:50,768 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:34:50,770 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:34:50,773 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:34:50,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 02:34:50,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:34:50,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:34:50,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 02:34:51,222 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-01-30 02:34:51,243 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:34:51,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 40 [2018-01-30 02:34:51,243 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-30 02:34:51,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-30 02:34:51,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1496, Unknown=0, NotChecked=0, Total=1640 [2018-01-30 02:34:51,244 INFO L87 Difference]: Start difference. First operand 283 states and 307 transitions. Second operand 41 states. [2018-01-30 02:34:55,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:55,816 INFO L93 Difference]: Finished difference Result 840 states and 909 transitions. [2018-01-30 02:34:55,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-01-30 02:34:55,816 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 142 [2018-01-30 02:34:55,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:55,819 INFO L225 Difference]: With dead ends: 840 [2018-01-30 02:34:55,820 INFO L226 Difference]: Without dead ends: 839 [2018-01-30 02:34:55,823 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4238 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1342, Invalid=13178, Unknown=0, NotChecked=0, Total=14520 [2018-01-30 02:34:55,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-01-30 02:34:55,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 319. [2018-01-30 02:34:55,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-01-30 02:34:55,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 346 transitions. [2018-01-30 02:34:55,843 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 346 transitions. Word has length 142 [2018-01-30 02:34:55,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:55,843 INFO L432 AbstractCegarLoop]: Abstraction has 319 states and 346 transitions. [2018-01-30 02:34:55,843 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-30 02:34:55,843 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 346 transitions. [2018-01-30 02:34:55,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-01-30 02:34:55,844 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:55,844 INFO L350 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:55,844 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:55,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1765856626, now seen corresponding path program 9 times [2018-01-30 02:34:55,845 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:55,845 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:55,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:55,845 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:34:55,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:55,857 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:56,438 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 51 proven. 254 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2018-01-30 02:34:56,438 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:34:56,439 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:34:56,443 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 02:34:56,452 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:34:56,455 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:34:56,457 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:34:56,460 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:34:56,463 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:34:56,467 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:34:56,470 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:34:56,475 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:34:56,476 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:34:56,481 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:34:56,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 02:34:56,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:34:56,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:34:56,488 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 02:34:57,018 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 51 proven. 254 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2018-01-30 02:34:57,050 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:34:57,051 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2018-01-30 02:34:57,051 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-01-30 02:34:57,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-01-30 02:34:57,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=1860, Unknown=0, NotChecked=0, Total=2162 [2018-01-30 02:34:57,052 INFO L87 Difference]: Start difference. First operand 319 states and 346 transitions. Second operand 47 states. [2018-01-30 02:34:58,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:34:58,221 INFO L93 Difference]: Finished difference Result 480 states and 522 transitions. [2018-01-30 02:34:58,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-30 02:34:58,222 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 161 [2018-01-30 02:34:58,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:34:58,224 INFO L225 Difference]: With dead ends: 480 [2018-01-30 02:34:58,224 INFO L226 Difference]: Without dead ends: 479 [2018-01-30 02:34:58,226 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1543 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=790, Invalid=3902, Unknown=0, NotChecked=0, Total=4692 [2018-01-30 02:34:58,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-01-30 02:34:58,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 346. [2018-01-30 02:34:58,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-01-30 02:34:58,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 375 transitions. [2018-01-30 02:34:58,248 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 375 transitions. Word has length 161 [2018-01-30 02:34:58,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:34:58,249 INFO L432 AbstractCegarLoop]: Abstraction has 346 states and 375 transitions. [2018-01-30 02:34:58,249 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-01-30 02:34:58,249 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 375 transitions. [2018-01-30 02:34:58,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-01-30 02:34:58,250 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:34:58,250 INFO L350 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:34:58,250 INFO L371 AbstractCegarLoop]: === Iteration 25 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:34:58,250 INFO L82 PathProgramCache]: Analyzing trace with hash -991764284, now seen corresponding path program 10 times [2018-01-30 02:34:58,250 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:34:58,250 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:34:58,251 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:58,251 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:34:58,251 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:34:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:34:58,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:34:59,373 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 109 proven. 328 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2018-01-30 02:34:59,373 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:34:59,373 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:34:59,379 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 02:34:59,413 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:34:59,418 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:34:59,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 02:34:59,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:34:59,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:34:59,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 02:35:00,105 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 0 proven. 284 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-01-30 02:35:00,125 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:35:00,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 22] total 48 [2018-01-30 02:35:00,126 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-01-30 02:35:00,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-01-30 02:35:00,126 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=2156, Unknown=0, NotChecked=0, Total=2352 [2018-01-30 02:35:00,127 INFO L87 Difference]: Start difference. First operand 346 states and 375 transitions. Second operand 49 states. [2018-01-30 02:35:07,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:35:07,161 INFO L93 Difference]: Finished difference Result 1180 states and 1277 transitions. [2018-01-30 02:35:07,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-01-30 02:35:07,162 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 171 [2018-01-30 02:35:07,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:35:07,165 INFO L225 Difference]: With dead ends: 1180 [2018-01-30 02:35:07,165 INFO L226 Difference]: Without dead ends: 1179 [2018-01-30 02:35:07,167 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6098 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1726, Invalid=18580, Unknown=0, NotChecked=0, Total=20306 [2018-01-30 02:35:07,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2018-01-30 02:35:07,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 382. [2018-01-30 02:35:07,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-01-30 02:35:07,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 414 transitions. [2018-01-30 02:35:07,191 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 414 transitions. Word has length 171 [2018-01-30 02:35:07,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:35:07,192 INFO L432 AbstractCegarLoop]: Abstraction has 382 states and 414 transitions. [2018-01-30 02:35:07,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-01-30 02:35:07,192 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 414 transitions. [2018-01-30 02:35:07,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-01-30 02:35:07,193 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:35:07,193 INFO L350 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:35:07,193 INFO L371 AbstractCegarLoop]: === Iteration 26 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:35:07,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1859389809, now seen corresponding path program 11 times [2018-01-30 02:35:07,193 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:35:07,193 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:35:07,194 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:35:07,194 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:35:07,194 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:35:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:35:07,208 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:35:07,984 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 125 proven. 414 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2018-01-30 02:35:07,984 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:35:07,984 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:35:07,990 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 02:35:08,001 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:35:08,004 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:35:08,006 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:35:08,010 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:35:08,013 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:35:08,016 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:35:08,020 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:35:08,025 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:35:08,030 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:35:08,036 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:35:08,038 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:35:08,043 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:35:08,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 02:35:08,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:35:08,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:35:08,050 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 02:35:08,888 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2018-01-30 02:35:08,909 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:35:08,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 23] total 52 [2018-01-30 02:35:08,909 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-01-30 02:35:08,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-01-30 02:35:08,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=2533, Unknown=0, NotChecked=0, Total=2756 [2018-01-30 02:35:08,910 INFO L87 Difference]: Start difference. First operand 382 states and 414 transitions. Second operand 53 states. [2018-01-30 02:35:16,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:35:16,843 INFO L93 Difference]: Finished difference Result 1422 states and 1539 transitions. [2018-01-30 02:35:16,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-01-30 02:35:16,857 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 190 [2018-01-30 02:35:16,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:35:16,862 INFO L225 Difference]: With dead ends: 1422 [2018-01-30 02:35:16,862 INFO L226 Difference]: Without dead ends: 1421 [2018-01-30 02:35:16,865 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7273 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1993, Invalid=22187, Unknown=0, NotChecked=0, Total=24180 [2018-01-30 02:35:16,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2018-01-30 02:35:16,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 418. [2018-01-30 02:35:16,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-01-30 02:35:16,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 453 transitions. [2018-01-30 02:35:16,893 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 453 transitions. Word has length 190 [2018-01-30 02:35:16,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:35:16,893 INFO L432 AbstractCegarLoop]: Abstraction has 418 states and 453 transitions. [2018-01-30 02:35:16,893 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-01-30 02:35:16,894 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 453 transitions. [2018-01-30 02:35:16,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-01-30 02:35:16,895 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:35:16,895 INFO L350 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:35:16,895 INFO L371 AbstractCegarLoop]: === Iteration 27 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:35:16,895 INFO L82 PathProgramCache]: Analyzing trace with hash 967372560, now seen corresponding path program 12 times [2018-01-30 02:35:16,895 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:35:16,895 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:35:16,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:35:16,896 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:35:16,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:35:16,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:35:16,909 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:35:17,635 INFO L134 CoverageAnalysis]: Checked inductivity of 935 backedges. 65 proven. 510 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2018-01-30 02:35:17,635 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:35:17,635 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:35:17,641 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 02:35:17,652 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:35:17,654 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:35:17,657 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:35:17,659 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:35:17,662 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:35:17,665 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:35:17,668 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:35:17,671 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:35:17,675 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:35:17,678 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:35:17,683 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 02:35:17,685 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:35:17,689 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:35:17,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 02:35:17,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:35:17,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:35:17,697 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 02:35:18,626 INFO L134 CoverageAnalysis]: Checked inductivity of 935 backedges. 0 proven. 445 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-01-30 02:35:18,647 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:35:18,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26] total 54 [2018-01-30 02:35:18,647 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-01-30 02:35:18,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-01-30 02:35:18,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=2652, Unknown=0, NotChecked=0, Total=2970 [2018-01-30 02:35:18,648 INFO L87 Difference]: Start difference. First operand 418 states and 453 transitions. Second operand 55 states. [2018-01-30 02:35:25,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:35:25,109 INFO L93 Difference]: Finished difference Result 1688 states and 1827 transitions. [2018-01-30 02:35:25,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-01-30 02:35:25,110 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 209 [2018-01-30 02:35:25,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:35:25,114 INFO L225 Difference]: With dead ends: 1688 [2018-01-30 02:35:25,114 INFO L226 Difference]: Without dead ends: 1687 [2018-01-30 02:35:25,117 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8643 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=4052, Invalid=24340, Unknown=0, NotChecked=0, Total=28392 [2018-01-30 02:35:25,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1687 states. [2018-01-30 02:35:25,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1687 to 454. [2018-01-30 02:35:25,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2018-01-30 02:35:25,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 492 transitions. [2018-01-30 02:35:25,169 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 492 transitions. Word has length 209 [2018-01-30 02:35:25,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:35:25,170 INFO L432 AbstractCegarLoop]: Abstraction has 454 states and 492 transitions. [2018-01-30 02:35:25,170 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-01-30 02:35:25,170 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 492 transitions. [2018-01-30 02:35:25,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-01-30 02:35:25,172 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:35:25,172 INFO L350 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:35:25,172 INFO L371 AbstractCegarLoop]: === Iteration 28 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:35:25,173 INFO L82 PathProgramCache]: Analyzing trace with hash 989034789, now seen corresponding path program 13 times [2018-01-30 02:35:25,173 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:35:25,173 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:35:25,174 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:35:25,174 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:35:25,174 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:35:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:35:25,196 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:35:27,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1133 backedges. 435 proven. 698 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:35:27,823 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:35:27,823 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:35:27,830 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:35:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:35:27,874 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:35:27,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 02:35:27,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:35:27,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:35:27,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 02:35:29,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1133 backedges. 0 proven. 539 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2018-01-30 02:35:29,298 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:35:29,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 27] total 77 [2018-01-30 02:35:29,298 INFO L409 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-01-30 02:35:29,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-01-30 02:35:29,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=402, Invalid=5604, Unknown=0, NotChecked=0, Total=6006 [2018-01-30 02:35:29,299 INFO L87 Difference]: Start difference. First operand 454 states and 492 transitions. Second operand 78 states. [2018-01-30 02:35:43,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:35:43,487 INFO L93 Difference]: Finished difference Result 1978 states and 2141 transitions. [2018-01-30 02:35:43,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-01-30 02:35:43,488 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 228 [2018-01-30 02:35:43,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:35:43,492 INFO L225 Difference]: With dead ends: 1978 [2018-01-30 02:35:43,492 INFO L226 Difference]: Without dead ends: 1977 [2018-01-30 02:35:43,493 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 202 SyntacticMatches, 1 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12382 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=2729, Invalid=37071, Unknown=0, NotChecked=0, Total=39800 [2018-01-30 02:35:43,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2018-01-30 02:35:43,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 490. [2018-01-30 02:35:43,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-01-30 02:35:43,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 531 transitions. [2018-01-30 02:35:43,551 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 531 transitions. Word has length 228 [2018-01-30 02:35:43,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:35:43,552 INFO L432 AbstractCegarLoop]: Abstraction has 490 states and 531 transitions. [2018-01-30 02:35:43,552 INFO L433 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-01-30 02:35:43,552 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 531 transitions. [2018-01-30 02:35:43,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-01-30 02:35:43,554 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:35:43,554 INFO L350 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-30 02:35:43,554 INFO L371 AbstractCegarLoop]: === Iteration 29 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:35:43,555 INFO L82 PathProgramCache]: Analyzing trace with hash 492564828, now seen corresponding path program 14 times [2018-01-30 02:35:43,555 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:35:43,555 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:35:43,556 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:35:43,556 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:35:43,556 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:35:43,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:35:43,575 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:35:44,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1350 backedges. 0 proven. 642 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2018-01-30 02:35:44,883 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:35:44,883 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:35:44,903 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 02:35:44,914 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:35:44,934 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:35:44,938 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:35:44,943 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:35:44,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 02:35:44,946 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:35:44,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:35:44,961 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 02:35:45,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1350 backedges. 0 proven. 642 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2018-01-30 02:35:45,861 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:35:45,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 58 [2018-01-30 02:35:45,862 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-01-30 02:35:45,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-01-30 02:35:45,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=2950, Unknown=0, NotChecked=0, Total=3422 [2018-01-30 02:35:45,863 INFO L87 Difference]: Start difference. First operand 490 states and 531 transitions. Second operand 59 states. [2018-01-30 02:35:49,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:35:49,047 INFO L93 Difference]: Finished difference Result 2105 states and 2277 transitions. [2018-01-30 02:35:49,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-01-30 02:35:49,047 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 247 [2018-01-30 02:35:49,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:35:49,052 INFO L225 Difference]: With dead ends: 2105 [2018-01-30 02:35:49,052 INFO L226 Difference]: Without dead ends: 2104 [2018-01-30 02:35:49,053 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2559 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1270, Invalid=8042, Unknown=0, NotChecked=0, Total=9312 [2018-01-30 02:35:49,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2104 states. [2018-01-30 02:35:49,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2104 to 499. [2018-01-30 02:35:49,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2018-01-30 02:35:49,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 541 transitions. [2018-01-30 02:35:49,109 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 541 transitions. Word has length 247 [2018-01-30 02:35:49,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:35:49,110 INFO L432 AbstractCegarLoop]: Abstraction has 499 states and 541 transitions. [2018-01-30 02:35:49,110 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-01-30 02:35:49,110 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 541 transitions. [2018-01-30 02:35:49,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-01-30 02:35:49,111 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:35:49,111 INFO L350 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:35:49,111 INFO L371 AbstractCegarLoop]: === Iteration 30 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:35:49,112 INFO L82 PathProgramCache]: Analyzing trace with hash -442474033, now seen corresponding path program 15 times [2018-01-30 02:35:49,112 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:35:49,112 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:35:49,112 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:35:49,112 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:35:49,113 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:35:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:35:49,134 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:35:50,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1462 backedges. 0 proven. 754 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2018-01-30 02:35:50,495 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:35:50,495 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:35:50,500 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 02:35:50,517 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:35:50,522 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:35:50,526 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:35:50,530 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:35:50,535 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:35:50,540 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:35:50,546 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:35:50,552 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:35:50,558 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:35:50,565 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:35:50,573 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:35:50,582 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:35:50,592 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:35:50,594 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:35:50,599 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:35:50,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 02:35:50,602 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:35:50,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:35:50,613 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 02:35:51,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1462 backedges. 86 proven. 734 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2018-01-30 02:35:52,007 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:35:52,007 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 34] total 64 [2018-01-30 02:35:52,008 INFO L409 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-01-30 02:35:52,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-01-30 02:35:52,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=3750, Unknown=0, NotChecked=0, Total=4160 [2018-01-30 02:35:52,009 INFO L87 Difference]: Start difference. First operand 499 states and 541 transitions. Second operand 65 states. [2018-01-30 02:36:01,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:36:01,556 INFO L93 Difference]: Finished difference Result 2436 states and 2637 transitions. [2018-01-30 02:36:01,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-01-30 02:36:01,557 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 256 [2018-01-30 02:36:01,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:36:01,564 INFO L225 Difference]: With dead ends: 2436 [2018-01-30 02:36:01,565 INFO L226 Difference]: Without dead ends: 2435 [2018-01-30 02:36:01,568 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12802 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=4787, Invalid=32269, Unknown=0, NotChecked=0, Total=37056 [2018-01-30 02:36:01,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2435 states. [2018-01-30 02:36:01,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2435 to 535. [2018-01-30 02:36:01,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-01-30 02:36:01,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 580 transitions. [2018-01-30 02:36:01,628 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 580 transitions. Word has length 256 [2018-01-30 02:36:01,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:36:01,628 INFO L432 AbstractCegarLoop]: Abstraction has 535 states and 580 transitions. [2018-01-30 02:36:01,628 INFO L433 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-01-30 02:36:01,628 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 580 transitions. [2018-01-30 02:36:01,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-01-30 02:36:01,631 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:36:01,631 INFO L350 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:36:01,631 INFO L371 AbstractCegarLoop]: === Iteration 31 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:36:01,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1409688846, now seen corresponding path program 16 times [2018-01-30 02:36:01,632 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:36:01,632 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:36:01,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:36:01,633 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:36:01,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:36:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:36:01,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:36:03,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1707 backedges. 0 proven. 875 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2018-01-30 02:36:03,155 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:36:03,156 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:36:03,160 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 02:36:03,214 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:36:03,220 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:36:03,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-30 02:36:03,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:36:03,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:36:03,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 02:36:04,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1707 backedges. 0 proven. 875 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2018-01-30 02:36:04,328 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:36:04,328 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 64 [2018-01-30 02:36:04,329 INFO L409 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-01-30 02:36:04,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-01-30 02:36:04,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=582, Invalid=3578, Unknown=0, NotChecked=0, Total=4160 [2018-01-30 02:36:04,329 INFO L87 Difference]: Start difference. First operand 535 states and 580 transitions. Second operand 65 states. [2018-01-30 02:36:07,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:36:07,602 INFO L93 Difference]: Finished difference Result 2575 states and 2786 transitions. [2018-01-30 02:36:07,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-01-30 02:36:07,603 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 275 [2018-01-30 02:36:07,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:36:07,608 INFO L225 Difference]: With dead ends: 2575 [2018-01-30 02:36:07,609 INFO L226 Difference]: Without dead ends: 2574 [2018-01-30 02:36:07,610 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 243 SyntacticMatches, 2 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3450 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1517, Invalid=10473, Unknown=0, NotChecked=0, Total=11990 [2018-01-30 02:36:07,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2574 states. [2018-01-30 02:36:07,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2574 to 544. [2018-01-30 02:36:07,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-01-30 02:36:07,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 590 transitions. [2018-01-30 02:36:07,661 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 590 transitions. Word has length 275 [2018-01-30 02:36:07,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:36:07,661 INFO L432 AbstractCegarLoop]: Abstraction has 544 states and 590 transitions. [2018-01-30 02:36:07,661 INFO L433 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-01-30 02:36:07,662 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 590 transitions. [2018-01-30 02:36:07,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-01-30 02:36:07,663 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:36:07,663 INFO L350 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:36:07,663 INFO L371 AbstractCegarLoop]: === Iteration 32 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:36:07,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1923145977, now seen corresponding path program 17 times [2018-01-30 02:36:07,663 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:36:07,663 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:36:07,664 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:36:07,664 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:36:07,664 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:36:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:36:07,683 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-30 02:36:07,896 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:235) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$0(Interpolator.java:233) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:130) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:396) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-30 02:36:07,899 INFO L168 Benchmark]: Toolchain (without parser) took 116700.67 ms. Allocated memory was 302.0 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 262.9 MB in the beginning and 1.2 GB in the end (delta: -891.4 MB). Peak memory consumption was 916.8 MB. Max. memory is 5.3 GB. [2018-01-30 02:36:07,900 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 302.0 MB. Free memory is still 267.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 02:36:07,900 INFO L168 Benchmark]: CACSL2BoogieTranslator took 233.23 ms. Allocated memory is still 302.0 MB. Free memory was 261.9 MB in the beginning and 253.8 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. [2018-01-30 02:36:07,901 INFO L168 Benchmark]: Boogie Preprocessor took 54.08 ms. Allocated memory is still 302.0 MB. Free memory was 253.8 MB in the beginning and 251.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-30 02:36:07,901 INFO L168 Benchmark]: RCFGBuilder took 413.55 ms. Allocated memory is still 302.0 MB. Free memory was 251.7 MB in the beginning and 234.6 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-30 02:36:07,901 INFO L168 Benchmark]: IcfgTransformer took 11846.76 ms. Allocated memory was 302.0 MB in the beginning and 1.2 GB in the end (delta: 850.4 MB). Free memory was 234.6 MB in the beginning and 297.9 MB in the end (delta: -63.3 MB). Peak memory consumption was 787.1 MB. Max. memory is 5.3 GB. [2018-01-30 02:36:07,902 INFO L168 Benchmark]: TraceAbstraction took 104143.21 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 957.9 MB). Free memory was 297.9 MB in the beginning and 1.2 GB in the end (delta: -856.4 MB). Peak memory consumption was 101.5 MB. Max. memory is 5.3 GB. [2018-01-30 02:36:07,903 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.28 ms. Allocated memory is still 302.0 MB. Free memory is still 267.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 233.23 ms. Allocated memory is still 302.0 MB. Free memory was 261.9 MB in the beginning and 253.8 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 54.08 ms. Allocated memory is still 302.0 MB. Free memory was 253.8 MB in the beginning and 251.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 413.55 ms. Allocated memory is still 302.0 MB. Free memory was 251.7 MB in the beginning and 234.6 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * IcfgTransformer took 11846.76 ms. Allocated memory was 302.0 MB in the beginning and 1.2 GB in the end (delta: 850.4 MB). Free memory was 234.6 MB in the beginning and 297.9 MB in the end (delta: -63.3 MB). Peak memory consumption was 787.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 104143.21 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 957.9 MB). Free memory was 297.9 MB in the beginning and 1.2 GB in the end (delta: -856.4 MB). Peak memory consumption was 101.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 59 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 1005 LocStat_NO_SUPPORTING_DISEQUALITIES : 461 LocStat_NO_DISJUNCTIONS : -118 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 79 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 102 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 80 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.288073 RENAME_VARIABLES(MILLISECONDS) : 0.178124 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.246976 PROJECTAWAY(MILLISECONDS) : 0.438846 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.113454 DISJOIN(MILLISECONDS) : 0.184987 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.202966 ADD_EQUALITY(MILLISECONDS) : 0.025903 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.048923 #CONJOIN_DISJUNCTIVE : 667 #RENAME_VARIABLES : 1481 #UNFREEZE : 0 #CONJOIN : 942 #PROJECTAWAY : 882 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 214 #RENAME_VARIABLES_DISJUNCTIVE : 1464 #ADD_EQUALITY : 102 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int] : 1 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_0 : 1 COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : 1 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_1 : 1 COUNT_BLOCKS_for_[#memory_int]_at_dim_1 : 1 COUNT_ARRAY_READS for [#memory_int] : 1 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:235) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-30_02-36-07-914.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-01-30_02-36-07-914.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-01-30_02-36-07-914.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-01-30_02-36-07-914.csv Completed graceful shutdown