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/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 15:50:13,922 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 15:50:13,924 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 15:50:13,938 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 15:50:13,939 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 15:50:13,939 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 15:50:13,940 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 15:50:13,942 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 15:50:13,945 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 15:50:13,946 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 15:50:13,946 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 15:50:13,946 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 15:50:13,947 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 15:50:13,948 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 15:50:13,949 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 15:50:13,951 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 15:50:13,953 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 15:50:13,955 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 15:50:13,957 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 15:50:13,958 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 15:50:13,960 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 15:50:13,960 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 15:50:13,961 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 15:50:13,962 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 15:50:13,963 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 15:50:13,964 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 15:50:13,964 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 15:50:13,965 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 15:50:13,965 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 15:50:13,965 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 15:50:13,966 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 15:50:13,966 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf [2018-01-24 15:50:13,976 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 15:50:13,976 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 15:50:13,977 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 15:50:13,977 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 15:50:13,978 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 15:50:13,978 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 15:50:13,978 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 15:50:13,979 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 15:50:13,979 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 15:50:13,979 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 15:50:13,979 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 15:50:13,980 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 15:50:13,980 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 15:50:13,980 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 15:50:13,980 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 15:50:13,980 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 15:50:13,981 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 15:50:13,981 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 15:50:13,981 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 15:50:13,981 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 15:50:13,981 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 15:50:13,982 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 15:50:13,982 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 15:50:13,982 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:50:13,982 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 15:50:13,983 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 15:50:13,983 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 15:50:13,983 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 15:50:13,983 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 15:50:13,983 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 15:50:13,984 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 15:50:13,984 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 15:50:13,984 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 15:50:13,985 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 15:50:13,985 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 15:50:14,019 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 15:50:14,032 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 15:50:14,037 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 15:50:14,038 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 15:50:14,039 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 15:50:14,040 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-24 15:50:14,176 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 15:50:14,183 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 15:50:14,185 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 15:50:14,185 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 15:50:14,191 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 15:50:14,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:50:14" (1/1) ... [2018-01-24 15:50:14,195 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54d10e7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:50:14, skipping insertion in model container [2018-01-24 15:50:14,195 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:50:14" (1/1) ... [2018-01-24 15:50:14,215 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:50:14,235 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:50:14,357 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:50:14,378 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:50:14,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:50:14 WrapperNode [2018-01-24 15:50:14,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 15:50:14,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 15:50:14,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 15:50:14,387 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 15:50:14,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:50:14" (1/1) ... [2018-01-24 15:50:14,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:50:14" (1/1) ... [2018-01-24 15:50:14,407 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:50:14" (1/1) ... [2018-01-24 15:50:14,407 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:50:14" (1/1) ... [2018-01-24 15:50:14,409 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:50:14" (1/1) ... [2018-01-24 15:50:14,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:50:14" (1/1) ... [2018-01-24 15:50:14,413 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:50:14" (1/1) ... [2018-01-24 15:50:14,414 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 15:50:14,414 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 15:50:14,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 15:50:14,415 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 15:50:14,416 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:50:14" (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-24 15:50:14,458 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 15:50:14,459 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 15:50:14,459 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-24 15:50:14,459 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 15:50:14,459 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 15:50:14,459 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 15:50:14,459 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 15:50:14,460 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 15:50:14,460 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 15:50:14,460 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-24 15:50:14,460 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 15:50:14,460 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 15:50:14,460 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 15:50:14,640 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 15:50:14,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:50:14 BoogieIcfgContainer [2018-01-24 15:50:14,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 15:50:14,641 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 15:50:14,641 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 15:50:14,643 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 15:50:14,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 03:50:14" (1/3) ... [2018-01-24 15:50:14,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bc47f57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:50:14, skipping insertion in model container [2018-01-24 15:50:14,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:50:14" (2/3) ... [2018-01-24 15:50:14,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bc47f57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:50:14, skipping insertion in model container [2018-01-24 15:50:14,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:50:14" (3/3) ... [2018-01-24 15:50:14,647 INFO L105 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-01-24 15:50:14,654 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 15:50:14,659 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-24 15:50:14,707 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 15:50:14,708 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 15:50:14,708 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 15:50:14,708 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 15:50:14,708 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 15:50:14,708 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 15:50:14,708 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 15:50:14,709 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 15:50:14,709 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 15:50:14,730 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-01-24 15:50:14,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-24 15:50:14,737 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:50:14,739 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:50:14,739 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:50:14,744 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-01-24 15:50:14,747 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:50:14,804 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:14,804 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:50:14,804 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:14,804 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:50:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:50:14,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:50:14,915 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-24 15:50:14,917 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:50:14,917 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 15:50:14,917 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:50:14,920 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 15:50:14,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 15:50:14,931 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:50:14,933 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-01-24 15:50:15,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:50:15,051 INFO L93 Difference]: Finished difference Result 101 states and 123 transitions. [2018-01-24 15:50:15,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 15:50:15,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-24 15:50:15,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:50:15,061 INFO L225 Difference]: With dead ends: 101 [2018-01-24 15:50:15,061 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 15:50:15,064 INFO L525 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-24 15:50:15,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 15:50:15,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-01-24 15:50:15,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 15:50:15,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-01-24 15:50:15,164 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-01-24 15:50:15,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:50:15,164 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-01-24 15:50:15,165 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 15:50:15,165 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-01-24 15:50:15,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 15:50:15,165 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:50:15,165 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:50:15,165 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:50:15,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-01-24 15:50:15,166 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:50:15,167 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:15,167 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:50:15,167 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:15,167 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:50:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:50:15,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:50:15,320 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-24 15:50:15,321 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:50:15,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:50:15,321 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:50:15,323 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:50:15,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:50:15,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:50:15,324 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 6 states. [2018-01-24 15:50:15,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:50:15,547 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2018-01-24 15:50:15,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:50:15,547 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-01-24 15:50:15,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:50:15,551 INFO L225 Difference]: With dead ends: 129 [2018-01-24 15:50:15,552 INFO L226 Difference]: Without dead ends: 91 [2018-01-24 15:50:15,553 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:50:15,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-24 15:50:15,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 66. [2018-01-24 15:50:15,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-24 15:50:15,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2018-01-24 15:50:15,564 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 16 [2018-01-24 15:50:15,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:50:15,565 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2018-01-24 15:50:15,565 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:50:15,565 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2018-01-24 15:50:15,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 15:50:15,566 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:50:15,566 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:50:15,566 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:50:15,567 INFO L82 PathProgramCache]: Analyzing trace with hash -258746290, now seen corresponding path program 1 times [2018-01-24 15:50:15,567 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:50:15,568 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:15,569 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:50:15,569 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:15,569 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:50:15,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:50:15,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:50:15,712 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-24 15:50:15,712 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:50:15,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:50:15,712 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:50:15,713 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:50:15,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:50:15,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:50:15,713 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand 5 states. [2018-01-24 15:50:15,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:50:15,821 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2018-01-24 15:50:15,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:50:15,822 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 15:50:15,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:50:15,824 INFO L225 Difference]: With dead ends: 77 [2018-01-24 15:50:15,824 INFO L226 Difference]: Without dead ends: 76 [2018-01-24 15:50:15,825 INFO L525 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-24 15:50:15,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-24 15:50:15,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2018-01-24 15:50:15,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-24 15:50:15,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2018-01-24 15:50:15,836 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 17 [2018-01-24 15:50:15,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:50:15,836 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2018-01-24 15:50:15,837 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:50:15,837 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2018-01-24 15:50:15,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 15:50:15,837 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:50:15,838 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:50:15,838 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:50:15,838 INFO L82 PathProgramCache]: Analyzing trace with hash -258746291, now seen corresponding path program 1 times [2018-01-24 15:50:15,838 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:50:15,839 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:15,839 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:50:15,840 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:15,840 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:50:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:50:15,848 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:50:15,904 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-24 15:50:15,919 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:50:15,919 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:50:15,919 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:50:15,920 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:50:15,920 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:50:15,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:50:15,920 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand 5 states. [2018-01-24 15:50:16,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:50:16,014 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2018-01-24 15:50:16,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:50:16,014 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 15:50:16,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:50:16,015 INFO L225 Difference]: With dead ends: 68 [2018-01-24 15:50:16,015 INFO L226 Difference]: Without dead ends: 67 [2018-01-24 15:50:16,016 INFO L525 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-24 15:50:16,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-24 15:50:16,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-01-24 15:50:16,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-24 15:50:16,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2018-01-24 15:50:16,027 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 17 [2018-01-24 15:50:16,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:50:16,027 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2018-01-24 15:50:16,027 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:50:16,028 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2018-01-24 15:50:16,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 15:50:16,028 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:50:16,028 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:50:16,029 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:50:16,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1933852231, now seen corresponding path program 1 times [2018-01-24 15:50:16,029 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:50:16,030 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:16,030 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:50:16,030 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:16,031 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:50:16,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:50:16,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:50:16,125 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-24 15:50:16,126 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:16,126 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:50:16,127 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-01-24 15:50:16,129 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [12], [13], [14], [17], [19], [28], [29], [30], [34], [39], [41], [79], [80], [81], [83] [2018-01-24 15:50:16,172 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:50:16,172 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:50:16,427 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:50:16,428 INFO L268 AbstractInterpreter]: Visited 20 different actions 27 times. Merged at 7 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 20 variables. [2018-01-24 15:50:16,437 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:50:16,437 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:16,437 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 15:50:16,447 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:50:16,447 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:50:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:50:16,493 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:50:16,542 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-24 15:50:16,543 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:50:16,592 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-24 15:50:16,626 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:16,626 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:50:16,631 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:50:16,631 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:50:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:50:16,659 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:50:16,662 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-24 15:50:16,663 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:50:16,679 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-24 15:50:16,681 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:50:16,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3, 3, 3] total 10 [2018-01-24 15:50:16,682 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:50:16,682 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 15:50:16,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 15:50:16,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-01-24 15:50:16,683 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 9 states. [2018-01-24 15:50:16,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:50:16,937 INFO L93 Difference]: Finished difference Result 107 states and 125 transitions. [2018-01-24 15:50:16,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 15:50:16,938 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-24 15:50:16,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:50:16,939 INFO L225 Difference]: With dead ends: 107 [2018-01-24 15:50:16,939 INFO L226 Difference]: Without dead ends: 105 [2018-01-24 15:50:16,940 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-01-24 15:50:16,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-24 15:50:16,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 90. [2018-01-24 15:50:16,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-01-24 15:50:16,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2018-01-24 15:50:16,953 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 22 [2018-01-24 15:50:16,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:50:16,954 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2018-01-24 15:50:16,954 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 15:50:16,954 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2018-01-24 15:50:16,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 15:50:16,955 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:50:16,955 INFO L322 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, 1] [2018-01-24 15:50:16,955 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:50:16,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1693854175, now seen corresponding path program 1 times [2018-01-24 15:50:16,956 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:50:16,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:16,957 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:50:16,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:16,957 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:50:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:50:16,971 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:50:17,071 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:50:17,072 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:17,072 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:50:17,072 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-24 15:50:17,072 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [14], [17], [19], [23], [24], [28], [29], [30], [34], [39], [40], [41], [43], [45], [79], [80], [81], [83], [84] [2018-01-24 15:50:17,074 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:50:17,074 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:50:18,039 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:50:18,039 INFO L268 AbstractInterpreter]: Visited 26 different actions 96 times. Merged at 16 different actions 45 times. Never widened. Found 7 fixpoints after 3 different actions. Largest state had 21 variables. [2018-01-24 15:50:18,046 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:50:18,046 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:18,046 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 15:50:18,062 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:50:18,062 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:50:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:50:18,089 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:50:18,261 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:50:18,262 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:50:18,541 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:50:18,563 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:18,563 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:50:18,568 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:50:18,568 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:50:18,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:50:18,598 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:50:18,711 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 15:50:18,711 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:50:18,765 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 15:50:18,767 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 3 imperfect interpolant sequences. [2018-01-24 15:50:18,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [6, 6, 6] total 16 [2018-01-24 15:50:18,767 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:50:18,768 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:50:18,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:50:18,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-01-24 15:50:18,769 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand 5 states. [2018-01-24 15:50:18,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:50:18,829 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2018-01-24 15:50:18,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:50:18,830 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-24 15:50:18,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:50:18,832 INFO L225 Difference]: With dead ends: 101 [2018-01-24 15:50:18,832 INFO L226 Difference]: Without dead ends: 99 [2018-01-24 15:50:18,833 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 102 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-01-24 15:50:18,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-24 15:50:18,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 87. [2018-01-24 15:50:18,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-24 15:50:18,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2018-01-24 15:50:18,846 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 29 [2018-01-24 15:50:18,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:50:18,846 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2018-01-24 15:50:18,846 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:50:18,846 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2018-01-24 15:50:18,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 15:50:18,848 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:50:18,848 INFO L322 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:50:18,848 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:50:18,848 INFO L82 PathProgramCache]: Analyzing trace with hash -2013598170, now seen corresponding path program 1 times [2018-01-24 15:50:18,848 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:50:18,849 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:18,849 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:50:18,849 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:18,850 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:50:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:50:18,864 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:50:18,986 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 15:50:18,986 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:50:18,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 15:50:18,987 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:50:18,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 15:50:18,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 15:50:18,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-01-24 15:50:18,987 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand 9 states. [2018-01-24 15:50:19,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:50:19,191 INFO L93 Difference]: Finished difference Result 147 states and 164 transitions. [2018-01-24 15:50:19,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 15:50:19,192 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-01-24 15:50:19,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:50:19,193 INFO L225 Difference]: With dead ends: 147 [2018-01-24 15:50:19,193 INFO L226 Difference]: Without dead ends: 87 [2018-01-24 15:50:19,194 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-01-24 15:50:19,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-24 15:50:19,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 79. [2018-01-24 15:50:19,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-24 15:50:19,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2018-01-24 15:50:19,202 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 35 [2018-01-24 15:50:19,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:50:19,203 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2018-01-24 15:50:19,203 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 15:50:19,203 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2018-01-24 15:50:19,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 15:50:19,204 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:50:19,205 INFO L322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:50:19,205 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:50:19,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1643098334, now seen corresponding path program 1 times [2018-01-24 15:50:19,205 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:50:19,206 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:19,206 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:50:19,206 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:19,206 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:50:19,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:50:19,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:50:19,308 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:50:19,308 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:19,309 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:50:19,309 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-01-24 15:50:19,309 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [14], [17], [19], [23], [24], [28], [29], [30], [34], [37], [39], [41], [43], [45], [49], [53], [58], [60], [63], [65], [66], [67], [78], [79], [80], [81], [83], [84] [2018-01-24 15:50:19,310 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:50:19,310 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:50:20,269 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:50:20,269 INFO L268 AbstractInterpreter]: Visited 35 different actions 123 times. Merged at 25 different actions 62 times. Never widened. Found 7 fixpoints after 3 different actions. Largest state had 21 variables. [2018-01-24 15:50:20,271 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:50:20,271 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:20,271 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 15:50:20,283 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:50:20,283 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:50:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:50:20,303 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:50:20,347 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:50:20,348 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:50:20,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:50:20,546 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:20,546 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:50:20,556 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:50:20,556 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:50:20,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:50:20,589 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:50:20,615 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 15:50:20,615 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:50:20,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 15:50:20,693 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:50:20,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 4, 4] total 16 [2018-01-24 15:50:20,694 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:50:20,695 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 15:50:20,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 15:50:20,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-01-24 15:50:20,695 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand 10 states. [2018-01-24 15:50:20,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:50:20,934 INFO L93 Difference]: Finished difference Result 147 states and 160 transitions. [2018-01-24 15:50:20,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 15:50:20,963 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-01-24 15:50:20,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:50:20,964 INFO L225 Difference]: With dead ends: 147 [2018-01-24 15:50:20,964 INFO L226 Difference]: Without dead ends: 89 [2018-01-24 15:50:20,965 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 135 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2018-01-24 15:50:20,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-24 15:50:20,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2018-01-24 15:50:20,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-24 15:50:20,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2018-01-24 15:50:20,974 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 37 [2018-01-24 15:50:20,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:50:20,975 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2018-01-24 15:50:20,975 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 15:50:20,975 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2018-01-24 15:50:20,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-24 15:50:20,976 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:50:20,977 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:50:20,977 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:50:20,977 INFO L82 PathProgramCache]: Analyzing trace with hash 833411622, now seen corresponding path program 2 times [2018-01-24 15:50:20,977 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:50:20,978 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:20,978 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:50:20,978 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:20,978 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:50:20,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:50:20,989 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:50:21,023 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 15:50:21,023 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:21,023 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:50:21,023 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:50:21,023 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:50:21,023 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:21,023 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 15:50:21,045 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:50:21,045 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:50:21,054 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:21,062 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:50:21,065 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:50:21,130 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:50:21,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-01-24 15:50:21,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:50:21,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 15:50:21,142 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 15:50:21,188 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_~#mask~3.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |main_~#mask~3.base| 0)) (= 0 (select |c_old(#valid)| |main_~#mask~3.base|)))) is different from true [2018-01-24 15:50:21,196 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-24 15:50:21,197 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:50:21,231 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_~#mask~3.base_15| Int)) (or (= (store |c_#valid| |v_main_~#mask~3.base_15| 0) |c_old(#valid)|) (not (= (select |c_#valid| |v_main_~#mask~3.base_15|) 0)))) is different from false [2018-01-24 15:50:21,238 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-24 15:50:21,272 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:50:21,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [4] total 10 [2018-01-24 15:50:21,272 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:50:21,273 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:50:21,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:50:21,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=42, Unknown=2, NotChecked=26, Total=90 [2018-01-24 15:50:21,273 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 6 states. [2018-01-24 15:50:21,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:50:21,331 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2018-01-24 15:50:21,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:50:21,331 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-01-24 15:50:21,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:50:21,332 INFO L225 Difference]: With dead ends: 80 [2018-01-24 15:50:21,332 INFO L226 Difference]: Without dead ends: 63 [2018-01-24 15:50:21,332 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=69, Unknown=2, NotChecked=34, Total=132 [2018-01-24 15:50:21,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-24 15:50:21,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-01-24 15:50:21,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-24 15:50:21,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2018-01-24 15:50:21,339 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 43 [2018-01-24 15:50:21,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:50:21,340 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2018-01-24 15:50:21,340 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:50:21,340 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-01-24 15:50:21,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-24 15:50:21,341 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:50:21,341 INFO L322 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:50:21,341 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:50:21,341 INFO L82 PathProgramCache]: Analyzing trace with hash 98230391, now seen corresponding path program 1 times [2018-01-24 15:50:21,341 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:50:21,342 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:21,342 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:50:21,342 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:21,342 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:50:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:50:21,358 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:50:21,536 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 73 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 15:50:21,536 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:21,536 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:50:21,537 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 60 with the following transitions: [2018-01-24 15:50:21,537 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [14], [16], [17], [19], [23], [24], [28], [29], [30], [34], [39], [41], [43], [45], [79], [80], [81], [83], [84] [2018-01-24 15:50:21,538 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:50:21,538 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:50:22,119 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:50:22,119 INFO L268 AbstractInterpreter]: Visited 26 different actions 99 times. Merged at 16 different actions 46 times. Never widened. Found 7 fixpoints after 3 different actions. Largest state had 21 variables. [2018-01-24 15:50:22,124 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:50:22,124 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:22,124 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 15:50:22,138 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:50:22,138 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:50:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:50:22,167 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:50:22,296 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 83 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 15:50:22,297 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:50:22,437 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 83 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 15:50:22,460 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:22,461 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:50:22,465 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:50:22,465 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:50:22,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:50:22,511 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:50:22,523 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 83 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 15:50:22,523 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:50:22,586 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 83 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 15:50:22,588 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:50:22,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9, 9, 9] total 22 [2018-01-24 15:50:22,588 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:50:22,588 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 15:50:22,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 15:50:22,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2018-01-24 15:50:22,589 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 18 states. [2018-01-24 15:50:22,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:50:22,854 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2018-01-24 15:50:22,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 15:50:22,854 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 59 [2018-01-24 15:50:22,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:50:22,856 INFO L225 Difference]: With dead ends: 131 [2018-01-24 15:50:22,856 INFO L226 Difference]: Without dead ends: 98 [2018-01-24 15:50:22,857 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 218 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2018-01-24 15:50:22,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-24 15:50:22,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2018-01-24 15:50:22,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-24 15:50:22,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2018-01-24 15:50:22,866 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 59 [2018-01-24 15:50:22,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:50:22,867 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2018-01-24 15:50:22,867 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 15:50:22,867 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2018-01-24 15:50:22,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-01-24 15:50:22,868 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:50:22,868 INFO L322 BasicCegarLoop]: trace histogram [10, 8, 8, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:50:22,868 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:50:22,869 INFO L82 PathProgramCache]: Analyzing trace with hash 315437000, now seen corresponding path program 2 times [2018-01-24 15:50:22,869 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:50:22,870 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:22,870 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:50:22,870 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:22,870 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:50:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:50:22,890 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:50:23,073 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 125 proven. 68 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-24 15:50:23,073 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:23,073 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:50:23,073 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:50:23,073 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:50:23,073 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:23,074 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 15:50:23,078 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:50:23,079 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:50:23,087 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:23,096 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:23,098 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:50:23,100 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:50:23,240 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 157 proven. 10 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-01-24 15:50:23,240 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:50:23,396 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 157 proven. 10 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-01-24 15:50:23,422 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:23,422 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:50:23,425 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:50:23,425 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:50:23,437 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:23,459 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:23,483 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:50:23,488 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:50:23,498 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 157 proven. 10 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-01-24 15:50:23,498 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:50:23,580 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 157 proven. 10 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-01-24 15:50:23,585 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:50:23,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8, 8, 8, 8] total 23 [2018-01-24 15:50:23,586 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:50:23,586 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 15:50:23,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 15:50:23,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2018-01-24 15:50:23,587 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand 20 states. [2018-01-24 15:50:23,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:50:23,857 INFO L93 Difference]: Finished difference Result 136 states and 141 transitions. [2018-01-24 15:50:23,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 15:50:23,857 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 83 [2018-01-24 15:50:23,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:50:23,858 INFO L225 Difference]: With dead ends: 136 [2018-01-24 15:50:23,858 INFO L226 Difference]: Without dead ends: 97 [2018-01-24 15:50:23,859 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 315 SyntacticMatches, 9 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=219, Invalid=971, Unknown=0, NotChecked=0, Total=1190 [2018-01-24 15:50:23,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-24 15:50:23,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2018-01-24 15:50:23,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-24 15:50:23,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-01-24 15:50:23,870 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 83 [2018-01-24 15:50:23,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:50:23,871 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-01-24 15:50:23,871 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-24 15:50:23,871 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-01-24 15:50:23,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-01-24 15:50:23,873 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:50:23,873 INFO L322 BasicCegarLoop]: trace histogram [11, 9, 9, 8, 8, 8, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:50:23,873 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:50:23,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1642738256, now seen corresponding path program 3 times [2018-01-24 15:50:23,873 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:50:23,874 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:23,874 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:50:23,874 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:23,874 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:50:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:50:23,894 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:50:24,213 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 138 proven. 20 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-01-24 15:50:24,213 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:24,213 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:50:24,214 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:50:24,214 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:50:24,214 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:24,214 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 15:50:24,219 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 15:50:24,219 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-24 15:50:24,230 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 15:50:24,235 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 15:50:24,242 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 15:50:24,244 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:50:24,247 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:50:24,250 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-24 15:50:24,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:50:24,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:50:24,254 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 15:50:24,511 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 138 proven. 20 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-01-24 15:50:24,511 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:50:24,668 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 128 proven. 30 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-01-24 15:50:24,689 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:24,689 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:50:24,693 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 15:50:24,693 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-24 15:50:24,707 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 15:50:24,716 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 15:50:24,736 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 15:50:24,747 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:50:24,751 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:50:24,753 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-24 15:50:24,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:50:24,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:50:24,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 15:50:24,868 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 148 proven. 20 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-01-24 15:50:24,868 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:50:25,021 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 130 proven. 38 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-01-24 15:50:25,023 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:50:25,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10, 12, 11] total 38 [2018-01-24 15:50:25,023 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:50:25,024 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 15:50:25,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 15:50:25,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1236, Unknown=0, NotChecked=0, Total=1482 [2018-01-24 15:50:25,024 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 21 states. [2018-01-24 15:50:25,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:50:25,170 INFO L93 Difference]: Finished difference Result 128 states and 130 transitions. [2018-01-24 15:50:25,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 15:50:25,170 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 89 [2018-01-24 15:50:25,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:50:25,172 INFO L225 Difference]: With dead ends: 128 [2018-01-24 15:50:25,172 INFO L226 Difference]: Without dead ends: 127 [2018-01-24 15:50:25,173 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 320 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=304, Invalid=1418, Unknown=0, NotChecked=0, Total=1722 [2018-01-24 15:50:25,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-24 15:50:25,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2018-01-24 15:50:25,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-24 15:50:25,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 125 transitions. [2018-01-24 15:50:25,182 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 125 transitions. Word has length 89 [2018-01-24 15:50:25,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:50:25,183 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 125 transitions. [2018-01-24 15:50:25,183 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 15:50:25,183 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 125 transitions. [2018-01-24 15:50:25,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-01-24 15:50:25,184 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:50:25,184 INFO L322 BasicCegarLoop]: trace histogram [15, 12, 12, 11, 11, 11, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:50:25,184 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:50:25,185 INFO L82 PathProgramCache]: Analyzing trace with hash -630750615, now seen corresponding path program 4 times [2018-01-24 15:50:25,185 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:50:25,185 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:25,186 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:50:25,186 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:25,186 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:50:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:50:25,203 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:50:25,425 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 325 proven. 125 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-01-24 15:50:25,426 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:25,426 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:50:25,426 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:50:25,426 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:50:25,426 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:25,426 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 15:50:25,431 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-24 15:50:25,431 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-24 15:50:25,454 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:50:25,456 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:50:25,530 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 355 proven. 24 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-01-24 15:50:25,530 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:50:25,682 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 355 proven. 24 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-01-24 15:50:25,708 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:25,708 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:50:25,712 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-24 15:50:25,713 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-24 15:50:25,766 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:50:25,771 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:50:25,787 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 355 proven. 24 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-01-24 15:50:25,787 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:50:25,887 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 355 proven. 24 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-01-24 15:50:25,889 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:50:25,890 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 10, 10, 10] total 25 [2018-01-24 15:50:25,890 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:50:25,890 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 15:50:25,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 15:50:25,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2018-01-24 15:50:25,891 INFO L87 Difference]: Start difference. First operand 123 states and 125 transitions. Second operand 21 states. [2018-01-24 15:50:26,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:50:26,383 INFO L93 Difference]: Finished difference Result 181 states and 186 transitions. [2018-01-24 15:50:26,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 15:50:26,384 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 119 [2018-01-24 15:50:26,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:50:26,385 INFO L225 Difference]: With dead ends: 181 [2018-01-24 15:50:26,385 INFO L226 Difference]: Without dead ends: 142 [2018-01-24 15:50:26,385 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 459 SyntacticMatches, 10 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=275, Invalid=1131, Unknown=0, NotChecked=0, Total=1406 [2018-01-24 15:50:26,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-01-24 15:50:26,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 133. [2018-01-24 15:50:26,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-24 15:50:26,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2018-01-24 15:50:26,399 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 119 [2018-01-24 15:50:26,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:50:26,399 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2018-01-24 15:50:26,399 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 15:50:26,400 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2018-01-24 15:50:26,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-01-24 15:50:26,401 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:50:26,401 INFO L322 BasicCegarLoop]: trace histogram [16, 13, 13, 12, 12, 12, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:50:26,401 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:50:26,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1849014223, now seen corresponding path program 5 times [2018-01-24 15:50:26,402 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:50:26,402 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:26,403 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:50:26,403 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:26,403 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:50:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:50:26,424 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:50:26,727 INFO L134 CoverageAnalysis]: Checked inductivity of 573 backedges. 225 proven. 30 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-01-24 15:50:26,727 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:26,727 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:50:26,727 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:50:26,727 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:50:26,728 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:26,728 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 15:50:26,733 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-24 15:50:26,733 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:50:26,743 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:26,747 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:26,753 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:26,760 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:26,766 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:26,777 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:26,784 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:50:26,787 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:50:26,794 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-24 15:50:26,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:50:26,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:50:26,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 15:50:26,904 INFO L134 CoverageAnalysis]: Checked inductivity of 573 backedges. 225 proven. 30 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-01-24 15:50:26,904 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:50:27,008 INFO L134 CoverageAnalysis]: Checked inductivity of 573 backedges. 225 proven. 30 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-01-24 15:50:27,029 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:27,029 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 18 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:50:27,032 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-24 15:50:27,032 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:50:27,045 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:27,055 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:27,071 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:27,098 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:27,138 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:27,268 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:27,289 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:50:27,294 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:50:27,299 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-24 15:50:27,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:50:27,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:50:27,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 15:50:27,380 INFO L134 CoverageAnalysis]: Checked inductivity of 573 backedges. 225 proven. 30 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-01-24 15:50:27,381 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:50:27,426 INFO L134 CoverageAnalysis]: Checked inductivity of 573 backedges. 225 proven. 30 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-01-24 15:50:27,428 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:50:27,429 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7, 8, 7] total 18 [2018-01-24 15:50:27,429 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:50:27,429 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 15:50:27,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 15:50:27,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2018-01-24 15:50:27,430 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 13 states. [2018-01-24 15:50:27,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:50:27,554 INFO L93 Difference]: Finished difference Result 142 states and 144 transitions. [2018-01-24 15:50:27,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 15:50:27,554 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 125 [2018-01-24 15:50:27,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:50:27,555 INFO L225 Difference]: With dead ends: 142 [2018-01-24 15:50:27,555 INFO L226 Difference]: Without dead ends: 141 [2018-01-24 15:50:27,556 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 474 SyntacticMatches, 15 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=371, Unknown=0, NotChecked=0, Total=506 [2018-01-24 15:50:27,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-01-24 15:50:27,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 135. [2018-01-24 15:50:27,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 15:50:27,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 137 transitions. [2018-01-24 15:50:27,566 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 137 transitions. Word has length 125 [2018-01-24 15:50:27,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:50:27,567 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 137 transitions. [2018-01-24 15:50:27,567 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 15:50:27,567 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 137 transitions. [2018-01-24 15:50:27,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-01-24 15:50:27,569 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:50:27,569 INFO L322 BasicCegarLoop]: trace histogram [17, 14, 14, 13, 13, 13, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:50:27,569 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:50:27,569 INFO L82 PathProgramCache]: Analyzing trace with hash 659173177, now seen corresponding path program 6 times [2018-01-24 15:50:27,569 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:50:27,570 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:27,570 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:50:27,570 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:27,570 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:50:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:50:27,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:50:27,855 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 285 proven. 52 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-01-24 15:50:27,855 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:27,855 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:50:27,855 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:50:27,855 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:50:27,855 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:27,855 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 15:50:27,860 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-24 15:50:27,861 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-01-24 15:50:27,871 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 15:50:27,889 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 15:50:27,898 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 15:50:27,906 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 15:50:27,915 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 15:50:27,922 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 15:50:27,924 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:50:27,928 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:50:27,931 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-24 15:50:27,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:50:27,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:50:27,934 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 15:50:28,239 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 349 proven. 174 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-01-24 15:50:28,239 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:50:28,576 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 319 proven. 204 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-01-24 15:50:28,597 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:28,597 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 20 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:50:28,600 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-24 15:50:28,601 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-01-24 15:50:28,615 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 15:50:28,624 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 15:50:28,642 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 15:50:28,671 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 15:50:28,712 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 15:50:28,804 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 15:50:28,826 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:50:28,832 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:50:28,839 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-24 15:50:28,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:50:28,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:50:28,843 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 15:50:29,028 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 285 proven. 52 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-01-24 15:50:29,028 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:50:29,175 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 285 proven. 52 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-01-24 15:50:29,177 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:50:29,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 15, 9, 8] total 48 [2018-01-24 15:50:29,177 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:50:29,178 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-24 15:50:29,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-24 15:50:29,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=2083, Unknown=0, NotChecked=0, Total=2352 [2018-01-24 15:50:29,178 INFO L87 Difference]: Start difference. First operand 135 states and 137 transitions. Second operand 25 states. [2018-01-24 15:50:30,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:50:30,045 INFO L93 Difference]: Finished difference Result 208 states and 217 transitions. [2018-01-24 15:50:30,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-24 15:50:30,045 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 131 [2018-01-24 15:50:30,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:50:30,046 INFO L225 Difference]: With dead ends: 208 [2018-01-24 15:50:30,046 INFO L226 Difference]: Without dead ends: 207 [2018-01-24 15:50:30,048 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 471 SyntacticMatches, 13 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1545 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=842, Invalid=3988, Unknown=0, NotChecked=0, Total=4830 [2018-01-24 15:50:30,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-01-24 15:50:30,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 195. [2018-01-24 15:50:30,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-01-24 15:50:30,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 202 transitions. [2018-01-24 15:50:30,062 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 202 transitions. Word has length 131 [2018-01-24 15:50:30,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:50:30,063 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 202 transitions. [2018-01-24 15:50:30,063 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-24 15:50:30,063 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 202 transitions. [2018-01-24 15:50:30,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-01-24 15:50:30,065 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:50:30,065 INFO L322 BasicCegarLoop]: trace histogram [19, 16, 16, 15, 15, 15, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:50:30,065 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:50:30,065 INFO L82 PathProgramCache]: Analyzing trace with hash -177564663, now seen corresponding path program 7 times [2018-01-24 15:50:30,065 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:50:30,066 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:30,066 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:50:30,066 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:30,066 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:50:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:50:30,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:50:30,460 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 379 proven. 80 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-01-24 15:50:30,461 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:30,461 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:50:30,461 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:50:30,461 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:50:30,461 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:30,461 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 15:50:30,466 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:50:30,466 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:50:30,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:50:30,496 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:50:30,595 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 629 proven. 40 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-01-24 15:50:30,595 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:50:30,732 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 655 proven. 14 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-01-24 15:50:30,753 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:30,753 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 22 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:50:30,757 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:50:30,757 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:50:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:50:30,820 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:50:30,838 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 629 proven. 40 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-01-24 15:50:30,839 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:50:30,939 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 655 proven. 14 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-01-24 15:50:30,940 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:50:30,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11, 11, 11] total 25 [2018-01-24 15:50:30,941 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:50:30,941 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 15:50:30,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 15:50:30,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2018-01-24 15:50:30,941 INFO L87 Difference]: Start difference. First operand 195 states and 202 transitions. Second operand 20 states. [2018-01-24 15:50:31,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:50:31,374 INFO L93 Difference]: Finished difference Result 324 states and 340 transitions. [2018-01-24 15:50:31,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 15:50:31,374 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 143 [2018-01-24 15:50:31,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:50:31,376 INFO L225 Difference]: With dead ends: 324 [2018-01-24 15:50:31,376 INFO L226 Difference]: Without dead ends: 212 [2018-01-24 15:50:31,377 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 548 SyntacticMatches, 10 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=239, Invalid=1021, Unknown=0, NotChecked=0, Total=1260 [2018-01-24 15:50:31,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-01-24 15:50:31,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 192. [2018-01-24 15:50:31,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-01-24 15:50:31,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 198 transitions. [2018-01-24 15:50:31,392 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 198 transitions. Word has length 143 [2018-01-24 15:50:31,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:50:31,393 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 198 transitions. [2018-01-24 15:50:31,393 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-24 15:50:31,393 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 198 transitions. [2018-01-24 15:50:31,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-01-24 15:50:31,394 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:50:31,394 INFO L322 BasicCegarLoop]: trace histogram [25, 21, 21, 20, 20, 20, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:50:31,394 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:50:31,395 INFO L82 PathProgramCache]: Analyzing trace with hash 267706226, now seen corresponding path program 8 times [2018-01-24 15:50:31,395 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:50:31,395 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:31,395 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:50:31,396 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:31,396 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:50:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:50:31,416 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:50:31,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 712 proven. 74 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2018-01-24 15:50:31,673 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:31,673 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:50:31,673 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:50:31,673 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:50:31,673 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:31,673 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 15:50:31,678 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:50:31,678 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:50:31,693 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:31,718 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:31,722 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:50:31,726 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:50:31,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 734 proven. 52 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2018-01-24 15:50:31,872 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:50:32,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 734 proven. 52 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2018-01-24 15:50:32,039 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:32,039 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 24 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:50:32,042 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:50:32,042 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:50:32,057 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:32,100 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:32,130 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:50:32,137 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:50:32,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 734 proven. 52 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2018-01-24 15:50:32,178 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:50:32,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 734 proven. 52 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2018-01-24 15:50:32,300 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:50:32,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15, 15, 15] total 37 [2018-01-24 15:50:32,300 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:50:32,301 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-24 15:50:32,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-24 15:50:32,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1101, Unknown=0, NotChecked=0, Total=1332 [2018-01-24 15:50:32,301 INFO L87 Difference]: Start difference. First operand 192 states and 198 transitions. Second operand 30 states. [2018-01-24 15:50:33,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:50:33,003 INFO L93 Difference]: Finished difference Result 403 states and 428 transitions. [2018-01-24 15:50:33,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 15:50:33,004 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 185 [2018-01-24 15:50:33,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:50:33,006 INFO L225 Difference]: With dead ends: 403 [2018-01-24 15:50:33,006 INFO L226 Difference]: Without dead ends: 307 [2018-01-24 15:50:33,007 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 766 GetRequests, 707 SyntacticMatches, 13 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 933 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=493, Invalid=1763, Unknown=0, NotChecked=0, Total=2256 [2018-01-24 15:50:33,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-01-24 15:50:33,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 297. [2018-01-24 15:50:33,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-01-24 15:50:33,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 310 transitions. [2018-01-24 15:50:33,038 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 310 transitions. Word has length 185 [2018-01-24 15:50:33,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:50:33,039 INFO L432 AbstractCegarLoop]: Abstraction has 297 states and 310 transitions. [2018-01-24 15:50:33,039 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-24 15:50:33,039 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 310 transitions. [2018-01-24 15:50:33,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-01-24 15:50:33,041 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:50:33,041 INFO L322 BasicCegarLoop]: trace histogram [30, 25, 25, 24, 24, 24, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:50:33,041 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:50:33,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1222792877, now seen corresponding path program 9 times [2018-01-24 15:50:33,041 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:50:33,042 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:33,042 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:50:33,042 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:33,043 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:50:33,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:50:33,071 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:50:33,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 1261 proven. 413 refuted. 0 times theorem prover too weak. 473 trivial. 0 not checked. [2018-01-24 15:50:33,610 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:33,610 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:50:33,610 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:50:33,610 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:50:33,611 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:33,611 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 15:50:33,616 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 15:50:33,616 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-24 15:50:33,634 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 15:50:33,638 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 15:50:33,643 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 15:50:33,654 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 15:50:33,668 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 15:50:33,677 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 15:50:33,680 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:50:33,686 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:50:33,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-24 15:50:33,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:50:33,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:50:33,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 15:50:34,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 817 proven. 92 refuted. 0 times theorem prover too weak. 1238 trivial. 0 not checked. [2018-01-24 15:50:34,173 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:50:34,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 795 proven. 114 refuted. 0 times theorem prover too weak. 1238 trivial. 0 not checked. [2018-01-24 15:50:34,554 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:34,554 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 26 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:50:34,564 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 15:50:34,564 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-24 15:50:34,584 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 15:50:34,594 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 15:50:34,615 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 15:50:34,651 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 15:50:34,721 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 15:50:34,860 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 15:50:34,888 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:50:34,896 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:50:34,902 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-24 15:50:34,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:50:34,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:50:34,908 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 15:50:35,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 883 proven. 92 refuted. 0 times theorem prover too weak. 1172 trivial. 0 not checked. [2018-01-24 15:50:35,268 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:50:35,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 819 proven. 156 refuted. 0 times theorem prover too weak. 1172 trivial. 0 not checked. [2018-01-24 15:50:35,709 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:50:35,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 13, 17, 16] total 61 [2018-01-24 15:50:35,709 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:50:35,709 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-24 15:50:35,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-24 15:50:35,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=393, Invalid=3267, Unknown=0, NotChecked=0, Total=3660 [2018-01-24 15:50:35,711 INFO L87 Difference]: Start difference. First operand 297 states and 310 transitions. Second operand 33 states. [2018-01-24 15:50:38,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:50:38,473 INFO L93 Difference]: Finished difference Result 461 states and 483 transitions. [2018-01-24 15:50:38,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-01-24 15:50:38,473 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 221 [2018-01-24 15:50:38,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:50:38,475 INFO L225 Difference]: With dead ends: 461 [2018-01-24 15:50:38,475 INFO L226 Difference]: Without dead ends: 350 [2018-01-24 15:50:38,477 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 952 GetRequests, 825 SyntacticMatches, 19 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4054 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1685, Invalid=10305, Unknown=0, NotChecked=0, Total=11990 [2018-01-24 15:50:38,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-01-24 15:50:38,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 342. [2018-01-24 15:50:38,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-01-24 15:50:38,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 349 transitions. [2018-01-24 15:50:38,503 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 349 transitions. Word has length 221 [2018-01-24 15:50:38,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:50:38,504 INFO L432 AbstractCegarLoop]: Abstraction has 342 states and 349 transitions. [2018-01-24 15:50:38,504 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-24 15:50:38,504 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 349 transitions. [2018-01-24 15:50:38,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-01-24 15:50:38,506 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:50:38,506 INFO L322 BasicCegarLoop]: trace histogram [38, 32, 32, 31, 31, 31, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:50:38,506 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:50:38,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1481262388, now seen corresponding path program 10 times [2018-01-24 15:50:38,507 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:50:38,507 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:38,508 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:50:38,508 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:38,508 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:50:38,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:50:38,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:50:39,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3508 backedges. 1886 proven. 677 refuted. 0 times theorem prover too weak. 945 trivial. 0 not checked. [2018-01-24 15:50:39,068 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:39,069 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:50:39,069 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:50:39,069 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:50:39,069 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:39,069 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 15:50:39,074 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-24 15:50:39,074 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-24 15:50:39,120 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:50:39,123 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:50:39,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3508 backedges. 2081 proven. 44 refuted. 0 times theorem prover too weak. 1383 trivial. 0 not checked. [2018-01-24 15:50:39,276 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:50:39,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3508 backedges. 1459 proven. 382 refuted. 0 times theorem prover too weak. 1667 trivial. 0 not checked. [2018-01-24 15:50:39,498 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:39,499 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 28 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:50:39,502 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-24 15:50:39,502 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-24 15:50:39,624 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:50:39,634 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:50:39,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3508 backedges. 2081 proven. 44 refuted. 0 times theorem prover too weak. 1383 trivial. 0 not checked. [2018-01-24 15:50:39,685 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:50:39,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3508 backedges. 1459 proven. 382 refuted. 0 times theorem prover too weak. 1667 trivial. 0 not checked. [2018-01-24 15:50:39,842 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:50:39,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12, 12, 12, 12] total 34 [2018-01-24 15:50:39,842 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:50:39,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-24 15:50:39,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-24 15:50:39,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=948, Unknown=0, NotChecked=0, Total=1122 [2018-01-24 15:50:39,843 INFO L87 Difference]: Start difference. First operand 342 states and 349 transitions. Second operand 29 states. [2018-01-24 15:50:40,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:50:40,824 INFO L93 Difference]: Finished difference Result 498 states and 506 transitions. [2018-01-24 15:50:40,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 15:50:40,825 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 275 [2018-01-24 15:50:40,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:50:40,827 INFO L225 Difference]: With dead ends: 498 [2018-01-24 15:50:40,827 INFO L226 Difference]: Without dead ends: 285 [2018-01-24 15:50:40,828 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 1138 GetRequests, 1075 SyntacticMatches, 12 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1007 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=424, Invalid=2332, Unknown=0, NotChecked=0, Total=2756 [2018-01-24 15:50:40,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-01-24 15:50:40,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2018-01-24 15:50:40,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-01-24 15:50:40,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 287 transitions. [2018-01-24 15:50:40,858 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 287 transitions. Word has length 275 [2018-01-24 15:50:40,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:50:40,858 INFO L432 AbstractCegarLoop]: Abstraction has 285 states and 287 transitions. [2018-01-24 15:50:40,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-24 15:50:40,859 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 287 transitions. [2018-01-24 15:50:40,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-01-24 15:50:40,860 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:50:40,861 INFO L322 BasicCegarLoop]: trace histogram [39, 33, 33, 32, 32, 32, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:50:40,861 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:50:40,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1397576748, now seen corresponding path program 11 times [2018-01-24 15:50:40,861 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:50:40,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:40,862 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:50:40,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:40,862 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:50:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:50:40,893 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:50:41,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3710 backedges. 2416 proven. 425 refuted. 0 times theorem prover too weak. 869 trivial. 0 not checked. [2018-01-24 15:50:41,627 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:41,627 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:50:41,627 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:50:41,627 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:50:41,627 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:41,627 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:50:41,632 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-24 15:50:41,633 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:50:41,647 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:41,649 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:41,652 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:41,656 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:41,662 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:41,669 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:41,676 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:41,683 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:41,691 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:41,697 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:41,699 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:50:41,703 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:50:41,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3710 backedges. 1998 proven. 491 refuted. 0 times theorem prover too weak. 1221 trivial. 0 not checked. [2018-01-24 15:50:41,948 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:50:42,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3710 backedges. 2006 proven. 483 refuted. 0 times theorem prover too weak. 1221 trivial. 0 not checked. [2018-01-24 15:50:42,345 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:42,346 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 30 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:50:42,349 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-24 15:50:42,349 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:50:42,369 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:42,375 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:42,387 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:42,419 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:42,477 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:42,542 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:42,737 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:43,128 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:43,616 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:46,088 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:46,153 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:50:46,163 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:50:46,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3710 backedges. 2015 proven. 580 refuted. 0 times theorem prover too weak. 1115 trivial. 0 not checked. [2018-01-24 15:50:46,249 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:50:46,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3710 backedges. 2029 proven. 566 refuted. 0 times theorem prover too weak. 1115 trivial. 0 not checked. [2018-01-24 15:50:46,490 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:50:46,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 19, 19, 19] total 50 [2018-01-24 15:50:46,491 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:50:46,491 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-24 15:50:46,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-24 15:50:46,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=2133, Unknown=0, NotChecked=0, Total=2450 [2018-01-24 15:50:46,492 INFO L87 Difference]: Start difference. First operand 285 states and 287 transitions. Second operand 36 states. [2018-01-24 15:50:47,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:50:47,688 INFO L93 Difference]: Finished difference Result 361 states and 366 transitions. [2018-01-24 15:50:47,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-24 15:50:47,688 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 281 [2018-01-24 15:50:47,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:50:47,689 INFO L225 Difference]: With dead ends: 361 [2018-01-24 15:50:47,689 INFO L226 Difference]: Without dead ends: 304 [2018-01-24 15:50:47,691 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 1178 GetRequests, 1085 SyntacticMatches, 19 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2104 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=918, Invalid=4782, Unknown=0, NotChecked=0, Total=5700 [2018-01-24 15:50:47,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-01-24 15:50:47,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 295. [2018-01-24 15:50:47,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-01-24 15:50:47,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 297 transitions. [2018-01-24 15:50:47,712 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 297 transitions. Word has length 281 [2018-01-24 15:50:47,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:50:47,713 INFO L432 AbstractCegarLoop]: Abstraction has 295 states and 297 transitions. [2018-01-24 15:50:47,713 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-24 15:50:47,713 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 297 transitions. [2018-01-24 15:50:47,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-01-24 15:50:47,714 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:50:47,715 INFO L322 BasicCegarLoop]: trace histogram [40, 34, 34, 33, 33, 33, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:50:47,715 INFO L371 AbstractCegarLoop]: === Iteration 21 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:50:47,715 INFO L82 PathProgramCache]: Analyzing trace with hash -825440932, now seen corresponding path program 12 times [2018-01-24 15:50:47,715 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:50:47,716 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:47,716 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:50:47,716 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:47,716 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:50:47,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:50:47,738 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:50:48,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3918 backedges. 1170 proven. 114 refuted. 0 times theorem prover too weak. 2634 trivial. 0 not checked. [2018-01-24 15:50:48,463 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:48,463 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:50:48,463 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:50:48,463 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:50:48,463 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:48,463 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:50:48,469 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-24 15:50:48,469 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-01-24 15:50:48,487 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 15:50:48,492 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 15:50:48,495 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 15:50:48,497 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 15:50:48,502 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 15:50:48,514 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 15:50:48,520 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 15:50:48,527 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 15:50:48,534 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 15:50:48,543 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 15:50:48,555 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 15:50:48,557 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:50:48,562 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:50:48,566 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-24 15:50:48,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:50:48,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:50:48,576 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 15:50:49,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3918 backedges. 1264 proven. 821 refuted. 0 times theorem prover too weak. 1833 trivial. 0 not checked. [2018-01-24 15:50:49,180 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:50:49,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3918 backedges. 1206 proven. 172 refuted. 0 times theorem prover too weak. 2540 trivial. 0 not checked. [2018-01-24 15:50:49,594 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:49,595 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 32 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:50:49,598 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-24 15:50:49,598 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-01-24 15:50:49,619 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 15:50:49,629 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 15:50:49,645 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 15:50:49,665 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 15:50:49,699 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 15:50:49,774 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 15:50:49,913 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 15:50:50,124 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 15:50:50,518 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 15:50:51,346 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 15:50:52,611 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 15:50:52,673 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:50:52,685 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:50:52,694 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-24 15:50:52,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:50:52,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:50:52,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 15:50:53,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3918 backedges. 1170 proven. 114 refuted. 0 times theorem prover too weak. 2634 trivial. 0 not checked. [2018-01-24 15:50:53,074 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:50:53,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3918 backedges. 1170 proven. 114 refuted. 0 times theorem prover too weak. 2634 trivial. 0 not checked. [2018-01-24 15:50:53,331 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:50:53,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 22, 16, 11, 10] total 60 [2018-01-24 15:50:53,332 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:50:53,332 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-24 15:50:53,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-24 15:50:53,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=601, Invalid=3059, Unknown=0, NotChecked=0, Total=3660 [2018-01-24 15:50:53,333 INFO L87 Difference]: Start difference. First operand 295 states and 297 transitions. Second operand 33 states. [2018-01-24 15:50:54,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:50:54,174 INFO L93 Difference]: Finished difference Result 306 states and 308 transitions. [2018-01-24 15:50:54,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-24 15:50:54,174 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 287 [2018-01-24 15:50:54,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:50:54,176 INFO L225 Difference]: With dead ends: 306 [2018-01-24 15:50:54,177 INFO L226 Difference]: Without dead ends: 305 [2018-01-24 15:50:54,179 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 1176 GetRequests, 1075 SyntacticMatches, 24 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2418 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1109, Invalid=5053, Unknown=0, NotChecked=0, Total=6162 [2018-01-24 15:50:54,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-01-24 15:50:54,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 297. [2018-01-24 15:50:54,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-01-24 15:50:54,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 299 transitions. [2018-01-24 15:50:54,211 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 299 transitions. Word has length 287 [2018-01-24 15:50:54,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:50:54,211 INFO L432 AbstractCegarLoop]: Abstraction has 297 states and 299 transitions. [2018-01-24 15:50:54,211 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-24 15:50:54,212 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 299 transitions. [2018-01-24 15:50:54,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-01-24 15:50:54,214 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:50:54,214 INFO L322 BasicCegarLoop]: trace histogram [41, 35, 35, 34, 34, 34, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:50:54,214 INFO L371 AbstractCegarLoop]: === Iteration 22 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:50:54,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1751572516, now seen corresponding path program 13 times [2018-01-24 15:50:54,214 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:50:54,215 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:54,215 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:50:54,215 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:54,216 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:50:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:50:54,247 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:50:54,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4132 backedges. 1344 proven. 154 refuted. 0 times theorem prover too weak. 2634 trivial. 0 not checked. [2018-01-24 15:50:54,724 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:54,724 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:50:54,724 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:50:54,724 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:50:54,725 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:54,725 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:50:54,729 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:50:54,729 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:50:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:50:54,783 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:50:54,787 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-24 15:50:54,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:50:54,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:50:54,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 15:50:55,099 INFO L134 CoverageAnalysis]: Checked inductivity of 4132 backedges. 1344 proven. 154 refuted. 0 times theorem prover too weak. 2634 trivial. 0 not checked. [2018-01-24 15:50:55,099 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:50:55,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4132 backedges. 1344 proven. 154 refuted. 0 times theorem prover too weak. 2634 trivial. 0 not checked. [2018-01-24 15:50:55,355 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:55,355 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 34 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:50:55,358 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:50:55,358 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:50:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:50:55,492 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:50:55,497 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-24 15:50:55,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:50:55,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:50:55,500 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 15:50:55,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4132 backedges. 1344 proven. 154 refuted. 0 times theorem prover too weak. 2634 trivial. 0 not checked. [2018-01-24 15:50:55,713 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:50:55,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4132 backedges. 1344 proven. 154 refuted. 0 times theorem prover too weak. 2634 trivial. 0 not checked. [2018-01-24 15:50:55,823 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:50:55,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11, 12, 11] total 30 [2018-01-24 15:50:55,824 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:50:55,824 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 15:50:55,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 15:50:55,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=714, Unknown=0, NotChecked=0, Total=930 [2018-01-24 15:50:55,825 INFO L87 Difference]: Start difference. First operand 297 states and 299 transitions. Second operand 21 states. [2018-01-24 15:50:56,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:50:56,206 INFO L93 Difference]: Finished difference Result 322 states and 326 transitions. [2018-01-24 15:50:56,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 15:50:56,206 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 293 [2018-01-24 15:50:56,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:50:56,208 INFO L225 Difference]: With dead ends: 322 [2018-01-24 15:50:56,208 INFO L226 Difference]: Without dead ends: 321 [2018-01-24 15:50:56,209 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 1190 GetRequests, 1126 SyntacticMatches, 27 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=369, Invalid=1113, Unknown=0, NotChecked=0, Total=1482 [2018-01-24 15:50:56,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-01-24 15:50:56,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 303. [2018-01-24 15:50:56,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-01-24 15:50:56,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 306 transitions. [2018-01-24 15:50:56,243 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 306 transitions. Word has length 293 [2018-01-24 15:50:56,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:50:56,243 INFO L432 AbstractCegarLoop]: Abstraction has 303 states and 306 transitions. [2018-01-24 15:50:56,244 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 15:50:56,244 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 306 transitions. [2018-01-24 15:50:56,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-01-24 15:50:56,246 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:50:56,246 INFO L322 BasicCegarLoop]: trace histogram [42, 36, 36, 35, 35, 35, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:50:56,246 INFO L371 AbstractCegarLoop]: === Iteration 23 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:50:56,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1671183124, now seen corresponding path program 14 times [2018-01-24 15:50:56,246 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:50:56,247 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:56,247 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:50:56,247 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:56,247 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:50:56,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:50:56,276 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:50:56,851 INFO L134 CoverageAnalysis]: Checked inductivity of 4352 backedges. 1688 proven. 144 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-01-24 15:50:56,852 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:56,852 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:50:56,852 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:50:56,852 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:50:56,852 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:56,852 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:50:56,857 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:50:56,857 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:50:56,872 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:56,906 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:56,912 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:50:56,916 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:50:57,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4352 backedges. 1718 proven. 114 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-01-24 15:50:57,163 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:50:57,400 INFO L134 CoverageAnalysis]: Checked inductivity of 4352 backedges. 1718 proven. 114 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-01-24 15:50:57,420 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:50:57,420 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 36 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:50:57,423 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:50:57,423 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:50:57,443 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:57,507 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:50:57,552 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:50:57,561 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:50:57,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4352 backedges. 1718 proven. 114 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-01-24 15:50:57,611 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:50:57,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4352 backedges. 1718 proven. 114 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-01-24 15:50:57,746 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:50:57,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 19, 19, 19] total 47 [2018-01-24 15:50:57,746 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:50:57,747 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-24 15:50:57,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-24 15:50:57,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1795, Unknown=0, NotChecked=0, Total=2162 [2018-01-24 15:50:57,748 INFO L87 Difference]: Start difference. First operand 303 states and 306 transitions. Second operand 38 states. [2018-01-24 15:50:58,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:50:58,233 INFO L93 Difference]: Finished difference Result 449 states and 459 transitions. [2018-01-24 15:50:58,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-24 15:50:58,233 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 299 [2018-01-24 15:50:58,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:50:58,236 INFO L225 Difference]: With dead ends: 449 [2018-01-24 15:50:58,236 INFO L226 Difference]: Without dead ends: 377 [2018-01-24 15:50:58,237 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 1230 GetRequests, 1153 SyntacticMatches, 17 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1686 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=808, Invalid=2974, Unknown=0, NotChecked=0, Total=3782 [2018-01-24 15:50:58,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-01-24 15:50:58,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 369. [2018-01-24 15:50:58,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-01-24 15:50:58,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 373 transitions. [2018-01-24 15:50:58,262 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 373 transitions. Word has length 299 [2018-01-24 15:50:58,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:50:58,262 INFO L432 AbstractCegarLoop]: Abstraction has 369 states and 373 transitions. [2018-01-24 15:50:58,262 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-24 15:50:58,262 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 373 transitions. [2018-01-24 15:50:58,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-01-24 15:50:58,265 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:50:58,265 INFO L322 BasicCegarLoop]: trace histogram [50, 43, 43, 42, 42, 42, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:50:58,265 INFO L371 AbstractCegarLoop]: === Iteration 24 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-24 15:50:58,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1483763557, now seen corresponding path program 15 times [2018-01-24 15:50:58,266 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:50:58,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:58,266 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:50:58,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:50:58,267 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:50:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:50:58,301 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-24 15:50:58,739 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 15:50:58,743 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 15:50:58,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 03:50:58 BoogieIcfgContainer [2018-01-24 15:50:58,744 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 15:50:58,744 INFO L168 Benchmark]: Toolchain (without parser) took 44567.58 ms. Allocated memory was 305.1 MB in the beginning and 966.3 MB in the end (delta: 661.1 MB). Free memory was 266.2 MB in the beginning and 592.7 MB in the end (delta: -326.5 MB). Peak memory consumption was 334.6 MB. Max. memory is 5.3 GB. [2018-01-24 15:50:58,745 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 305.1 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 15:50:58,745 INFO L168 Benchmark]: CACSL2BoogieTranslator took 201.78 ms. Allocated memory is still 305.1 MB. Free memory was 265.2 MB in the beginning and 257.1 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:50:58,746 INFO L168 Benchmark]: Boogie Preprocessor took 27.61 ms. Allocated memory is still 305.1 MB. Free memory was 257.1 MB in the beginning and 255.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-24 15:50:58,746 INFO L168 Benchmark]: RCFGBuilder took 225.83 ms. Allocated memory is still 305.1 MB. Free memory was 255.1 MB in the beginning and 240.3 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 5.3 GB. [2018-01-24 15:50:58,746 INFO L168 Benchmark]: TraceAbstraction took 44102.78 ms. Allocated memory was 305.1 MB in the beginning and 966.3 MB in the end (delta: 661.1 MB). Free memory was 239.3 MB in the beginning and 592.7 MB in the end (delta: -353.3 MB). Peak memory consumption was 307.8 MB. Max. memory is 5.3 GB. [2018-01-24 15:50:58,747 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.21 ms. Allocated memory is still 305.1 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 201.78 ms. Allocated memory is still 305.1 MB. Free memory was 265.2 MB in the beginning and 257.1 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.61 ms. Allocated memory is still 305.1 MB. Free memory was 257.1 MB in the beginning and 255.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 225.83 ms. Allocated memory is still 305.1 MB. Free memory was 255.1 MB in the beginning and 240.3 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 44102.78 ms. Allocated memory was 305.1 MB in the beginning and 966.3 MB in the end (delta: 661.1 MB). Free memory was 239.3 MB in the beginning and 592.7 MB in the end (delta: -353.3 MB). Peak memory consumption was 307.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 19 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 147 LocStat_NO_SUPPORTING_DISEQUALITIES : 36 LocStat_NO_DISJUNCTIONS : -38 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 26 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 31 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 27 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.574585 RENAME_VARIABLES(MILLISECONDS) : 0.475415 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.505693 PROJECTAWAY(MILLISECONDS) : 0.357242 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.158380 DISJOIN(MILLISECONDS) : 2.334242 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.516963 ADD_EQUALITY(MILLISECONDS) : 0.051844 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.045941 #CONJOIN_DISJUNCTIVE : 36 #RENAME_VARIABLES : 65 #UNFREEZE : 0 #CONJOIN : 59 #PROJECTAWAY : 60 #ADD_WEAK_EQUALITY : 4 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 63 #ADD_EQUALITY : 31 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 24 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 201 LocStat_NO_SUPPORTING_DISEQUALITIES : 38 LocStat_NO_DISJUNCTIONS : -48 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 32 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 36 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.722062 RENAME_VARIABLES(MILLISECONDS) : 0.176120 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.667460 PROJECTAWAY(MILLISECONDS) : 0.142363 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.143215 DISJOIN(MILLISECONDS) : 0.217386 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.198896 ADD_EQUALITY(MILLISECONDS) : 0.041650 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.018312 #CONJOIN_DISJUNCTIVE : 129 #RENAME_VARIABLES : 298 #UNFREEZE : 0 #CONJOIN : 212 #PROJECTAWAY : 205 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 31 #RENAME_VARIABLES_DISJUNCTIVE : 293 #ADD_EQUALITY : 36 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 33 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 257 LocStat_NO_SUPPORTING_DISEQUALITIES : 60 LocStat_NO_DISJUNCTIONS : -66 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 41 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 38 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 41 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.832287 RENAME_VARIABLES(MILLISECONDS) : 0.252372 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.785706 PROJECTAWAY(MILLISECONDS) : 0.214512 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.068212 DISJOIN(MILLISECONDS) : 0.348103 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.280289 ADD_EQUALITY(MILLISECONDS) : 0.020223 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010040 #CONJOIN_DISJUNCTIVE : 172 #RENAME_VARIABLES : 379 #UNFREEZE : 0 #CONJOIN : 250 #PROJECTAWAY : 249 #ADD_WEAK_EQUALITY : 6 #DISJOIN : 33 #RENAME_VARIABLES_DISJUNCTIVE : 379 #ADD_EQUALITY : 38 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 24 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 209 LocStat_NO_SUPPORTING_DISEQUALITIES : 38 LocStat_NO_DISJUNCTIONS : -48 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 32 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 36 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.735035 RENAME_VARIABLES(MILLISECONDS) : 0.231899 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.701309 PROJECTAWAY(MILLISECONDS) : 0.162678 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.087041 DISJOIN(MILLISECONDS) : 0.320511 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.258649 ADD_EQUALITY(MILLISECONDS) : 0.022536 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.017375 #CONJOIN_DISJUNCTIVE : 130 #RENAME_VARIABLES : 301 #UNFREEZE : 0 #CONJOIN : 214 #PROJECTAWAY : 207 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 31 #RENAME_VARIABLES_DISJUNCTIVE : 295 #ADD_EQUALITY : 36 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while BasicCegarLoop was analyzing trace of length 354 with TraceHistMax 50, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 17. - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 18). Cancelled while BasicCegarLoop was analyzing trace of length 354 with TraceHistMax 50, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 17. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while BasicCegarLoop was analyzing trace of length 354 with TraceHistMax 50, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 17. - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 27). Cancelled while BasicCegarLoop was analyzing trace of length 354 with TraceHistMax 50, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 17. - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 23). Cancelled while BasicCegarLoop was analyzing trace of length 354 with TraceHistMax 50, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 17. - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 30). Cancelled while BasicCegarLoop was analyzing trace of length 354 with TraceHistMax 50, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 17. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 6 error locations. TIMEOUT Result, 44.0s OverallTime, 24 OverallIterations, 50 TraceHistogramMax, 11.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 760 SDtfs, 3534 SDslu, 4613 SDs, 0 SdLazy, 6767 SolverSat, 625 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11257 GetRequests, 10256 SyntacticMatches, 212 SemanticMatches, 789 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 16735 ImplicationChecksByTransitivity, 17.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=369occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.8s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 209 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 9.2s SatisfiabilityAnalysisTime, 17.7s InterpolantComputationTime, 8216 NumberOfCodeBlocks, 7946 NumberOfCodeBlocksAsserted, 136 NumberOfCheckSat, 13522 ConstructedInterpolants, 1462 QuantifiedInterpolants, 11991256 SizeOfPredicates, 122 NumberOfNonLiveVariables, 11794 ConjunctsInSsa, 526 ConjunctsInUnsatCore, 93 InterpolantComputations, 9 PerfectInterpolantSequences, 122666/131986 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_15-50-58-759.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_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_15-50-58-759.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_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_15-50-58-759.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_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_15-50-58-759.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_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_15-50-58-759.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_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_15-50-58-759.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_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_15-50-58-759.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_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-24_15-50-58-759.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_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-24_15-50-58-759.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_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_15-50-58-759.csv Completed graceful shutdown