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/cstrcat-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:40:41,068 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:40:41,071 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:40:41,087 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:40:41,087 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:40:41,088 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:40:41,089 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:40:41,090 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:40:41,093 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:40:41,093 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:40:41,094 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:40:41,094 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:40:41,095 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:40:41,097 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:40:41,097 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:40:41,100 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:40:41,102 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:40:41,104 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:40:41,105 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:40:41,106 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:40:41,108 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:40:41,108 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:40:41,109 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:40:41,110 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:40:41,110 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:40:41,111 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:40:41,112 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:40:41,112 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:40:41,112 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:40:41,113 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:40:41,113 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:40:41,113 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:40:41,123 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:40:41,123 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:40:41,124 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:40:41,124 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:40:41,124 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:40:41,124 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:40:41,125 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:40:41,125 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:40:41,125 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:40:41,126 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:40:41,126 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:40:41,126 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:40:41,126 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:40:41,126 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:40:41,126 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:40:41,127 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:40:41,127 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:40:41,127 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:40:41,127 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:40:41,127 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:40:41,128 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:40:41,128 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:40:41,128 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:40:41,128 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:40:41,128 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:40:41,128 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:40:41,129 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:40:41,129 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:40:41,129 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:40:41,129 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 16:40:41,129 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:40:41,130 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:40:41,130 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:40:41,130 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 16:40:41,131 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:40:41,131 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:40:41,164 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:40:41,176 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:40:41,180 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:40:41,181 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:40:41,182 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:40:41,182 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-01-24 16:40:41,337 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:40:41,343 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:40:41,344 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:40:41,344 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:40:41,348 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:40:41,349 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:40:41" (1/1) ... [2018-01-24 16:40:41,351 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e47ad9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:40:41, skipping insertion in model container [2018-01-24 16:40:41,351 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:40:41" (1/1) ... [2018-01-24 16:40:41,367 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:40:41,405 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:40:41,512 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:40:41,529 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:40:41,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:40:41 WrapperNode [2018-01-24 16:40:41,537 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:40:41,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:40:41,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:40:41,538 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:40:41,552 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:40:41" (1/1) ... [2018-01-24 16:40:41,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:40:41" (1/1) ... [2018-01-24 16:40:41,560 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:40:41" (1/1) ... [2018-01-24 16:40:41,560 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:40:41" (1/1) ... [2018-01-24 16:40:41,563 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:40:41" (1/1) ... [2018-01-24 16:40:41,565 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:40:41" (1/1) ... [2018-01-24 16:40:41,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:40:41" (1/1) ... [2018-01-24 16:40:41,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:40:41,568 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:40:41,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:40:41,568 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:40:41,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:40:41" (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:40:41,617 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:40:41,617 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:40:41,617 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcat [2018-01-24 16:40:41,617 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:40:41,618 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:40:41,618 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:40:41,618 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:40:41,618 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:40:41,618 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:40:41,618 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:40:41,618 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcat [2018-01-24 16:40:41,619 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:40:41,619 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:40:41,619 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:40:41,831 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:40:41,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:40:41 BoogieIcfgContainer [2018-01-24 16:40:41,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:40:41,833 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 16:40:41,833 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 16:40:41,834 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 16:40:41,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 04:40:41" (1/3) ... [2018-01-24 16:40:41,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c1bbf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:40:41, skipping insertion in model container [2018-01-24 16:40:41,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:40:41" (2/3) ... [2018-01-24 16:40:41,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c1bbf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:40:41, skipping insertion in model container [2018-01-24 16:40:41,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:40:41" (3/3) ... [2018-01-24 16:40:41,837 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-01-24 16:40:41,843 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 16:40:41,849 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-01-24 16:40:41,890 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 16:40:41,890 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 16:40:41,890 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 16:40:41,891 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 16:40:41,891 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 16:40:41,891 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 16:40:41,891 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 16:40:41,891 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 16:40:41,892 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 16:40:41,908 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-01-24 16:40:41,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-24 16:40:41,913 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:40:41,914 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:40:41,915 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:40:41,918 INFO L82 PathProgramCache]: Analyzing trace with hash 104454547, now seen corresponding path program 1 times [2018-01-24 16:40:41,920 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:40:41,961 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:41,961 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:41,962 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:41,962 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:40:42,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:42,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:40:42,093 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:40:42,096 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:40:42,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 16:40:42,096 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:40:42,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 16:40:42,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 16:40:42,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 16:40:42,117 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. [2018-01-24 16:40:42,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:40:42,223 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2018-01-24 16:40:42,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 16:40:42,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-24 16:40:42,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:40:42,303 INFO L225 Difference]: With dead ends: 72 [2018-01-24 16:40:42,303 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 16:40:42,307 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:40:42,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 16:40:42,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-24 16:40:42,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 16:40:42,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-01-24 16:40:42,348 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 11 [2018-01-24 16:40:42,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:40:42,348 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-01-24 16:40:42,348 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 16:40:42,349 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-01-24 16:40:42,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 16:40:42,349 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:40:42,349 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:40:42,350 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:40:42,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1017224676, now seen corresponding path program 1 times [2018-01-24 16:40:42,350 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:40:42,351 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:42,352 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:42,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:42,352 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:40:42,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:42,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:40:42,447 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:40:42,447 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:40:42,447 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:40:42,447 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:40:42,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:40:42,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:40:42,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:40:42,450 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 4 states. [2018-01-24 16:40:42,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:40:42,506 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-01-24 16:40:42,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:40:42,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-24 16:40:42,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:40:42,507 INFO L225 Difference]: With dead ends: 46 [2018-01-24 16:40:42,507 INFO L226 Difference]: Without dead ends: 45 [2018-01-24 16:40:42,508 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:40:42,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-24 16:40:42,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-01-24 16:40:42,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-24 16:40:42,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-01-24 16:40:42,514 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 15 [2018-01-24 16:40:42,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:40:42,515 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-01-24 16:40:42,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:40:42,515 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-01-24 16:40:42,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 16:40:42,515 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:40:42,515 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:40:42,516 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:40:42,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1017224677, now seen corresponding path program 1 times [2018-01-24 16:40:42,516 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:40:42,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:42,517 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:42,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:42,517 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:40:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:42,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:40:42,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:40:42,735 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:40:42,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:40:42,735 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:40:42,736 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:40:42,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:40:42,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:40:42,736 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2018-01-24 16:40:42,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:40:42,813 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-01-24 16:40:42,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:40:42,814 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-24 16:40:42,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:40:42,815 INFO L225 Difference]: With dead ends: 45 [2018-01-24 16:40:42,815 INFO L226 Difference]: Without dead ends: 44 [2018-01-24 16:40:42,816 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:40:42,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-24 16:40:42,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-01-24 16:40:42,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-24 16:40:42,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-01-24 16:40:42,821 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 15 [2018-01-24 16:40:42,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:40:42,822 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-01-24 16:40:42,822 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:40:42,822 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-01-24 16:40:42,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 16:40:42,823 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:40:42,823 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:40:42,823 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:40:42,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1469193927, now seen corresponding path program 1 times [2018-01-24 16:40:42,823 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:40:42,824 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:42,824 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:42,824 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:42,825 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:40:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:42,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:40:42,890 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:40:42,890 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:40:42,890 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:40:42,890 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:40:42,891 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:40:42,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:40:42,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:40:42,891 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 4 states. [2018-01-24 16:40:42,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:40:42,940 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-01-24 16:40:42,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:40:42,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 16:40:42,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:40:42,942 INFO L225 Difference]: With dead ends: 44 [2018-01-24 16:40:42,942 INFO L226 Difference]: Without dead ends: 43 [2018-01-24 16:40:42,942 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:40:42,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-24 16:40:42,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-24 16:40:42,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-24 16:40:42,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-01-24 16:40:42,948 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 16 [2018-01-24 16:40:42,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:40:42,949 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-01-24 16:40:42,949 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:40:42,949 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-01-24 16:40:42,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 16:40:42,950 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:40:42,950 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:40:42,950 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:40:42,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1469193928, now seen corresponding path program 1 times [2018-01-24 16:40:42,950 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:40:42,951 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:42,951 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:42,951 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:42,951 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:40:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:42,965 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:40:43,028 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:40:43,028 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:40:43,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:40:43,028 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:40:43,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:40:43,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:40:43,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:40:43,029 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 6 states. [2018-01-24 16:40:43,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:40:43,159 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-01-24 16:40:43,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 16:40:43,159 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-01-24 16:40:43,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:40:43,161 INFO L225 Difference]: With dead ends: 59 [2018-01-24 16:40:43,161 INFO L226 Difference]: Without dead ends: 58 [2018-01-24 16:40:43,162 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:40:43,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-24 16:40:43,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2018-01-24 16:40:43,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 16:40:43,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-01-24 16:40:43,173 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2018-01-24 16:40:43,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:40:43,174 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-01-24 16:40:43,174 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:40:43,174 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-01-24 16:40:43,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 16:40:43,175 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:40:43,175 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:40:43,175 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:40:43,175 INFO L82 PathProgramCache]: Analyzing trace with hash 659847302, now seen corresponding path program 1 times [2018-01-24 16:40:43,175 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:40:43,176 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:43,176 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:43,176 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:43,176 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:40:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:43,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:40:43,269 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:40:43,269 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:40:43,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 16:40:43,269 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:40:43,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 16:40:43,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 16:40:43,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:40:43,270 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 7 states. [2018-01-24 16:40:43,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:40:43,359 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-01-24 16:40:43,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:40:43,360 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-01-24 16:40:43,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:40:43,360 INFO L225 Difference]: With dead ends: 50 [2018-01-24 16:40:43,360 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 16:40:43,361 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-01-24 16:40:43,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 16:40:43,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2018-01-24 16:40:43,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-24 16:40:43,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-01-24 16:40:43,365 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 16 [2018-01-24 16:40:43,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:40:43,365 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-01-24 16:40:43,365 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 16:40:43,365 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-01-24 16:40:43,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 16:40:43,365 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:40:43,366 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] [2018-01-24 16:40:43,366 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:40:43,366 INFO L82 PathProgramCache]: Analyzing trace with hash -262056781, now seen corresponding path program 1 times [2018-01-24 16:40:43,366 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:40:43,367 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:43,367 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:43,367 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:43,367 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:40:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:43,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:40:43,417 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:40:43,417 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:40:43,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:40:43,417 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:40:43,418 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:40:43,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:40:43,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:40:43,418 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2018-01-24 16:40:43,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:40:43,460 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-01-24 16:40:43,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:40:43,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-24 16:40:43,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:40:43,461 INFO L225 Difference]: With dead ends: 42 [2018-01-24 16:40:43,462 INFO L226 Difference]: Without dead ends: 41 [2018-01-24 16:40:43,462 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:40:43,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-24 16:40:43,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-24 16:40:43,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 16:40:43,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-01-24 16:40:43,468 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 20 [2018-01-24 16:40:43,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:40:43,468 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-01-24 16:40:43,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:40:43,468 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-01-24 16:40:43,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 16:40:43,469 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:40:43,469 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] [2018-01-24 16:40:43,469 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:40:43,470 INFO L82 PathProgramCache]: Analyzing trace with hash -262056780, now seen corresponding path program 1 times [2018-01-24 16:40:43,470 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:40:43,470 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:43,471 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:43,471 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:43,471 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:40:43,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:43,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:40:43,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:40:43,567 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:40:43,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 16:40:43,567 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:40:43,567 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 16:40:43,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 16:40:43,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:40:43,568 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 7 states. [2018-01-24 16:40:43,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:40:43,682 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-01-24 16:40:43,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:40:43,682 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-01-24 16:40:43,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:40:43,682 INFO L225 Difference]: With dead ends: 47 [2018-01-24 16:40:43,683 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 16:40:43,683 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-01-24 16:40:43,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 16:40:43,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-01-24 16:40:43,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-24 16:40:43,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-01-24 16:40:43,688 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 20 [2018-01-24 16:40:43,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:40:43,689 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-01-24 16:40:43,689 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 16:40:43,689 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-01-24 16:40:43,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 16:40:43,690 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:40:43,690 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] [2018-01-24 16:40:43,690 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:40:43,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1316966177, now seen corresponding path program 1 times [2018-01-24 16:40:43,690 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:40:43,691 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:43,691 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:43,691 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:43,691 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:40:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:43,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:40:43,828 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:40:43,828 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:40:43,829 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:40:43,830 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-24 16:40:43,832 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [10], [15], [43], [48], [52], [58], [65], [66], [67], [68], [69], [70], [73], [84], [85], [86], [88] [2018-01-24 16:40:43,890 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:40:43,891 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:40:44,075 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:40:44,076 INFO L268 AbstractInterpreter]: Visited 22 different actions 26 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-01-24 16:40:44,092 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:40:44,092 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:40:44,092 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:40:44,103 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:44,104 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:40:44,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:44,149 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:40:44,203 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 11 treesize of output 8 [2018-01-24 16:40:44,205 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 8 treesize of output 7 [2018-01-24 16:40:44,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:44,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:44,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:44,209 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-24 16:40:44,257 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 11 [2018-01-24 16:40:44,266 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 11 treesize of output 3 [2018-01-24 16:40:44,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:44,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:44,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:44,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-01-24 16:40:44,290 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:40:44,291 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:40:44,301 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:40:44,316 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:40:44,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:44,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:44,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:44,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:3 [2018-01-24 16:40:44,331 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:40:44,355 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 16:40:44,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [7] total 13 [2018-01-24 16:40:44,356 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:40:44,356 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 16:40:44,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 16:40:44,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-01-24 16:40:44,357 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 7 states. [2018-01-24 16:40:44,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:40:44,494 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2018-01-24 16:40:44,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 16:40:44,494 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-01-24 16:40:44,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:40:44,495 INFO L225 Difference]: With dead ends: 93 [2018-01-24 16:40:44,495 INFO L226 Difference]: Without dead ends: 70 [2018-01-24 16:40:44,496 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-01-24 16:40:44,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-24 16:40:44,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 55. [2018-01-24 16:40:44,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 16:40:44,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-01-24 16:40:44,505 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 23 [2018-01-24 16:40:44,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:40:44,505 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-01-24 16:40:44,505 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 16:40:44,505 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-01-24 16:40:44,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 16:40:44,506 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:40:44,506 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] [2018-01-24 16:40:44,506 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:40:44,507 INFO L82 PathProgramCache]: Analyzing trace with hash 37102499, now seen corresponding path program 1 times [2018-01-24 16:40:44,507 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:40:44,508 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:44,508 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:44,508 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:44,508 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:40:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:44,521 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:40:44,619 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:40:44,620 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:40:44,620 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:40:44,620 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-24 16:40:44,620 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [10], [15], [43], [48], [52], [60], [65], [66], [67], [68], [69], [70], [73], [84], [85], [86], [88] [2018-01-24 16:40:44,621 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:40:44,622 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:40:44,727 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:40:44,728 INFO L268 AbstractInterpreter]: Visited 22 different actions 26 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-01-24 16:40:44,735 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:40:44,735 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:40:44,735 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:40:44,742 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:44,742 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:40:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:44,773 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:40:44,790 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:40:44,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:44,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:44,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-01-24 16:40:44,890 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:40:44,890 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:40:44,983 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:40:45,006 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:40:45,006 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 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 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:40:45,010 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:45,010 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:40:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:45,043 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:40:45,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:40:45,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:45,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:45,062 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 16:40:45,186 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:40:45,186 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:40:45,205 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:40:45,207 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:40:45,207 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8, 7, 8] total 24 [2018-01-24 16:40:45,207 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:40:45,207 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 16:40:45,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 16:40:45,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2018-01-24 16:40:45,208 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 13 states. [2018-01-24 16:40:45,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:40:45,376 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-01-24 16:40:45,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 16:40:45,377 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-01-24 16:40:45,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:40:45,380 INFO L225 Difference]: With dead ends: 74 [2018-01-24 16:40:45,380 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 16:40:45,381 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 69 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=746, Unknown=0, NotChecked=0, Total=870 [2018-01-24 16:40:45,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 16:40:45,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 58. [2018-01-24 16:40:45,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-24 16:40:45,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2018-01-24 16:40:45,393 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 23 [2018-01-24 16:40:45,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:40:45,394 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2018-01-24 16:40:45,394 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 16:40:45,394 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-01-24 16:40:45,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 16:40:45,395 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:40:45,395 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:40:45,395 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:40:45,395 INFO L82 PathProgramCache]: Analyzing trace with hash -2123766212, now seen corresponding path program 1 times [2018-01-24 16:40:45,396 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:40:45,396 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:45,397 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:45,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:45,397 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:40:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:45,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:40:45,459 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:40:45,460 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:40:45,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:40:45,460 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:40:45,460 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:40:45,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:40:45,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:40:45,461 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 6 states. [2018-01-24 16:40:45,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:40:45,524 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-01-24 16:40:45,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:40:45,525 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-24 16:40:45,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:40:45,526 INFO L225 Difference]: With dead ends: 58 [2018-01-24 16:40:45,526 INFO L226 Difference]: Without dead ends: 57 [2018-01-24 16:40:45,526 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:40:45,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-24 16:40:45,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-24 16:40:45,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-24 16:40:45,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2018-01-24 16:40:45,534 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 24 [2018-01-24 16:40:45,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:40:45,535 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-01-24 16:40:45,535 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:40:45,535 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2018-01-24 16:40:45,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 16:40:45,536 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:40:45,536 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:40:45,536 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:40:45,536 INFO L82 PathProgramCache]: Analyzing trace with hash -2123766211, now seen corresponding path program 1 times [2018-01-24 16:40:45,536 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:40:45,537 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:45,537 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:45,537 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:45,537 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:40:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:45,549 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:40:45,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:40:45,713 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:40:45,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 16:40:45,713 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:40:45,713 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 16:40:45,714 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 16:40:45,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:40:45,714 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 9 states. [2018-01-24 16:40:45,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:40:45,816 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2018-01-24 16:40:45,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 16:40:45,817 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-01-24 16:40:45,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:40:45,818 INFO L225 Difference]: With dead ends: 65 [2018-01-24 16:40:45,818 INFO L226 Difference]: Without dead ends: 64 [2018-01-24 16:40:45,818 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-01-24 16:40:45,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-24 16:40:45,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-01-24 16:40:45,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-24 16:40:45,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2018-01-24 16:40:45,824 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 24 [2018-01-24 16:40:45,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:40:45,824 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-01-24 16:40:45,824 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 16:40:45,824 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2018-01-24 16:40:45,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 16:40:45,825 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:40:45,825 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] [2018-01-24 16:40:45,825 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:40:45,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1412243135, now seen corresponding path program 1 times [2018-01-24 16:40:45,825 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:40:45,826 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:45,826 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:45,827 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:45,827 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:40:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:45,834 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:40:45,861 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:40:45,861 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:40:45,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:40:45,861 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:40:45,862 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:40:45,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:40:45,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:40:45,862 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 6 states. [2018-01-24 16:40:45,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:40:45,938 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2018-01-24 16:40:45,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:40:45,939 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-24 16:40:45,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:40:45,939 INFO L225 Difference]: With dead ends: 60 [2018-01-24 16:40:45,939 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 16:40:45,940 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:40:45,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 16:40:45,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-24 16:40:45,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-24 16:40:45,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2018-01-24 16:40:45,947 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 25 [2018-01-24 16:40:45,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:40:45,947 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2018-01-24 16:40:45,947 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:40:45,948 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2018-01-24 16:40:45,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 16:40:45,948 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:40:45,949 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] [2018-01-24 16:40:45,949 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:40:45,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1412243134, now seen corresponding path program 1 times [2018-01-24 16:40:45,949 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:40:45,950 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:45,950 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:45,950 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:45,950 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:40:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:45,958 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:40:46,195 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:40:46,196 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:40:46,196 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 16:40:46,196 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:40:46,196 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 16:40:46,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 16:40:46,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:40:46,197 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 8 states. [2018-01-24 16:40:46,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:40:46,569 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2018-01-24 16:40:46,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 16:40:46,570 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-01-24 16:40:46,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:40:46,570 INFO L225 Difference]: With dead ends: 65 [2018-01-24 16:40:46,570 INFO L226 Difference]: Without dead ends: 64 [2018-01-24 16:40:46,571 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-01-24 16:40:46,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-24 16:40:46,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-01-24 16:40:46,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-24 16:40:46,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2018-01-24 16:40:46,575 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 25 [2018-01-24 16:40:46,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:40:46,575 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-01-24 16:40:46,575 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 16:40:46,575 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2018-01-24 16:40:46,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 16:40:46,576 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:40:46,576 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] [2018-01-24 16:40:46,576 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:40:46,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1513907666, now seen corresponding path program 2 times [2018-01-24 16:40:46,576 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:40:46,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:46,577 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:46,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:46,577 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:40:46,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:46,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:40:46,734 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 16:40:46,734 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:40:46,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 16:40:46,735 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:40:46,735 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 16:40:46,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 16:40:46,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-01-24 16:40:46,736 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 12 states. [2018-01-24 16:40:46,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:40:46,947 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2018-01-24 16:40:46,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 16:40:46,947 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-01-24 16:40:46,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:40:46,948 INFO L225 Difference]: With dead ends: 128 [2018-01-24 16:40:46,948 INFO L226 Difference]: Without dead ends: 102 [2018-01-24 16:40:46,948 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2018-01-24 16:40:46,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-24 16:40:46,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 64. [2018-01-24 16:40:46,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-24 16:40:46,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2018-01-24 16:40:46,954 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 26 [2018-01-24 16:40:46,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:40:46,954 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2018-01-24 16:40:46,954 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 16:40:46,954 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2018-01-24 16:40:46,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 16:40:46,955 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:40:46,956 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] [2018-01-24 16:40:46,956 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:40:46,956 INFO L82 PathProgramCache]: Analyzing trace with hash -175036076, now seen corresponding path program 1 times [2018-01-24 16:40:46,956 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:40:46,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:46,957 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 16:40:46,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:46,957 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:40:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:46,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:40:47,156 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:40:47,157 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:40:47,157 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:40:47,157 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-01-24 16:40:47,157 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [10], [15], [43], [48], [54], [60], [65], [66], [67], [68], [69], [70], [73], [84], [85], [86], [88] [2018-01-24 16:40:47,158 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:40:47,158 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:40:47,230 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:40:47,230 INFO L268 AbstractInterpreter]: Visited 22 different actions 26 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-01-24 16:40:47,243 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:40:47,243 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:40:47,243 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:40:47,253 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:47,253 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:40:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:47,278 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:40:47,286 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:40:47,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:47,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:47,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-24 16:40:47,360 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:40:47,362 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:40:47,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:47,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:47,369 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:40:47,369 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-24 16:40:47,528 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 18 treesize of output 14 [2018-01-24 16:40:47,538 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 14 treesize of output 11 [2018-01-24 16:40:47,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:40:47,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:40:47,557 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:40:47,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:35 [2018-01-24 16:40:47,672 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:40:47,673 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:40:47,888 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:40:47,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, 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:40:47,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:47,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:47,931 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:40:47,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:38 [2018-01-24 16:40:48,062 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:40:48,081 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:40:48,081 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 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 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:40:48,084 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:48,084 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:40:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:48,125 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:40:48,130 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:40:48,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:48,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:48,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-24 16:40:48,163 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:40:48,165 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:40:48,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:48,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:48,171 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:40:48,171 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-24 16:40:48,751 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 18 treesize of output 14 [2018-01-24 16:40:48,756 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 14 treesize of output 15 [2018-01-24 16:40:48,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:40:48,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:40:48,775 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:40:48,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:27 [2018-01-24 16:40:48,814 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:40:48,814 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:40:48,951 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:40:48,958 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:40:48,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:48,960 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:48,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:48,963 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:16 [2018-01-24 16:40:49,112 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:40:49,113 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:40:49,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12, 12, 13] total 43 [2018-01-24 16:40:49,113 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:40:49,113 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 16:40:49,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 16:40:49,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1732, Unknown=1, NotChecked=0, Total=1892 [2018-01-24 16:40:49,115 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand 21 states. [2018-01-24 16:40:49,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:40:49,900 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2018-01-24 16:40:49,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 16:40:49,900 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 26 [2018-01-24 16:40:49,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:40:49,900 INFO L225 Difference]: With dead ends: 84 [2018-01-24 16:40:49,900 INFO L226 Difference]: Without dead ends: 83 [2018-01-24 16:40:49,901 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 66 SyntacticMatches, 7 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=302, Invalid=2453, Unknown=1, NotChecked=0, Total=2756 [2018-01-24 16:40:49,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-24 16:40:49,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 75. [2018-01-24 16:40:49,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-24 16:40:49,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2018-01-24 16:40:49,908 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 26 [2018-01-24 16:40:49,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:40:49,908 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2018-01-24 16:40:49,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 16:40:49,908 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2018-01-24 16:40:49,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 16:40:49,909 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:40:49,909 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:40:49,910 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:40:49,910 INFO L82 PathProgramCache]: Analyzing trace with hash -707331403, now seen corresponding path program 1 times [2018-01-24 16:40:49,910 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:40:49,917 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:49,917 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:49,917 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:49,917 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:40:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:49,928 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:40:50,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:40:50,002 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:40:50,002 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:40:50,002 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-24 16:40:50,002 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [13], [15], [21], [23], [24], [29], [43], [48], [54], [60], [65], [66], [67], [68], [69], [70], [73], [84], [85], [86], [88] [2018-01-24 16:40:50,004 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:40:50,004 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:40:50,094 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:40:50,094 INFO L268 AbstractInterpreter]: Visited 26 different actions 34 times. Merged at 8 different actions 8 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-01-24 16:40:50,102 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:40:50,102 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:40:50,103 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:40:50,121 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:50,121 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:40:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:50,155 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:40:50,162 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:40:50,162 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:50,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:50,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-01-24 16:40:50,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:40:50,253 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:40:50,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:40:50,385 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:40:50,385 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 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 8 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:40:50,388 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:50,388 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:40:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:50,424 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:40:50,428 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:40:50,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:50,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:50,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-01-24 16:40:50,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:40:50,461 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:40:50,625 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:40:50,627 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:40:50,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9, 8, 9] total 26 [2018-01-24 16:40:50,627 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:40:50,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 16:40:50,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 16:40:50,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2018-01-24 16:40:50,628 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 15 states. [2018-01-24 16:40:50,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:40:50,804 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2018-01-24 16:40:50,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 16:40:50,804 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-01-24 16:40:50,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:40:50,805 INFO L225 Difference]: With dead ends: 86 [2018-01-24 16:40:50,805 INFO L226 Difference]: Without dead ends: 85 [2018-01-24 16:40:50,805 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 87 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=904, Unknown=0, NotChecked=0, Total=1056 [2018-01-24 16:40:50,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-24 16:40:50,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2018-01-24 16:40:50,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-24 16:40:50,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions. [2018-01-24 16:40:50,813 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 91 transitions. Word has length 28 [2018-01-24 16:40:50,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:40:50,813 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 91 transitions. [2018-01-24 16:40:50,813 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 16:40:50,813 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 91 transitions. [2018-01-24 16:40:50,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 16:40:50,814 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:40:50,815 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:40:50,815 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:40:50,815 INFO L82 PathProgramCache]: Analyzing trace with hash -653260906, now seen corresponding path program 1 times [2018-01-24 16:40:50,815 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:40:50,816 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:50,816 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:50,816 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:50,816 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:40:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:50,834 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:40:51,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:40:51,046 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:40:51,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-01-24 16:40:51,046 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:40:51,047 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 16:40:51,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 16:40:51,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-01-24 16:40:51,047 INFO L87 Difference]: Start difference. First operand 80 states and 91 transitions. Second operand 15 states. [2018-01-24 16:40:51,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:40:51,485 INFO L93 Difference]: Finished difference Result 182 states and 205 transitions. [2018-01-24 16:40:51,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-24 16:40:51,486 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-01-24 16:40:51,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:40:51,487 INFO L225 Difference]: With dead ends: 182 [2018-01-24 16:40:51,487 INFO L226 Difference]: Without dead ends: 161 [2018-01-24 16:40:51,487 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=233, Invalid=889, Unknown=0, NotChecked=0, Total=1122 [2018-01-24 16:40:51,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-01-24 16:40:51,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 134. [2018-01-24 16:40:51,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-24 16:40:51,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 153 transitions. [2018-01-24 16:40:51,500 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 153 transitions. Word has length 29 [2018-01-24 16:40:51,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:40:51,500 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 153 transitions. [2018-01-24 16:40:51,500 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 16:40:51,500 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 153 transitions. [2018-01-24 16:40:51,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 16:40:51,501 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:40:51,501 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:40:51,501 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:40:51,501 INFO L82 PathProgramCache]: Analyzing trace with hash -434406188, now seen corresponding path program 1 times [2018-01-24 16:40:51,501 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:40:51,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:51,502 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:51,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:51,502 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:40:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:51,511 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:40:51,719 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 19 DAG size of output 15 [2018-01-24 16:40:51,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:40:51,979 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:40:51,979 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:40:51,979 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-24 16:40:51,979 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [13], [21], [23], [24], [26], [27], [34], [43], [48], [54], [58], [65], [66], [67], [68], [69], [70], [73], [84], [85], [86], [88] [2018-01-24 16:40:51,981 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:40:51,981 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:40:52,122 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:40:52,122 INFO L268 AbstractInterpreter]: Visited 27 different actions 38 times. Merged at 6 different actions 11 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-01-24 16:40:52,151 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:40:52,151 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:40:52,152 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:40:52,161 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:52,161 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:40:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:52,187 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:40:52,191 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:40:52,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:52,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:52,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 16:40:52,245 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:40:52,246 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:40:52,247 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:40:52,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:52,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:52,251 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-24 16:40:52,290 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 14 treesize of output 11 [2018-01-24 16:40:52,292 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:40:52,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:52,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:52,300 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:40:52,300 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-24 16:40:52,324 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 25 treesize of output 26 [2018-01-24 16:40:52,325 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:40:52,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:52,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:52,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-24 16:40:52,335 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-24 16:40:52,469 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 30 treesize of output 28 [2018-01-24 16:40:52,475 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:40:52,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:40:52,483 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:40:52,483 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:52,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:40:52,495 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:40:52,495 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-01-24 16:40:52,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:40:52,535 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:40:52,779 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:40:52,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:52,790 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:40:52,799 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:40:52,799 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:52,800 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:52,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:52,806 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:39, output treesize:7 [2018-01-24 16:40:52,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:40:52,880 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:40:52,880 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:40:52,883 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:52,883 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:40:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:52,945 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:40:52,984 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:40:52,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:52,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 6 treesize of output 5 [2018-01-24 16:40:52,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:52,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:52,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 16:40:53,045 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:40:53,046 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:40:53,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:53,053 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:40:53,054 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:40:53,054 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:40:53,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:53,060 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:40:53,060 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-24 16:40:53,121 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:40:53,122 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:40:53,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:53,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:53,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:53,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-24 16:40:53,162 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 27 treesize of output 28 [2018-01-24 16:40:53,164 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:40:53,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:53,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:53,172 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:40:53,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:30 [2018-01-24 16:40:53,371 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 29 treesize of output 27 [2018-01-24 16:40:53,373 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:40:53,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:53,381 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:40:53,382 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 16:40:53,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:40:53,391 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:40:53,391 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:30 [2018-01-24 16:40:53,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:40:53,505 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:40:53,723 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:40:53,730 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:40:53,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:53,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:53,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:53,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:21 [2018-01-24 16:40:53,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:40:53,915 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:40:53,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 10, 13, 11] total 50 [2018-01-24 16:40:53,915 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:40:53,915 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-24 16:40:53,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-24 16:40:53,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2373, Unknown=0, NotChecked=0, Total=2550 [2018-01-24 16:40:53,916 INFO L87 Difference]: Start difference. First operand 134 states and 153 transitions. Second operand 24 states. [2018-01-24 16:40:54,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:40:54,826 INFO L93 Difference]: Finished difference Result 144 states and 165 transitions. [2018-01-24 16:40:54,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 16:40:54,826 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 29 [2018-01-24 16:40:54,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:40:54,827 INFO L225 Difference]: With dead ends: 144 [2018-01-24 16:40:54,827 INFO L226 Difference]: Without dead ends: 143 [2018-01-24 16:40:54,828 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=331, Invalid=3575, Unknown=0, NotChecked=0, Total=3906 [2018-01-24 16:40:54,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-24 16:40:54,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 139. [2018-01-24 16:40:54,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-01-24 16:40:54,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 159 transitions. [2018-01-24 16:40:54,844 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 159 transitions. Word has length 29 [2018-01-24 16:40:54,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:40:54,844 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 159 transitions. [2018-01-24 16:40:54,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-24 16:40:54,845 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 159 transitions. [2018-01-24 16:40:54,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 16:40:54,845 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:40:54,846 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:40:54,846 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:40:54,846 INFO L82 PathProgramCache]: Analyzing trace with hash -409487743, now seen corresponding path program 2 times [2018-01-24 16:40:54,846 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:40:54,847 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:54,847 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:40:54,847 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:54,847 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:40:54,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:54,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:40:55,232 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:40:55,233 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:40:55,233 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:40:55,233 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 16:40:55,233 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:40:55,233 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:40:55,233 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:40:55,241 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:40:55,241 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:40:55,253 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:40:55,259 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:40:55,272 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:40:55,276 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:40:55,405 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:40:55,405 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:55,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:55,420 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-24 16:40:55,462 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:40:55,464 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:40:55,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:55,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:55,471 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:40:55,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-24 16:40:55,638 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 25 treesize of output 19 [2018-01-24 16:40:55,642 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:40:55,647 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 19 treesize of output 25 [2018-01-24 16:40:55,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:40:55,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:40:55,669 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:40:55,669 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:58 [2018-01-24 16:40:55,756 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:40:55,756 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:40:55,954 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 34 treesize of output 30 [2018-01-24 16:40:55,970 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:40:55,971 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:40:55,972 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:55,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:55,980 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 36 treesize of output 32 [2018-01-24 16:40:56,026 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:40:56,027 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:40:56,028 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:56,032 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:56,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:40:56,040 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:71, output treesize:27 [2018-01-24 16:40:56,159 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:40:56,179 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:40:56,179 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:40:56,182 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:40:56,182 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:40:56,196 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:40:56,223 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:40:56,263 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:40:56,268 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:40:56,274 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:40:56,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:56,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:56,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-24 16:40:56,311 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:40:56,313 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:40:56,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:56,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:56,326 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:40:56,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-24 16:40:56,340 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 25 treesize of output 19 [2018-01-24 16:40:56,360 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:40:56,365 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 19 treesize of output 25 [2018-01-24 16:40:56,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:40:56,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:40:56,387 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:40:56,388 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:58 [2018-01-24 16:40:56,392 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:40:56,392 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:40:56,569 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 29 treesize of output 25 [2018-01-24 16:40:56,582 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:40:56,583 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:40:56,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:56,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:56,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:56,591 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:19 [2018-01-24 16:40:56,719 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:40:56,720 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:40:56,720 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14, 14, 14] total 49 [2018-01-24 16:40:56,720 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:40:56,721 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-24 16:40:56,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-24 16:40:56,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=2234, Unknown=0, NotChecked=0, Total=2450 [2018-01-24 16:40:56,721 INFO L87 Difference]: Start difference. First operand 139 states and 159 transitions. Second operand 29 states. [2018-01-24 16:40:57,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:40:57,322 INFO L93 Difference]: Finished difference Result 182 states and 209 transitions. [2018-01-24 16:40:57,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 16:40:57,323 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-01-24 16:40:57,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:40:57,324 INFO L225 Difference]: With dead ends: 182 [2018-01-24 16:40:57,324 INFO L226 Difference]: Without dead ends: 181 [2018-01-24 16:40:57,325 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1042 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=441, Invalid=3465, Unknown=0, NotChecked=0, Total=3906 [2018-01-24 16:40:57,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-01-24 16:40:57,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 149. [2018-01-24 16:40:57,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-01-24 16:40:57,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 172 transitions. [2018-01-24 16:40:57,351 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 172 transitions. Word has length 29 [2018-01-24 16:40:57,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:40:57,352 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 172 transitions. [2018-01-24 16:40:57,352 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-24 16:40:57,352 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 172 transitions. [2018-01-24 16:40:57,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 16:40:57,353 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:40:57,353 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] [2018-01-24 16:40:57,353 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:40:57,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1617883298, now seen corresponding path program 2 times [2018-01-24 16:40:57,354 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:40:57,354 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:57,355 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 16:40:57,355 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:57,355 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:40:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:57,366 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:40:57,484 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:40:57,484 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:40:57,484 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:40:57,484 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 16:40:57,484 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:40:57,484 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:40:57,484 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:40:57,491 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:40:57,491 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:40:57,504 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:40:57,506 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:40:57,508 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:40:57,526 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-24 16:40:57,526 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:40:57,530 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-24 16:40:57,550 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 16:40:57,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 11 [2018-01-24 16:40:57,550 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:40:57,550 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:40:57,550 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:40:57,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-01-24 16:40:57,551 INFO L87 Difference]: Start difference. First operand 149 states and 172 transitions. Second operand 4 states. [2018-01-24 16:40:57,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:40:57,579 INFO L93 Difference]: Finished difference Result 150 states and 172 transitions. [2018-01-24 16:40:57,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:40:57,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-01-24 16:40:57,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:40:57,580 INFO L225 Difference]: With dead ends: 150 [2018-01-24 16:40:57,581 INFO L226 Difference]: Without dead ends: 149 [2018-01-24 16:40:57,581 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-01-24 16:40:57,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-01-24 16:40:57,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 141. [2018-01-24 16:40:57,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-01-24 16:40:57,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 161 transitions. [2018-01-24 16:40:57,597 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 161 transitions. Word has length 31 [2018-01-24 16:40:57,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:40:57,597 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 161 transitions. [2018-01-24 16:40:57,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:40:57,597 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 161 transitions. [2018-01-24 16:40:57,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 16:40:57,598 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:40:57,598 INFO L322 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:40:57,598 INFO L371 AbstractCegarLoop]: === Iteration 22 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:40:57,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1342276044, now seen corresponding path program 3 times [2018-01-24 16:40:57,599 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:40:57,599 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:57,600 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 16:40:57,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:40:57,600 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:40:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:40:57,615 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:40:58,017 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:40:58,017 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:40:58,047 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:40:58,048 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 16:40:58,048 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:40:58,048 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:40:58,048 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:40:58,054 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 16:40:58,055 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-24 16:40:58,065 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 16:40:58,069 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 16:40:58,072 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 16:40:58,075 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 16:40:58,079 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 16:40:58,084 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:40:58,086 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:40:58,097 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:40:58,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:58,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:58,102 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-24 16:40:58,161 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:40:58,163 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:40:58,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:40:58,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:40:58,169 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:40:58,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-24 16:40:59,490 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 34 treesize of output 26 [2018-01-24 16:40:59,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 58 [2018-01-24 16:40:59,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 10 xjuncts. [2018-01-24 16:40:59,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:40:59,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:40:59,581 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:60, output treesize:98 [2018-01-24 16:40:59,756 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:40:59,756 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:41:00,345 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 34 [2018-01-24 16:41:00,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2018-01-24 16:41:00,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:00,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:00,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-24 16:41:00,410 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:147 [2018-01-24 16:41:00,741 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:00,761 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:41:00,761 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 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 15 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:41:00,766 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 16:41:00,766 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-24 16:41:00,781 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 16:41:00,806 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 16:41:00,840 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 16:41:00,866 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 16:41:00,915 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 16:41:00,954 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:41:00,959 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:41:00,964 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:41:00,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:00,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:00,973 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-24 16:41:01,020 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:41:01,022 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:41:01,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:01,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:01,029 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:41:01,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-24 16:41:03,197 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 33 treesize of output 25 [2018-01-24 16:41:03,200 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:03,226 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:03,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 39 [2018-01-24 16:41:03,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:41:03,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:41:03,265 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:41:03,266 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:76 [2018-01-24 16:41:03,436 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:03,436 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:41:03,863 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 44 treesize of output 38 [2018-01-24 16:41:03,882 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:41:03,882 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:41:03,882 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:41:03,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-01-24 16:41:03,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:03,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:03,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:03,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:22 [2018-01-24 16:41:04,141 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:04,143 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:41:04,143 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17, 16, 16] total 68 [2018-01-24 16:41:04,143 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:41:04,143 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-24 16:41:04,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-24 16:41:04,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=4308, Unknown=4, NotChecked=0, Total=4692 [2018-01-24 16:41:04,144 INFO L87 Difference]: Start difference. First operand 141 states and 161 transitions. Second operand 30 states. [2018-01-24 16:41:04,784 WARN L146 SmtUtils]: Spent 439ms on a formula simplification. DAG size of input: 55 DAG size of output 29 [2018-01-24 16:41:05,758 WARN L146 SmtUtils]: Spent 604ms on a formula simplification. DAG size of input: 69 DAG size of output 37 [2018-01-24 16:41:07,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:41:07,651 INFO L93 Difference]: Finished difference Result 189 states and 216 transitions. [2018-01-24 16:41:07,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 16:41:07,651 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 32 [2018-01-24 16:41:07,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:41:07,652 INFO L225 Difference]: With dead ends: 189 [2018-01-24 16:41:07,652 INFO L226 Difference]: Without dead ends: 188 [2018-01-24 16:41:07,655 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 72 SyntacticMatches, 5 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1672 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=719, Invalid=6417, Unknown=4, NotChecked=0, Total=7140 [2018-01-24 16:41:07,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-01-24 16:41:07,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 147. [2018-01-24 16:41:07,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-01-24 16:41:07,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 169 transitions. [2018-01-24 16:41:07,671 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 169 transitions. Word has length 32 [2018-01-24 16:41:07,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:41:07,672 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 169 transitions. [2018-01-24 16:41:07,672 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-24 16:41:07,672 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 169 transitions. [2018-01-24 16:41:07,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 16:41:07,672 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:41:07,673 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:41:07,673 INFO L371 AbstractCegarLoop]: === Iteration 23 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:41:07,673 INFO L82 PathProgramCache]: Analyzing trace with hash 785498486, now seen corresponding path program 1 times [2018-01-24 16:41:07,673 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:41:07,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:07,674 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 16:41:07,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:07,674 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:41:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:07,686 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:41:08,072 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:41:08,073 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:41:08,073 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:41:08,073 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-01-24 16:41:08,073 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [13], [15], [21], [23], [24], [27], [29], [34], [43], [48], [54], [60], [65], [66], [67], [68], [69], [70], [73], [84], [85], [86], [88] [2018-01-24 16:41:08,074 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:41:08,074 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:41:08,258 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:41:08,270 INFO L268 AbstractInterpreter]: Visited 28 different actions 50 times. Merged at 10 different actions 20 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 28 variables. [2018-01-24 16:41:08,274 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:41:08,275 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:41:08,275 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:41:08,304 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:41:08,304 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:41:08,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:08,334 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:41:08,339 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:41:08,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:08,347 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:41:08,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:08,353 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:41:08,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-01-24 16:41:08,401 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:08,402 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:08,403 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:41:08,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:08,417 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:08,418 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:41:08,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:08,424 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:41:08,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-01-24 16:41:08,621 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:41:08,621 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:41:08,942 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:41:08,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:08,947 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:41:08,956 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:41:08,957 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:08,960 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 16:41:08,960 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:08,969 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:08,972 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:41:08,973 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-01-24 16:41:09,006 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:41:09,027 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:41:09,027 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 17 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 17 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:41:09,031 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:41:09,031 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:41:09,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:09,078 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:41:09,082 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:41:09,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:09,088 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:41:09,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:09,093 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:41:09,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-01-24 16:41:09,156 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:09,156 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:09,157 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:41:09,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:09,169 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:09,170 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:09,170 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:41:09,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:09,176 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:41:09,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-01-24 16:41:09,285 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:41:09,285 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:41:09,565 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:41:09,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:09,570 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:41:09,578 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 16:41:09,578 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:09,579 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:41:09,579 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:09,582 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:09,585 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:41:09,585 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-01-24 16:41:09,650 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:41:09,651 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:41:09,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15, 13, 14] total 54 [2018-01-24 16:41:09,651 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:41:09,651 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-24 16:41:09,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-24 16:41:09,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2765, Unknown=0, NotChecked=0, Total=2970 [2018-01-24 16:41:09,652 INFO L87 Difference]: Start difference. First operand 147 states and 169 transitions. Second operand 29 states. [2018-01-24 16:41:10,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:41:10,864 INFO L93 Difference]: Finished difference Result 189 states and 218 transitions. [2018-01-24 16:41:10,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-24 16:41:10,864 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 33 [2018-01-24 16:41:10,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:41:10,865 INFO L225 Difference]: With dead ends: 189 [2018-01-24 16:41:10,866 INFO L226 Difference]: Without dead ends: 188 [2018-01-24 16:41:10,867 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 87 SyntacticMatches, 6 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1397 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=576, Invalid=5124, Unknown=0, NotChecked=0, Total=5700 [2018-01-24 16:41:10,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-01-24 16:41:10,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 151. [2018-01-24 16:41:10,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-24 16:41:10,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 175 transitions. [2018-01-24 16:41:10,890 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 175 transitions. Word has length 33 [2018-01-24 16:41:10,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:41:10,890 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 175 transitions. [2018-01-24 16:41:10,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-24 16:41:10,890 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 175 transitions. [2018-01-24 16:41:10,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 16:41:10,891 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:41:10,891 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:41:10,892 INFO L371 AbstractCegarLoop]: === Iteration 24 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:41:10,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1281886369, now seen corresponding path program 2 times [2018-01-24 16:41:10,892 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:41:10,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:10,893 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:41:10,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:10,893 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:41:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:10,906 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:41:11,316 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:11,316 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:41:11,317 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:41:11,317 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 16:41:11,317 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:41:11,317 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:41:11,317 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:41:11,322 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:41:11,322 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:41:11,333 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:41:11,339 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:41:11,342 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:41:11,344 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:41:11,347 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:41:11,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:11,352 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:41:11,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:11,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:11,356 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 16:41:11,375 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:11,376 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:41:11,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:11,384 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:11,385 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:11,385 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:41:11,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:11,390 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:41:11,390 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-24 16:41:11,425 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:41:11,426 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:41:11,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:11,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:11,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:11,432 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:20 [2018-01-24 16:41:11,455 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 27 treesize of output 28 [2018-01-24 16:41:11,456 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:41:11,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:11,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:11,467 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:41:11,467 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:30 [2018-01-24 16:41:11,627 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 33 treesize of output 32 [2018-01-24 16:41:11,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25 [2018-01-24 16:41:11,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:41:11,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:41:11,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-24 16:41:11,677 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:43, output treesize:51 [2018-01-24 16:41:11,749 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 21 treesize of output 17 [2018-01-24 16:41:11,754 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 17 treesize of output 14 [2018-01-24 16:41:11,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:41:11,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:41:11,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:41:11,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:38 [2018-01-24 16:41:11,852 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:11,853 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:41:12,381 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-01-24 16:41:12,393 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 12 treesize of output 11 [2018-01-24 16:41:12,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:12,405 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 18 [2018-01-24 16:41:12,407 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 9 treesize of output 1 [2018-01-24 16:41:12,407 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:12,410 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:12,411 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:41:12,413 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-01-24 16:41:12,413 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:12,415 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:12,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-24 16:41:12,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-24 16:41:12,444 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:68, output treesize:166 [2018-01-24 16:41:12,692 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:12,713 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:41:12,713 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 19 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 19 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:41:12,716 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:41:12,716 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:41:12,733 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:41:12,766 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:41:12,807 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:41:12,812 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:41:12,815 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:41:12,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:12,819 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:41:12,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:12,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:12,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 16:41:12,826 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:12,827 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:12,827 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:41:12,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:12,834 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:41:12,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:12,838 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:41:12,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-24 16:41:12,841 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 15 treesize of output 12 [2018-01-24 16:41:12,842 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 12 treesize of output 11 [2018-01-24 16:41:12,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:12,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:12,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:12,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-24 16:41:12,881 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 26 treesize of output 27 [2018-01-24 16:41:12,883 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:41:12,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:12,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:12,890 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:41:12,890 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-01-24 16:41:13,096 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 33 treesize of output 32 [2018-01-24 16:41:13,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25 [2018-01-24 16:41:13,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:41:13,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:41:13,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-24 16:41:13,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:40, output treesize:45 [2018-01-24 16:41:13,212 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 21 treesize of output 17 [2018-01-24 16:41:13,217 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 17 treesize of output 14 [2018-01-24 16:41:13,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:41:13,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:41:13,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:41:13,225 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-01-24 16:41:13,279 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:13,279 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:41:13,794 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-01-24 16:41:13,807 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 12 treesize of output 11 [2018-01-24 16:41:13,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:13,818 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:41:13,823 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-01-24 16:41:13,823 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:13,827 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:13,829 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 18 [2018-01-24 16:41:13,832 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 9 treesize of output 1 [2018-01-24 16:41:13,832 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:13,836 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:13,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-24 16:41:13,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-24 16:41:13,865 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-01-24 16:41:15,242 WARN L146 SmtUtils]: Spent 1218ms on a formula simplification. DAG size of input: 37 DAG size of output 34 [2018-01-24 16:41:15,606 WARN L143 SmtUtils]: Spent 305ms on a formula simplification that was a NOOP. DAG size: 34 [2018-01-24 16:41:15,614 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:15,616 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:41:15,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 15, 16, 15] total 62 [2018-01-24 16:41:15,616 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:41:15,616 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-24 16:41:15,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-24 16:41:15,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=3654, Unknown=0, NotChecked=0, Total=3906 [2018-01-24 16:41:15,617 INFO L87 Difference]: Start difference. First operand 151 states and 175 transitions. Second operand 30 states. [2018-01-24 16:41:16,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:41:16,477 INFO L93 Difference]: Finished difference Result 174 states and 204 transitions. [2018-01-24 16:41:16,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 16:41:16,477 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 34 [2018-01-24 16:41:16,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:41:16,478 INFO L225 Difference]: With dead ends: 174 [2018-01-24 16:41:16,478 INFO L226 Difference]: Without dead ends: 173 [2018-01-24 16:41:16,479 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 83 SyntacticMatches, 6 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1782 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=445, Invalid=5105, Unknown=0, NotChecked=0, Total=5550 [2018-01-24 16:41:16,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-01-24 16:41:16,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 161. [2018-01-24 16:41:16,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-01-24 16:41:16,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 188 transitions. [2018-01-24 16:41:16,496 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 188 transitions. Word has length 34 [2018-01-24 16:41:16,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:41:16,497 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 188 transitions. [2018-01-24 16:41:16,497 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-24 16:41:16,497 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 188 transitions. [2018-01-24 16:41:16,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 16:41:16,497 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:41:16,497 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:41:16,497 INFO L371 AbstractCegarLoop]: === Iteration 25 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:41:16,497 INFO L82 PathProgramCache]: Analyzing trace with hash 304009148, now seen corresponding path program 1 times [2018-01-24 16:41:16,498 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:41:16,498 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:16,498 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 16:41:16,498 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:16,498 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:41:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:16,507 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:41:16,595 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:41:16,596 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:41:16,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:41:16,596 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:41:16,596 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:41:16,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:41:16,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:41:16,597 INFO L87 Difference]: Start difference. First operand 161 states and 188 transitions. Second operand 6 states. [2018-01-24 16:41:16,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:41:16,742 INFO L93 Difference]: Finished difference Result 161 states and 188 transitions. [2018-01-24 16:41:16,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:41:16,742 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-24 16:41:16,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:41:16,743 INFO L225 Difference]: With dead ends: 161 [2018-01-24 16:41:16,743 INFO L226 Difference]: Without dead ends: 119 [2018-01-24 16:41:16,743 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:41:16,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-24 16:41:16,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 114. [2018-01-24 16:41:16,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-24 16:41:16,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2018-01-24 16:41:16,760 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 35 [2018-01-24 16:41:16,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:41:16,760 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2018-01-24 16:41:16,760 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:41:16,760 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2018-01-24 16:41:16,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 16:41:16,761 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:41:16,761 INFO L322 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:41:16,761 INFO L371 AbstractCegarLoop]: === Iteration 26 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:41:16,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1600146015, now seen corresponding path program 4 times [2018-01-24 16:41:16,762 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:41:16,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:16,763 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:41:16,763 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:16,763 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:41:16,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:16,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:41:17,381 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:17,381 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:41:17,381 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:41:17,381 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 16:41:17,381 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:41:17,382 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:41:17,382 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:41:17,387 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-24 16:41:17,387 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-24 16:41:17,403 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:41:17,405 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:41:17,408 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:41:17,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:17,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:17,413 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-24 16:41:17,459 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:41:17,460 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:41:17,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:17,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:17,468 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:41:17,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-24 16:41:19,146 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 48 treesize of output 38 [2018-01-24 16:41:19,148 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:19,149 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:19,150 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:19,150 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:19,152 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:19,152 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:19,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 93 [2018-01-24 16:41:19,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:41:19,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:41:19,211 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:41:19,211 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:73 [2018-01-24 16:41:19,330 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:19,330 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:41:19,810 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 59 treesize of output 51 [2018-01-24 16:41:19,850 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:41:19,850 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:41:19,850 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:41:19,851 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:41:19,851 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:41:19,851 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:41:19,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 49 [2018-01-24 16:41:19,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:19,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:19,880 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:41:19,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:86 [2018-01-24 16:41:20,128 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:20,149 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:41:20,149 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 21 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 21 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:41:20,155 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-24 16:41:20,155 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-24 16:41:20,245 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:41:20,252 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:41:20,306 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:41:20,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:20,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:20,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-01-24 16:41:20,404 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:41:20,406 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:41:20,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:20,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:20,414 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:41:20,414 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-01-24 16:41:22,641 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 48 treesize of output 38 [2018-01-24 16:41:22,643 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:22,643 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:22,644 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:22,644 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:22,645 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:22,646 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:22,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 93 [2018-01-24 16:41:22,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:41:22,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:41:22,703 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:41:22,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:73 [2018-01-24 16:41:22,709 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:22,709 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:41:22,974 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 59 treesize of output 51 [2018-01-24 16:41:23,008 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:41:23,008 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:41:23,009 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:41:23,009 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:41:23,009 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:41:23,010 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:41:23,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 49 [2018-01-24 16:41:23,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:23,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:23,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:23,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:31 [2018-01-24 16:41:23,195 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:23,196 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:41:23,196 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18, 17, 17] total 63 [2018-01-24 16:41:23,196 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:41:23,197 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-24 16:41:23,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-24 16:41:23,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=3695, Unknown=5, NotChecked=0, Total=4032 [2018-01-24 16:41:23,198 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand 34 states. [2018-01-24 16:41:27,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:41:27,522 INFO L93 Difference]: Finished difference Result 153 states and 169 transitions. [2018-01-24 16:41:27,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-24 16:41:27,522 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 35 [2018-01-24 16:41:27,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:41:27,523 INFO L225 Difference]: With dead ends: 153 [2018-01-24 16:41:27,523 INFO L226 Difference]: Without dead ends: 152 [2018-01-24 16:41:27,524 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 91 SyntacticMatches, 5 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1697 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=675, Invalid=5961, Unknown=6, NotChecked=0, Total=6642 [2018-01-24 16:41:27,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-24 16:41:27,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 126. [2018-01-24 16:41:27,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-24 16:41:27,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2018-01-24 16:41:27,548 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 35 [2018-01-24 16:41:27,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:41:27,549 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2018-01-24 16:41:27,549 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-24 16:41:27,549 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2018-01-24 16:41:27,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 16:41:27,549 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:41:27,549 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:41:27,549 INFO L371 AbstractCegarLoop]: === Iteration 27 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:41:27,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1381463977, now seen corresponding path program 2 times [2018-01-24 16:41:27,550 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:41:27,550 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:27,550 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 16:41:27,550 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:27,550 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:41:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:27,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:41:27,903 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:27,903 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:41:27,903 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:41:27,903 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 16:41:27,903 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:41:27,903 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:41:27,903 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:41:27,911 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:41:27,911 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:41:27,922 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:41:27,928 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:41:27,931 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:41:27,933 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:41:27,936 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:41:27,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:27,942 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:41:27,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:27,947 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:41:27,947 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-01-24 16:41:27,989 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:27,990 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:27,990 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:41:27,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:28,000 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:28,001 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:28,001 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:41:28,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:28,007 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:41:28,007 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-01-24 16:41:28,051 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:41:28,052 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:41:28,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:28,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:28,059 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:41:28,059 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-01-24 16:41:28,130 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 17 treesize of output 13 [2018-01-24 16:41:28,135 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 13 treesize of output 14 [2018-01-24 16:41:28,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:41:28,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:41:28,146 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:41:28,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:55 [2018-01-24 16:41:28,336 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:28,337 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:41:28,643 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 26 treesize of output 24 [2018-01-24 16:41:28,656 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:41:28,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:28,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:28,662 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 24 treesize of output 22 [2018-01-24 16:41:28,673 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:41:28,674 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:28,677 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:28,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:41:28,686 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:51, output treesize:31 [2018-01-24 16:41:28,883 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:41:28,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:28,888 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:41:28,896 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:41:28,896 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:28,897 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 16:41:28,898 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:28,900 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:28,904 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:41:28,904 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:27, output treesize:10 [2018-01-24 16:41:28,939 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:28,959 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:41:28,959 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 23 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 23 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:41:28,962 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:41:28,962 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:41:28,980 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:41:29,009 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:41:29,052 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:41:29,057 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:41:29,088 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:41:29,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:29,094 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:41:29,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:29,099 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:41:29,099 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-01-24 16:41:29,172 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:29,173 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 14 treesize of output 17 [2018-01-24 16:41:29,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:29,181 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:29,182 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:29,182 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:41:29,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:29,187 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:41:29,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2018-01-24 16:41:29,264 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 14 treesize of output 11 [2018-01-24 16:41:29,266 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:41:29,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:29,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:29,274 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:41:29,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-01-24 16:41:29,415 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 18 treesize of output 14 [2018-01-24 16:41:29,420 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 14 treesize of output 15 [2018-01-24 16:41:29,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:41:29,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:41:29,432 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:41:29,433 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:66 [2018-01-24 16:41:29,603 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:29,603 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:41:29,917 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:41:29,924 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:41:29,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:29,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:29,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:29,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:29 [2018-01-24 16:41:30,179 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:41:30,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:30,185 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:41:30,197 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 16:41:30,197 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:30,198 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:41:30,199 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:30,201 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:30,206 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:41:30,206 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:13 [2018-01-24 16:41:30,255 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:30,257 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:41:30,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17, 15, 16] total 70 [2018-01-24 16:41:30,257 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:41:30,257 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-24 16:41:30,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-24 16:41:30,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=4702, Unknown=0, NotChecked=0, Total=4970 [2018-01-24 16:41:30,258 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand 33 states. [2018-01-24 16:41:32,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:41:32,311 INFO L93 Difference]: Finished difference Result 161 states and 174 transitions. [2018-01-24 16:41:32,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-24 16:41:32,311 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 36 [2018-01-24 16:41:32,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:41:32,312 INFO L225 Difference]: With dead ends: 161 [2018-01-24 16:41:32,312 INFO L226 Difference]: Without dead ends: 160 [2018-01-24 16:41:32,313 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 89 SyntacticMatches, 4 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2387 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=791, Invalid=8911, Unknown=0, NotChecked=0, Total=9702 [2018-01-24 16:41:32,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-01-24 16:41:32,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 126. [2018-01-24 16:41:32,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-24 16:41:32,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2018-01-24 16:41:32,329 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 36 [2018-01-24 16:41:32,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:41:32,329 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2018-01-24 16:41:32,329 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-24 16:41:32,329 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2018-01-24 16:41:32,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-24 16:41:32,329 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:41:32,329 INFO L322 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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:41:32,330 INFO L371 AbstractCegarLoop]: === Iteration 28 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:41:32,330 INFO L82 PathProgramCache]: Analyzing trace with hash 269048756, now seen corresponding path program 3 times [2018-01-24 16:41:32,330 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:41:32,330 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:32,330 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 16:41:32,330 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:32,331 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:41:32,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:32,340 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:41:32,725 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 16:41:32,726 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:41:32,726 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:41:32,726 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 16:41:32,726 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:41:32,726 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:41:32,726 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:41:32,731 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 16:41:32,731 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-24 16:41:32,743 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 16:41:32,748 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 16:41:32,753 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 16:41:32,758 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 16:41:32,760 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:41:32,762 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:41:32,765 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:41:32,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:32,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:41:32,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:32,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:32,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 16:41:32,811 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:32,812 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:41:32,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:32,819 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:32,820 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:32,820 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:41:32,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:32,824 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:41:32,824 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-24 16:41:32,858 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:41:32,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:41:32,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:32,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:32,865 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:41:32,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-24 16:41:32,899 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 27 treesize of output 28 [2018-01-24 16:41:32,901 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:41:32,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:32,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:32,912 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:41:32,912 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:33 [2018-01-24 16:41:33,044 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 34 treesize of output 33 [2018-01-24 16:41:33,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25 [2018-01-24 16:41:33,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:41:33,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:41:33,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-24 16:41:33,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:44, output treesize:57 [2018-01-24 16:41:33,121 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 23 treesize of output 24 [2018-01-24 16:41:33,122 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 8 treesize of output 7 [2018-01-24 16:41:33,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:33,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:33,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:33,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2018-01-24 16:41:33,162 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 21 treesize of output 17 [2018-01-24 16:41:33,168 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 17 treesize of output 14 [2018-01-24 16:41:33,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:41:33,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:41:33,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:41:33,176 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-01-24 16:41:33,220 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:33,220 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:41:33,684 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-01-24 16:41:33,697 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 12 treesize of output 11 [2018-01-24 16:41:33,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:33,710 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 22 treesize of output 20 [2018-01-24 16:41:33,711 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 9 treesize of output 1 [2018-01-24 16:41:33,712 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:33,714 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:33,716 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 21 treesize of output 17 [2018-01-24 16:41:33,717 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2018-01-24 16:41:33,718 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:33,719 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:33,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. Received shutdown request... [2018-01-24 16:41:33,736 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 16:41:33,736 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 16:41:33,739 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 16:41:33,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 04:41:33 BoogieIcfgContainer [2018-01-24 16:41:33,740 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 16:41:33,740 INFO L168 Benchmark]: Toolchain (without parser) took 52402.82 ms. Allocated memory was 308.3 MB in the beginning and 701.0 MB in the end (delta: 392.7 MB). Free memory was 268.2 MB in the beginning and 530.1 MB in the end (delta: -261.9 MB). Peak memory consumption was 130.8 MB. Max. memory is 5.3 GB. [2018-01-24 16:41:33,741 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 308.3 MB. Free memory is still 274.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:41:33,741 INFO L168 Benchmark]: CACSL2BoogieTranslator took 194.22 ms. Allocated memory is still 308.3 MB. Free memory was 267.2 MB in the beginning and 257.1 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-24 16:41:33,741 INFO L168 Benchmark]: Boogie Preprocessor took 29.59 ms. Allocated memory is still 308.3 MB. Free memory was 257.1 MB in the beginning and 255.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:41:33,741 INFO L168 Benchmark]: RCFGBuilder took 264.09 ms. Allocated memory is still 308.3 MB. Free memory was 255.1 MB in the beginning and 237.0 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:41:33,742 INFO L168 Benchmark]: TraceAbstraction took 51907.14 ms. Allocated memory was 308.3 MB in the beginning and 701.0 MB in the end (delta: 392.7 MB). Free memory was 236.0 MB in the beginning and 530.1 MB in the end (delta: -294.1 MB). Peak memory consumption was 98.6 MB. Max. memory is 5.3 GB. [2018-01-24 16:41:33,743 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.18 ms. Allocated memory is still 308.3 MB. Free memory is still 274.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 194.22 ms. Allocated memory is still 308.3 MB. Free memory was 267.2 MB in the beginning and 257.1 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.59 ms. Allocated memory is still 308.3 MB. Free memory was 257.1 MB in the beginning and 255.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 264.09 ms. Allocated memory is still 308.3 MB. Free memory was 255.1 MB in the beginning and 237.0 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 51907.14 ms. Allocated memory was 308.3 MB in the beginning and 701.0 MB in the end (delta: 392.7 MB). Free memory was 236.0 MB in the beginning and 530.1 MB in the end (delta: -294.1 MB). Peak memory consumption was 98.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 223 LocStat_NO_SUPPORTING_DISEQUALITIES : 42 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 57 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 29 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.914890 RENAME_VARIABLES(MILLISECONDS) : 0.523278 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.856704 PROJECTAWAY(MILLISECONDS) : 0.783396 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001730 DISJOIN(MILLISECONDS) : 0.586161 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.572494 ADD_EQUALITY(MILLISECONDS) : 0.039637 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.025721 #CONJOIN_DISJUNCTIVE : 49 #RENAME_VARIABLES : 72 #UNFREEZE : 0 #CONJOIN : 95 #PROJECTAWAY : 66 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 6 #RENAME_VARIABLES_DISJUNCTIVE : 69 #ADD_EQUALITY : 59 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 231 LocStat_NO_SUPPORTING_DISEQUALITIES : 42 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 57 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 29 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.561632 RENAME_VARIABLES(MILLISECONDS) : 0.274891 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.526763 PROJECTAWAY(MILLISECONDS) : 0.460999 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000733 DISJOIN(MILLISECONDS) : 0.284681 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.302534 ADD_EQUALITY(MILLISECONDS) : 0.028493 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012066 #CONJOIN_DISJUNCTIVE : 48 #RENAME_VARIABLES : 72 #UNFREEZE : 0 #CONJOIN : 94 #PROJECTAWAY : 66 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 6 #RENAME_VARIABLES_DISJUNCTIVE : 69 #ADD_EQUALITY : 59 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 226 LocStat_NO_SUPPORTING_DISEQUALITIES : 33 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 57 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 29 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.603086 RENAME_VARIABLES(MILLISECONDS) : 0.350885 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.556326 PROJECTAWAY(MILLISECONDS) : 0.474199 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001084 DISJOIN(MILLISECONDS) : 0.371963 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.382729 ADD_EQUALITY(MILLISECONDS) : 0.019469 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.016935 #CONJOIN_DISJUNCTIVE : 47 #RENAME_VARIABLES : 72 #UNFREEZE : 0 #CONJOIN : 93 #PROJECTAWAY : 66 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 6 #RENAME_VARIABLES_DISJUNCTIVE : 69 #ADD_EQUALITY : 59 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 25 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 294 LocStat_NO_SUPPORTING_DISEQUALITIES : 45 LocStat_NO_DISJUNCTIONS : -50 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 32 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 68 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.764241 RENAME_VARIABLES(MILLISECONDS) : 0.177612 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.334574 PROJECTAWAY(MILLISECONDS) : 0.027668 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000851 DISJOIN(MILLISECONDS) : 0.201873 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.198738 ADD_EQUALITY(MILLISECONDS) : 0.014992 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012444 #CONJOIN_DISJUNCTIVE : 61 #RENAME_VARIABLES : 96 #UNFREEZE : 0 #CONJOIN : 115 #PROJECTAWAY : 82 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 10 #RENAME_VARIABLES_DISJUNCTIVE : 93 #ADD_EQUALITY : 70 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 26 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 299 LocStat_NO_SUPPORTING_DISEQUALITIES : 48 LocStat_NO_DISJUNCTIONS : -52 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 33 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 68 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 34 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.562841 RENAME_VARIABLES(MILLISECONDS) : 0.266967 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.529851 PROJECTAWAY(MILLISECONDS) : 0.171424 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001486 DISJOIN(MILLISECONDS) : 0.545664 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.296150 ADD_EQUALITY(MILLISECONDS) : 0.026313 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012888 #CONJOIN_DISJUNCTIVE : 69 #RENAME_VARIABLES : 112 #UNFREEZE : 0 #CONJOIN : 127 #PROJECTAWAY : 92 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 10 #RENAME_VARIABLES_DISJUNCTIVE : 107 #ADD_EQUALITY : 71 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 26 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 312 LocStat_NO_SUPPORTING_DISEQUALITIES : 48 LocStat_NO_DISJUNCTIONS : -52 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 34 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 70 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 35 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.543177 RENAME_VARIABLES(MILLISECONDS) : 0.393964 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.491651 PROJECTAWAY(MILLISECONDS) : 0.676481 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001347 DISJOIN(MILLISECONDS) : 0.306788 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.425609 ADD_EQUALITY(MILLISECONDS) : 0.016887 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.017489 #CONJOIN_DISJUNCTIVE : 87 #RENAME_VARIABLES : 149 #UNFREEZE : 0 #CONJOIN : 147 #PROJECTAWAY : 112 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 13 #RENAME_VARIABLES_DISJUNCTIVE : 143 #ADD_EQUALITY : 73 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 49 locations, 11 error locations. TIMEOUT Result, 51.8s OverallTime, 28 OverallIterations, 6 TraceHistogramMax, 16.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 948 SDtfs, 1868 SDslu, 6486 SDs, 0 SdLazy, 6354 SolverSat, 529 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1771 GetRequests, 919 SyntacticMatches, 51 SemanticMatches, 801 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12209 ImplicationChecksByTransitivity, 36.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.9s AbstIntTime, 6 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 27 MinimizatonAttempts, 330 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 30.0s InterpolantComputationTime, 1340 NumberOfCodeBlocks, 1332 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 1933 ConstructedInterpolants, 174 QuantifiedInterpolants, 705935 SizeOfPredicates, 365 NumberOfNonLiveVariables, 3267 ConjunctsInSsa, 989 ConjunctsInUnsatCore, 71 InterpolantComputations, 19 PerfectInterpolantSequences, 35/678 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/cstrcat-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-41-33-757.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcat-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-41-33-757.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcat-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-41-33-757.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcat-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-41-33-757.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcat-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-41-33-757.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcat-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-41-33-757.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcat-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-41-33-757.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-24_16-41-33-757.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-24_16-41-33-757.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-4-2018-01-24_16-41-33-757.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-4-2018-01-24_16-41-33-757.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-5-2018-01-24_16-41-33-757.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-5-2018-01-24_16-41-33-757.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcat-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-41-33-757.csv Completed graceful shutdown