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/cstrpbrk-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 23:11:55,183 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 23:11:55,185 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 23:11:55,200 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 23:11:55,200 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 23:11:55,201 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 23:11:55,202 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 23:11:55,203 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 23:11:55,205 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 23:11:55,205 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 23:11:55,206 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 23:11:55,206 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 23:11:55,207 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 23:11:55,209 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 23:11:55,210 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 23:11:55,212 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 23:11:55,214 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 23:11:55,216 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 23:11:55,217 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 23:11:55,218 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 23:11:55,221 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 23:11:55,221 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 23:11:55,221 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 23:11:55,222 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 23:11:55,223 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 23:11:55,224 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 23:11:55,224 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 23:11:55,225 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 23:11:55,225 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 23:11:55,225 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 23:11:55,226 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 23:11:55,226 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:11:55,236 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 23:11:55,237 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 23:11:55,238 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 23:11:55,238 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 23:11:55,238 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 23:11:55,238 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 23:11:55,239 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 23:11:55,239 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 23:11:55,240 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 23:11:55,240 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 23:11:55,240 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 23:11:55,240 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 23:11:55,240 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 23:11:55,241 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 23:11:55,241 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 23:11:55,241 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 23:11:55,241 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 23:11:55,242 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 23:11:55,242 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 23:11:55,242 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 23:11:55,242 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 23:11:55,242 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 23:11:55,243 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 23:11:55,243 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 23:11:55,244 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 23:11:55,245 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 23:11:55,245 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 23:11:55,245 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 23:11:55,245 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 23:11:55,245 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 23:11:55,246 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 23:11:55,246 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 23:11:55,246 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 23:11:55,246 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 23:11:55,247 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 23:11:55,247 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 23:11:55,298 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 23:11:55,310 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 23:11:55,315 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 23:11:55,316 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 23:11:55,317 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 23:11:55,318 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-01-24 23:11:55,500 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 23:11:55,507 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 23:11:55,508 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 23:11:55,508 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 23:11:55,516 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 23:11:55,518 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:11:55" (1/1) ... [2018-01-24 23:11:55,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@96a551d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:11:55, skipping insertion in model container [2018-01-24 23:11:55,522 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:11:55" (1/1) ... [2018-01-24 23:11:55,542 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 23:11:55,583 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 23:11:55,702 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 23:11:55,719 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 23:11:55,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:11:55 WrapperNode [2018-01-24 23:11:55,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 23:11:55,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 23:11:55,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 23:11:55,727 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 23:11:55,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:11:55" (1/1) ... [2018-01-24 23:11:55,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:11:55" (1/1) ... [2018-01-24 23:11:55,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:11:55" (1/1) ... [2018-01-24 23:11:55,754 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:11:55" (1/1) ... [2018-01-24 23:11:55,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:11:55" (1/1) ... [2018-01-24 23:11:55,760 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:11:55" (1/1) ... [2018-01-24 23:11:55,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:11:55" (1/1) ... [2018-01-24 23:11:55,763 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 23:11:55,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 23:11:55,764 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 23:11:55,764 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 23:11:55,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:11:55" (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:11:55,814 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 23:11:55,815 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 23:11:55,815 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrpbrk [2018-01-24 23:11:55,815 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 23:11:55,815 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 23:11:55,815 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 23:11:55,815 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 23:11:55,815 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 23:11:55,815 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 23:11:55,815 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 23:11:55,816 INFO L128 BoogieDeclarations]: Found specification of procedure cstrpbrk [2018-01-24 23:11:55,816 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 23:11:55,816 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 23:11:55,816 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 23:11:56,071 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 23:11:56,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:11:56 BoogieIcfgContainer [2018-01-24 23:11:56,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 23:11:56,073 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 23:11:56,073 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 23:11:56,075 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 23:11:56,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:11:55" (1/3) ... [2018-01-24 23:11:56,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cbff5d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:11:56, skipping insertion in model container [2018-01-24 23:11:56,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:11:55" (2/3) ... [2018-01-24 23:11:56,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cbff5d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:11:56, skipping insertion in model container [2018-01-24 23:11:56,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:11:56" (3/3) ... [2018-01-24 23:11:56,095 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-01-24 23:11:56,102 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 23:11:56,108 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-24 23:11:56,145 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 23:11:56,145 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 23:11:56,145 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 23:11:56,145 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 23:11:56,145 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 23:11:56,146 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 23:11:56,146 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 23:11:56,146 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 23:11:56,147 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 23:11:56,170 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-01-24 23:11:56,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 23:11:56,178 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:11:56,179 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:11:56,179 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:11:56,185 INFO L82 PathProgramCache]: Analyzing trace with hash -21044599, now seen corresponding path program 1 times [2018-01-24 23:11:56,188 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:11:56,234 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:11:56,235 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:11:56,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:11:56,235 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:11:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:11:56,300 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:11:56,450 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:11:56,452 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:11:56,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 23:11:56,453 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:11:56,455 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 23:11:56,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 23:11:56,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 23:11:56,549 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 4 states. [2018-01-24 23:11:56,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:11:56,756 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2018-01-24 23:11:56,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 23:11:56,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 23:11:56,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:11:56,766 INFO L225 Difference]: With dead ends: 96 [2018-01-24 23:11:56,766 INFO L226 Difference]: Without dead ends: 54 [2018-01-24 23:11:56,769 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:11:56,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-24 23:11:56,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-24 23:11:56,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 23:11:56,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-01-24 23:11:56,802 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 13 [2018-01-24 23:11:56,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:11:56,802 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-01-24 23:11:56,802 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 23:11:56,803 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-01-24 23:11:56,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 23:11:56,803 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:11:56,803 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:11:56,803 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:11:56,803 INFO L82 PathProgramCache]: Analyzing trace with hash -21044598, now seen corresponding path program 1 times [2018-01-24 23:11:56,804 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:11:56,804 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:11:56,805 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:11:56,805 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:11:56,805 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:11:56,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:11:56,825 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:11:56,973 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:11:56,973 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:11:56,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 23:11:56,974 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:11:56,976 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 23:11:56,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 23:11:56,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:11:56,977 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 6 states. [2018-01-24 23:11:57,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:11:57,108 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-01-24 23:11:57,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:11:57,109 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-24 23:11:57,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:11:57,111 INFO L225 Difference]: With dead ends: 54 [2018-01-24 23:11:57,111 INFO L226 Difference]: Without dead ends: 53 [2018-01-24 23:11:57,112 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-24 23:11:57,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-24 23:11:57,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-24 23:11:57,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 23:11:57,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-01-24 23:11:57,120 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 13 [2018-01-24 23:11:57,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:11:57,121 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-01-24 23:11:57,121 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 23:11:57,121 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-01-24 23:11:57,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 23:11:57,122 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:11:57,122 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:11:57,122 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:11:57,122 INFO L82 PathProgramCache]: Analyzing trace with hash -652382516, now seen corresponding path program 1 times [2018-01-24 23:11:57,122 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:11:57,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:11:57,124 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:11:57,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:11:57,124 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:11:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:11:57,140 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:11:57,173 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:11:57,173 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:11:57,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 23:11:57,174 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:11:57,174 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 23:11:57,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 23:11:57,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 23:11:57,175 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 4 states. [2018-01-24 23:11:57,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:11:57,263 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-01-24 23:11:57,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 23:11:57,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 23:11:57,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:11:57,265 INFO L225 Difference]: With dead ends: 53 [2018-01-24 23:11:57,265 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 23:11:57,265 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:11:57,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 23:11:57,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-24 23:11:57,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 23:11:57,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-01-24 23:11:57,270 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 14 [2018-01-24 23:11:57,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:11:57,270 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-01-24 23:11:57,270 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 23:11:57,270 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-01-24 23:11:57,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 23:11:57,271 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:11:57,271 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:11:57,271 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:11:57,272 INFO L82 PathProgramCache]: Analyzing trace with hash -652382515, now seen corresponding path program 1 times [2018-01-24 23:11:57,272 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:11:57,273 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:11:57,273 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:11:57,273 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:11:57,274 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:11:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:11:57,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:11:57,359 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:11:57,359 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:11:57,359 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 23:11:57,359 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:11:57,359 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 23:11:57,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 23:11:57,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:11:57,360 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-01-24 23:11:57,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:11:57,453 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-01-24 23:11:57,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:11:57,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 23:11:57,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:11:57,455 INFO L225 Difference]: With dead ends: 52 [2018-01-24 23:11:57,455 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 23:11:57,456 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:11:57,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 23:11:57,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-24 23:11:57,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 23:11:57,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-01-24 23:11:57,463 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 14 [2018-01-24 23:11:57,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:11:57,464 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-01-24 23:11:57,464 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 23:11:57,464 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-01-24 23:11:57,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 23:11:57,465 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:11:57,465 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:11:57,465 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:11:57,465 INFO L82 PathProgramCache]: Analyzing trace with hash 470787565, now seen corresponding path program 1 times [2018-01-24 23:11:57,465 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:11:57,466 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:11:57,467 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:11:57,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:11:57,467 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:11:57,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:11:57,483 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:11:57,534 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:11:57,535 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:11:57,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 23:11:57,535 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:11:57,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 23:11:57,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 23:11:57,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:11:57,536 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 5 states. [2018-01-24 23:11:57,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:11:57,628 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-01-24 23:11:57,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 23:11:57,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 23:11:57,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:11:57,629 INFO L225 Difference]: With dead ends: 51 [2018-01-24 23:11:57,629 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 23:11:57,629 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:11:57,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 23:11:57,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-24 23:11:57,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 23:11:57,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-01-24 23:11:57,635 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 18 [2018-01-24 23:11:57,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:11:57,635 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-01-24 23:11:57,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 23:11:57,635 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-01-24 23:11:57,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 23:11:57,635 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:11:57,636 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:11:57,636 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:11:57,636 INFO L82 PathProgramCache]: Analyzing trace with hash 470787566, now seen corresponding path program 1 times [2018-01-24 23:11:57,636 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:11:57,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:11:57,637 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:11:57,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:11:57,637 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:11:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:11:57,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:11:57,758 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:11:57,758 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:11:57,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 23:11:57,758 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:11:57,759 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 23:11:57,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 23:11:57,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 23:11:57,759 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 8 states. [2018-01-24 23:11:57,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:11:57,901 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2018-01-24 23:11:57,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 23:11:57,901 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-24 23:11:57,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:11:57,904 INFO L225 Difference]: With dead ends: 75 [2018-01-24 23:11:57,904 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 23:11:57,905 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-24 23:11:57,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 23:11:57,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2018-01-24 23:11:57,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 23:11:57,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-01-24 23:11:57,911 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 18 [2018-01-24 23:11:57,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:11:57,911 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-01-24 23:11:57,911 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 23:11:57,911 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-01-24 23:11:57,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 23:11:57,912 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:11:57,912 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] [2018-01-24 23:11:57,912 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:11:57,912 INFO L82 PathProgramCache]: Analyzing trace with hash 947097224, now seen corresponding path program 1 times [2018-01-24 23:11:57,913 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:11:57,913 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:11:57,914 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:11:57,914 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:11:57,914 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:11:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:11:57,925 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:11:57,959 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:11:57,960 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:11:57,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 23:11:57,960 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:11:57,961 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 23:11:57,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 23:11:57,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:11:57,968 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 6 states. [2018-01-24 23:11:58,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:11:58,060 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-01-24 23:11:58,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:11:58,061 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-24 23:11:58,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:11:58,062 INFO L225 Difference]: With dead ends: 56 [2018-01-24 23:11:58,062 INFO L226 Difference]: Without dead ends: 53 [2018-01-24 23:11:58,062 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:11:58,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-24 23:11:58,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-01-24 23:11:58,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 23:11:58,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-01-24 23:11:58,067 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 23 [2018-01-24 23:11:58,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:11:58,068 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-01-24 23:11:58,068 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 23:11:58,068 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-01-24 23:11:58,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 23:11:58,069 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:11:58,069 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] [2018-01-24 23:11:58,069 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:11:58,069 INFO L82 PathProgramCache]: Analyzing trace with hash 947097225, now seen corresponding path program 1 times [2018-01-24 23:11:58,069 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:11:58,070 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:11:58,070 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:11:58,070 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:11:58,070 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:11:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:11:58,080 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:11:58,250 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:11:58,251 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:11:58,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 23:11:58,251 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:11:58,251 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 23:11:58,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 23:11:58,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 23:11:58,252 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 9 states. [2018-01-24 23:11:58,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:11:58,550 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-01-24 23:11:58,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 23:11:58,551 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-01-24 23:11:58,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:11:58,552 INFO L225 Difference]: With dead ends: 70 [2018-01-24 23:11:58,553 INFO L226 Difference]: Without dead ends: 67 [2018-01-24 23:11:58,553 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-24 23:11:58,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-24 23:11:58,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2018-01-24 23:11:58,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-24 23:11:58,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-01-24 23:11:58,565 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 23 [2018-01-24 23:11:58,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:11:58,566 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-01-24 23:11:58,566 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 23:11:58,566 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-01-24 23:11:58,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 23:11:58,567 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:11:58,567 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:11:58,568 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:11:58,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1236428998, now seen corresponding path program 1 times [2018-01-24 23:11:58,568 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:11:58,569 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:11:58,569 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:11:58,569 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:11:58,569 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:11:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:11:58,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:11:58,734 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:11:58,734 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:11:58,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 23:11:58,735 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:11:58,735 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 23:11:58,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 23:11:58,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:11:58,736 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 6 states. [2018-01-24 23:11:59,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:11:59,224 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2018-01-24 23:11:59,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 23:11:59,225 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-01-24 23:11:59,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:11:59,226 INFO L225 Difference]: With dead ends: 58 [2018-01-24 23:11:59,226 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 23:11:59,227 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 23:11:59,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 23:11:59,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-24 23:11:59,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 23:11:59,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-01-24 23:11:59,235 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 28 [2018-01-24 23:11:59,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:11:59,235 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-01-24 23:11:59,235 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 23:11:59,236 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-01-24 23:11:59,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 23:11:59,239 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:11:59,239 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:11:59,239 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:11:59,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1333847614, now seen corresponding path program 1 times [2018-01-24 23:11:59,240 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:11:59,241 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:11:59,241 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:11:59,241 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:11:59,242 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:11:59,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:11:59,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:11:59,294 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:11:59,294 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:11:59,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 23:11:59,294 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:11:59,295 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 23:11:59,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 23:11:59,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 23:11:59,295 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 3 states. [2018-01-24 23:11:59,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:11:59,307 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2018-01-24 23:11:59,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 23:11:59,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-01-24 23:11:59,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:11:59,308 INFO L225 Difference]: With dead ends: 78 [2018-01-24 23:11:59,308 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 23:11:59,308 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 23:11:59,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 23:11:59,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-24 23:11:59,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 23:11:59,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-01-24 23:11:59,316 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 28 [2018-01-24 23:11:59,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:11:59,316 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-01-24 23:11:59,317 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 23:11:59,317 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-01-24 23:11:59,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 23:11:59,318 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:11:59,318 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:11:59,318 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:11:59,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1745742785, now seen corresponding path program 1 times [2018-01-24 23:11:59,318 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:11:59,319 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:11:59,320 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:11:59,320 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:11:59,320 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:11:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:11:59,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:11:59,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 23:11:59,619 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:11:59,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-24 23:11:59,619 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:11:59,620 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 23:11:59,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 23:11:59,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-01-24 23:11:59,621 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 11 states. [2018-01-24 23:11:59,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:11:59,968 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2018-01-24 23:11:59,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 23:11:59,968 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-01-24 23:11:59,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:11:59,969 INFO L225 Difference]: With dead ends: 93 [2018-01-24 23:11:59,969 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 23:11:59,969 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-01-24 23:11:59,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 23:11:59,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-24 23:11:59,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 23:11:59,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-24 23:11:59,975 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 30 [2018-01-24 23:11:59,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:11:59,975 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-24 23:11:59,975 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 23:11:59,976 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-24 23:11:59,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 23:11:59,976 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:11:59,977 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:11:59,977 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:11:59,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1611729279, now seen corresponding path program 1 times [2018-01-24 23:11:59,977 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:11:59,978 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:11:59,978 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:11:59,978 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:11:59,978 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:11:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:11:59,997 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:12:00,231 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:12:00,232 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:12:00,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-24 23:12:00,232 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:12:00,232 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 23:12:00,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 23:12:00,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-24 23:12:00,233 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 11 states. [2018-01-24 23:12:00,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:12:00,528 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2018-01-24 23:12:00,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 23:12:00,533 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-01-24 23:12:00,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:12:00,534 INFO L225 Difference]: With dead ends: 107 [2018-01-24 23:12:00,535 INFO L226 Difference]: Without dead ends: 77 [2018-01-24 23:12:00,535 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-01-24 23:12:00,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-24 23:12:00,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-01-24 23:12:00,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-24 23:12:00,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-01-24 23:12:00,546 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 30 [2018-01-24 23:12:00,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:12:00,547 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-01-24 23:12:00,547 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 23:12:00,552 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-01-24 23:12:00,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 23:12:00,553 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:12:00,554 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:12:00,554 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:12:00,554 INFO L82 PathProgramCache]: Analyzing trace with hash -193709055, now seen corresponding path program 1 times [2018-01-24 23:12:00,554 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:12:00,555 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:12:00,555 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:12:00,555 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:12:00,556 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:12:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:12:00,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:12:00,752 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:12:00,753 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:12:00,753 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 23:12:00,754 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-01-24 23:12:00,756 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [7], [14], [15], [18], [22], [24], [26], [27], [30], [31], [34], [42], [63], [68], [74], [76], [77], [78], [79], [80], [83], [94], [95], [96], [98] [2018-01-24 23:12:00,808 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 23:12:00,808 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 23:12:31,028 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 23:12:31,029 INFO L268 AbstractInterpreter]: Visited 29 different actions 45 times. Merged at 8 different actions 16 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-01-24 23:12:31,050 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 23:12:31,050 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:12:31,050 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:12:31,060 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:12:31,060 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 23:12:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:12:31,106 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 23:12:31,137 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:12:31,139 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:12:31,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 23:12:31,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:12:31,153 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:12:31,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 23:12:31,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-01-24 23:12:31,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 23:12:31,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 23:12:31,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 23:12:31,344 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:12:31,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-24 23:12:31,468 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:12:31,469 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 23:12:31,871 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:12:31,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 23:12:31,879 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:12:31,888 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:12:31,889 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 23:12:31,891 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:12:31,896 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:12:31,896 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-24 23:12:31,903 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:12:31,923 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:12:31,924 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:12:31,930 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:12:31,930 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 23:12:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:12:31,995 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 23:12:31,999 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:12:31,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 23:12:32,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:12:32,013 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 23:12:32,072 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:12:32,074 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:12:32,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 23:12:32,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:12:32,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:12:32,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 23:12:32,198 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:12:32,203 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-24 23:12:32,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 23:12:32,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 23:12:32,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 23:12:32,216 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:30 [2018-01-24 23:12:32,338 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:12:32,339 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 23:12:32,436 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:12:32,443 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:12:32,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 23:12:32,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:12:32,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:12:32,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-24 23:12:32,523 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:12:32,525 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 23:12:32,525 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10, 12, 12] total 41 [2018-01-24 23:12:32,525 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 23:12:32,526 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 23:12:32,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 23:12:32,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1559, Unknown=0, NotChecked=0, Total=1722 [2018-01-24 23:12:32,526 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 20 states. [2018-01-24 23:12:33,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:12:33,599 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2018-01-24 23:12:33,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 23:12:33,600 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2018-01-24 23:12:33,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:12:33,602 INFO L225 Difference]: With dead ends: 106 [2018-01-24 23:12:33,602 INFO L226 Difference]: Without dead ends: 103 [2018-01-24 23:12:33,602 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 87 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=320, Invalid=2332, Unknown=0, NotChecked=0, Total=2652 [2018-01-24 23:12:33,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-24 23:12:33,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2018-01-24 23:12:33,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-24 23:12:33,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2018-01-24 23:12:33,614 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 30 [2018-01-24 23:12:33,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:12:33,615 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2018-01-24 23:12:33,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-24 23:12:33,615 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2018-01-24 23:12:33,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 23:12:33,616 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:12:33,616 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:12:33,616 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:12:33,616 INFO L82 PathProgramCache]: Analyzing trace with hash -276872451, now seen corresponding path program 1 times [2018-01-24 23:12:33,616 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:12:33,617 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:12:33,618 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:12:33,618 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:12:33,618 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:12:33,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:12:33,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:12:33,716 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:12:33,716 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:12:33,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 23:12:33,716 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:12:33,717 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 23:12:33,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 23:12:33,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-24 23:12:33,717 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 10 states. [2018-01-24 23:12:34,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:12:34,035 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2018-01-24 23:12:34,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 23:12:34,035 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-01-24 23:12:34,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:12:34,036 INFO L225 Difference]: With dead ends: 132 [2018-01-24 23:12:34,036 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 23:12:34,036 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-01-24 23:12:34,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 23:12:34,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-01-24 23:12:34,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-24 23:12:34,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-01-24 23:12:34,044 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 31 [2018-01-24 23:12:34,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:12:34,045 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-01-24 23:12:34,045 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 23:12:34,045 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-01-24 23:12:34,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 23:12:34,045 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:12:34,046 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:12:34,046 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:12:34,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1615321176, now seen corresponding path program 1 times [2018-01-24 23:12:34,046 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:12:34,047 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:12:34,047 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:12:34,047 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:12:34,047 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:12:34,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:12:34,064 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:12:34,365 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:12:34,366 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:12:34,366 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 23:12:34,366 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-01-24 23:12:34,366 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [7], [9], [14], [15], [18], [22], [24], [27], [30], [31], [34], [40], [46], [52], [54], [63], [68], [74], [76], [77], [78], [79], [80], [83], [94], [95], [96], [98] [2018-01-24 23:12:34,368 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 23:12:34,369 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-24 23:12:47,928 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-24 23:12:47,929 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-24 23:12:47,929 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 23:12:47,929 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:12:47,929 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-24 23:12:47,934 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:12:47,934 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 23:12:47,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:12:47,955 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 23:12:47,957 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 23:12:47,957 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 23:12:47,960 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 23:12:47,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:12:47 BoogieIcfgContainer [2018-01-24 23:12:47,961 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 23:12:47,962 INFO L168 Benchmark]: Toolchain (without parser) took 52460.67 ms. Allocated memory was 300.9 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 261.0 MB in the beginning and 578.8 MB in the end (delta: -317.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. [2018-01-24 23:12:47,962 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 300.9 MB. Free memory is still 267.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 23:12:47,962 INFO L168 Benchmark]: CACSL2BoogieTranslator took 218.59 ms. Allocated memory is still 300.9 MB. Free memory was 260.0 MB in the beginning and 249.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-24 23:12:47,963 INFO L168 Benchmark]: Boogie Preprocessor took 36.17 ms. Allocated memory is still 300.9 MB. Free memory was 249.8 MB in the beginning and 247.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 23:12:47,963 INFO L168 Benchmark]: RCFGBuilder took 308.32 ms. Allocated memory is still 300.9 MB. Free memory was 247.8 MB in the beginning and 228.2 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 5.3 GB. [2018-01-24 23:12:47,963 INFO L168 Benchmark]: TraceAbstraction took 51888.09 ms. Allocated memory was 300.9 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 228.2 MB in the beginning and 578.8 MB in the end (delta: -350.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. [2018-01-24 23:12:47,965 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.21 ms. Allocated memory is still 300.9 MB. Free memory is still 267.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 218.59 ms. Allocated memory is still 300.9 MB. Free memory was 260.0 MB in the beginning and 249.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.17 ms. Allocated memory is still 300.9 MB. Free memory was 249.8 MB in the beginning and 247.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 308.32 ms. Allocated memory is still 300.9 MB. Free memory was 247.8 MB in the beginning and 228.2 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 51888.09 ms. Allocated memory was 300.9 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 228.2 MB in the beginning and 578.8 MB in the end (delta: -350.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 28 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 378 LocStat_NO_SUPPORTING_DISEQUALITIES : 82 LocStat_NO_DISJUNCTIONS : -56 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 35 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 68 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 38 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.459815 RENAME_VARIABLES(MILLISECONDS) : 0.304763 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.391339 PROJECTAWAY(MILLISECONDS) : 0.959313 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.100746 DISJOIN(MILLISECONDS) : 0.409120 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.335550 ADD_EQUALITY(MILLISECONDS) : 0.016203 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008058 #CONJOIN_DISJUNCTIVE : 81 #RENAME_VARIABLES : 135 #UNFREEZE : 0 #CONJOIN : 140 #PROJECTAWAY : 109 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 15 #RENAME_VARIABLES_DISJUNCTIVE : 123 #ADD_EQUALITY : 70 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 555]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 34 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 58 locations, 15 error locations. TIMEOUT Result, 51.8s OverallTime, 15 OverallIterations, 2 TraceHistogramMax, 3.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 551 SDtfs, 836 SDslu, 1415 SDs, 0 SdLazy, 1286 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 262 GetRequests, 107 SyntacticMatches, 6 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 43.8s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 57 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 373 NumberOfCodeBlocks, 373 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 415 ConstructedInterpolants, 14 QuantifiedInterpolants, 71331 SizeOfPredicates, 25 NumberOfNonLiveVariables, 268 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 18 InterpolantComputations, 13 PerfectInterpolantSequences, 8/18 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/cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_23-12-47-973.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_23-12-47-973.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_23-12-47-973.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_23-12-47-973.csv Completed graceful shutdown