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_imprecise.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 16:49:11,590 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:49:11,592 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:49:11,608 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:49:11,609 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:49:11,610 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:49:11,611 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:49:11,612 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:49:11,615 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:49:11,616 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:49:11,617 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:49:11,617 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:49:11,618 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:49:11,619 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:49:11,620 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:49:11,623 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:49:11,625 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:49:11,627 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:49:11,629 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:49:11,630 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:49:11,632 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:49:11,633 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:49:11,633 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:49:11,634 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:49:11,635 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:49:11,636 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:49:11,636 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:49:11,637 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:49:11,637 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:49:11,637 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:49:11,638 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:49:11,638 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_imprecise.epf [2018-01-24 16:49:11,647 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:49:11,647 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:49:11,648 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:49:11,648 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:49:11,648 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:49:11,648 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:49:11,649 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:49:11,649 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:49:11,649 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:49:11,649 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:49:11,649 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:49:11,650 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:49:11,650 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:49:11,650 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:49:11,650 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:49:11,650 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:49:11,650 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:49:11,650 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:49:11,651 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:49:11,651 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:49:11,651 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:49:11,651 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:49:11,651 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:49:11,652 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:49:11,652 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:49:11,652 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:49:11,652 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:49:11,652 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:49:11,652 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:49:11,653 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 16:49:11,653 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:49:11,653 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:49:11,653 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:49:11,653 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 16:49:11,654 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:49:11,654 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:49:11,686 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:49:11,697 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:49:11,701 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:49:11,702 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:49:11,702 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:49:11,703 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 16:49:11,860 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:49:11,863 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:49:11,864 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:49:11,864 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:49:11,869 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:49:11,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:49:11" (1/1) ... [2018-01-24 16:49:11,873 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27dd3756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:49:11, skipping insertion in model container [2018-01-24 16:49:11,873 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:49:11" (1/1) ... [2018-01-24 16:49:11,887 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:49:11,927 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:49:12,050 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:49:12,071 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:49:12,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:49:12 WrapperNode [2018-01-24 16:49:12,079 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:49:12,080 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:49:12,080 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:49:12,080 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:49:12,093 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:49:12" (1/1) ... [2018-01-24 16:49:12,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:49:12" (1/1) ... [2018-01-24 16:49:12,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:49:12" (1/1) ... [2018-01-24 16:49:12,102 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:49:12" (1/1) ... [2018-01-24 16:49:12,107 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:49:12" (1/1) ... [2018-01-24 16:49:12,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:49:12" (1/1) ... [2018-01-24 16:49:12,113 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:49:12" (1/1) ... [2018-01-24 16:49:12,115 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:49:12,116 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:49:12,116 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:49:12,116 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:49:12,117 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:49:12" (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 16:49:12,167 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:49:12,167 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:49:12,167 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncat [2018-01-24 16:49:12,167 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:49:12,167 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:49:12,167 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:49:12,168 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:49:12,168 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:49:12,168 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:49:12,168 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:49:12,168 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncat [2018-01-24 16:49:12,168 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:49:12,169 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:49:12,169 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:49:12,403 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:49:12,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:49:12 BoogieIcfgContainer [2018-01-24 16:49:12,404 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:49:12,404 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 16:49:12,404 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 16:49:12,406 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 16:49:12,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 04:49:11" (1/3) ... [2018-01-24 16:49:12,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd5cc20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:49:12, skipping insertion in model container [2018-01-24 16:49:12,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:49:12" (2/3) ... [2018-01-24 16:49:12,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd5cc20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:49:12, skipping insertion in model container [2018-01-24 16:49:12,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:49:12" (3/3) ... [2018-01-24 16:49:12,409 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-01-24 16:49:12,415 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 16:49:12,422 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-24 16:49:12,467 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 16:49:12,468 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 16:49:12,468 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 16:49:12,468 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 16:49:12,468 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 16:49:12,468 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 16:49:12,468 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 16:49:12,469 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 16:49:12,469 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 16:49:12,490 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-01-24 16:49:12,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-24 16:49:12,497 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:49:12,498 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:49:12,498 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 16:49:12,503 INFO L82 PathProgramCache]: Analyzing trace with hash 2055638365, now seen corresponding path program 1 times [2018-01-24 16:49:12,506 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:49:12,553 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:49:12,554 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:49:12,554 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:49:12,554 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:49:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:49:12,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:49:12,665 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 16:49:12,667 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:49:12,668 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 16:49:12,668 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:49:12,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 16:49:12,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 16:49:12,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 16:49:12,686 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 3 states. [2018-01-24 16:49:12,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:49:12,895 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2018-01-24 16:49:12,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 16:49:12,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-24 16:49:12,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:49:12,909 INFO L225 Difference]: With dead ends: 81 [2018-01-24 16:49:12,909 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 16:49:12,913 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 16:49:12,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 16:49:12,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-24 16:49:12,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 16:49:12,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-01-24 16:49:12,951 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 11 [2018-01-24 16:49:12,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:49:12,951 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-01-24 16:49:12,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 16:49:12,951 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-01-24 16:49:12,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 16:49:12,952 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:49:12,952 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:49:12,952 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 16:49:12,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1872133330, now seen corresponding path program 1 times [2018-01-24 16:49:12,952 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:49:12,953 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:49:12,953 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:49:12,954 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:49:12,954 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:49:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:49:12,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:49:13,025 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 16:49:13,025 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:49:13,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:49:13,026 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:49:13,027 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:49:13,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:49:13,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:49:13,028 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 5 states. [2018-01-24 16:49:13,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:49:13,138 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2018-01-24 16:49:13,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:49:13,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-24 16:49:13,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:49:13,139 INFO L225 Difference]: With dead ends: 95 [2018-01-24 16:49:13,139 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 16:49:13,141 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 16:49:13,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 16:49:13,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-24 16:49:13,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 16:49:13,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-01-24 16:49:13,149 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 15 [2018-01-24 16:49:13,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:49:13,149 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-01-24 16:49:13,149 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:49:13,149 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-01-24 16:49:13,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 16:49:13,150 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:49:13,150 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:49:13,150 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 16:49:13,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1192074960, now seen corresponding path program 1 times [2018-01-24 16:49:13,151 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:49:13,152 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:49:13,152 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:49:13,153 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:49:13,153 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:49:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:49:13,177 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:49:13,243 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 16:49:13,243 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:49:13,244 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:49:13,244 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:49:13,244 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:49:13,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:49:13,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:49:13,245 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 4 states. [2018-01-24 16:49:13,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:49:13,386 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-01-24 16:49:13,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:49:13,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-24 16:49:13,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:49:13,388 INFO L225 Difference]: With dead ends: 51 [2018-01-24 16:49:13,388 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 16:49:13,388 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 16:49:13,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 16:49:13,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-24 16:49:13,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 16:49:13,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-24 16:49:13,395 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 15 [2018-01-24 16:49:13,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:49:13,396 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-24 16:49:13,396 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:49:13,396 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-24 16:49:13,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 16:49:13,397 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:49:13,397 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:49:13,397 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 16:49:13,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1192074959, now seen corresponding path program 1 times [2018-01-24 16:49:13,397 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:49:13,398 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:49:13,399 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:49:13,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:49:13,399 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:49:13,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:49:13,416 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:49:13,567 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 16:49:13,568 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:49:13,568 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 16:49:13,568 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:49:13,568 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 16:49:13,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 16:49:13,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:49:13,569 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 8 states. [2018-01-24 16:49:13,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:49:13,690 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-01-24 16:49:13,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:49:13,690 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-01-24 16:49:13,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:49:13,691 INFO L225 Difference]: With dead ends: 50 [2018-01-24 16:49:13,691 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 16:49:13,691 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 16:49:13,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 16:49:13,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-24 16:49:13,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 16:49:13,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-01-24 16:49:13,699 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 15 [2018-01-24 16:49:13,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:49:13,700 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-01-24 16:49:13,700 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 16:49:13,700 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-01-24 16:49:13,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 16:49:13,701 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:49:13,701 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:49:13,701 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 16:49:13,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1700381909, now seen corresponding path program 1 times [2018-01-24 16:49:13,701 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:49:13,702 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:49:13,702 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:49:13,702 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:49:13,703 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:49:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:49:13,717 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:49:13,750 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 16:49:13,750 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:49:13,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:49:13,751 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:49:13,751 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:49:13,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:49:13,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:49:13,752 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 4 states. [2018-01-24 16:49:13,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:49:13,798 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-01-24 16:49:13,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:49:13,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 16:49:13,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:49:13,799 INFO L225 Difference]: With dead ends: 49 [2018-01-24 16:49:13,799 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 16:49:13,800 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 16:49:13,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 16:49:13,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-24 16:49:13,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 16:49:13,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-01-24 16:49:13,805 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 16 [2018-01-24 16:49:13,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:49:13,805 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-01-24 16:49:13,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:49:13,805 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-01-24 16:49:13,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 16:49:13,806 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:49:13,806 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:49:13,806 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 16:49:13,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1700381910, now seen corresponding path program 1 times [2018-01-24 16:49:13,807 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:49:13,807 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:49:13,808 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:49:13,808 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:49:13,808 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:49:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:49:13,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:49:13,894 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 16:49:13,894 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:49:13,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:49:13,894 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:49:13,895 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:49:13,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:49:13,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:49:13,895 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 5 states. [2018-01-24 16:49:13,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:49:13,924 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-01-24 16:49:13,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:49:13,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-24 16:49:13,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:49:13,925 INFO L225 Difference]: With dead ends: 48 [2018-01-24 16:49:13,925 INFO L226 Difference]: Without dead ends: 47 [2018-01-24 16:49:13,926 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 16:49:13,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-24 16:49:13,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-24 16:49:13,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 16:49:13,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-01-24 16:49:13,932 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 16 [2018-01-24 16:49:13,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:49:13,932 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-01-24 16:49:13,932 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:49:13,932 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-01-24 16:49:13,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 16:49:13,933 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:49:13,933 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 16:49:13,934 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 16:49:13,934 INFO L82 PathProgramCache]: Analyzing trace with hash -275307336, now seen corresponding path program 1 times [2018-01-24 16:49:13,934 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:49:13,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:49:13,935 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:49:13,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:49:13,935 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:49:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:49:13,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:49:13,993 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 16:49:13,993 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:49:13,993 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:49:13,993 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:49:13,993 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:49:13,994 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:49:13,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:49:13,994 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 6 states. [2018-01-24 16:49:14,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:49:14,082 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-01-24 16:49:14,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:49:14,083 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-01-24 16:49:14,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:49:14,085 INFO L225 Difference]: With dead ends: 50 [2018-01-24 16:49:14,086 INFO L226 Difference]: Without dead ends: 47 [2018-01-24 16:49:14,086 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 16:49:14,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-24 16:49:14,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2018-01-24 16:49:14,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-24 16:49:14,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-01-24 16:49:14,092 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 21 [2018-01-24 16:49:14,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:49:14,093 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-01-24 16:49:14,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:49:14,093 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-01-24 16:49:14,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 16:49:14,094 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:49:14,094 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 16:49:14,094 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 16:49:14,094 INFO L82 PathProgramCache]: Analyzing trace with hash -275307335, now seen corresponding path program 1 times [2018-01-24 16:49:14,094 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:49:14,095 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:49:14,095 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:49:14,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:49:14,096 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:49:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:49:14,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:49:14,274 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 16:49:14,274 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:49:14,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 16:49:14,274 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:49:14,275 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 16:49:14,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 16:49:14,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:49:14,275 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 10 states. [2018-01-24 16:49:14,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:49:14,437 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-01-24 16:49:14,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 16:49:14,437 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-01-24 16:49:14,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:49:14,438 INFO L225 Difference]: With dead ends: 60 [2018-01-24 16:49:14,438 INFO L226 Difference]: Without dead ends: 57 [2018-01-24 16:49:14,439 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 16:49:14,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-24 16:49:14,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2018-01-24 16:49:14,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 16:49:14,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2018-01-24 16:49:14,446 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 21 [2018-01-24 16:49:14,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:49:14,446 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2018-01-24 16:49:14,446 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 16:49:14,447 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2018-01-24 16:49:14,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 16:49:14,447 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:49:14,447 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 16:49:14,447 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 16:49:14,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1706718631, now seen corresponding path program 1 times [2018-01-24 16:49:14,448 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:49:14,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:49:14,448 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:49:14,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:49:14,449 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:49:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:49:14,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:49:14,505 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 16:49:14,506 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:49:14,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 16:49:14,506 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:49:14,507 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 16:49:14,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 16:49:14,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:49:14,507 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand 7 states. [2018-01-24 16:49:14,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:49:14,622 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-01-24 16:49:14,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 16:49:14,623 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-01-24 16:49:14,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:49:14,624 INFO L225 Difference]: With dead ends: 55 [2018-01-24 16:49:14,624 INFO L226 Difference]: Without dead ends: 54 [2018-01-24 16:49:14,624 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:49:14,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-24 16:49:14,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-01-24 16:49:14,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 16:49:14,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2018-01-24 16:49:14,632 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 24 [2018-01-24 16:49:14,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:49:14,633 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2018-01-24 16:49:14,633 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 16:49:14,633 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2018-01-24 16:49:14,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 16:49:14,634 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:49:14,634 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 16:49:14,634 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 16:49:14,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1706718632, now seen corresponding path program 1 times [2018-01-24 16:49:14,634 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:49:14,635 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:49:14,635 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:49:14,636 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:49:14,636 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:49:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:49:14,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:49:14,884 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 16:49:14,884 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:49:14,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 16:49:14,884 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:49:14,885 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 16:49:14,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 16:49:14,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:49:14,885 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 10 states. [2018-01-24 16:49:15,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:49:15,122 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2018-01-24 16:49:15,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 16:49:15,123 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-01-24 16:49:15,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:49:15,123 INFO L225 Difference]: With dead ends: 57 [2018-01-24 16:49:15,123 INFO L226 Difference]: Without dead ends: 56 [2018-01-24 16:49:15,124 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-01-24 16:49:15,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-24 16:49:15,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2018-01-24 16:49:15,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 16:49:15,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-01-24 16:49:15,130 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 24 [2018-01-24 16:49:15,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:49:15,130 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-01-24 16:49:15,130 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 16:49:15,130 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-01-24 16:49:15,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 16:49:15,131 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:49:15,132 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 16:49:15,132 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 16:49:15,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1706720075, now seen corresponding path program 1 times [2018-01-24 16:49:15,132 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:49:15,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:49:15,133 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:49:15,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:49:15,133 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:49:15,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:49:15,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:49:15,308 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 16:49:15,309 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:49:15,362 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:49:15,363 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-24 16:49:15,365 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 16:49:15,413 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:49:15,413 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:49:15,621 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:49:15,623 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 16:49:15,632 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:49:15,632 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:49:15,632 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 16:49:15,642 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:49:15,643 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:49:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:49:15,679 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:49:15,735 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 16:49:15,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:15,770 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 16:49:15,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:15,781 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 16:49:15,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-01-24 16:49:15,884 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:49:15,885 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:49:15,886 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 16:49:15,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:15,898 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:49:15,899 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:49:15,899 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 16:49:15,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:15,908 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 16:49:15,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:18 [2018-01-24 16:49:16,117 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 16:49:16,117 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:49:16,321 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 16:49:16,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:16,326 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 16:49:16,337 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 16:49:16,337 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:16,338 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 16:49:16,338 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:16,343 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:16,346 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 16:49:16,346 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:21, output treesize:3 [2018-01-24 16:49:16,359 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 16:49:16,380 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:49:16,380 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 16:49:16,384 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:49:16,384 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:49:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:49:16,426 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:49:16,433 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 16:49:16,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:16,444 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 16:49:16,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:16,450 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 16:49:16,450 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-01-24 16:49:16,504 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:49:16,504 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:49: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 16:49:16,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:16,517 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:49:16,517 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:49:16,518 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 16:49:16,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:16,524 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 16:49:16,524 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:18 [2018-01-24 16:49:16,682 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 16:49:16,682 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:49:16,737 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 16:49:16,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:16,741 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 16:49:16,748 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 16:49:16,749 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:16,750 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 16:49:16,750 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:16,752 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:16,755 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 16:49:16,755 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:21, output treesize:3 [2018-01-24 16:49:16,804 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 16:49:16,811 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:49:16,811 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12, 11, 12] total 38 [2018-01-24 16:49:16,811 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:49:16,812 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-24 16:49:16,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-24 16:49:16,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1332, Unknown=0, NotChecked=0, Total=1482 [2018-01-24 16:49:16,813 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 24 states. [2018-01-24 16:49:17,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:49:17,443 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2018-01-24 16:49:17,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 16:49:17,443 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-01-24 16:49:17,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:49:17,444 INFO L225 Difference]: With dead ends: 75 [2018-01-24 16:49:17,444 INFO L226 Difference]: Without dead ends: 72 [2018-01-24 16:49:17,445 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 16:49:17,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-24 16:49:17,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2018-01-24 16:49:17,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-24 16:49:17,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2018-01-24 16:49:17,454 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 24 [2018-01-24 16:49:17,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:49:17,454 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2018-01-24 16:49:17,454 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-24 16:49:17,454 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2018-01-24 16:49:17,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 16:49:17,455 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:49:17,455 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 16:49:17,455 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 16:49:17,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1074905977, now seen corresponding path program 2 times [2018-01-24 16:49:17,456 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:49:17,457 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:49:17,457 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:49:17,457 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:49:17,457 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:49:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:49:17,476 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:49:17,816 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 16:49:17,816 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:49:17,816 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:49:17,817 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 16:49:17,817 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 16:49:17,817 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:49:17,817 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 16:49:17,822 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:49:17,822 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:49:17,840 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:49:17,844 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:49:17,846 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:49:17,849 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:49:17,876 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 16:49:17,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:17,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:17,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-01-24 16:49:17,923 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:49:17,923 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:49:17,924 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 16:49:17,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:17,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:17,938 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:16 [2018-01-24 16:49:17,986 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 16:49:17,988 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 16:49:17,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:17,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:17,998 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 16:49:17,998 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:38 [2018-01-24 16:49:18,032 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 16:49:18,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 16:49:18,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:18,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:18,049 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 16:49:18,049 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:52, output treesize:48 [2018-01-24 16:49:20,359 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 16:49:20,365 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 16:49:20,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:20,388 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:49:20,394 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 16:49:20,395 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 16:49:20,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:49:20,426 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 16:49:20,426 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:66, output treesize:43 [2018-01-24 16:49:20,474 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 16:49:20,474 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:49:20,836 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 16:49:20,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:20,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, 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 16:49:20,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:20,861 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 16:49:20,878 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:49:20,880 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 16:49:20,880 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:20,885 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:20,894 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 16:49:20,911 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:49:20,913 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 16:49:20,913 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:20,917 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:20,926 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 16:49:20,926 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:103, output treesize:33 [2018-01-24 16:49:21,152 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 16:49:21,174 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:49:21,174 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 16:49:21,178 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:49:21,178 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:49:21,198 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:49:21,234 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:49:21,287 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:49:21,294 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:49:21,360 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 16:49:21,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:21,369 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 16:49:21,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:21,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:21,376 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-01-24 16:49:21,453 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:49:21,454 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 16:49:21,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:21,465 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:49:21,466 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:49:21,466 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 16:49:21,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:21,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:21,472 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-01-24 16:49:21,549 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 16:49:21,551 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 16:49:21,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:21,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:21,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:21,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-24 16:49:21,603 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 16:49:21,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 16:49:21,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:21,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:21,616 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 16:49:21,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-01-24 16:49:21,879 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 16:49:21,886 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 16:49:21,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:49:21,895 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 16:49:21,895 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:21,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:49:21,904 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 16:49:21,904 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2018-01-24 16:49:22,088 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 16:49:22,088 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:49:22,519 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 16:49:22,527 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 16:49:22,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:22,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:22,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:22,534 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:25 [2018-01-24 16:49:22,785 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 16:49:22,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:22,792 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 16:49:22,806 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 16:49:22,806 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:22,806 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 16:49:22,807 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:49:22,812 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:49:22,822 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 16:49:22,822 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:37, output treesize:7 [2018-01-24 16:49:22,874 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 16:49:22,876 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:49:22,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 14, 15, 13] total 63 [2018-01-24 16:49:22,876 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:49:22,876 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-24 16:49:22,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-24 16:49:22,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=3801, Unknown=1, NotChecked=0, Total=4032 [2018-01-24 16:49:22,878 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 28 states. [2018-01-24 16:49:39,645 WARN L146 SmtUtils]: Spent 555ms on a formula simplification. DAG size of input: 80 DAG size of output 71 [2018-01-24 16:49:46,403 WARN L146 SmtUtils]: Spent 4162ms on a formula simplification. DAG size of input: 83 DAG size of output 74 [2018-01-24 16:50:06,813 WARN L146 SmtUtils]: Spent 8071ms on a formula simplification. DAG size of input: 79 DAG size of output 69 [2018-01-24 16:50:09,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:50:09,902 INFO L93 Difference]: Finished difference Result 106 states and 121 transitions. [2018-01-24 16:50:09,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-24 16:50:09,903 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-01-24 16:50:09,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:50:09,903 INFO L225 Difference]: With dead ends: 106 [2018-01-24 16:50:09,903 INFO L226 Difference]: Without dead ends: 103 [2018-01-24 16:50:09,905 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 53 SyntacticMatches, 6 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1708 ImplicationChecksByTransitivity, 30.4s TimeCoverageRelationStatistics Valid=692, Invalid=7134, Unknown=6, NotChecked=0, Total=7832 [2018-01-24 16:50:09,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-24 16:50:09,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 61. [2018-01-24 16:50:09,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-24 16:50:09,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2018-01-24 16:50:09,912 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 27 [2018-01-24 16:50:09,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:50:09,913 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2018-01-24 16:50:09,913 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-24 16:50:09,913 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2018-01-24 16:50:09,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 16:50:09,914 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:50:09,914 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 16:50:09,914 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 16:50:09,915 INFO L82 PathProgramCache]: Analyzing trace with hash 94248296, now seen corresponding path program 1 times [2018-01-24 16:50:09,915 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:50:09,915 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:50:09,916 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 16:50:09,916 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:50:09,916 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:50:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:50:09,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:50:09,975 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 16:50:09,975 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:50:09,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:50:09,975 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:50:09,976 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:50:09,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:50:09,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:50:09,976 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 5 states. [2018-01-24 16:50:10,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:50:10,054 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2018-01-24 16:50:10,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:50:10,054 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-24 16:50:10,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:50:10,057 INFO L225 Difference]: With dead ends: 93 [2018-01-24 16:50:10,057 INFO L226 Difference]: Without dead ends: 86 [2018-01-24 16:50:10,057 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 16:50:10,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-24 16:50:10,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 72. [2018-01-24 16:50:10,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-24 16:50:10,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2018-01-24 16:50:10,075 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 28 [2018-01-24 16:50:10,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:50:10,075 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2018-01-24 16:50:10,075 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:50:10,076 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2018-01-24 16:50:10,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 16:50:10,077 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:50:10,077 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 16:50:10,077 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 16:50:10,077 INFO L82 PathProgramCache]: Analyzing trace with hash -723400154, now seen corresponding path program 1 times [2018-01-24 16:50:10,077 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:50:10,078 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:50:10,078 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:50:10,078 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:50:10,078 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:50:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:50:10,092 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:50:10,198 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 16:50:10,199 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:50:10,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:50:10,199 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:50:10,199 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:50:10,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:50:10,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:50:10,200 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 6 states. [2018-01-24 16:50:10,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:50:10,312 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2018-01-24 16:50:10,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:50:10,313 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-01-24 16:50:10,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:50:10,313 INFO L225 Difference]: With dead ends: 72 [2018-01-24 16:50:10,313 INFO L226 Difference]: Without dead ends: 58 [2018-01-24 16:50:10,314 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 16:50:10,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-24 16:50:10,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2018-01-24 16:50:10,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 16:50:10,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-01-24 16:50:10,320 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 28 [2018-01-24 16:50:10,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:50:10,320 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-01-24 16:50:10,320 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:50:10,320 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-01-24 16:50:10,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 16:50:10,321 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:50:10,321 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 16:50:10,321 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 16:50:10,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1208652779, now seen corresponding path program 1 times [2018-01-24 16:50:10,321 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:50:10,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:50:10,322 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:50:10,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:50:10,322 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:50:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:50:10,336 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:50:10,461 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 16:50:10,461 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:50:10,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 16:50:10,461 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:50:10,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 16:50:10,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 16:50:10,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:50:10,462 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 7 states. [2018-01-24 16:50:10,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:50:10,552 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2018-01-24 16:50:10,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 16:50:10,552 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-01-24 16:50:10,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:50:10,553 INFO L225 Difference]: With dead ends: 97 [2018-01-24 16:50:10,553 INFO L226 Difference]: Without dead ends: 77 [2018-01-24 16:50:10,553 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:50:10,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-24 16:50:10,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-01-24 16:50:10,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-24 16:50:10,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2018-01-24 16:50:10,565 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 30 [2018-01-24 16:50:10,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:50:10,565 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2018-01-24 16:50:10,565 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 16:50:10,565 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2018-01-24 16:50:10,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 16:50:10,566 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:50:10,566 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 16:50:10,566 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 16:50:10,566 INFO L82 PathProgramCache]: Analyzing trace with hash -989798061, now seen corresponding path program 1 times [2018-01-24 16:50:10,566 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:50:10,567 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:50:10,567 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:50:10,567 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:50:10,568 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:50:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:50:10,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:50:10,789 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 21 DAG size of output 15 [2018-01-24 16:50:10,905 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 16:50:10,905 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:50:10,905 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:50:10,905 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-01-24 16:50:10,906 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 16:50:10,907 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:50:10,907 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:50:11,085 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:50:11,085 INFO L268 AbstractInterpreter]: Visited 29 different actions 40 times. Merged at 7 different actions 11 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 31 variables. [2018-01-24 16:50:11,110 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:50:11,110 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:50:11,110 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 16:50:11,122 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:50:11,122 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:50:11,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:50:11,150 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:50:11,164 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 16:50:11,167 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 16:50:11,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:50:11,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:50:11,175 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 16:50:11,176 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 16:50:11,348 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 16:50:11,357 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 16:50:11,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:50:11,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:50:11,376 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 16:50:11,376 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-24 16:50:11,426 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 16:50:11,426 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:50:11,691 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 16:50:11,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:50:11,699 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 16:50:11,709 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 16:50:11,709 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:50:11,710 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:50:11,716 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 16:50:11,716 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:39, output treesize:7 [2018-01-24 16:50:11,738 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 16:50:11,770 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:50:11,770 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 16:50:11,773 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:50:11,773 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:50:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:50:11,840 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:50:11,875 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 16:50:11,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:50:11,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:50:11,879 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 16:50:11,910 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 16:50:11,912 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 16:50:11,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:50:11,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:50:11,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:50:11,925 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 16:50:12,081 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 16:50:12,086 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 16:50:12,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:50:12,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:50:12,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:50:12,094 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:30 [2018-01-24 16:50:12,177 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 16:50:12,177 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:50:12,306 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 16:50:12,313 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 16:50:12,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:50:12,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:50:12,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:50:12,320 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-24 16:50:12,383 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 16:50:12,385 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:50:12,385 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10, 12, 12] total 41 [2018-01-24 16:50:12,385 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:50:12,385 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 16:50:12,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 16:50:12,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1566, Unknown=0, NotChecked=0, Total=1722 [2018-01-24 16:50:12,387 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand 19 states. [2018-01-24 16:50:13,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:50:13,009 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2018-01-24 16:50:13,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 16:50:13,009 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2018-01-24 16:50:13,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:50:13,010 INFO L225 Difference]: With dead ends: 87 [2018-01-24 16:50:13,010 INFO L226 Difference]: Without dead ends: 86 [2018-01-24 16:50:13,011 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=257, Invalid=2193, Unknown=0, NotChecked=0, Total=2450 [2018-01-24 16:50:13,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-24 16:50:13,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2018-01-24 16:50:13,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-24 16:50:13,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-01-24 16:50:13,020 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 30 [2018-01-24 16:50:13,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:50:13,020 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-01-24 16:50:13,020 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 16:50:13,020 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-01-24 16:50:13,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 16:50:13,021 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:50:13,021 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-01-24 16:50:13,021 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 16:50:13,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1959345908, now seen corresponding path program 1 times [2018-01-24 16:50:13,021 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:50:13,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:50:13,022 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:50:13,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:50:13,022 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:50:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:50:13,035 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:50:13,536 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:50:13,537 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:50:13,537 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:50:13,537 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-01-24 16:50:13,537 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [20], [27], [28], [29], [30], [31], [32], [35], [46], [49], [53], [55], [60], [62], [68], [69], [72], [79], [81], [84], [92], [98], [99], [100], [102] [2018-01-24 16:50:13,538 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:50:13,539 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:50:13,678 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:50:13,679 INFO L268 AbstractInterpreter]: Visited 30 different actions 41 times. Merged at 11 different actions 11 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 33 variables. [2018-01-24 16:50:13,683 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:50:13,683 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:50:13,683 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:50:13,688 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:50:13,689 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:50:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:50:13,713 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:50:13,721 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 16:50:13,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:50:13,728 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 16:50:13,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:50:13,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:50:13,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2018-01-24 16:50:13,760 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:50:13,761 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:50:13,761 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 16:50:13,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:50:13,769 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 16:50:13,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:50:13,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:50:13,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-01-24 16:50:13,818 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 18 treesize of output 15 [2018-01-24 16:50:13,820 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 15 treesize of output 14 [2018-01-24 16:50:13,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:50:13,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:50:13,827 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 16:50:13,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-01-24 16:50:13,856 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 31 treesize of output 32 [2018-01-24 16:50:13,858 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 16:50:13,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:50:13,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:50:13,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-24 16:50:13,868 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:37 [2018-01-24 16:50:14,195 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 34 treesize of output 32 [2018-01-24 16:50:14,197 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 16:50:14,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:50:14,209 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 18 treesize of output 15 [2018-01-24 16:50:14,209 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 16:50:14,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:50:14,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:50:14,221 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:47, output treesize:27 [2018-01-24 16:50:14,423 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:50:14,423 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:50:15,275 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 16:50:15,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 3 [2018-01-24 16:50:15,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:50:15,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:50:15,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:50:15,293 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:39 [2018-01-24 16:50:17,063 WARN L143 SmtUtils]: Spent 1652ms on a formula simplification that was a NOOP. DAG size: 36 Received shutdown request... [2018-01-24 16:50:18,820 WARN L143 SmtUtils]: Spent 1696ms on a formula simplification that was a NOOP. DAG size: 36 [2018-01-24 16:50:18,822 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 16:50:18,822 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 16:50:18,825 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 16:50:18,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 04:50:18 BoogieIcfgContainer [2018-01-24 16:50:18,825 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 16:50:18,826 INFO L168 Benchmark]: Toolchain (without parser) took 66965.62 ms. Allocated memory was 304.6 MB in the beginning and 609.7 MB in the end (delta: 305.1 MB). Free memory was 263.5 MB in the beginning and 467.5 MB in the end (delta: -203.9 MB). Peak memory consumption was 101.2 MB. Max. memory is 5.3 GB. [2018-01-24 16:50:18,826 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 304.6 MB. Free memory is still 269.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:50:18,826 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.44 ms. Allocated memory is still 304.6 MB. Free memory was 263.5 MB in the beginning and 253.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:50:18,826 INFO L168 Benchmark]: Boogie Preprocessor took 35.66 ms. Allocated memory is still 304.6 MB. Free memory was 253.5 MB in the beginning and 251.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:50:18,827 INFO L168 Benchmark]: RCFGBuilder took 288.01 ms. Allocated memory is still 304.6 MB. Free memory was 251.5 MB in the beginning and 230.5 MB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 5.3 GB. [2018-01-24 16:50:18,827 INFO L168 Benchmark]: TraceAbstraction took 66420.69 ms. Allocated memory was 304.6 MB in the beginning and 609.7 MB in the end (delta: 305.1 MB). Free memory was 230.5 MB in the beginning and 467.5 MB in the end (delta: -236.9 MB). Peak memory consumption was 68.2 MB. Max. memory is 5.3 GB. [2018-01-24 16:50:18,829 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.13 ms. Allocated memory is still 304.6 MB. Free memory is still 269.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 215.44 ms. Allocated memory is still 304.6 MB. Free memory was 263.5 MB in the beginning and 253.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.66 ms. Allocated memory is still 304.6 MB. Free memory was 253.5 MB in the beginning and 251.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 288.01 ms. Allocated memory is still 304.6 MB. Free memory was 251.5 MB in the beginning and 230.5 MB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 66420.69 ms. Allocated memory was 304.6 MB in the beginning and 609.7 MB in the end (delta: 305.1 MB). Free memory was 230.5 MB in the beginning and 467.5 MB in the end (delta: -236.9 MB). Peak memory consumption was 68.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 : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 250 LocStat_NO_SUPPORTING_DISEQUALITIES : 40 LocStat_NO_DISJUNCTIONS : -44 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 29 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 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.039271 RENAME_VARIABLES(MILLISECONDS) : 0.567358 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.979109 PROJECTAWAY(MILLISECONDS) : 0.936174 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001471 DISJOIN(MILLISECONDS) : 0.626434 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.614306 ADD_EQUALITY(MILLISECONDS) : 0.044877 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.038944 #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 : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 341 LocStat_NO_SUPPORTING_DISEQUALITIES : 61 LocStat_NO_DISJUNCTIONS : -56 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 35 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 72 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 36 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.756037 RENAME_VARIABLES(MILLISECONDS) : 0.448015 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.691264 PROJECTAWAY(MILLISECONDS) : 0.226423 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001319 DISJOIN(MILLISECONDS) : 0.634653 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.481569 ADD_EQUALITY(MILLISECONDS) : 0.021053 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.016156 #CONJOIN_DISJUNCTIVE : 71 #RENAME_VARIABLES : 112 #UNFREEZE : 0 #CONJOIN : 129 #PROJECTAWAY : 94 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 9 #RENAME_VARIABLES_DISJUNCTIVE : 107 #ADD_EQUALITY : 75 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 29 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 373 LocStat_NO_SUPPORTING_DISEQUALITIES : 77 LocStat_NO_DISJUNCTIONS : -58 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 36 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 75 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 37 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.890353 RENAME_VARIABLES(MILLISECONDS) : 0.248704 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.411977 PROJECTAWAY(MILLISECONDS) : 0.046887 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001180 DISJOIN(MILLISECONDS) : 0.573815 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.279458 ADD_EQUALITY(MILLISECONDS) : 0.022986 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011310 #CONJOIN_DISJUNCTIVE : 76 #RENAME_VARIABLES : 116 #UNFREEZE : 0 #CONJOIN : 133 #PROJECTAWAY : 96 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 13 #RENAME_VARIABLES_DISJUNCTIVE : 113 #ADD_EQUALITY : 78 #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 analyzing trace of length 36 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 4 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 4 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 574). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 4 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 4 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 557]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 557). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 4 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 4 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 4 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 4 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 4 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 4 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 4 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 4 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while XnfDer was eliminating 4 quantified variables from 2 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 54 locations, 13 error locations. TIMEOUT Result, 66.3s OverallTime, 17 OverallIterations, 3 TraceHistogramMax, 49.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 633 SDtfs, 1125 SDslu, 2156 SDs, 0 SdLazy, 1997 SolverSat, 246 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 22.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 503 GetRequests, 217 SyntacticMatches, 20 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2901 ImplicationChecksByTransitivity, 34.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 93 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 507 NumberOfCodeBlocks, 507 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 641 ConstructedInterpolants, 58 QuantifiedInterpolants, 151739 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_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_16-50-18-838.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_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-50-18-838.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_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-50-18-838.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_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_16-50-18-838.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_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_16-50-18-838.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_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_16-50-18-838.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_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_16-50-18-838.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_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_16-50-18-838.csv Completed graceful shutdown