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/array-memsafety/openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 15:20:10,719 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 15:20:10,721 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 15:20:10,736 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 15:20:10,736 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 15:20:10,737 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 15:20:10,738 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 15:20:10,740 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 15:20:10,742 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 15:20:10,742 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 15:20:10,743 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 15:20:10,744 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 15:20:10,745 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 15:20:10,746 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 15:20:10,747 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 15:20:10,749 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 15:20:10,751 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 15:20:10,753 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 15:20:10,754 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 15:20:10,756 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 15:20:10,758 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 15:20:10,758 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 15:20:10,759 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 15:20:10,760 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 15:20:10,760 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 15:20:10,762 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 15:20:10,762 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 15:20:10,762 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 15:20:10,763 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 15:20:10,763 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 15:20:10,763 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 15:20:10,764 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:20:10,771 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 15:20:10,772 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 15:20:10,773 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 15:20:10,773 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 15:20:10,773 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 15:20:10,773 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 15:20:10,773 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 15:20:10,774 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 15:20:10,774 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 15:20:10,774 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 15:20:10,774 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 15:20:10,774 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 15:20:10,774 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 15:20:10,775 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 15:20:10,775 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 15:20:10,775 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 15:20:10,775 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 15:20:10,775 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 15:20:10,775 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 15:20:10,775 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 15:20:10,775 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 15:20:10,776 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 15:20:10,776 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 15:20:10,776 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:20:10,776 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 15:20:10,776 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 15:20:10,777 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 15:20:10,777 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 15:20:10,777 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 15:20:10,777 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 15:20:10,777 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 15:20:10,777 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 15:20:10,777 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 15:20:10,778 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 15:20:10,778 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 15:20:10,810 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 15:20:10,821 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 15:20:10,824 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 15:20:10,825 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 15:20:10,826 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 15:20:10,826 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-01-24 15:20:10,980 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 15:20:10,985 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 15:20:10,986 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 15:20:10,986 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 15:20:10,990 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 15:20:10,991 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:20:10" (1/1) ... [2018-01-24 15:20:10,994 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ca156b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:20:10, skipping insertion in model container [2018-01-24 15:20:10,994 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:20:10" (1/1) ... [2018-01-24 15:20:11,006 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:20:11,043 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:20:11,163 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:20:11,183 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:20:11,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:20:11 WrapperNode [2018-01-24 15:20:11,192 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 15:20:11,192 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 15:20:11,193 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 15:20:11,193 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 15:20:11,206 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:20:11" (1/1) ... [2018-01-24 15:20:11,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:20:11" (1/1) ... [2018-01-24 15:20:11,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:20:11" (1/1) ... [2018-01-24 15:20:11,215 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:20:11" (1/1) ... [2018-01-24 15:20:11,220 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:20:11" (1/1) ... [2018-01-24 15:20:11,225 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:20:11" (1/1) ... [2018-01-24 15:20:11,227 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:20:11" (1/1) ... [2018-01-24 15:20:11,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 15:20:11,229 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 15:20:11,229 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 15:20:11,230 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 15:20:11,231 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:20:11" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:20:11,287 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 15:20:11,287 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 15:20:11,287 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncat [2018-01-24 15:20:11,287 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 15:20:11,287 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 15:20:11,287 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 15:20:11,288 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 15:20:11,288 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 15:20:11,288 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 15:20:11,288 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 15:20:11,288 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncat [2018-01-24 15:20:11,288 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 15:20:11,289 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 15:20:11,289 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 15:20:11,554 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 15:20:11,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:20:11 BoogieIcfgContainer [2018-01-24 15:20:11,555 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 15:20:11,555 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 15:20:11,556 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 15:20:11,558 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 15:20:11,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 03:20:10" (1/3) ... [2018-01-24 15:20:11,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21316476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:20:11, skipping insertion in model container [2018-01-24 15:20:11,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:20:11" (2/3) ... [2018-01-24 15:20:11,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21316476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:20:11, skipping insertion in model container [2018-01-24 15:20:11,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:20:11" (3/3) ... [2018-01-24 15:20:11,562 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-01-24 15:20:11,568 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 15:20:11,575 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-24 15:20:11,617 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 15:20:11,617 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 15:20:11,617 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 15:20:11,617 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 15:20:11,617 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 15:20:11,617 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 15:20:11,618 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 15:20:11,618 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 15:20:11,618 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 15:20:11,639 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-01-24 15:20:11,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-24 15:20:11,644 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:20:11,645 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:20:11,645 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 15:20:11,650 INFO L82 PathProgramCache]: Analyzing trace with hash 2055638365, now seen corresponding path program 1 times [2018-01-24 15:20:11,652 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:20:11,692 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:20:11,692 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:20:11,693 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:20:11,693 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:20:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:20:11,741 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:20:11,792 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:20:11,794 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:20:11,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 15:20:11,795 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:20:11,798 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 15:20:11,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 15:20:11,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:20:11,813 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 3 states. [2018-01-24 15:20:12,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:20:12,002 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2018-01-24 15:20:12,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 15:20:12,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-24 15:20:12,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:20:12,014 INFO L225 Difference]: With dead ends: 81 [2018-01-24 15:20:12,014 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 15:20:12,017 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 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:20:12,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 15:20:12,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-24 15:20:12,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 15:20:12,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-01-24 15:20:12,049 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 11 [2018-01-24 15:20:12,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:20:12,049 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-01-24 15:20:12,049 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 15:20:12,049 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-01-24 15:20:12,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 15:20:12,050 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:20:12,050 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:20:12,050 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 15:20:12,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1872133330, now seen corresponding path program 1 times [2018-01-24 15:20:12,051 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:20:12,052 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:20:12,052 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:20:12,052 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:20:12,052 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:20:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:20:12,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:20:12,105 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:20:12,105 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:20:12,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:20:12,105 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:20:12,107 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:20:12,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:20:12,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:20:12,108 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 5 states. [2018-01-24 15:20:12,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:20:12,250 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2018-01-24 15:20:12,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:20:12,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-24 15:20:12,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:20:12,252 INFO L225 Difference]: With dead ends: 95 [2018-01-24 15:20:12,252 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 15:20:12,253 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:20:12,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 15:20:12,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-24 15:20:12,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 15:20:12,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-01-24 15:20:12,260 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 15 [2018-01-24 15:20:12,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:20:12,260 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-01-24 15:20:12,260 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:20:12,261 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-01-24 15:20:12,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 15:20:12,261 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:20:12,261 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:20:12,262 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 15:20:12,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1192074960, now seen corresponding path program 1 times [2018-01-24 15:20:12,262 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:20:12,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:20:12,263 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:20:12,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:20:12,263 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:20:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:20:12,279 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:20:12,344 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:20:12,344 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:20:12,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:20:12,344 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:20:12,345 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:20:12,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:20:12,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:20:12,345 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 4 states. [2018-01-24 15:20:12,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:20:12,409 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-01-24 15:20:12,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 15:20:12,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-24 15:20:12,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:20:12,411 INFO L225 Difference]: With dead ends: 51 [2018-01-24 15:20:12,411 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 15:20:12,411 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:20:12,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 15:20:12,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-24 15:20:12,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 15:20:12,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-24 15:20:12,416 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 15 [2018-01-24 15:20:12,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:20:12,417 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-24 15:20:12,417 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:20:12,417 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-24 15:20:12,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 15:20:12,417 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:20:12,417 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:20:12,418 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 15:20:12,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1192074959, now seen corresponding path program 1 times [2018-01-24 15:20:12,418 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:20:12,419 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:20:12,419 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:20:12,419 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:20:12,419 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:20:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:20:12,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:20:12,598 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:20:12,599 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:20:12,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 15:20:12,599 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:20:12,599 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 15:20:12,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 15:20:12,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:20:12,600 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 8 states. [2018-01-24 15:20:12,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:20:12,756 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-01-24 15:20:12,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 15:20:12,756 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-01-24 15:20:12,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:20:12,757 INFO L225 Difference]: With dead ends: 50 [2018-01-24 15:20:12,757 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 15:20:12,758 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-01-24 15:20:12,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 15:20:12,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-24 15:20:12,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 15:20:12,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-01-24 15:20:12,765 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 15 [2018-01-24 15:20:12,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:20:12,765 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-01-24 15:20:12,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 15:20:12,766 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-01-24 15:20:12,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 15:20:12,766 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:20:12,766 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:20:12,766 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 15:20:12,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1700381909, now seen corresponding path program 1 times [2018-01-24 15:20:12,767 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:20:12,767 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:20:12,768 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:20:12,768 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:20:12,768 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:20:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:20:12,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:20:12,811 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:20:12,811 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:20:12,811 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:20:12,811 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:20:12,812 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:20:12,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:20:12,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:20:12,812 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 4 states. [2018-01-24 15:20:12,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:20:12,851 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-01-24 15:20:12,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 15:20:12,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 15:20:12,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:20:12,852 INFO L225 Difference]: With dead ends: 49 [2018-01-24 15:20:12,852 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 15:20:12,852 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:20:12,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 15:20:12,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-24 15:20:12,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 15:20:12,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-01-24 15:20:12,857 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 16 [2018-01-24 15:20:12,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:20:12,857 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-01-24 15:20:12,857 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:20:12,857 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-01-24 15:20:12,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 15:20:12,858 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:20:12,858 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:20:12,858 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 15:20:12,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1700381910, now seen corresponding path program 1 times [2018-01-24 15:20:12,858 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:20:12,859 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:20:12,859 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:20:12,859 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:20:12,859 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:20:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:20:12,872 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:20:12,948 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:20:12,949 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:20:12,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:20:12,949 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:20:12,949 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:20:12,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:20:12,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:20:12,950 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 5 states. [2018-01-24 15:20:12,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:20:12,977 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-01-24 15:20:12,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:20:12,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-24 15:20:12,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:20:12,979 INFO L225 Difference]: With dead ends: 48 [2018-01-24 15:20:12,979 INFO L226 Difference]: Without dead ends: 47 [2018-01-24 15:20:12,979 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:20:12,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-24 15:20:12,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-24 15:20:12,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 15:20:12,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-01-24 15:20:12,985 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 16 [2018-01-24 15:20:12,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:20:12,985 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-01-24 15:20:12,985 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:20:12,986 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-01-24 15:20:12,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 15:20:12,986 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:20:12,987 INFO L322 BasicCegarLoop]: trace histogram [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:20:12,987 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 15:20:12,987 INFO L82 PathProgramCache]: Analyzing trace with hash -275307336, now seen corresponding path program 1 times [2018-01-24 15:20:12,987 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:20:12,988 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:20:12,988 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:20:12,988 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:20:12,988 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:20:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:20:13,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:20:13,042 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:20:13,042 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:20:13,042 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:20:13,042 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:20:13,042 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:20:13,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:20:13,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:20:13,043 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 6 states. [2018-01-24 15:20:13,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:20:13,116 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-01-24 15:20:13,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:20:13,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-01-24 15:20:13,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:20:13,120 INFO L225 Difference]: With dead ends: 50 [2018-01-24 15:20:13,120 INFO L226 Difference]: Without dead ends: 47 [2018-01-24 15:20:13,120 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:20:13,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-24 15:20:13,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2018-01-24 15:20:13,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-24 15:20:13,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-01-24 15:20:13,127 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 21 [2018-01-24 15:20:13,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:20:13,132 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-01-24 15:20:13,132 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:20:13,132 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-01-24 15:20:13,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 15:20:13,133 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:20:13,133 INFO L322 BasicCegarLoop]: trace histogram [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:20:13,133 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 15:20:13,133 INFO L82 PathProgramCache]: Analyzing trace with hash -275307335, now seen corresponding path program 1 times [2018-01-24 15:20:13,134 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:20:13,134 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:20:13,135 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:20:13,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:20:13,135 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:20:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:20:13,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:20:13,281 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:20:13,282 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:20:13,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 15:20:13,282 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:20:13,282 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 15:20:13,282 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 15:20:13,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-24 15:20:13,283 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 10 states. [2018-01-24 15:20:13,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:20:13,453 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-01-24 15:20:13,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 15:20:13,453 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-01-24 15:20:13,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:20:13,455 INFO L225 Difference]: With dead ends: 60 [2018-01-24 15:20:13,455 INFO L226 Difference]: Without dead ends: 57 [2018-01-24 15:20:13,455 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-01-24 15:20:13,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-24 15:20:13,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2018-01-24 15:20:13,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 15:20:13,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2018-01-24 15:20:13,462 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 21 [2018-01-24 15:20:13,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:20:13,462 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2018-01-24 15:20:13,463 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 15:20:13,463 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2018-01-24 15:20:13,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 15:20:13,464 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:20:13,464 INFO L322 BasicCegarLoop]: trace histogram [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:20:13,464 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 15:20:13,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1706718631, now seen corresponding path program 1 times [2018-01-24 15:20:13,465 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:20:13,465 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:20:13,466 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:20:13,466 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:20:13,466 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:20:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:20:13,477 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:20:13,573 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:20:13,574 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:20:13,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 15:20:13,574 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:20:13,574 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 15:20:13,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 15:20:13,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:20:13,575 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand 7 states. [2018-01-24 15:20:13,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:20:13,737 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-01-24 15:20:13,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 15:20:13,737 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-01-24 15:20:13,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:20:13,738 INFO L225 Difference]: With dead ends: 55 [2018-01-24 15:20:13,739 INFO L226 Difference]: Without dead ends: 54 [2018-01-24 15:20:13,739 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-24 15:20:13,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-24 15:20:13,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-01-24 15:20:13,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 15:20:13,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2018-01-24 15:20:13,745 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 24 [2018-01-24 15:20:13,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:20:13,746 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2018-01-24 15:20:13,746 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 15:20:13,746 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2018-01-24 15:20:13,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 15:20:13,747 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:20:13,747 INFO L322 BasicCegarLoop]: trace histogram [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:20:13,747 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 15:20:13,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1706718632, now seen corresponding path program 1 times [2018-01-24 15:20:13,747 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:20:13,748 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:20:13,748 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:20:13,748 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:20:13,748 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:20:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:20:13,761 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:20:13,929 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:20:13,929 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:20:13,930 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 15:20:13,930 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:20:13,930 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 15:20:13,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 15:20:13,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-24 15:20:13,931 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 10 states. [2018-01-24 15:20:14,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:20:14,067 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2018-01-24 15:20:14,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 15:20:14,067 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-01-24 15:20:14,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:20:14,068 INFO L225 Difference]: With dead ends: 57 [2018-01-24 15:20:14,068 INFO L226 Difference]: Without dead ends: 56 [2018-01-24 15:20:14,068 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-01-24 15:20:14,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-24 15:20:14,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2018-01-24 15:20:14,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 15:20:14,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-01-24 15:20:14,073 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 24 [2018-01-24 15:20:14,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:20:14,073 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-01-24 15:20:14,073 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 15:20:14,073 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-01-24 15:20:14,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 15:20:14,074 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:20:14,074 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:20:14,074 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 15:20:14,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1706720075, now seen corresponding path program 1 times [2018-01-24 15:20:14,074 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:20:14,075 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:20:14,075 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:20:14,075 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:20:14,075 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:20:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:20:14,090 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:20:14,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:20:14,236 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:20:14,237 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:20:14,237 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-24 15:20:14,239 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [20], [27], [28], [29], [30], [31], [32], [35], [46], [49], [53], [55], [57], [62], [98], [99], [100], [102] [2018-01-24 15:20:14,287 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:20:14,287 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:20:15,581 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:20:15,583 INFO L268 AbstractInterpreter]: Visited 23 different actions 27 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 27 variables. [2018-01-24 15:20:15,605 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:20:15,605 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:20:15,605 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:20:15,617 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:20:15,617 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:20:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:20:15,662 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:20:15,746 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:20:15,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:20:15,797 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:20:15,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:20:15,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:20:15,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-01-24 15:20:15,852 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:20:15,853 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:20:15,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-01-24 15:20:15,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:20:15,880 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:20:15,881 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:20:15,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 15:20:15,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:20:15,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:20:15,894 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:18 [2018-01-24 15:20:16,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:20:16,100 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:20:16,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 10 treesize of output 3 [2018-01-24 15:20:16,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:20:16,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-01-24 15:20:16,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 3 [2018-01-24 15:20:16,348 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:20:16,349 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 15:20:16,349 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:20:16,351 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:20:16,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:20:16,354 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:21, output treesize:3 [2018-01-24 15:20:16,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:20:16,382 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:20:16,383 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:20:16,386 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:20:16,386 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:20:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:20:16,436 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:20:16,443 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:20:16,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:20:16,450 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:20:16,450 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:20:16,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:20:16,455 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-01-24 15:20:16,504 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:20:16,505 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:20:16,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-01-24 15:20:16,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:20:16,518 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:20:16,518 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:20:16,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 15:20:16,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:20:16,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 15:20:16,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:18 [2018-01-24 15:20:16,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:20:16,692 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:20:16,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 10 treesize of output 3 [2018-01-24 15:20:16,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:20:16,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-01-24 15:20:16,754 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 15:20:16,755 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:20:16,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 3 [2018-01-24 15:20:16,756 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:20:16,758 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:20:16,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:20:16,760 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:21, output treesize:3 [2018-01-24 15:20:16,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:20:16,809 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:20:16,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12, 11, 12] total 38 [2018-01-24 15:20:16,809 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:20:16,810 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-24 15:20:16,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-24 15:20:16,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1332, Unknown=0, NotChecked=0, Total=1482 [2018-01-24 15:20:16,811 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 24 states. [2018-01-24 15:20:17,130 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 37 DAG size of output 31 [2018-01-24 15:20:17,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:20:17,516 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2018-01-24 15:20:17,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 15:20:17,516 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-01-24 15:20:17,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:20:17,517 INFO L225 Difference]: With dead ends: 75 [2018-01-24 15:20:17,518 INFO L226 Difference]: Without dead ends: 72 [2018-01-24 15:20:17,519 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 61 SyntacticMatches, 9 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=296, Invalid=1960, Unknown=0, NotChecked=0, Total=2256 [2018-01-24 15:20:17,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-24 15:20:17,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2018-01-24 15:20:17,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-24 15:20:17,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2018-01-24 15:20:17,527 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 24 [2018-01-24 15:20:17,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:20:17,527 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2018-01-24 15:20:17,527 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-24 15:20:17,528 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2018-01-24 15:20:17,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 15:20:17,528 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:20:17,529 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:20:17,529 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 15:20:17,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1074905977, now seen corresponding path program 2 times [2018-01-24 15:20:17,529 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:20:17,530 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:20:17,530 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:20:17,530 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:20:17,531 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:20:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:20:17,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:20:17,919 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:20:17,919 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:20:17,919 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:20:17,919 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:20:17,920 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:20:17,920 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:20:17,920 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:20:17,926 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:20:17,926 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:20:17,944 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:20:17,959 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:20:17,967 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:20:17,970 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:20:18,021 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:20:18,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:20:18,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:20:18,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-01-24 15:20:18,066 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:20:18,067 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:20:18,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 15:20:18,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:20:18,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:20:18,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:16 [2018-01-24 15:20:18,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-01-24 15:20:18,121 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 14 treesize of output 13 [2018-01-24 15:20:18,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:20:18,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:20:18,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 15:20:18,131 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:38 [2018-01-24 15:20:18,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-01-24 15:20:18,174 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 11 treesize of output 10 [2018-01-24 15:20:18,175 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:20:18,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:20:18,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-01-24 15:20:18,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:52, output treesize:48 [2018-01-24 15:20:20,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-01-24 15:20:20,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 8 treesize of output 1 [2018-01-24 15:20:20,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:20:20,484 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:20:20,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 37 [2018-01-24 15:20:20,491 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 15:20:20,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:20:20,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:20:20,518 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:66, output treesize:43 [2018-01-24 15:20:20,565 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:20:20,565 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:20:20,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2018-01-24 15:20:20,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:20:20,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2018-01-24 15:20:20,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:20:20,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2018-01-24 15:20:20,977 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 15:20:20,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 15:20:20,979 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:20:20,984 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:20:20,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2018-01-24 15:20:21,010 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 15:20:21,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 15:20:21,012 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 15:20:21,016 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:20:21,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:20:21,025 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:103, output treesize:33 [2018-01-24 15:20:21,245 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:20:21,266 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:20:21,266 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:20:21,270 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:20:21,270 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:20:21,289 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:20:21,318 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:20:21,367 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:20:21,373 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:20:21,425 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:20:21,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:20:21,432 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:20:21,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:20:21,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:20:21,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-01-24 15:20:21,519 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:20:21,521 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 15 [2018-01-24 15:20:21,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:20:21,531 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:20:21,532 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:20:21,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 15:20:21,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:20:21,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:20:21,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-01-24 15:20:21,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 15:20:21,616 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 13 treesize of output 12 [2018-01-24 15:20:21,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:20:21,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:20:21,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:20:21,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-24 15:20:21,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-01-24 15:20:21,676 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 13 treesize of output 12 [2018-01-24 15:20:21,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:20:21,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:20:21,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 15:20:21,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-01-24 15:20:21,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-01-24 15:20:21,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 16 [2018-01-24 15:20:21,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:20:21,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 10 treesize of output 1 [2018-01-24 15:20:21,940 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:20:21,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:20:21,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:20:21,948 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2018-01-24 15:20:22,138 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:20:22,138 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:20:22,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-01-24 15:20:22,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 15:20:22,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:20:22,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:20:22,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:20:22,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:25 [2018-01-24 15:20:22,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 10 treesize of output 3 [2018-01-24 15:20:22,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:20:22,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-01-24 15:20:22,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 17 treesize of output 7 [2018-01-24 15:20:22,874 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:20:22,874 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 15:20:22,874 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:20:22,879 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:20:22,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:20:22,890 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:37, output treesize:7 [2018-01-24 15:20:22,928 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:20:22,929 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:20:22,930 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 14, 15, 13] total 63 [2018-01-24 15:20:22,930 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:20:22,930 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-24 15:20:22,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-24 15:20:22,931 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=3801, Unknown=1, NotChecked=0, Total=4032 [2018-01-24 15:20:22,931 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 28 states. [2018-01-24 15:20:45,760 WARN L146 SmtUtils]: Spent 8054ms on a formula simplification. DAG size of input: 69 DAG size of output 68 [2018-01-24 15:20:50,881 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 70 DAG size of output 59 [2018-01-24 15:20:51,635 WARN L146 SmtUtils]: Spent 636ms on a formula simplification. DAG size of input: 79 DAG size of output 62 [2018-01-24 15:20:58,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:20:58,676 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2018-01-24 15:20:58,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-24 15:20:58,676 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-01-24 15:20:58,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:20:58,678 INFO L225 Difference]: With dead ends: 112 [2018-01-24 15:20:58,678 INFO L226 Difference]: Without dead ends: 109 [2018-01-24 15:20:58,680 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1775 ImplicationChecksByTransitivity, 23.8s TimeCoverageRelationStatistics Valid=751, Invalid=7617, Unknown=4, NotChecked=0, Total=8372 [2018-01-24 15:20:58,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-24 15:20:58,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 61. [2018-01-24 15:20:58,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-24 15:20:58,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2018-01-24 15:20:58,689 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 27 [2018-01-24 15:20:58,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:20:58,689 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2018-01-24 15:20:58,689 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-24 15:20:58,689 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2018-01-24 15:20:58,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 15:20:58,690 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:20:58,691 INFO L322 BasicCegarLoop]: trace histogram [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:20:58,691 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 15:20:58,691 INFO L82 PathProgramCache]: Analyzing trace with hash 94248296, now seen corresponding path program 1 times [2018-01-24 15:20:58,691 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:20:58,692 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:20:58,692 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:20:58,692 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:20:58,692 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:20:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:20:58,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:20:58,748 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:20:58,749 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:20:58,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:20:58,749 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:20:58,749 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:20:58,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:20:58,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:20:58,750 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 5 states. [2018-01-24 15:20:58,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:20:58,817 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2018-01-24 15:20:58,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:20:58,818 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-24 15:20:58,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:20:58,820 INFO L225 Difference]: With dead ends: 93 [2018-01-24 15:20:58,820 INFO L226 Difference]: Without dead ends: 86 [2018-01-24 15:20:58,821 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:20:58,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-24 15:20:58,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 72. [2018-01-24 15:20:58,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-24 15:20:58,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2018-01-24 15:20:58,836 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 28 [2018-01-24 15:20:58,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:20:58,836 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2018-01-24 15:20:58,836 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:20:58,836 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2018-01-24 15:20:58,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 15:20:58,837 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:20:58,837 INFO L322 BasicCegarLoop]: trace histogram [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:20:58,837 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 15:20:58,838 INFO L82 PathProgramCache]: Analyzing trace with hash -723400154, now seen corresponding path program 1 times [2018-01-24 15:20:58,838 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:20:58,839 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:20:58,839 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:20:58,839 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:20:58,839 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:20:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:20:58,853 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:20:58,944 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:20:58,945 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:20:58,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:20:58,945 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:20:58,945 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:20:58,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:20:58,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:20:58,946 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 6 states. [2018-01-24 15:20:59,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:20:59,091 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2018-01-24 15:20:59,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 15:20:59,092 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-01-24 15:20:59,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:20:59,092 INFO L225 Difference]: With dead ends: 72 [2018-01-24 15:20:59,092 INFO L226 Difference]: Without dead ends: 58 [2018-01-24 15:20:59,093 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:20:59,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-24 15:20:59,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2018-01-24 15:20:59,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 15:20:59,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-01-24 15:20:59,098 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 28 [2018-01-24 15:20:59,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:20:59,098 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-01-24 15:20:59,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:20:59,098 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-01-24 15:20:59,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 15:20:59,099 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:20:59,099 INFO L322 BasicCegarLoop]: trace histogram [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:20:59,099 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 15:20:59,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1208652779, now seen corresponding path program 1 times [2018-01-24 15:20:59,099 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:20:59,100 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:20:59,100 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:20:59,100 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:20:59,100 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:20:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:20:59,116 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:20:59,422 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 25 DAG size of output 5 [2018-01-24 15:20:59,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:20:59,495 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:20:59,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 15:20:59,495 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:20:59,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 15:20:59,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 15:20:59,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:20:59,496 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 7 states. [2018-01-24 15:20:59,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:20:59,647 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2018-01-24 15:20:59,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 15:20:59,647 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-01-24 15:20:59,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:20:59,648 INFO L225 Difference]: With dead ends: 97 [2018-01-24 15:20:59,648 INFO L226 Difference]: Without dead ends: 77 [2018-01-24 15:20:59,648 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-01-24 15:20:59,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-24 15:20:59,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-01-24 15:20:59,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-24 15:20:59,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2018-01-24 15:20:59,657 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 30 [2018-01-24 15:20:59,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:20:59,658 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2018-01-24 15:20:59,658 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 15:20:59,658 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2018-01-24 15:20:59,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 15:20:59,658 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:20:59,659 INFO L322 BasicCegarLoop]: trace histogram [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:20:59,659 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 15:20:59,659 INFO L82 PathProgramCache]: Analyzing trace with hash -989798061, now seen corresponding path program 1 times [2018-01-24 15:20:59,659 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:20:59,660 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:20:59,660 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:20:59,660 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:20:59,660 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:20:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:20:59,674 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:20:59,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:20:59,864 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:20:59,864 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:20:59,864 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-01-24 15:20:59,864 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [22], [27], [28], [29], [30], [31], [32], [35], [46], [49], [53], [55], [60], [68], [69], [71], [72], [79], [81], [86], [98], [99], [100], [102] [2018-01-24 15:20:59,865 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:20:59,865 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:21:05,913 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:21:05,913 INFO L268 AbstractInterpreter]: Visited 29 different actions 47 times. Merged at 7 different actions 18 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 31 variables. [2018-01-24 15:21:05,920 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:21:05,920 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:21:05,920 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:21:05,925 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:21:05,925 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:21:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:21:05,942 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:21:05,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 15:21:05,952 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 11 treesize of output 10 [2018-01-24 15:21:05,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:05,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:05,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 15:21:05,962 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 15:21:06,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-24 15:21:06,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 15:21:06,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:21:06,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:21:06,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:21:06,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-24 15:21:06,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:21:06,147 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:21:06,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-24 15:21:06,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:06,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-01-24 15:21:06,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-01-24 15:21:06,447 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:06,448 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:06,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:06,454 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:39, output treesize:7 [2018-01-24 15:21:06,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:21:06,483 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:21:06,483 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:21:06,486 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:21:06,487 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:21:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:21:06,552 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:21:06,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 15:21:06,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:06,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:06,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 15:21:06,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 15:21:06,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 15:21:06,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:06,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:06,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:06,593 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 15:21:06,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-24 15:21:06,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 15:21:06,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:21:06,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:21:06,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:21:06,761 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:30 [2018-01-24 15:21:06,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:21:06,844 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:21:06,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 15:21:06,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 15:21:06,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:06,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:06,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:06,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-24 15:21:07,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:21:07,062 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:21:07,062 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10, 12, 12] total 41 [2018-01-24 15:21:07,062 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:21:07,062 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 15:21:07,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 15:21:07,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1566, Unknown=0, NotChecked=0, Total=1722 [2018-01-24 15:21:07,063 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand 19 states. [2018-01-24 15:21:07,315 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 35 DAG size of output 28 Received shutdown request... [2018-01-24 15:21:08,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 15:21:08,250 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 15:21:08,253 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 15:21:08,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 03:21:08 BoogieIcfgContainer [2018-01-24 15:21:08,253 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 15:21:08,254 INFO L168 Benchmark]: Toolchain (without parser) took 57273.20 ms. Allocated memory was 306.2 MB in the beginning and 823.1 MB in the end (delta: 516.9 MB). Free memory was 266.1 MB in the beginning and 714.8 MB in the end (delta: -448.7 MB). Peak memory consumption was 68.3 MB. Max. memory is 5.3 GB. [2018-01-24 15:21:08,255 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 306.2 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 15:21:08,255 INFO L168 Benchmark]: CACSL2BoogieTranslator took 206.26 ms. Allocated memory is still 306.2 MB. Free memory was 265.1 MB in the beginning and 255.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:21:08,255 INFO L168 Benchmark]: Boogie Preprocessor took 36.37 ms. Allocated memory is still 306.2 MB. Free memory was 255.1 MB in the beginning and 253.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:21:08,256 INFO L168 Benchmark]: RCFGBuilder took 325.45 ms. Allocated memory is still 306.2 MB. Free memory was 253.1 MB in the beginning and 233.1 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:21:08,256 INFO L168 Benchmark]: TraceAbstraction took 56697.73 ms. Allocated memory was 306.2 MB in the beginning and 823.1 MB in the end (delta: 516.9 MB). Free memory was 233.1 MB in the beginning and 714.8 MB in the end (delta: -481.7 MB). Peak memory consumption was 35.2 MB. Max. memory is 5.3 GB. [2018-01-24 15:21:08,258 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.12 ms. Allocated memory is still 306.2 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 206.26 ms. Allocated memory is still 306.2 MB. Free memory was 265.1 MB in the beginning and 255.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.37 ms. Allocated memory is still 306.2 MB. Free memory was 255.1 MB in the beginning and 253.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 325.45 ms. Allocated memory is still 306.2 MB. Free memory was 253.1 MB in the beginning and 233.1 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 56697.73 ms. Allocated memory was 306.2 MB in the beginning and 823.1 MB in the end (delta: 516.9 MB). Free memory was 233.1 MB in the beginning and 714.8 MB in the end (delta: -481.7 MB). Peak memory consumption was 35.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 22 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 275 LocStat_NO_SUPPORTING_DISEQUALITIES : 42 LocStat_NO_DISJUNCTIONS : -44 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 29 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 61 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 30 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.755467 RENAME_VARIABLES(MILLISECONDS) : 0.343059 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.688954 PROJECTAWAY(MILLISECONDS) : 0.877995 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.098649 DISJOIN(MILLISECONDS) : 0.421695 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.378545 ADD_EQUALITY(MILLISECONDS) : 0.023229 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.015623 #CONJOIN_DISJUNCTIVE : 50 #RENAME_VARIABLES : 74 #UNFREEZE : 0 #CONJOIN : 99 #PROJECTAWAY : 68 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 6 #RENAME_VARIABLES_DISJUNCTIVE : 71 #ADD_EQUALITY : 63 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 28 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 417 LocStat_NO_SUPPORTING_DISEQUALITIES : 65 LocStat_NO_DISJUNCTIONS : -56 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 35 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 72 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 36 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 21.099214 RENAME_VARIABLES(MILLISECONDS) : 3.305556 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 21.049859 PROJECTAWAY(MILLISECONDS) : 20.953081 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.064596 DISJOIN(MILLISECONDS) : 0.406463 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 3.342909 ADD_EQUALITY(MILLISECONDS) : 0.015126 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.017231 #CONJOIN_DISJUNCTIVE : 83 #RENAME_VARIABLES : 138 #UNFREEZE : 0 #CONJOIN : 143 #PROJECTAWAY : 108 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 13 #RENAME_VARIABLES_DISJUNCTIVE : 131 #ADD_EQUALITY : 75 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 574). Cancelled while BasicCegarLoop was constructing difference of abstraction (75states) and interpolant automaton (currently 9 states, 19 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (75states) and interpolant automaton (currently 9 states, 19 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 574). Cancelled while BasicCegarLoop was constructing difference of abstraction (75states) and interpolant automaton (currently 9 states, 19 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (75states) and interpolant automaton (currently 9 states, 19 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 557]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 557). Cancelled while BasicCegarLoop was constructing difference of abstraction (75states) and interpolant automaton (currently 9 states, 19 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (75states) and interpolant automaton (currently 9 states, 19 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (75states) and interpolant automaton (currently 9 states, 19 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (75states) and interpolant automaton (currently 9 states, 19 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (75states) and interpolant automaton (currently 9 states, 19 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (75states) and interpolant automaton (currently 9 states, 19 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (75states) and interpolant automaton (currently 9 states, 19 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (75states) and interpolant automaton (currently 9 states, 19 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (75states) and interpolant automaton (currently 9 states, 19 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 47 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 54 locations, 13 error locations. TIMEOUT Result, 56.6s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 39.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 625 SDtfs, 1104 SDslu, 2092 SDs, 0 SdLazy, 1860 SolverSat, 236 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 18.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 503 GetRequests, 217 SyntacticMatches, 19 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2928 ImplicationChecksByTransitivity, 27.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 7.4s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 94 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 507 NumberOfCodeBlocks, 507 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 641 ConstructedInterpolants, 58 QuantifiedInterpolants, 151768 SizeOfPredicates, 96 NumberOfNonLiveVariables, 824 ConjunctsInSsa, 223 ConjunctsInUnsatCore, 28 InterpolantComputations, 13 PerfectInterpolantSequences, 2/57 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/openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_15-21-08-269.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_15-21-08-269.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_15-21-08-269.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_15-21-08-269.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_15-21-08-269.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_15-21-08-269.csv Completed graceful shutdown