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_preciseopt.epf -i ../../../trunk/examples/svcomp/array-memsafety/subseq-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 02:48:41,121 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 02:48:41,122 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 02:48:41,136 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 02:48:41,136 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 02:48:41,137 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 02:48:41,138 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 02:48:41,140 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 02:48:41,142 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 02:48:41,143 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 02:48:41,144 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 02:48:41,144 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 02:48:41,145 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 02:48:41,146 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 02:48:41,146 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 02:48:41,149 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 02:48:41,151 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 02:48:41,153 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 02:48:41,154 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 02:48:41,156 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 02:48:41,158 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 02:48:41,158 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 02:48:41,159 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 02:48:41,160 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 02:48:41,161 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 02:48:41,162 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 02:48:41,162 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 02:48:41,163 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 02:48:41,163 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 02:48:41,163 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 02:48:41,164 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 02:48:41,164 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_preciseopt.epf [2018-01-25 02:48:41,174 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 02:48:41,175 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 02:48:41,175 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 02:48:41,176 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 02:48:41,176 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 02:48:41,176 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 02:48:41,176 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 02:48:41,176 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 02:48:41,177 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 02:48:41,177 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 02:48:41,177 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 02:48:41,178 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 02:48:41,178 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 02:48:41,178 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 02:48:41,178 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 02:48:41,178 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 02:48:41,179 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 02:48:41,179 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 02:48:41,179 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 02:48:41,179 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 02:48:41,179 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 02:48:41,180 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 02:48:41,180 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 02:48:41,180 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 02:48:41,180 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 02:48:41,180 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:48:41,181 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 02:48:41,181 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 02:48:41,181 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 02:48:41,181 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 02:48:41,181 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 02:48:41,182 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 02:48:41,182 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 02:48:41,182 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 02:48:41,182 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 02:48:41,183 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 02:48:41,183 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 02:48:41,218 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 02:48:41,232 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 02:48:41,236 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 02:48:41,238 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 02:48:41,239 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 02:48:41,240 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/subseq-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:48:41,425 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 02:48:41,432 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 02:48:41,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 02:48:41,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 02:48:41,441 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 02:48:41,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:48:41" (1/1) ... [2018-01-25 02:48:41,445 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b93d6c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:48:41, skipping insertion in model container [2018-01-25 02:48:41,446 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:48:41" (1/1) ... [2018-01-25 02:48:41,465 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:48:41,508 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:48:41,633 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:48:41,657 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:48:41,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:48:41 WrapperNode [2018-01-25 02:48:41,665 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 02:48:41,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 02:48:41,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 02:48:41,667 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 02:48:41,678 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:48:41" (1/1) ... [2018-01-25 02:48:41,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:48:41" (1/1) ... [2018-01-25 02:48:41,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:48:41" (1/1) ... [2018-01-25 02:48:41,687 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:48:41" (1/1) ... [2018-01-25 02:48:41,691 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:48:41" (1/1) ... [2018-01-25 02:48:41,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:48:41" (1/1) ... [2018-01-25 02:48:41,695 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:48:41" (1/1) ... [2018-01-25 02:48:41,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 02:48:41,697 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 02:48:41,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 02:48:41,697 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 02:48:41,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:48: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-25 02:48:41,755 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 02:48:41,755 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 02:48:41,755 INFO L136 BoogieDeclarations]: Found implementation of procedure subseq [2018-01-25 02:48:41,755 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 02:48:41,755 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 02:48:41,755 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 02:48:41,755 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 02:48:41,755 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 02:48:41,756 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 02:48:41,756 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 02:48:41,756 INFO L128 BoogieDeclarations]: Found specification of procedure subseq [2018-01-25 02:48:41,756 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 02:48:41,756 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 02:48:41,756 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 02:48:41,986 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 02:48:41,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:48:41 BoogieIcfgContainer [2018-01-25 02:48:41,987 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 02:48:41,988 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 02:48:41,988 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 02:48:41,990 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 02:48:41,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 02:48:41" (1/3) ... [2018-01-25 02:48:41,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29234dc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:48:41, skipping insertion in model container [2018-01-25 02:48:41,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:48:41" (2/3) ... [2018-01-25 02:48:41,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29234dc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:48:41, skipping insertion in model container [2018-01-25 02:48:41,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:48:41" (3/3) ... [2018-01-25 02:48:41,993 INFO L105 eAbstractionObserver]: Analyzing ICFG subseq-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:48:42,000 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 02:48:42,007 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-25 02:48:42,045 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 02:48:42,045 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 02:48:42,045 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 02:48:42,045 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 02:48:42,045 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 02:48:42,045 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 02:48:42,045 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 02:48:42,046 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 02:48:42,046 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 02:48:42,070 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-01-25 02:48:42,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 02:48:42,077 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:48:42,079 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:48:42,079 INFO L371 AbstractCegarLoop]: === Iteration 1 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:48:42,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1068442526, now seen corresponding path program 1 times [2018-01-25 02:48:42,087 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:48:42,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:48:42,133 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:48:42,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:48:42,133 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:48:42,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:48:42,193 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:48:42,304 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-25 02:48:42,307 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:48:42,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:48:42,307 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:48:42,310 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:48:42,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:48:42,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:48:42,330 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 4 states. [2018-01-25 02:48:42,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:48:42,511 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-01-25 02:48:42,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:48:42,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 02:48:42,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:48:42,525 INFO L225 Difference]: With dead ends: 71 [2018-01-25 02:48:42,525 INFO L226 Difference]: Without dead ends: 51 [2018-01-25 02:48:42,529 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:48:42,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-25 02:48:42,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-25 02:48:42,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-25 02:48:42,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-01-25 02:48:42,573 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 13 [2018-01-25 02:48:42,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:48:42,573 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-01-25 02:48:42,573 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:48:42,574 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-01-25 02:48:42,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 02:48:42,574 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:48:42,575 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:48:42,575 INFO L371 AbstractCegarLoop]: === Iteration 2 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:48:42,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1068442527, now seen corresponding path program 1 times [2018-01-25 02:48:42,575 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:48:42,576 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:48:42,577 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:48:42,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:48:42,577 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:48:42,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:48:42,596 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:48:42,729 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-25 02:48:42,729 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:48:42,729 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:48:42,729 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:48:42,730 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:48:42,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:48:42,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:48:42,731 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 6 states. [2018-01-25 02:48:42,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:48:42,857 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-01-25 02:48:42,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:48:42,858 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-25 02:48:42,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:48:42,859 INFO L225 Difference]: With dead ends: 51 [2018-01-25 02:48:42,859 INFO L226 Difference]: Without dead ends: 50 [2018-01-25 02:48:42,860 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:48:42,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-25 02:48:42,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-25 02:48:42,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 02:48:42,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-25 02:48:42,868 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 13 [2018-01-25 02:48:42,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:48:42,868 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-25 02:48:42,868 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:48:42,868 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-25 02:48:42,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 02:48:42,868 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:48:42,869 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:48:42,869 INFO L371 AbstractCegarLoop]: === Iteration 3 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:48:42,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1238020018, now seen corresponding path program 1 times [2018-01-25 02:48:42,869 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:48:42,870 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:48:42,870 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:48:42,870 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:48:42,871 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:48:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:48:42,886 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:48:42,920 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-25 02:48:42,920 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:48:42,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:48:42,921 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:48:42,921 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:48:42,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:48:42,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:48:42,922 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 4 states. [2018-01-25 02:48:43,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:48:43,005 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-01-25 02:48:43,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:48:43,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 02:48:43,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:48:43,007 INFO L225 Difference]: With dead ends: 50 [2018-01-25 02:48:43,007 INFO L226 Difference]: Without dead ends: 49 [2018-01-25 02:48:43,007 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-25 02:48:43,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-25 02:48:43,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-25 02:48:43,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 02:48:43,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-01-25 02:48:43,014 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 14 [2018-01-25 02:48:43,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:48:43,015 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-01-25 02:48:43,015 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:48:43,015 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-01-25 02:48:43,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 02:48:43,015 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:48:43,016 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:48:43,016 INFO L371 AbstractCegarLoop]: === Iteration 4 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:48:43,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1238020017, now seen corresponding path program 1 times [2018-01-25 02:48:43,016 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:48:43,017 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:48:43,017 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:48:43,018 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:48:43,018 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:48:43,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:48:43,032 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:48:43,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:48:43,106 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:48:43,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:48:43,106 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:48:43,107 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:48:43,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:48:43,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:48:43,107 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 5 states. [2018-01-25 02:48:43,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:48:43,227 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-01-25 02:48:43,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:48:43,227 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 02:48:43,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:48:43,228 INFO L225 Difference]: With dead ends: 49 [2018-01-25 02:48:43,228 INFO L226 Difference]: Without dead ends: 48 [2018-01-25 02:48:43,229 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:48:43,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-25 02:48:43,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-25 02:48:43,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-25 02:48:43,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-01-25 02:48:43,236 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 14 [2018-01-25 02:48:43,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:48:43,236 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-01-25 02:48:43,236 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:48:43,237 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-01-25 02:48:43,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 02:48:43,237 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:48:43,237 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:48:43,238 INFO L371 AbstractCegarLoop]: === Iteration 5 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:48:43,238 INFO L82 PathProgramCache]: Analyzing trace with hash -9248999, now seen corresponding path program 1 times [2018-01-25 02:48:43,238 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:48:43,239 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:48:43,239 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:48:43,239 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:48:43,240 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:48:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:48:43,265 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:48:43,323 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-25 02:48:43,324 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:48:43,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:48:43,324 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:48:43,324 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:48:43,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:48:43,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:48:43,325 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 5 states. [2018-01-25 02:48:43,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:48:43,383 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-01-25 02:48:43,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:48:43,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-25 02:48:43,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:48:43,384 INFO L225 Difference]: With dead ends: 48 [2018-01-25 02:48:43,384 INFO L226 Difference]: Without dead ends: 46 [2018-01-25 02:48:43,385 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-25 02:48:43,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-25 02:48:43,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-25 02:48:43,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-25 02:48:43,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-01-25 02:48:43,391 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 18 [2018-01-25 02:48:43,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:48:43,392 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-01-25 02:48:43,392 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:48:43,392 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-01-25 02:48:43,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 02:48:43,393 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:48:43,393 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:48:43,393 INFO L371 AbstractCegarLoop]: === Iteration 6 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:48:43,394 INFO L82 PathProgramCache]: Analyzing trace with hash -9248998, now seen corresponding path program 1 times [2018-01-25 02:48:43,394 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:48:43,395 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:48:43,395 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:48:43,396 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:48:43,396 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:48:43,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:48:43,412 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:48:43,549 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-25 02:48:43,550 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:48:43,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 02:48:43,550 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:48:43,550 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 02:48:43,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 02:48:43,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:48:43,551 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 8 states. [2018-01-25 02:48:43,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:48:43,765 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2018-01-25 02:48:43,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 02:48:43,766 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-25 02:48:43,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:48:43,769 INFO L225 Difference]: With dead ends: 69 [2018-01-25 02:48:43,769 INFO L226 Difference]: Without dead ends: 67 [2018-01-25 02:48:43,769 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-25 02:48:43,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-25 02:48:43,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 57. [2018-01-25 02:48:43,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-25 02:48:43,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2018-01-25 02:48:43,775 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 18 [2018-01-25 02:48:43,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:48:43,775 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2018-01-25 02:48:43,775 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 02:48:43,775 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2018-01-25 02:48:43,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 02:48:43,776 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:48:43,776 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:48:43,776 INFO L371 AbstractCegarLoop]: === Iteration 7 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:48:43,776 INFO L82 PathProgramCache]: Analyzing trace with hash -659041035, now seen corresponding path program 1 times [2018-01-25 02:48:43,776 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:48:43,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:48:43,777 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:48:43,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:48:43,777 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:48:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:48:43,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:48:43,869 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-25 02:48:43,870 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:48:43,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:48:43,870 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:48:43,870 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:48:43,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:48:43,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:48:43,871 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 5 states. [2018-01-25 02:48:43,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:48:43,995 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-01-25 02:48:43,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:48:43,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-01-25 02:48:43,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:48:43,996 INFO L225 Difference]: With dead ends: 57 [2018-01-25 02:48:43,996 INFO L226 Difference]: Without dead ends: 54 [2018-01-25 02:48:43,996 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-25 02:48:43,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-25 02:48:44,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-25 02:48:44,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 02:48:44,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-01-25 02:48:44,002 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 21 [2018-01-25 02:48:44,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:48:44,002 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-01-25 02:48:44,002 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:48:44,002 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-01-25 02:48:44,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 02:48:44,003 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:48:44,003 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:48:44,003 INFO L371 AbstractCegarLoop]: === Iteration 8 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:48:44,003 INFO L82 PathProgramCache]: Analyzing trace with hash -659041034, now seen corresponding path program 1 times [2018-01-25 02:48:44,003 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:48:44,004 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:48:44,004 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:48:44,004 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:48:44,004 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:48:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:48:44,017 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:48:44,158 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-25 02:48:44,158 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:48:44,158 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 02:48:44,158 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:48:44,159 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 02:48:44,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 02:48:44,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:48:44,159 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 8 states. [2018-01-25 02:48:44,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:48:44,305 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2018-01-25 02:48:44,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 02:48:44,306 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-01-25 02:48:44,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:48:44,307 INFO L225 Difference]: With dead ends: 73 [2018-01-25 02:48:44,307 INFO L226 Difference]: Without dead ends: 70 [2018-01-25 02:48:44,307 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-25 02:48:44,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-25 02:48:44,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2018-01-25 02:48:44,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-25 02:48:44,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2018-01-25 02:48:44,315 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 21 [2018-01-25 02:48:44,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:48:44,315 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2018-01-25 02:48:44,316 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 02:48:44,316 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2018-01-25 02:48:44,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 02:48:44,317 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:48:44,317 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:48:44,317 INFO L371 AbstractCegarLoop]: === Iteration 9 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:48:44,317 INFO L82 PathProgramCache]: Analyzing trace with hash 753859844, now seen corresponding path program 1 times [2018-01-25 02:48:44,317 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:48:44,318 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:48:44,318 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:48:44,318 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:48:44,319 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:48:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:48:44,334 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:48:44,357 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-25 02:48:44,357 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:48:44,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:48:44,357 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:48:44,358 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 02:48:44,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 02:48:44,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 02:48:44,358 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 3 states. [2018-01-25 02:48:44,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:48:44,371 INFO L93 Difference]: Finished difference Result 107 states and 130 transitions. [2018-01-25 02:48:44,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 02:48:44,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-01-25 02:48:44,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:48:44,374 INFO L225 Difference]: With dead ends: 107 [2018-01-25 02:48:44,374 INFO L226 Difference]: Without dead ends: 67 [2018-01-25 02:48:44,375 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-25 02:48:44,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-25 02:48:44,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-01-25 02:48:44,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-25 02:48:44,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2018-01-25 02:48:44,383 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 27 [2018-01-25 02:48:44,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:48:44,383 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2018-01-25 02:48:44,383 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 02:48:44,383 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2018-01-25 02:48:44,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 02:48:44,384 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:48:44,385 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:48:44,385 INFO L371 AbstractCegarLoop]: === Iteration 10 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:48:44,385 INFO L82 PathProgramCache]: Analyzing trace with hash 199156551, now seen corresponding path program 1 times [2018-01-25 02:48:44,385 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:48:44,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:48:44,386 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:48:44,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:48:44,387 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:48:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:48:44,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:48:45,017 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-25 02:48:45,018 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:48:45,018 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-01-25 02:48:45,018 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:48:45,018 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 02:48:45,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 02:48:45,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-01-25 02:48:45,019 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand 15 states. [2018-01-25 02:48:45,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:48:45,451 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2018-01-25 02:48:45,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-25 02:48:45,452 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-01-25 02:48:45,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:48:45,453 INFO L225 Difference]: With dead ends: 140 [2018-01-25 02:48:45,454 INFO L226 Difference]: Without dead ends: 112 [2018-01-25 02:48:45,455 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2018-01-25 02:48:45,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-25 02:48:45,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2018-01-25 02:48:45,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-25 02:48:45,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2018-01-25 02:48:45,467 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 123 transitions. Word has length 29 [2018-01-25 02:48:45,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:48:45,468 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 123 transitions. [2018-01-25 02:48:45,472 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 02:48:45,472 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 123 transitions. [2018-01-25 02:48:45,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 02:48:45,474 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:48:45,474 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:48:45,474 INFO L371 AbstractCegarLoop]: === Iteration 11 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:48:45,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1606281783, now seen corresponding path program 1 times [2018-01-25 02:48:45,474 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:48:45,475 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:48:45,475 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:48:45,475 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:48:45,475 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:48:45,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:48:45,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:48:45,737 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-25 02:48:45,737 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:48:45,737 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:48:45,738 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-25 02:48:45,740 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [10], [11], [14], [15], [18], [26], [27], [30], [35], [39], [54], [59], [65], [67], [68], [69], [70], [71], [74], [85], [86], [87], [89] [2018-01-25 02:48:45,786 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:48:45,786 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 02:49:21,308 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 02:49:21,310 INFO L268 AbstractInterpreter]: Visited 28 different actions 56 times. Merged at 12 different actions 27 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 31 variables. [2018-01-25 02:49:21,372 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 02:49:21,372 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:49:21,372 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-25 02:49:21,383 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:49:21,383 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:49:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:49:21,427 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:49:21,513 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-25 02:49:21,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:49:21,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:49:21,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 02:49:21,598 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:49:21,599 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:49:21,600 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-25 02:49:21,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:49:21,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:49:21,613 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-25 02:49:21,686 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-25 02:49:21,690 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-25 02:49:21,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:49:21,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:49:21,703 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-25 02:49:21,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-25 02:49:21,782 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-25 02:49:21,785 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-25 02:49:21,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:49:21,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:49:21,806 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-25 02:49:21,806 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-25 02:49:23,210 WARN L143 SmtUtils]: Spent 720ms on a formula simplification that was a NOOP. DAG size: 43 [2018-01-25 02:49:23,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 53 [2018-01-25 02:49:23,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 47 [2018-01-25 02:49:23,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-01-25 02:49:23,570 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 31 treesize of output 23 [2018-01-25 02:49:23,570 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 02:49:23,572 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 35 treesize of output 27 [2018-01-25 02:49:23,573 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 02:49:23,575 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 34 treesize of output 26 [2018-01-25 02:49:23,575 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-25 02:49:23,630 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 41 treesize of output 34 [2018-01-25 02:49:23,631 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-25 02:49:23,744 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 37 treesize of output 29 [2018-01-25 02:49:23,744 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-25 02:49:23,814 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 34 treesize of output 26 [2018-01-25 02:49:23,815 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-25 02:49:23,873 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 29 treesize of output 27 [2018-01-25 02:49:23,874 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-01-25 02:49:23,967 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 26 treesize of output 24 [2018-01-25 02:49:23,968 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-01-25 02:49:24,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-01-25 02:49:24,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-25 02:49:24,066 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2018-01-25 02:49:24,129 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-25 02:49:24,129 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:49:25,228 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 15 treesize of output 11 [2018-01-25 02:49:25,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:49:25,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-01-25 02:49:25,323 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 24 treesize of output 16 [2018-01-25 02:49:25,324 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 02:49:25,336 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-01-25 02:49:25,337 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 02:49:25,341 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:49:25,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:49:25,350 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:69, output treesize:7 [2018-01-25 02:49:25,398 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-25 02:49:25,420 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:49:25,420 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 02:49:25,431 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:49:25,431 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:49:25,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:49:25,484 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:49:25,491 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-25 02:49:25,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:49:25,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 02:49:25,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:49:25,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:49:25,501 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-25 02:49:25,573 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:49:25,574 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:49:25,574 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-25 02:49:25,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:49:25,581 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-25 02:49:25,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:49:25,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:49:25,587 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-25 02:49:25,656 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-25 02:49:25,658 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-25 02:49:25,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:49:25,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:49:25,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:49:25,665 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-25 02:49:25,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-01-25 02:49:25,712 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-25 02:49:25,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:49:25,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:49:25,722 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-25 02:49:25,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-01-25 02:49:25,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-01-25 02:49:25,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-01-25 02:49:25,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:49:25,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 16 [2018-01-25 02:49:25,955 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-25 02:49:26,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:49:26,043 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-25 02:49:26,043 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:48, output treesize:34 [2018-01-25 02:49:26,378 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-25 02:49:26,391 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:49:26,791 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-25 02:49:26,804 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-25 02:49:26,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:49:26,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:49:26,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:49:26,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:21 [2018-01-25 02:49:26,994 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-25 02:49:26,996 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 02:49:26,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 13, 13, 11] total 61 [2018-01-25 02:49:26,996 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 02:49:26,997 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-25 02:49:26,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-25 02:49:26,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=3511, Unknown=0, NotChecked=0, Total=3782 [2018-01-25 02:49:26,998 INFO L87 Difference]: Start difference. First operand 102 states and 123 transitions. Second operand 30 states. [2018-01-25 02:49:29,319 WARN L146 SmtUtils]: Spent 1445ms on a formula simplification. DAG size of input: 76 DAG size of output 57 [2018-01-25 02:49:32,303 WARN L146 SmtUtils]: Spent 1350ms on a formula simplification. DAG size of input: 69 DAG size of output 57 [2018-01-25 02:49:32,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:49:32,643 INFO L93 Difference]: Finished difference Result 110 states and 130 transitions. [2018-01-25 02:49:32,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-25 02:49:32,644 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-01-25 02:49:32,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:49:32,645 INFO L225 Difference]: With dead ends: 110 [2018-01-25 02:49:32,645 INFO L226 Difference]: Without dead ends: 108 [2018-01-25 02:49:32,647 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1811 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=644, Invalid=6162, Unknown=0, NotChecked=0, Total=6806 [2018-01-25 02:49:32,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-01-25 02:49:32,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2018-01-25 02:49:32,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-25 02:49:32,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 105 transitions. [2018-01-25 02:49:32,655 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 105 transitions. Word has length 29 [2018-01-25 02:49:32,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:49:32,656 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 105 transitions. [2018-01-25 02:49:32,656 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-25 02:49:32,656 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 105 transitions. [2018-01-25 02:49:32,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 02:49:32,657 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:49:32,657 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] [2018-01-25 02:49:32,657 INFO L371 AbstractCegarLoop]: === Iteration 12 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:49:32,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1713594616, now seen corresponding path program 1 times [2018-01-25 02:49:32,658 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:49:32,659 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:49:32,659 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:49:32,659 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:49:32,659 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:49:32,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:49:32,676 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:49:32,779 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-25 02:49:32,779 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:49:32,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:49:32,779 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:49:32,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:49:32,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:49:32,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:49:32,780 INFO L87 Difference]: Start difference. First operand 89 states and 105 transitions. Second operand 6 states. [2018-01-25 02:49:32,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:49:32,873 INFO L93 Difference]: Finished difference Result 89 states and 105 transitions. [2018-01-25 02:49:32,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 02:49:32,873 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-25 02:49:32,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:49:32,873 INFO L225 Difference]: With dead ends: 89 [2018-01-25 02:49:32,874 INFO L226 Difference]: Without dead ends: 72 [2018-01-25 02:49:32,874 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-25 02:49:32,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-25 02:49:32,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-01-25 02:49:32,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-25 02:49:32,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2018-01-25 02:49:32,880 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 31 [2018-01-25 02:49:32,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:49:32,880 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2018-01-25 02:49:32,880 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:49:32,881 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2018-01-25 02:49:32,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 02:49:32,882 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:49:32,882 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:49:32,882 INFO L371 AbstractCegarLoop]: === Iteration 13 === [subseqErr8RequiresViolation, subseqErr4RequiresViolation, subseqErr2RequiresViolation, subseqErr3RequiresViolation, subseqErr9RequiresViolation, subseqErr7RequiresViolation, subseqErr5RequiresViolation, subseqErr1RequiresViolation, subseqErr0RequiresViolation, subseqErr6RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:49:32,882 INFO L82 PathProgramCache]: Analyzing trace with hash -797033429, now seen corresponding path program 1 times [2018-01-25 02:49:32,882 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:49:32,883 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:49:32,883 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:49:32,884 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:49:32,884 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:49:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:49:32,898 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:49:33,169 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:49:33,169 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:49:33,169 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:49:33,169 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-01-25 02:49:33,170 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [11], [14], [15], [17], [18], [26], [27], [30], [37], [39], [54], [57], [65], [67], [68], [69], [70], [71], [74], [85], [86], [87], [89] [2018-01-25 02:49:33,173 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:49:33,174 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 02:49:37,089 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 02:49:37,090 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 02:49:37,090 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 02:49:37,091 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:49:37,091 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 02:49:37,099 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:49:37,099 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:49:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:49:37,129 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:49:37,143 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 02:49:37,144 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 02:49:37,149 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 02:49:37,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 02:49:37 BoogieIcfgContainer [2018-01-25 02:49:37,149 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 02:49:37,150 INFO L168 Benchmark]: Toolchain (without parser) took 55723.96 ms. Allocated memory was 303.0 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 260.4 MB in the beginning and 585.5 MB in the end (delta: -325.1 MB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. [2018-01-25 02:49:37,151 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 303.0 MB. Free memory is still 266.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 02:49:37,151 INFO L168 Benchmark]: CACSL2BoogieTranslator took 232.94 ms. Allocated memory is still 303.0 MB. Free memory was 260.4 MB in the beginning and 250.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:49:37,151 INFO L168 Benchmark]: Boogie Preprocessor took 30.12 ms. Allocated memory is still 303.0 MB. Free memory was 250.3 MB in the beginning and 248.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:49:37,152 INFO L168 Benchmark]: RCFGBuilder took 290.29 ms. Allocated memory is still 303.0 MB. Free memory was 248.3 MB in the beginning and 229.8 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. [2018-01-25 02:49:37,152 INFO L168 Benchmark]: TraceAbstraction took 55161.34 ms. Allocated memory was 303.0 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 229.8 MB in the beginning and 585.5 MB in the end (delta: -355.7 MB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. [2018-01-25 02:49:37,153 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.20 ms. Allocated memory is still 303.0 MB. Free memory is still 266.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 232.94 ms. Allocated memory is still 303.0 MB. Free memory was 260.4 MB in the beginning and 250.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.12 ms. Allocated memory is still 303.0 MB. Free memory was 250.3 MB in the beginning and 248.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 290.29 ms. Allocated memory is still 303.0 MB. Free memory was 248.3 MB in the beginning and 229.8 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 55161.34 ms. Allocated memory was 303.0 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 229.8 MB in the beginning and 585.5 MB in the end (delta: -355.7 MB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 27 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 380 LocStat_NO_SUPPORTING_DISEQUALITIES : 59 LocStat_NO_DISJUNCTIONS : -54 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 34 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 70 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 37 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 4.144495 RENAME_VARIABLES(MILLISECONDS) : 0.224952 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.972317 PROJECTAWAY(MILLISECONDS) : 0.047045 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.078672 DISJOIN(MILLISECONDS) : 0.527146 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.258168 ADD_EQUALITY(MILLISECONDS) : 0.019270 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008628 #CONJOIN_DISJUNCTIVE : 100 #RENAME_VARIABLES : 177 #UNFREEZE : 0 #CONJOIN : 164 #PROJECTAWAY : 131 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 15 #RENAME_VARIABLES_DISJUNCTIVE : 161 #ADD_EQUALITY : 72 #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 550). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - TimeoutResultAtElement [Line: 553]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 33 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 12 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 55 locations, 15 error locations. TIMEOUT Result, 55.1s OverallTime, 13 OverallIterations, 2 TraceHistogramMax, 7.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 468 SDtfs, 660 SDslu, 1204 SDs, 0 SdLazy, 1360 SolverSat, 170 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 241 GetRequests, 80 SyntacticMatches, 6 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1988 ImplicationChecksByTransitivity, 10.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 39.5s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 48 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 306 NumberOfCodeBlocks, 306 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 348 ConstructedInterpolants, 28 QuantifiedInterpolants, 89085 SizeOfPredicates, 43 NumberOfNonLiveVariables, 272 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 16 InterpolantComputations, 11 PerfectInterpolantSequences, 4/14 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/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_02-49-37-164.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_02-49-37-164.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_02-49-37-164.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/subseq-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_02-49-37-164.csv Completed graceful shutdown