java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:52:49,496 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:52:49,498 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:52:49,511 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:52:49,511 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:52:49,512 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:52:49,514 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:52:49,515 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:52:49,518 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:52:49,518 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:52:49,519 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:52:49,519 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:52:49,520 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:52:49,522 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:52:49,522 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:52:49,525 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:52:49,527 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:52:49,529 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:52:49,530 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:52:49,531 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:52:49,534 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:52:49,534 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:52:49,534 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:52:49,535 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:52:49,536 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:52:49,537 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:52:49,537 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:52:49,538 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:52:49,538 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:52:49,539 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:52:49,539 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:52:49,539 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-24 16:52:49,549 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:52:49,549 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:52:49,550 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:52:49,551 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:52:49,551 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:52:49,551 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:52:49,551 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:52:49,551 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:52:49,552 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:52:49,552 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:52:49,552 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:52:49,553 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:52:49,553 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:52:49,553 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:52:49,553 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:52:49,553 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:52:49,554 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:52:49,554 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:52:49,554 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:52:49,554 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:52:49,555 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:52:49,555 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:52:49,555 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:52:49,555 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:52:49,555 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:52:49,556 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:52:49,556 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:52:49,556 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:52:49,556 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:52:49,556 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 16:52:49,557 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:52:49,557 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:52:49,557 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:52:49,557 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 16:52:49,558 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:52:49,558 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:52:49,595 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:52:49,607 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:52:49,611 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:52:49,613 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:52:49,613 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:52:49,614 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2018-01-24 16:52:49,771 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:52:49,779 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:52:49,780 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:52:49,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:52:49,788 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:52:49,790 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:52:49" (1/1) ... [2018-01-24 16:52:49,793 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cdf0e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:52:49, skipping insertion in model container [2018-01-24 16:52:49,794 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:52:49" (1/1) ... [2018-01-24 16:52:49,813 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:52:49,851 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:52:49,963 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:52:49,980 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:52:49,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:52:49 WrapperNode [2018-01-24 16:52:49,988 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:52:49,989 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:52:49,989 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:52:49,989 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:52:50,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:52:49" (1/1) ... [2018-01-24 16:52:50,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:52:49" (1/1) ... [2018-01-24 16:52:50,012 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:52:49" (1/1) ... [2018-01-24 16:52:50,012 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:52:49" (1/1) ... [2018-01-24 16:52:50,016 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:52:49" (1/1) ... [2018-01-24 16:52:50,019 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:52:49" (1/1) ... [2018-01-24 16:52:50,020 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:52:49" (1/1) ... [2018-01-24 16:52:50,022 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:52:50,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:52:50,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:52:50,022 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:52:50,023 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:52:49" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:52:50,068 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:52:50,068 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:52:50,068 INFO L136 BoogieDeclarations]: Found implementation of procedure substring [2018-01-24 16:52:50,068 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:52:50,069 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:52:50,069 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:52:50,069 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:52:50,069 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:52:50,069 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:52:50,069 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:52:50,069 INFO L128 BoogieDeclarations]: Found specification of procedure substring [2018-01-24 16:52:50,069 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:52:50,069 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:52:50,069 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:52:50,324 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:52:50,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:52:50 BoogieIcfgContainer [2018-01-24 16:52:50,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:52:50,325 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 16:52:50,325 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 16:52:50,326 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 16:52:50,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 04:52:49" (1/3) ... [2018-01-24 16:52:50,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cdccf83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:52:50, skipping insertion in model container [2018-01-24 16:52:50,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:52:49" (2/3) ... [2018-01-24 16:52:50,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cdccf83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:52:50, skipping insertion in model container [2018-01-24 16:52:50,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:52:50" (3/3) ... [2018-01-24 16:52:50,330 INFO L105 eAbstractionObserver]: Analyzing ICFG substring-alloca_true-valid-memsafety_true-termination.i [2018-01-24 16:52:50,336 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 16:52:50,342 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-24 16:52:50,391 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 16:52:50,391 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 16:52:50,391 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 16:52:50,392 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 16:52:50,392 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 16:52:50,392 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 16:52:50,392 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 16:52:50,392 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 16:52:50,393 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 16:52:50,416 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-01-24 16:52:50,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 16:52:50,423 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:52:50,425 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:52:50,425 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 16:52:50,430 INFO L82 PathProgramCache]: Analyzing trace with hash 680757637, now seen corresponding path program 1 times [2018-01-24 16:52:50,433 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:52:50,493 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:50,493 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:52:50,494 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:50,494 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:52:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:50,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:52:50,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:50,697 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:52:50,697 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:52:50,697 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:52:50,700 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:52:50,714 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:52:50,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:52:50,717 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 4 states. [2018-01-24 16:52:50,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:52:50,946 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2018-01-24 16:52:50,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:52:50,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 16:52:50,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:52:50,961 INFO L225 Difference]: With dead ends: 92 [2018-01-24 16:52:50,961 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 16:52:50,965 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:52:50,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 16:52:51,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-24 16:52:51,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 16:52:51,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-01-24 16:52:51,009 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 13 [2018-01-24 16:52:51,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:52:51,009 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-01-24 16:52:51,010 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:52:51,010 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-01-24 16:52:51,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 16:52:51,010 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:52:51,011 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:52:51,011 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 16:52:51,011 INFO L82 PathProgramCache]: Analyzing trace with hash 680757638, now seen corresponding path program 1 times [2018-01-24 16:52:51,011 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:52:51,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:51,012 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:52:51,013 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:51,013 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:52:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:51,032 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:52:51,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:51,191 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:52:51,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:52:51,192 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:52:51,193 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:52:51,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:52:51,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:52:51,194 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 6 states. [2018-01-24 16:52:51,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:52:51,270 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-01-24 16:52:51,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:52:51,270 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-24 16:52:51,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:52:51,272 INFO L225 Difference]: With dead ends: 52 [2018-01-24 16:52:51,272 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 16:52:51,273 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:52:51,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 16:52:51,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-24 16:52:51,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 16:52:51,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-01-24 16:52:51,280 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 13 [2018-01-24 16:52:51,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:52:51,281 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-01-24 16:52:51,281 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:52:51,281 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-01-24 16:52:51,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 16:52:51,281 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:52:51,282 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:52:51,282 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 16:52:51,282 INFO L82 PathProgramCache]: Analyzing trace with hash -371349738, now seen corresponding path program 1 times [2018-01-24 16:52:51,282 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:52:51,283 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:51,283 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:52:51,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:51,284 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:52:51,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:51,299 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:52:51,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:51,325 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:52:51,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:52:51,326 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:52:51,326 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:52:51,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:52:51,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:52:51,327 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 4 states. [2018-01-24 16:52:51,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:52:51,381 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-01-24 16:52:51,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:52:51,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 16:52:51,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:52:51,384 INFO L225 Difference]: With dead ends: 51 [2018-01-24 16:52:51,384 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 16:52:51,384 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:52:51,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 16:52:51,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-24 16:52:51,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 16:52:51,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-24 16:52:51,392 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 14 [2018-01-24 16:52:51,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:52:51,393 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-24 16:52:51,393 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:52:51,393 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-24 16:52:51,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 16:52:51,394 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:52:51,394 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:52:51,394 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 16:52:51,394 INFO L82 PathProgramCache]: Analyzing trace with hash -371349737, now seen corresponding path program 1 times [2018-01-24 16:52:51,394 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:52:51,395 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:51,395 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:52:51,396 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:51,396 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:52:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:51,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:52:51,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:51,492 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:52:51,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:52:51,492 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:52:51,492 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:52:51,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:52:51,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:52:51,493 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 5 states. [2018-01-24 16:52:51,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:52:51,567 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-01-24 16:52:51,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:52:51,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 16:52:51,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:52:51,568 INFO L225 Difference]: With dead ends: 50 [2018-01-24 16:52:51,568 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 16:52:51,569 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:52:51,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 16:52:51,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-24 16:52:51,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 16:52:51,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-01-24 16:52:51,573 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 14 [2018-01-24 16:52:51,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:52:51,574 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-01-24 16:52:51,574 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:52:51,574 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-01-24 16:52:51,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 16:52:51,574 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:52:51,575 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-24 16:52:51,575 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 16:52:51,575 INFO L82 PathProgramCache]: Analyzing trace with hash -435796900, now seen corresponding path program 1 times [2018-01-24 16:52:51,575 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:52:51,576 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:51,576 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:52:51,576 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:51,576 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:52:51,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:51,586 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:52:51,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:51,635 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:52:51,635 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:52:51,635 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:52:51,636 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:52:51,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:52:51,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:52:51,636 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 5 states. [2018-01-24 16:52:51,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:52:51,718 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-01-24 16:52:51,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:52:51,718 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 16:52:51,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:52:51,719 INFO L225 Difference]: With dead ends: 49 [2018-01-24 16:52:51,719 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 16:52:51,720 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:52:51,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 16:52:51,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-24 16:52:51,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 16:52:51,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-01-24 16:52:51,725 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 18 [2018-01-24 16:52:51,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:52:51,725 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-01-24 16:52:51,725 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:52:51,725 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-01-24 16:52:51,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 16:52:51,726 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:52:51,726 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-24 16:52:51,726 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 16:52:51,726 INFO L82 PathProgramCache]: Analyzing trace with hash -435796899, now seen corresponding path program 1 times [2018-01-24 16:52:51,727 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:52:51,728 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:51,728 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:52:51,728 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:51,728 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:52:51,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:51,738 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:52:51,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:51,839 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:52:51,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 16:52:51,840 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:52:51,840 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 16:52:51,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 16:52:51,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:52:51,841 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 8 states. [2018-01-24 16:52:51,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:52:51,958 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-01-24 16:52:51,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 16:52:51,958 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-24 16:52:51,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:52:51,961 INFO L225 Difference]: With dead ends: 73 [2018-01-24 16:52:51,961 INFO L226 Difference]: Without dead ends: 72 [2018-01-24 16:52:51,961 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-24 16:52:51,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-24 16:52:51,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2018-01-24 16:52:51,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 16:52:51,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-24 16:52:51,967 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 18 [2018-01-24 16:52:51,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:52:51,967 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-24 16:52:51,967 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 16:52:51,968 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-24 16:52:51,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 16:52:51,968 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:52:51,968 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:52:51,968 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 16:52:51,969 INFO L82 PathProgramCache]: Analyzing trace with hash 860706905, now seen corresponding path program 1 times [2018-01-24 16:52:51,969 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:52:51,969 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:51,970 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:52:51,970 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:51,970 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:52:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:51,982 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:52:52,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:52,035 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:52:52,035 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:52:52,035 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:52:52,036 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:52:52,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:52:52,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:52:52,036 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 6 states. [2018-01-24 16:52:52,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:52:52,119 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-01-24 16:52:52,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:52:52,119 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-01-24 16:52:52,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:52:52,120 INFO L225 Difference]: With dead ends: 54 [2018-01-24 16:52:52,120 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 16:52:52,120 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:52:52,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 16:52:52,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-01-24 16:52:52,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 16:52:52,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-01-24 16:52:52,125 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 21 [2018-01-24 16:52:52,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:52:52,126 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-01-24 16:52:52,126 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:52:52,126 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-01-24 16:52:52,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 16:52:52,127 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:52:52,127 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:52:52,128 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 16:52:52,128 INFO L82 PathProgramCache]: Analyzing trace with hash 860706906, now seen corresponding path program 1 times [2018-01-24 16:52:52,128 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:52:52,129 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:52,129 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:52:52,129 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:52,129 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:52:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:52,141 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:52:52,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:52,269 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:52:52,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 16:52:52,269 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:52:52,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 16:52:52,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 16:52:52,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:52:52,271 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 9 states. [2018-01-24 16:52:52,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:52:52,400 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2018-01-24 16:52:52,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 16:52:52,422 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-01-24 16:52:52,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:52:52,423 INFO L225 Difference]: With dead ends: 69 [2018-01-24 16:52:52,424 INFO L226 Difference]: Without dead ends: 66 [2018-01-24 16:52:52,424 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-24 16:52:52,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-24 16:52:52,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2018-01-24 16:52:52,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 16:52:52,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2018-01-24 16:52:52,432 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 21 [2018-01-24 16:52:52,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:52:52,432 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2018-01-24 16:52:52,432 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 16:52:52,433 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2018-01-24 16:52:52,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 16:52:52,433 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:52:52,434 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:52:52,434 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 16:52:52,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1579895137, now seen corresponding path program 1 times [2018-01-24 16:52:52,434 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:52:52,435 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:52,435 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:52:52,435 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:52,435 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:52:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:52,448 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:52:52,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:52,505 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:52:52,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:52:52,506 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:52:52,506 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:52:52,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:52:52,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:52:52,506 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand 6 states. [2018-01-24 16:52:52,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:52:52,610 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-01-24 16:52:52,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:52:52,611 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-24 16:52:52,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:52:52,612 INFO L225 Difference]: With dead ends: 60 [2018-01-24 16:52:52,612 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 16:52:52,613 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:52:52,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 16:52:52,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-01-24 16:52:52,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 16:52:52,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-01-24 16:52:52,621 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 25 [2018-01-24 16:52:52,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:52:52,622 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-01-24 16:52:52,622 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:52:52,622 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-01-24 16:52:52,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 16:52:52,623 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:52:52,623 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:52:52,623 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 16:52:52,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1579895136, now seen corresponding path program 1 times [2018-01-24 16:52:52,624 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:52:52,624 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:52,625 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:52:52,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:52,625 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:52:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:52,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:52:52,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:52,746 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:52:52,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 16:52:52,746 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:52:52,746 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 16:52:52,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 16:52:52,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:52:52,747 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 8 states. [2018-01-24 16:52:52,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:52:52,858 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2018-01-24 16:52:52,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 16:52:52,858 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-01-24 16:52:52,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:52:52,859 INFO L225 Difference]: With dead ends: 93 [2018-01-24 16:52:52,859 INFO L226 Difference]: Without dead ends: 92 [2018-01-24 16:52:52,860 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-01-24 16:52:52,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-24 16:52:52,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 62. [2018-01-24 16:52:52,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-24 16:52:52,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2018-01-24 16:52:52,867 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 25 [2018-01-24 16:52:52,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:52:52,868 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2018-01-24 16:52:52,868 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 16:52:52,868 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2018-01-24 16:52:52,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 16:52:52,869 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:52:52,869 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] [2018-01-24 16:52:52,869 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 16:52:52,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1731827764, now seen corresponding path program 1 times [2018-01-24 16:52:52,870 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:52:52,872 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:52,872 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:52:52,872 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:52,872 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:52:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:52,882 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:52:52,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:52,903 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:52:52,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:52:52,904 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:52:52,904 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 16:52:52,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 16:52:52,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 16:52:52,904 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 3 states. [2018-01-24 16:52:52,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:52:52,927 INFO L93 Difference]: Finished difference Result 101 states and 119 transitions. [2018-01-24 16:52:52,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 16:52:52,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-01-24 16:52:52,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:52:52,928 INFO L225 Difference]: With dead ends: 101 [2018-01-24 16:52:52,928 INFO L226 Difference]: Without dead ends: 64 [2018-01-24 16:52:52,929 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-24 16:52:52,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-24 16:52:52,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-01-24 16:52:52,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-24 16:52:52,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2018-01-24 16:52:52,936 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 26 [2018-01-24 16:52:52,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:52:52,937 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2018-01-24 16:52:52,937 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 16:52:52,937 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2018-01-24 16:52:52,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 16:52:52,938 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:52:52,938 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] [2018-01-24 16:52:52,938 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 16:52:52,938 INFO L82 PathProgramCache]: Analyzing trace with hash -2135151184, now seen corresponding path program 1 times [2018-01-24 16:52:52,939 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:52:52,939 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:52,940 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:52:52,940 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:52,940 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:52:52,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:52,951 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:52:53,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:53,012 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:52:53,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 16:52:53,012 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:52:53,013 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:52:53,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:52:53,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:52:53,013 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 6 states. [2018-01-24 16:52:53,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:52:53,109 INFO L93 Difference]: Finished difference Result 109 states and 126 transitions. [2018-01-24 16:52:53,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 16:52:53,109 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-01-24 16:52:53,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:52:53,110 INFO L225 Difference]: With dead ends: 109 [2018-01-24 16:52:53,110 INFO L226 Difference]: Without dead ends: 70 [2018-01-24 16:52:53,111 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:52:53,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-24 16:52:53,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2018-01-24 16:52:53,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-24 16:52:53,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2018-01-24 16:52:53,119 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 28 [2018-01-24 16:52:53,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:52:53,119 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2018-01-24 16:52:53,120 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:52:53,120 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2018-01-24 16:52:53,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 16:52:53,121 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:52:53,121 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:52:53,121 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 16:52:53,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1750130544, now seen corresponding path program 1 times [2018-01-24 16:52:53,122 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:52:53,122 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:53,123 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:52:53,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:53,123 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:52:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:53,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:52:53,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:53,292 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:52:53,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 16:52:53,292 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:52:53,292 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 16:52:53,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 16:52:53,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:52:53,293 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand 7 states. [2018-01-24 16:52:53,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:52:53,383 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2018-01-24 16:52:53,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 16:52:53,383 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-01-24 16:52:53,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:52:53,384 INFO L225 Difference]: With dead ends: 67 [2018-01-24 16:52:53,384 INFO L226 Difference]: Without dead ends: 54 [2018-01-24 16:52:53,384 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:52:53,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-24 16:52:53,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-24 16:52:53,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 16:52:53,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-01-24 16:52:53,391 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 28 [2018-01-24 16:52:53,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:52:53,391 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-01-24 16:52:53,391 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 16:52:53,391 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-01-24 16:52:53,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 16:52:53,392 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:52:53,392 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-24 16:52:53,393 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 16:52:53,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1520679734, now seen corresponding path program 1 times [2018-01-24 16:52:53,393 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:52:53,394 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:53,394 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:52:53,394 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:52:53,394 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:52:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:53,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:52:53,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:53,718 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:52:53,718 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:52:53,719 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-24 16:52:53,721 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [8], [16], [18], [19], [20], [21], [22], [25], [36], [40], [42], [49], [53], [55], [57], [58], [61], [62], [65], [68], [76], [92], [93], [94], [96] [2018-01-24 16:52:53,767 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:52:53,767 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:52:54,056 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:52:54,057 INFO L268 AbstractInterpreter]: Visited 28 different actions 37 times. Merged at 9 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 33 variables. [2018-01-24 16:52:54,066 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:52:54,066 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:52:54,067 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:52:54,078 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:52:54,079 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:52:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:52:54,115 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:52:54,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:52:54,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:54,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:54,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 16:52:54,204 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:52:54,205 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:52:54,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 16:52:54,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:54,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:54,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-24 16:52:54,279 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 11 treesize of output 8 [2018-01-24 16:52:54,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 16:52:54,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:54,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:54,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:54,289 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-01-24 16:52:54,329 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 22 treesize of output 23 [2018-01-24 16:52:54,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 16:52:54,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:54,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:54,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-24 16:52:54,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:26, output treesize:22 [2018-01-24 16:52:56,688 WARN L143 SmtUtils]: Spent 2037ms on a formula simplification that was a NOOP. DAG size: 30 [2018-01-24 16:52:56,783 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 40 treesize of output 50 [2018-01-24 16:52:56,789 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 42 treesize of output 35 [2018-01-24 16:52:56,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:56,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 24 [2018-01-24 16:52:56,883 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:56,920 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 24 treesize of output 16 [2018-01-24 16:52:56,920 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:56,977 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 34 treesize of output 26 [2018-01-24 16:52:56,978 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:57,025 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 26 treesize of output 19 [2018-01-24 16:52:57,025 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:57,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-01-24 16:52:57,053 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:57,085 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 34 treesize of output 24 [2018-01-24 16:52:57,086 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:57,110 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 24 treesize of output 16 [2018-01-24 16:52:57,110 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:57,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 16:52:57,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:57,146 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:44, output treesize:8 [2018-01-24 16:52:57,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:57,200 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:52:57,659 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-24 16:52:57,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-01-24 16:52:57,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:57,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 11 [2018-01-24 16:52:57,710 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:52:57,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:57,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:52:57,728 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:48, output treesize:3 [2018-01-24 16:52:57,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:52:57,782 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 16:52:57,782 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18, 14] imperfect sequences [12] total 39 [2018-01-24 16:52:57,782 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:52:57,783 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 16:52:57,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 16:52:57,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1369, Unknown=0, NotChecked=0, Total=1482 [2018-01-24 16:52:57,784 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 18 states. [2018-01-24 16:53:01,821 WARN L143 SmtUtils]: Spent 3834ms on a formula simplification that was a NOOP. DAG size: 29 [2018-01-24 16:53:06,832 WARN L143 SmtUtils]: Spent 4975ms on a formula simplification that was a NOOP. DAG size: 38 [2018-01-24 16:53:11,808 WARN L143 SmtUtils]: Spent 4932ms on a formula simplification that was a NOOP. DAG size: 44 [2018-01-24 16:53:25,143 WARN L146 SmtUtils]: Spent 13288ms on a formula simplification. DAG size of input: 51 DAG size of output 51 [2018-01-24 16:53:39,224 WARN L146 SmtUtils]: Spent 14052ms on a formula simplification. DAG size of input: 51 DAG size of output 47 [2018-01-24 16:53:53,309 WARN L146 SmtUtils]: Spent 14056ms on a formula simplification. DAG size of input: 55 DAG size of output 51 Received shutdown request... [2018-01-24 16:54:07,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 16:54:07,402 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 16:54:07,405 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 16:54:07,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 04:54:07 BoogieIcfgContainer [2018-01-24 16:54:07,406 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 16:54:07,406 INFO L168 Benchmark]: Toolchain (without parser) took 77634.38 ms. Allocated memory was 304.6 MB in the beginning and 548.4 MB in the end (delta: 243.8 MB). Free memory was 261.5 MB in the beginning and 376.9 MB in the end (delta: -115.3 MB). Peak memory consumption was 128.5 MB. Max. memory is 5.3 GB. [2018-01-24 16:54:07,407 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 304.6 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:54:07,407 INFO L168 Benchmark]: CACSL2BoogieTranslator took 208.83 ms. Allocated memory is still 304.6 MB. Free memory was 261.5 MB in the beginning and 251.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:54:07,407 INFO L168 Benchmark]: Boogie Preprocessor took 32.52 ms. Allocated memory is still 304.6 MB. Free memory was 251.6 MB in the beginning and 249.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:54:07,407 INFO L168 Benchmark]: RCFGBuilder took 302.29 ms. Allocated memory is still 304.6 MB. Free memory was 249.6 MB in the beginning and 228.6 MB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 5.3 GB. [2018-01-24 16:54:07,408 INFO L168 Benchmark]: TraceAbstraction took 77080.93 ms. Allocated memory was 304.6 MB in the beginning and 548.4 MB in the end (delta: 243.8 MB). Free memory was 228.6 MB in the beginning and 376.9 MB in the end (delta: -148.2 MB). Peak memory consumption was 95.6 MB. Max. memory is 5.3 GB. [2018-01-24 16:54:07,409 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 304.6 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 208.83 ms. Allocated memory is still 304.6 MB. Free memory was 261.5 MB in the beginning and 251.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.52 ms. Allocated memory is still 304.6 MB. Free memory was 251.6 MB in the beginning and 249.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 302.29 ms. Allocated memory is still 304.6 MB. Free memory was 249.6 MB in the beginning and 228.6 MB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 77080.93 ms. Allocated memory was 304.6 MB in the beginning and 548.4 MB in the end (delta: 243.8 MB). Free memory was 228.6 MB in the beginning and 376.9 MB in the end (delta: -148.2 MB). Peak memory consumption was 95.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 27 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 381 LocStat_NO_SUPPORTING_DISEQUALITIES : 68 LocStat_NO_DISJUNCTIONS : -54 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 34 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 71 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 37 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.503977 RENAME_VARIABLES(MILLISECONDS) : 0.795564 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.438652 PROJECTAWAY(MILLISECONDS) : 1.556753 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001804 DISJOIN(MILLISECONDS) : 0.939536 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.859357 ADD_EQUALITY(MILLISECONDS) : 0.026476 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014185 #CONJOIN_DISJUNCTIVE : 73 #RENAME_VARIABLES : 114 #UNFREEZE : 0 #CONJOIN : 133 #PROJECTAWAY : 95 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 14 #RENAME_VARIABLES_DISJUNCTIVE : 105 #ADD_EQUALITY : 73 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (54states) and interpolant automaton (currently 16 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (54states) and interpolant automaton (currently 16 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (54states) and interpolant automaton (currently 16 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (54states) and interpolant automaton (currently 16 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 555]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 555). Cancelled while BasicCegarLoop was constructing difference of abstraction (54states) and interpolant automaton (currently 16 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (54states) and interpolant automaton (currently 16 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (54states) and interpolant automaton (currently 16 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (54states) and interpolant automaton (currently 16 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (54states) and interpolant automaton (currently 16 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (54states) and interpolant automaton (currently 16 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (54states) and interpolant automaton (currently 16 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (54states) and interpolant automaton (currently 16 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (54states) and interpolant automaton (currently 16 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (54states) and interpolant automaton (currently 16 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (54states) and interpolant automaton (currently 16 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 56 locations, 15 error locations. TIMEOUT Result, 77.0s OverallTime, 14 OverallIterations, 2 TraceHistogramMax, 70.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 558 SDtfs, 734 SDslu, 1165 SDs, 0 SdLazy, 978 SolverSat, 76 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 59.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 73 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 322 NumberOfCodeBlocks, 322 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 335 ConstructedInterpolants, 21 QuantifiedInterpolants, 45188 SizeOfPredicates, 28 NumberOfNonLiveVariables, 142 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 16 InterpolantComputations, 15 PerfectInterpolantSequences, 8/10 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/substring-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_16-54-07-417.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/substring-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-54-07-417.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/substring-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-54-07-417.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/substring-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_16-54-07-417.csv Completed graceful shutdown