java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 02:44:35,216 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 02:44:35,217 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 02:44:35,234 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 02:44:35,234 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 02:44:35,235 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 02:44:35,236 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 02:44:35,238 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 02:44:35,240 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 02:44:35,241 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 02:44:35,242 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 02:44:35,242 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 02:44:35,243 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 02:44:35,245 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 02:44:35,246 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 02:44:35,248 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 02:44:35,251 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 02:44:35,253 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 02:44:35,254 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 02:44:35,256 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 02:44:35,258 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 02:44:35,258 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 02:44:35,259 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 02:44:35,260 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 02:44:35,261 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 02:44:35,262 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 02:44:35,262 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 02:44:35,263 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 02:44:35,263 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 02:44:35,263 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 02:44:35,264 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 02:44:35,264 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf [2018-01-25 02:44:35,274 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 02:44:35,274 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 02:44:35,275 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 02:44:35,275 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 02:44:35,275 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 02:44:35,275 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 02:44:35,275 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 02:44:35,275 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 02:44:35,275 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 02:44:35,276 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 02:44:35,276 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 02:44:35,276 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 02:44:35,276 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 02:44:35,276 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 02:44:35,277 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 02:44:35,277 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 02:44:35,277 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 02:44:35,277 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 02:44:35,277 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 02:44:35,277 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 02:44:35,277 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 02:44:35,278 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 02:44:35,278 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 02:44:35,278 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 02:44:35,278 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 02:44:35,278 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:44:35,279 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 02:44:35,279 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 02:44:35,279 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 02:44:35,279 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 02:44:35,279 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 02:44:35,279 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 02:44:35,279 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 02:44:35,280 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 02:44:35,280 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 02:44:35,280 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 02:44:35,281 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 02:44:35,315 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 02:44:35,326 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 02:44:35,330 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 02:44:35,331 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 02:44:35,331 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 02:44:35,332 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:44:35,498 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 02:44:35,502 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 02:44:35,503 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 02:44:35,503 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 02:44:35,509 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 02:44:35,510 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:44:35" (1/1) ... [2018-01-25 02:44:35,513 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@549a5ff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:44:35, skipping insertion in model container [2018-01-25 02:44:35,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:44:35" (1/1) ... [2018-01-25 02:44:35,528 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:44:35,569 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:44:35,698 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:44:35,720 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:44:35,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:44:35 WrapperNode [2018-01-25 02:44:35,729 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 02:44:35,730 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 02:44:35,730 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 02:44:35,730 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 02:44:35,745 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:44:35" (1/1) ... [2018-01-25 02:44:35,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:44:35" (1/1) ... [2018-01-25 02:44:35,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:44:35" (1/1) ... [2018-01-25 02:44:35,754 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:44:35" (1/1) ... [2018-01-25 02:44:35,760 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:44:35" (1/1) ... [2018-01-25 02:44:35,764 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:44:35" (1/1) ... [2018-01-25 02:44:35,766 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:44:35" (1/1) ... [2018-01-25 02:44:35,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 02:44:35,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 02:44:35,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 02:44:35,770 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 02:44:35,771 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:44:35" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:44:35,829 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 02:44:35,829 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 02:44:35,829 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncat [2018-01-25 02:44:35,829 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 02:44:35,830 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 02:44:35,830 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 02:44:35,830 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 02:44:35,830 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 02:44:35,830 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 02:44:35,830 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 02:44:35,830 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncat [2018-01-25 02:44:35,830 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 02:44:35,830 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 02:44:35,830 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 02:44:36,099 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 02:44:36,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:44:36 BoogieIcfgContainer [2018-01-25 02:44:36,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 02:44:36,101 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 02:44:36,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 02:44:36,104 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 02:44:36,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 02:44:35" (1/3) ... [2018-01-25 02:44:36,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c4ac0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:44:36, skipping insertion in model container [2018-01-25 02:44:36,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:44:35" (2/3) ... [2018-01-25 02:44:36,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c4ac0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:44:36, skipping insertion in model container [2018-01-25 02:44:36,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:44:36" (3/3) ... [2018-01-25 02:44:36,107 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:44:36,115 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 02:44:36,121 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-25 02:44:36,170 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 02:44:36,171 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 02:44:36,171 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 02:44:36,171 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 02:44:36,171 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 02:44:36,171 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 02:44:36,171 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 02:44:36,172 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 02:44:36,172 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 02:44:36,195 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-01-25 02:44:36,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-25 02:44:36,203 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:44:36,204 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:44:36,204 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-25 02:44:36,210 INFO L82 PathProgramCache]: Analyzing trace with hash 2055638365, now seen corresponding path program 1 times [2018-01-25 02:44:36,213 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:44:36,262 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:36,262 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:44:36,262 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:36,263 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:44:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:44:36,317 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:44:36,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:44:36,393 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:44:36,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 02:44:36,393 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:44:36,396 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 02:44:36,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 02:44:36,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 02:44:36,410 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 3 states. [2018-01-25 02:44:36,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:44:36,673 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2018-01-25 02:44:36,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 02:44:36,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-25 02:44:36,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:44:36,697 INFO L225 Difference]: With dead ends: 81 [2018-01-25 02:44:36,697 INFO L226 Difference]: Without dead ends: 51 [2018-01-25 02:44:36,700 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 02:44:36,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-25 02:44:36,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-25 02:44:36,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-25 02:44:36,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-01-25 02:44:36,734 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 11 [2018-01-25 02:44:36,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:44:36,734 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-01-25 02:44:36,734 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 02:44:36,734 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-01-25 02:44:36,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 02:44:36,735 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:44:36,735 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:44:36,735 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-25 02:44:36,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1872133330, now seen corresponding path program 1 times [2018-01-25 02:44:36,736 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:44:36,736 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:36,737 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:44:36,737 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:36,737 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:44:36,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:44:36,753 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:44:36,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:44:36,848 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:44:36,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:44:36,848 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:44:36,850 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:44:36,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:44:36,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:44:36,858 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 5 states. [2018-01-25 02:44:36,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:44:36,975 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2018-01-25 02:44:36,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:44:36,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-25 02:44:36,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:44:36,977 INFO L225 Difference]: With dead ends: 95 [2018-01-25 02:44:36,977 INFO L226 Difference]: Without dead ends: 51 [2018-01-25 02:44:36,979 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:44:36,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-25 02:44:36,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-25 02:44:36,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-25 02:44:36,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-01-25 02:44:36,987 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 15 [2018-01-25 02:44:36,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:44:36,987 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-01-25 02:44:36,988 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:44:36,988 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-01-25 02:44:36,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 02:44:36,989 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:44:36,989 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:44:36,989 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-25 02:44:36,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1192074960, now seen corresponding path program 1 times [2018-01-25 02:44:36,989 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:44:36,991 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:36,991 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:44:36,991 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:36,991 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:44:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:44:37,014 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:44:37,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:44:37,094 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:44:37,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:44:37,094 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:44:37,095 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:44:37,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:44:37,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:44:37,095 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 4 states. [2018-01-25 02:44:37,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:44:37,162 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-01-25 02:44:37,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:44:37,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-25 02:44:37,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:44:37,186 INFO L225 Difference]: With dead ends: 51 [2018-01-25 02:44:37,186 INFO L226 Difference]: Without dead ends: 50 [2018-01-25 02:44:37,187 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:44:37,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-25 02:44:37,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-25 02:44:37,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 02:44:37,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-25 02:44:37,194 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 15 [2018-01-25 02:44:37,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:44:37,194 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-25 02:44:37,194 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:44:37,194 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-25 02:44:37,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 02:44:37,195 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:44:37,195 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:44:37,195 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-25 02:44:37,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1192074959, now seen corresponding path program 1 times [2018-01-25 02:44:37,196 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:44:37,197 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:37,197 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:44:37,197 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:37,197 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:44:37,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:44:37,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:44:37,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:44:37,363 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:44:37,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 02:44:37,363 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:44:37,363 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 02:44:37,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 02:44:37,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:44:37,364 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 8 states. [2018-01-25 02:44:37,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:44:37,507 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-01-25 02:44:37,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 02:44:37,507 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-01-25 02:44:37,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:44:37,508 INFO L225 Difference]: With dead ends: 50 [2018-01-25 02:44:37,508 INFO L226 Difference]: Without dead ends: 49 [2018-01-25 02:44:37,509 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-01-25 02:44:37,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-25 02:44:37,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-25 02:44:37,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 02:44:37,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-01-25 02:44:37,514 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 15 [2018-01-25 02:44:37,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:44:37,515 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-01-25 02:44:37,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 02:44:37,515 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-01-25 02:44:37,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-25 02:44:37,515 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:44:37,515 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:44:37,515 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-25 02:44:37,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1700381909, now seen corresponding path program 1 times [2018-01-25 02:44:37,516 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:44:37,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:37,517 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:44:37,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:37,517 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:44:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:44:37,530 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:44:37,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:44:37,558 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:44:37,559 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:44:37,559 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:44:37,559 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:44:37,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:44:37,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:44:37,560 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 4 states. [2018-01-25 02:44:37,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:44:37,610 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-01-25 02:44:37,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:44:37,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-25 02:44:37,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:44:37,612 INFO L225 Difference]: With dead ends: 49 [2018-01-25 02:44:37,612 INFO L226 Difference]: Without dead ends: 48 [2018-01-25 02:44:37,612 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:44:37,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-25 02:44:37,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-25 02:44:37,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-25 02:44:37,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-01-25 02:44:37,619 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 16 [2018-01-25 02:44:37,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:44:37,619 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-01-25 02:44:37,619 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:44:37,619 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-01-25 02:44:37,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-25 02:44:37,620 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:44:37,620 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:44:37,620 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-25 02:44:37,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1700381910, now seen corresponding path program 1 times [2018-01-25 02:44:37,621 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:44:37,622 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:37,622 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:44:37,622 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:37,622 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:44:37,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:44:37,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:44:37,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:44:37,710 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:44:37,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:44:37,710 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:44:37,710 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:44:37,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:44:37,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:44:37,711 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 5 states. [2018-01-25 02:44:37,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:44:37,754 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-01-25 02:44:37,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:44:37,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-25 02:44:37,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:44:37,755 INFO L225 Difference]: With dead ends: 48 [2018-01-25 02:44:37,755 INFO L226 Difference]: Without dead ends: 47 [2018-01-25 02:44:37,756 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:44:37,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-25 02:44:37,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-25 02:44:37,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-25 02:44:37,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-01-25 02:44:37,762 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 16 [2018-01-25 02:44:37,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:44:37,763 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-01-25 02:44:37,763 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:44:37,763 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-01-25 02:44:37,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 02:44:37,764 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:44:37,764 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:44:37,764 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-25 02:44:37,765 INFO L82 PathProgramCache]: Analyzing trace with hash -275307336, now seen corresponding path program 1 times [2018-01-25 02:44:37,765 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:44:37,766 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:37,766 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:44:37,766 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:37,766 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:44:37,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:44:37,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:44:37,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:44:37,826 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:44:37,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:44:37,827 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:44:37,827 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:44:37,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:44:37,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:44:37,828 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 6 states. [2018-01-25 02:44:37,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:44:37,911 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-01-25 02:44:37,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:44:37,911 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-01-25 02:44:37,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:44:37,915 INFO L225 Difference]: With dead ends: 50 [2018-01-25 02:44:37,916 INFO L226 Difference]: Without dead ends: 47 [2018-01-25 02:44:37,916 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-25 02:44:37,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-25 02:44:37,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2018-01-25 02:44:37,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-25 02:44:37,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-01-25 02:44:37,922 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 21 [2018-01-25 02:44:37,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:44:37,922 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-01-25 02:44:37,923 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:44:37,923 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-01-25 02:44:37,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 02:44:37,923 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:44:37,923 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:44:37,923 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-25 02:44:37,924 INFO L82 PathProgramCache]: Analyzing trace with hash -275307335, now seen corresponding path program 1 times [2018-01-25 02:44:37,924 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:44:37,925 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:37,925 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:44:37,925 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:37,925 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:44:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:44:37,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:44:38,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:44:38,116 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:44:38,116 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 02:44:38,116 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:44:38,117 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 02:44:38,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 02:44:38,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-25 02:44:38,118 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 10 states. [2018-01-25 02:44:38,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:44:38,296 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-01-25 02:44:38,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 02:44:38,296 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-01-25 02:44:38,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:44:38,297 INFO L225 Difference]: With dead ends: 60 [2018-01-25 02:44:38,297 INFO L226 Difference]: Without dead ends: 57 [2018-01-25 02:44:38,298 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-01-25 02:44:38,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-25 02:44:38,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2018-01-25 02:44:38,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-25 02:44:38,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2018-01-25 02:44:38,302 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 21 [2018-01-25 02:44:38,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:44:38,303 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2018-01-25 02:44:38,303 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 02:44:38,303 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2018-01-25 02:44:38,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 02:44:38,303 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:44:38,303 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:44:38,303 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-25 02:44:38,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1706718631, now seen corresponding path program 1 times [2018-01-25 02:44:38,304 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:44:38,304 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:38,304 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:44:38,305 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:38,305 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:44:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:44:38,317 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:44:38,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:44:38,370 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:44:38,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 02:44:38,370 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:44:38,371 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 02:44:38,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 02:44:38,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:44:38,371 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand 7 states. [2018-01-25 02:44:38,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:44:38,552 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-01-25 02:44:38,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 02:44:38,553 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-01-25 02:44:38,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:44:38,554 INFO L225 Difference]: With dead ends: 55 [2018-01-25 02:44:38,554 INFO L226 Difference]: Without dead ends: 54 [2018-01-25 02:44:38,555 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-25 02:44:38,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-25 02:44:38,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-01-25 02:44:38,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-25 02:44:38,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2018-01-25 02:44:38,561 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 24 [2018-01-25 02:44:38,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:44:38,561 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2018-01-25 02:44:38,562 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 02:44:38,562 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2018-01-25 02:44:38,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 02:44:38,562 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:44:38,563 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:44:38,563 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-25 02:44:38,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1706718632, now seen corresponding path program 1 times [2018-01-25 02:44:38,566 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:44:38,567 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:38,567 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:44:38,567 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:38,568 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:44:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:44:38,588 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:44:38,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:44:38,727 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:44:38,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 02:44:38,727 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:44:38,728 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 02:44:38,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 02:44:38,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-25 02:44:38,728 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 10 states. [2018-01-25 02:44:38,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:44:38,886 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2018-01-25 02:44:38,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 02:44:38,887 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-01-25 02:44:38,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:44:38,887 INFO L225 Difference]: With dead ends: 57 [2018-01-25 02:44:38,887 INFO L226 Difference]: Without dead ends: 56 [2018-01-25 02:44:38,888 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-01-25 02:44:38,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-25 02:44:38,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2018-01-25 02:44:38,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-25 02:44:38,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-01-25 02:44:38,892 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 24 [2018-01-25 02:44:38,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:44:38,892 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-01-25 02:44:38,892 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 02:44:38,892 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-01-25 02:44:38,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 02:44:38,893 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:44:38,893 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:44:38,893 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-25 02:44:38,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1706720075, now seen corresponding path program 1 times [2018-01-25 02:44:38,894 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:44:38,894 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:38,894 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:44:38,894 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:44:38,894 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:44:38,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:44:38,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:44:39,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:44:39,064 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:44:39,064 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:44:39,065 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-25 02:44:39,067 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [20], [27], [28], [29], [30], [31], [32], [35], [46], [49], [53], [55], [57], [62], [98], [99], [100], [102] [2018-01-25 02:44:39,113 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:44:39,113 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 02:45:12,158 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 02:45:12,160 INFO L268 AbstractInterpreter]: Visited 23 different actions 27 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 27 variables. [2018-01-25 02:45:12,172 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 02:45:12,173 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:45:12,173 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 02:45:12,181 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:45:12,182 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:45:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:45:12,218 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:45:12,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 02:45:12,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:12,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 02:45:12,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:12,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:45:12,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-01-25 02:45:12,401 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:45:12,402 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:45:12,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-01-25 02:45:12,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:12,415 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:45:12,432 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:45:12,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-25 02:45:12,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:12,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:45:12,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:18 [2018-01-25 02:45:12,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:45:12,668 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:45:12,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-01-25 02:45:12,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:12,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-01-25 02:45:12,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-01-25 02:45:12,917 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:12,918 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-25 02:45:12,918 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:12,921 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:45:12,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:45:12,925 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:21, output treesize:3 [2018-01-25 02:45:12,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:45:12,964 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:45:12,964 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 02:45:12,968 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:45:12,969 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:45:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:45:13,014 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:45:13,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 02:45:13,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:13,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 02:45:13,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:13,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:45:13,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-01-25 02:45:13,164 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:45:13,172 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:45:13,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-01-25 02:45:13,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:13,190 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:45:13,191 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:45:13,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-25 02:45:13,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:13,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 02:45:13,198 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:18 [2018-01-25 02:45:13,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:45:13,411 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:45:13,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-01-25 02:45:13,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:13,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-01-25 02:45:13,488 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-25 02:45:13,488 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:13,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-01-25 02:45:13,490 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:13,500 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:45:13,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:45:13,503 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:21, output treesize:3 [2018-01-25 02:45:13,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:45:13,607 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 02:45:13,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12, 11, 12] total 38 [2018-01-25 02:45:13,607 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 02:45:13,608 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-25 02:45:13,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-25 02:45:13,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1332, Unknown=0, NotChecked=0, Total=1482 [2018-01-25 02:45:13,609 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 24 states. [2018-01-25 02:45:14,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:45:14,594 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2018-01-25 02:45:14,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-25 02:45:14,594 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-01-25 02:45:14,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:45:14,595 INFO L225 Difference]: With dead ends: 75 [2018-01-25 02:45:14,595 INFO L226 Difference]: Without dead ends: 72 [2018-01-25 02:45:14,596 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 61 SyntacticMatches, 9 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=296, Invalid=1960, Unknown=0, NotChecked=0, Total=2256 [2018-01-25 02:45:14,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-25 02:45:14,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2018-01-25 02:45:14,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-25 02:45:14,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2018-01-25 02:45:14,605 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 24 [2018-01-25 02:45:14,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:45:14,606 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2018-01-25 02:45:14,606 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-25 02:45:14,606 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2018-01-25 02:45:14,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 02:45:14,608 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:45:14,608 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:45:14,608 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-25 02:45:14,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1074905977, now seen corresponding path program 2 times [2018-01-25 02:45:14,608 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:45:14,609 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:14,609 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:45:14,609 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:45:14,609 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:45:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:45:14,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:45:14,976 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 30 DAG size of output 20 [2018-01-25 02:45:15,135 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:45:15,135 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:45:15,135 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:45:15,135 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 02:45:15,136 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 02:45:15,136 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:45:15,136 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 02:45:15,143 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 02:45:15,143 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 02:45:15,158 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 02:45:15,163 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 02:45:15,165 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 02:45:15,168 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:45:15,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 02:45:15,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:15,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:45:15,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-01-25 02:45:15,246 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:45:15,247 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:45:15,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-25 02:45:15,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:15,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:45:15,253 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:16 [2018-01-25 02:45:15,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-01-25 02:45:15,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-25 02:45:15,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:15,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:45:15,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-25 02:45:15,323 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:38 [2018-01-25 02:45:15,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-01-25 02:45:15,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-25 02:45:15,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:15,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:45:15,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-01-25 02:45:15,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:52, output treesize:48 [2018-01-25 02:45:17,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-01-25 02:45:17,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-01-25 02:45:17,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:17,893 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:45:17,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 37 [2018-01-25 02:45:17,900 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-25 02:45:17,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:45:17,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:45:17,929 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:66, output treesize:43 [2018-01-25 02:45:17,978 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:45:17,978 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:45:18,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2018-01-25 02:45:18,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:18,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2018-01-25 02:45:18,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:18,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2018-01-25 02:45:18,568 INFO L682 Elim1Store]: detected equality via solver [2018-01-25 02:45:18,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-25 02:45:18,570 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:18,576 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:45:18,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2018-01-25 02:45:18,602 INFO L682 Elim1Store]: detected equality via solver [2018-01-25 02:45:18,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-25 02:45:18,604 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:18,610 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:45:18,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:45:18,620 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:103, output treesize:33 [2018-01-25 02:45:18,849 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:45:18,872 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:45:18,872 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 02:45:18,877 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 02:45:18,877 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 02:45:18,898 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 02:45:18,939 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 02:45:18,975 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 02:45:18,981 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:45:19,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 02:45:19,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:19,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 02:45:19,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:19,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:45:19,053 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-01-25 02:45:19,133 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:45:19,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-25 02:45:19,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:19,173 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:45:19,174 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:45:19,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-25 02:45:19,175 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:19,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:45:19,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-01-25 02:45:19,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-25 02:45:19,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-25 02:45:19,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:19,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:45:19,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:45:19,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-25 02:45:19,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-01-25 02:45:19,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-25 02:45:19,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:19,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:45:19,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-25 02:45:19,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-01-25 02:45:19,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-01-25 02:45:19,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 16 [2018-01-25 02:45:19,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 02:45:19,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-01-25 02:45:19,633 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:19,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:45:19,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:45:19,641 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2018-01-25 02:45:19,815 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:45:19,815 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:45:20,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-01-25 02:45:20,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-25 02:45:20,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:20,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:45:20,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:45:20,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:25 [2018-01-25 02:45:20,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-01-25 02:45:20,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:20,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-01-25 02:45:20,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2018-01-25 02:45:20,558 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:20,558 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-25 02:45:20,558 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 02:45:20,564 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:45:20,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:45:20,574 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:37, output treesize:7 [2018-01-25 02:45:20,611 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:45:20,613 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 02:45:20,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 14, 15, 13] total 63 [2018-01-25 02:45:20,614 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 02:45:20,614 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-25 02:45:20,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-25 02:45:20,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=3801, Unknown=1, NotChecked=0, Total=4032 [2018-01-25 02:45:20,616 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 28 states. [2018-01-25 02:45:23,111 WARN L146 SmtUtils]: Spent 1682ms on a formula simplification. DAG size of input: 70 DAG size of output 63 [2018-01-25 02:45:23,813 WARN L146 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 80 DAG size of output 77 [2018-01-25 02:45:28,018 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 84 DAG size of output 79 Received shutdown request... [2018-01-25 02:45:40,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-25 02:45:40,677 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 02:45:40,680 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 02:45:40,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 02:45:40 BoogieIcfgContainer [2018-01-25 02:45:40,680 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 02:45:40,681 INFO L168 Benchmark]: Toolchain (without parser) took 65182.67 ms. Allocated memory was 295.2 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 255.1 MB in the beginning and 688.9 MB in the end (delta: -433.9 MB). Peak memory consumption was 863.8 MB. Max. memory is 5.3 GB. [2018-01-25 02:45:40,681 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 295.2 MB. Free memory is still 261.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 02:45:40,681 INFO L168 Benchmark]: CACSL2BoogieTranslator took 226.54 ms. Allocated memory is still 295.2 MB. Free memory was 254.1 MB in the beginning and 244.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:45:40,682 INFO L168 Benchmark]: Boogie Preprocessor took 39.37 ms. Allocated memory is still 295.2 MB. Free memory was 244.1 MB in the beginning and 242.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:45:40,682 INFO L168 Benchmark]: RCFGBuilder took 331.01 ms. Allocated memory is still 295.2 MB. Free memory was 242.1 MB in the beginning and 222.1 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:45:40,682 INFO L168 Benchmark]: TraceAbstraction took 64578.92 ms. Allocated memory was 295.2 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 222.1 MB in the beginning and 688.9 MB in the end (delta: -466.9 MB). Peak memory consumption was 830.7 MB. Max. memory is 5.3 GB. [2018-01-25 02:45:40,683 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.17 ms. Allocated memory is still 295.2 MB. Free memory is still 261.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 226.54 ms. Allocated memory is still 295.2 MB. Free memory was 254.1 MB in the beginning and 244.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.37 ms. Allocated memory is still 295.2 MB. Free memory was 244.1 MB in the beginning and 242.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 331.01 ms. Allocated memory is still 295.2 MB. Free memory was 242.1 MB in the beginning and 222.1 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 64578.92 ms. Allocated memory was 295.2 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 222.1 MB in the beginning and 688.9 MB in the end (delta: -466.9 MB). Peak memory consumption was 830.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 22 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 291 LocStat_NO_SUPPORTING_DISEQUALITIES : 42 LocStat_NO_DISJUNCTIONS : -44 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 29 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 61 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 30 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.450205 RENAME_VARIABLES(MILLISECONDS) : 0.336056 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.383770 PROJECTAWAY(MILLISECONDS) : 0.657920 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.073452 DISJOIN(MILLISECONDS) : 0.493368 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.373716 ADD_EQUALITY(MILLISECONDS) : 0.014509 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.013452 #CONJOIN_DISJUNCTIVE : 50 #RENAME_VARIABLES : 74 #UNFREEZE : 0 #CONJOIN : 99 #PROJECTAWAY : 68 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 6 #RENAME_VARIABLES_DISJUNCTIVE : 71 #ADD_EQUALITY : 63 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 574). Cancelled while BasicCegarLoop was constructing difference of abstraction (64states) and interpolant automaton (currently 16 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (64states) and interpolant automaton (currently 16 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 574). Cancelled while BasicCegarLoop was constructing difference of abstraction (64states) and interpolant automaton (currently 16 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (64states) and interpolant automaton (currently 16 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 557]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 557). Cancelled while BasicCegarLoop was constructing difference of abstraction (64states) and interpolant automaton (currently 16 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (64states) and interpolant automaton (currently 16 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (64states) and interpolant automaton (currently 16 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (64states) and interpolant automaton (currently 16 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (64states) and interpolant automaton (currently 16 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (64states) and interpolant automaton (currently 16 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (64states) and interpolant automaton (currently 16 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (64states) and interpolant automaton (currently 16 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (64states) and interpolant automaton (currently 16 states, 28 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 80. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 54 locations, 13 error locations. TIMEOUT Result, 64.5s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 22.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 474 SDtfs, 829 SDslu, 1312 SDs, 0 SdLazy, 1103 SolverSat, 143 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 7.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 329 GetRequests, 125 SyntacticMatches, 15 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2004 ImplicationChecksByTransitivity, 14.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 33.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 22 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 331 NumberOfCodeBlocks, 331 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 413 ConstructedInterpolants, 43 QuantifiedInterpolants, 93593 SizeOfPredicates, 69 NumberOfNonLiveVariables, 516 ConjunctsInSsa, 151 ConjunctsInUnsatCore, 20 InterpolantComputations, 10 PerfectInterpolantSequences, 0/45 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_02-45-40-694.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_02-45-40-694.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_02-45-40-694.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_02-45-40-694.csv Completed graceful shutdown