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_precise.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 23:18:58,292 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 23:18:58,294 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 23:18:58,309 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 23:18:58,309 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 23:18:58,310 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 23:18:58,311 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 23:18:58,313 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 23:18:58,315 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 23:18:58,315 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 23:18:58,316 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 23:18:58,317 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 23:18:58,318 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 23:18:58,319 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 23:18:58,320 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 23:18:58,322 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 23:18:58,324 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 23:18:58,326 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 23:18:58,328 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 23:18:58,329 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 23:18:58,331 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 23:18:58,331 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 23:18:58,332 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 23:18:58,333 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 23:18:58,333 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 23:18:58,335 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 23:18:58,335 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 23:18:58,336 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 23:18:58,336 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 23:18:58,336 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 23:18:58,337 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 23:18:58,337 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_precise.epf [2018-01-24 23:18:58,346 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 23:18:58,346 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 23:18:58,347 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 23:18:58,347 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 23:18:58,347 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 23:18:58,347 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 23:18:58,347 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 23:18:58,347 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 23:18:58,348 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 23:18:58,348 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 23:18:58,348 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 23:18:58,348 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 23:18:58,348 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 23:18:58,348 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 23:18:58,348 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 23:18:58,349 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 23:18:58,349 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 23:18:58,349 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 23:18:58,349 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 23:18:58,349 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 23:18:58,349 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 23:18:58,349 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 23:18:58,349 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 23:18:58,350 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 23:18:58,350 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 23:18:58,350 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 23:18:58,350 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 23:18:58,350 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 23:18:58,351 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 23:18:58,351 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 23:18:58,351 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 23:18:58,351 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 23:18:58,351 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 23:18:58,351 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 23:18:58,352 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 23:18:58,352 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 23:18:58,384 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 23:18:58,397 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 23:18:58,401 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 23:18:58,403 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 23:18:58,403 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 23:18:58,404 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-01-24 23:18:58,582 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 23:18:58,589 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 23:18:58,590 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 23:18:58,590 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 23:18:58,597 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 23:18:58,598 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:18:58" (1/1) ... [2018-01-24 23:18:58,601 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fee6ace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:18:58, skipping insertion in model container [2018-01-24 23:18:58,601 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:18:58" (1/1) ... [2018-01-24 23:18:58,619 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 23:18:58,657 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 23:18:58,774 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 23:18:58,790 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 23:18:58,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:18:58 WrapperNode [2018-01-24 23:18:58,796 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 23:18:58,797 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 23:18:58,797 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 23:18:58,797 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 23:18:58,810 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:18:58" (1/1) ... [2018-01-24 23:18:58,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:18:58" (1/1) ... [2018-01-24 23:18:58,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:18:58" (1/1) ... [2018-01-24 23:18:58,821 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:18:58" (1/1) ... [2018-01-24 23:18:58,825 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:18:58" (1/1) ... [2018-01-24 23:18:58,828 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:18:58" (1/1) ... [2018-01-24 23:18:58,829 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:18:58" (1/1) ... [2018-01-24 23:18:58,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 23:18:58,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 23:18:58,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 23:18:58,831 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 23:18:58,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:18:58" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 23:18:58,879 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 23:18:58,880 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 23:18:58,880 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcspn [2018-01-24 23:18:58,880 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 23:18:58,880 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 23:18:58,880 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 23:18:58,880 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 23:18:58,881 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 23:18:58,881 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 23:18:58,881 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 23:18:58,881 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcspn [2018-01-24 23:18:58,881 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 23:18:58,881 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 23:18:58,882 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 23:18:59,081 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 23:18:59,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:18:59 BoogieIcfgContainer [2018-01-24 23:18:59,082 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 23:18:59,083 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 23:18:59,083 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 23:18:59,084 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 23:18:59,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:18:58" (1/3) ... [2018-01-24 23:18:59,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f0a49d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:18:59, skipping insertion in model container [2018-01-24 23:18:59,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:18:58" (2/3) ... [2018-01-24 23:18:59,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f0a49d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:18:59, skipping insertion in model container [2018-01-24 23:18:59,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:18:59" (3/3) ... [2018-01-24 23:18:59,089 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-01-24 23:18:59,095 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 23:18:59,100 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-24 23:18:59,145 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 23:18:59,146 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 23:18:59,146 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 23:18:59,146 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 23:18:59,146 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 23:18:59,146 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 23:18:59,146 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 23:18:59,147 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 23:18:59,147 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 23:18:59,166 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-24 23:18:59,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 23:18:59,172 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:18:59,173 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:18:59,173 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:18:59,177 INFO L82 PathProgramCache]: Analyzing trace with hash -839073384, now seen corresponding path program 1 times [2018-01-24 23:18:59,179 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:18:59,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:18:59,221 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:18:59,221 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:18:59,221 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:18:59,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:18:59,286 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:18:59,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:18:59,436 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:18:59,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 23:18:59,436 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:18:59,439 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 23:18:59,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 23:18:59,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 23:18:59,451 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 4 states. [2018-01-24 23:18:59,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:18:59,629 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-01-24 23:18:59,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 23:18:59,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 23:18:59,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:18:59,642 INFO L225 Difference]: With dead ends: 70 [2018-01-24 23:18:59,643 INFO L226 Difference]: Without dead ends: 41 [2018-01-24 23:18:59,646 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:18:59,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-24 23:18:59,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-24 23:18:59,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 23:18:59,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-01-24 23:18:59,685 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 13 [2018-01-24 23:18:59,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:18:59,686 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-01-24 23:18:59,686 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 23:18:59,686 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-01-24 23:18:59,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 23:18:59,686 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:18:59,686 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:18:59,686 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:18:59,687 INFO L82 PathProgramCache]: Analyzing trace with hash -839073383, now seen corresponding path program 1 times [2018-01-24 23:18:59,687 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:18:59,688 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:18:59,688 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:18:59,688 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:18:59,688 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:18:59,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:18:59,708 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:18:59,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:18:59,834 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:18:59,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 23:18:59,835 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:18:59,837 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 23:18:59,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 23:18:59,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:18:59,837 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 6 states. [2018-01-24 23:18:59,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:18:59,937 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-01-24 23:18:59,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:18:59,938 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-24 23:18:59,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:18:59,939 INFO L225 Difference]: With dead ends: 41 [2018-01-24 23:18:59,939 INFO L226 Difference]: Without dead ends: 40 [2018-01-24 23:18:59,940 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-24 23:18:59,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-24 23:18:59,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-01-24 23:18:59,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-24 23:18:59,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-01-24 23:18:59,946 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 13 [2018-01-24 23:18:59,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:18:59,946 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-01-24 23:18:59,947 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 23:18:59,947 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-01-24 23:18:59,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 23:18:59,947 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:18:59,948 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:18:59,948 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:18:59,948 INFO L82 PathProgramCache]: Analyzing trace with hash -241471094, now seen corresponding path program 1 times [2018-01-24 23:18:59,948 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:18:59,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:18:59,949 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:18:59,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:18:59,950 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:18:59,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:18:59,962 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:18:59,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:18:59,990 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:18:59,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 23:18:59,990 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:18:59,991 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 23:18:59,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 23:18:59,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 23:18:59,991 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 4 states. [2018-01-24 23:19:00,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:19:00,053 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-01-24 23:19:00,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 23:19:00,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 23:19:00,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:19:00,054 INFO L225 Difference]: With dead ends: 40 [2018-01-24 23:19:00,054 INFO L226 Difference]: Without dead ends: 39 [2018-01-24 23:19:00,055 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:19:00,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-24 23:19:00,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-01-24 23:19:00,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-24 23:19:00,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-01-24 23:19:00,061 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 14 [2018-01-24 23:19:00,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:19:00,061 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-01-24 23:19:00,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 23:19:00,061 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-01-24 23:19:00,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 23:19:00,062 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:19:00,062 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:19:00,062 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:19:00,062 INFO L82 PathProgramCache]: Analyzing trace with hash -241471093, now seen corresponding path program 1 times [2018-01-24 23:19:00,063 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:19:00,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:00,064 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:19:00,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:00,064 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:19:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:19:00,077 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:19:00,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:19:00,143 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:19:00,143 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 23:19:00,143 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:19:00,144 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 23:19:00,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 23:19:00,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:19:00,144 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 5 states. [2018-01-24 23:19:00,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:19:00,198 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-01-24 23:19:00,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:19:00,199 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 23:19:00,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:19:00,200 INFO L225 Difference]: With dead ends: 39 [2018-01-24 23:19:00,200 INFO L226 Difference]: Without dead ends: 38 [2018-01-24 23:19:00,200 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:19:00,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-24 23:19:00,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-01-24 23:19:00,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-24 23:19:00,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-24 23:19:00,206 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 14 [2018-01-24 23:19:00,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:19:00,206 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-24 23:19:00,206 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 23:19:00,206 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-24 23:19:00,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 23:19:00,207 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:19:00,207 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:19:00,207 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:19:00,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1727701620, now seen corresponding path program 1 times [2018-01-24 23:19:00,208 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:19:00,209 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:00,209 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:19:00,209 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:00,209 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:19:00,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:19:00,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:19:00,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:19:00,258 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:19:00,258 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 23:19:00,258 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:19:00,259 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 23:19:00,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 23:19:00,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:19:00,260 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 6 states. [2018-01-24 23:19:00,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:19:00,335 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-01-24 23:19:00,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:19:00,336 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 23:19:00,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:19:00,337 INFO L225 Difference]: With dead ends: 38 [2018-01-24 23:19:00,337 INFO L226 Difference]: Without dead ends: 37 [2018-01-24 23:19:00,337 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 23:19:00,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-01-24 23:19:00,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-01-24 23:19:00,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 23:19:00,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-01-24 23:19:00,343 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 19 [2018-01-24 23:19:00,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:19:00,344 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-01-24 23:19:00,344 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 23:19:00,344 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-01-24 23:19:00,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 23:19:00,345 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:19:00,345 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:19:00,345 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:19:00,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1727701619, now seen corresponding path program 1 times [2018-01-24 23:19:00,346 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:19:00,347 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:00,347 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:19:00,347 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:00,347 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:19:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:19:00,363 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:19:00,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:19:00,484 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:19:00,484 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 23:19:00,484 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:19:00,485 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 23:19:00,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 23:19:00,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 23:19:00,485 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 9 states. [2018-01-24 23:19:00,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:19:00,602 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-01-24 23:19:00,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 23:19:00,602 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-24 23:19:00,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:19:00,603 INFO L225 Difference]: With dead ends: 42 [2018-01-24 23:19:00,603 INFO L226 Difference]: Without dead ends: 41 [2018-01-24 23:19:00,603 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-01-24 23:19:00,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-24 23:19:00,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-01-24 23:19:00,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-24 23:19:00,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-01-24 23:19:00,608 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 19 [2018-01-24 23:19:00,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:19:00,608 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-01-24 23:19:00,608 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 23:19:00,608 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-01-24 23:19:00,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 23:19:00,608 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:19:00,609 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] [2018-01-24 23:19:00,609 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:19:00,609 INFO L82 PathProgramCache]: Analyzing trace with hash 929099078, now seen corresponding path program 1 times [2018-01-24 23:19:00,609 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:19:00,610 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:00,610 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:19:00,610 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:00,610 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:19:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:19:00,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:19:00,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:19:00,688 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:19:00,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 23:19:00,688 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:19:00,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 23:19:00,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 23:19:00,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 23:19:00,689 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 7 states. [2018-01-24 23:19:00,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:19:00,822 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-01-24 23:19:00,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 23:19:00,849 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-01-24 23:19:00,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:19:00,850 INFO L225 Difference]: With dead ends: 41 [2018-01-24 23:19:00,850 INFO L226 Difference]: Without dead ends: 40 [2018-01-24 23:19:00,851 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-24 23:19:00,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-24 23:19:00,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-01-24 23:19:00,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-24 23:19:00,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-01-24 23:19:00,856 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 22 [2018-01-24 23:19:00,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:19:00,856 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-01-24 23:19:00,856 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 23:19:00,856 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-01-24 23:19:00,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 23:19:00,857 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:19:00,857 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] [2018-01-24 23:19:00,857 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:19:00,858 INFO L82 PathProgramCache]: Analyzing trace with hash 929099079, now seen corresponding path program 1 times [2018-01-24 23:19:00,858 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:19:00,859 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:00,859 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:19:00,859 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:00,859 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:19:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:19:00,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:19:00,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:19:00,997 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:19:00,997 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 23:19:00,997 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:19:00,998 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 23:19:00,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 23:19:00,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-24 23:19:00,998 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 10 states. [2018-01-24 23:19:01,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:19:01,118 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-01-24 23:19:01,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 23:19:01,119 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-01-24 23:19:01,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:19:01,119 INFO L225 Difference]: With dead ends: 44 [2018-01-24 23:19:01,119 INFO L226 Difference]: Without dead ends: 43 [2018-01-24 23:19:01,120 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-24 23:19:01,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-24 23:19:01,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-01-24 23:19:01,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 23:19:01,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-01-24 23:19:01,124 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 22 [2018-01-24 23:19:01,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:19:01,124 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-01-24 23:19:01,124 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 23:19:01,124 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-01-24 23:19:01,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 23:19:01,125 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:19:01,125 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:19:01,125 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:19:01,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1211791035, now seen corresponding path program 1 times [2018-01-24 23:19:01,125 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:19:01,126 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:01,126 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:19:01,126 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:01,126 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:19:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:19:01,142 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:19:01,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:19:01,281 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:19:01,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 23:19:01,282 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:19:01,282 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 23:19:01,282 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 23:19:01,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-01-24 23:19:01,283 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 12 states. [2018-01-24 23:19:01,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:19:01,587 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2018-01-24 23:19:01,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 23:19:01,587 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-01-24 23:19:01,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:19:01,588 INFO L225 Difference]: With dead ends: 101 [2018-01-24 23:19:01,589 INFO L226 Difference]: Without dead ends: 79 [2018-01-24 23:19:01,589 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2018-01-24 23:19:01,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-24 23:19:01,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2018-01-24 23:19:01,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-24 23:19:01,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-01-24 23:19:01,600 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 27 [2018-01-24 23:19:01,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:19:01,601 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-01-24 23:19:01,601 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 23:19:01,601 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-01-24 23:19:01,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 23:19:01,602 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:19:01,602 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:19:01,602 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:19:01,603 INFO L82 PathProgramCache]: Analyzing trace with hash 394142585, now seen corresponding path program 1 times [2018-01-24 23:19:01,603 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:19:01,604 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:01,604 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:19:01,604 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:01,604 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:19:01,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:19:01,620 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:19:01,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:19:01,847 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:19:01,847 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 23:19:01,848 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-01-24 23:19:01,850 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [12], [15], [19], [20], [22], [23], [27], [33], [44], [49], [55], [57], [58], [59], [60], [61], [64], [75], [76], [77], [79] [2018-01-24 23:19:01,895 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 23:19:01,895 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 23:19:36,391 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 23:19:36,393 INFO L268 AbstractInterpreter]: Visited 26 different actions 36 times. Merged at 6 different actions 10 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-01-24 23:19:36,403 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 23:19:36,404 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:19:36,404 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 23:19:36,423 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:19:36,424 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 23:19:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:19:36,467 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 23:19:36,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 23:19:36,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 23:19:36,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 23:19:36,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:19:36,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 23:19:36,589 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 23:19:36,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-24 23:19:36,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 23:19:36,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 23:19:36,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 23:19:36,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 23:19:36,854 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-24 23:19:36,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:19:36,978 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 23:19:37,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-24 23:19:37,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 23:19:37,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 23:19:37,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 23:19:37,337 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 23:19:37,338 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:19:37,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:19:37,344 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-24 23:19:37,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:19:37,373 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:19:37,373 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 23:19:37,378 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:19:37,378 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 23:19:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:19:37,474 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 23:19:37,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 23:19:37,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 23:19:37,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:19:37,484 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 23:19:37,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 23:19:37,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 23:19:37,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 23:19:37,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:19:37,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:19:37,583 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 23:19:38,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-24 23:19:38,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 23:19:38,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 23:19:38,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 23:19:38,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 23:19:38,450 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:30 [2018-01-24 23:19:38,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:19:38,599 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 23:19:38,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 23:19:38,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 23:19:38,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 23:19:38,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:19:38,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:19:38,761 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-24 23:19:38,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:19:38,835 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 23:19:38,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11, 13, 13] total 46 [2018-01-24 23:19:38,835 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 23:19:38,836 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 23:19:38,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 23:19:38,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1980, Unknown=1, NotChecked=0, Total=2162 [2018-01-24 23:19:38,837 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 21 states. [2018-01-24 23:19:40,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:19:40,206 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2018-01-24 23:19:40,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 23:19:40,207 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2018-01-24 23:19:40,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:19:40,209 INFO L225 Difference]: With dead ends: 79 [2018-01-24 23:19:40,209 INFO L226 Difference]: Without dead ends: 78 [2018-01-24 23:19:40,210 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=358, Invalid=3063, Unknown=1, NotChecked=0, Total=3422 [2018-01-24 23:19:40,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-24 23:19:40,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 68. [2018-01-24 23:19:40,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-24 23:19:40,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-01-24 23:19:40,223 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 27 [2018-01-24 23:19:40,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:19:40,223 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-01-24 23:19:40,223 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 23:19:40,223 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-01-24 23:19:40,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 23:19:40,225 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:19:40,225 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:19:40,225 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcspnErr0RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:19:40,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1089255981, now seen corresponding path program 1 times [2018-01-24 23:19:40,225 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:19:40,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:40,226 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:19:40,227 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:40,227 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:19:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:19:40,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:19:40,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:19:40,604 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:19:40,604 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 23:19:40,604 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-24 23:19:40,605 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [12], [14], [15], [19], [20], [23], [27], [31], [44], [49], [53], [57], [58], [59], [60], [61], [64], [75], [76], [77], [79] [2018-01-24 23:19:40,606 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 23:19:40,606 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown