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_RubberTaipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 13:35:51,200 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 13:35:51,202 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 13:35:51,217 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 13:35:51,217 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 13:35:51,218 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 13:35:51,219 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 13:35:51,221 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 13:35:51,223 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 13:35:51,224 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 13:35:51,225 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 13:35:51,226 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 13:35:51,227 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 13:35:51,228 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 13:35:51,229 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 13:35:51,231 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 13:35:51,234 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 13:35:51,236 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 13:35:51,237 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 13:35:51,239 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 13:35:51,241 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 13:35:51,242 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 13:35:51,242 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 13:35:51,243 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 13:35:51,244 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 13:35:51,245 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 13:35:51,245 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 13:35:51,246 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 13:35:51,246 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 13:35:51,247 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 13:35:51,247 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 13:35:51,247 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 13:35:51,256 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 13:35:51,256 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 13:35:51,257 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 13:35:51,257 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 13:35:51,257 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 13:35:51,257 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 13:35:51,257 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 13:35:51,257 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 13:35:51,258 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 13:35:51,258 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 13:35:51,258 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 13:35:51,258 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 13:35:51,258 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 13:35:51,258 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 13:35:51,258 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 13:35:51,258 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 13:35:51,259 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 13:35:51,259 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 13:35:51,259 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 13:35:51,259 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 13:35:51,259 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 13:35:51,259 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 13:35:51,259 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 13:35:51,260 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:35:51,260 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 13:35:51,260 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 13:35:51,260 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 13:35:51,260 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 13:35:51,261 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 13:35:51,261 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 13:35:51,261 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 13:35:51,261 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 13:35:51,262 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 13:35:51,262 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 13:35:51,294 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 13:35:51,304 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 13:35:51,308 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 13:35:51,309 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 13:35:51,309 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 13:35:51,310 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-01-24 13:35:51,483 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 13:35:51,488 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 13:35:51,489 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 13:35:51,489 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 13:35:51,494 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 13:35:51,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:35:51" (1/1) ... [2018-01-24 13:35:51,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@321f72c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:35:51, skipping insertion in model container [2018-01-24 13:35:51,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:35:51" (1/1) ... [2018-01-24 13:35:51,512 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:35:51,553 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:35:51,679 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:35:51,706 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:35:51,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:35:51 WrapperNode [2018-01-24 13:35:51,717 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 13:35:51,718 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 13:35:51,719 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 13:35:51,719 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 13:35:51,730 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:35:51" (1/1) ... [2018-01-24 13:35:51,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:35:51" (1/1) ... [2018-01-24 13:35:51,741 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:35:51" (1/1) ... [2018-01-24 13:35:51,741 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:35:51" (1/1) ... [2018-01-24 13:35:51,750 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:35:51" (1/1) ... [2018-01-24 13:35:51,756 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:35:51" (1/1) ... [2018-01-24 13:35:51,758 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:35:51" (1/1) ... [2018-01-24 13:35:51,761 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 13:35:51,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 13:35:51,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 13:35:51,762 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 13:35:51,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:35:51" (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 13:35:51,814 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 13:35:51,815 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 13:35:51,815 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 13:35:51,815 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 13:35:51,815 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 13:35:51,815 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 13:35:51,815 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 13:35:51,815 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 13:35:51,815 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 13:35:51,815 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 13:35:51,816 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 13:35:51,816 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 13:35:51,816 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 13:35:51,816 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-24 13:35:51,816 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 13:35:51,816 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 13:35:51,816 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 13:35:52,420 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 13:35:52,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:35:52 BoogieIcfgContainer [2018-01-24 13:35:52,421 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 13:35:52,421 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 13:35:52,421 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 13:35:52,423 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 13:35:52,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 01:35:51" (1/3) ... [2018-01-24 13:35:52,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf9222a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:35:52, skipping insertion in model container [2018-01-24 13:35:52,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:35:51" (2/3) ... [2018-01-24 13:35:52,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf9222a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:35:52, skipping insertion in model container [2018-01-24 13:35:52,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:35:52" (3/3) ... [2018-01-24 13:35:52,427 INFO L105 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-01-24 13:35:52,433 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 13:35:52,440 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 67 error locations. [2018-01-24 13:35:52,492 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 13:35:52,493 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 13:35:52,493 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 13:35:52,493 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 13:35:52,493 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 13:35:52,493 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 13:35:52,494 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 13:35:52,494 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 13:35:52,495 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 13:35:52,520 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states. [2018-01-24 13:35:52,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 13:35:52,528 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:35:52,529 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:35:52,529 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:35:52,535 INFO L82 PathProgramCache]: Analyzing trace with hash 726209746, now seen corresponding path program 1 times [2018-01-24 13:35:52,538 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:35:52,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:52,606 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:35:52,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:52,606 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:35:52,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:35:52,653 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:35:52,725 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 13:35:52,727 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:35:52,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:35:52,727 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:35:52,730 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:35:52,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:35:52,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:35:52,744 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 4 states. [2018-01-24 13:35:53,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:35:53,150 INFO L93 Difference]: Finished difference Result 316 states and 377 transitions. [2018-01-24 13:35:53,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:35:53,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 13:35:53,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:35:53,161 INFO L225 Difference]: With dead ends: 316 [2018-01-24 13:35:53,161 INFO L226 Difference]: Without dead ends: 177 [2018-01-24 13:35:53,165 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 13:35:53,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-01-24 13:35:53,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 154. [2018-01-24 13:35:53,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-24 13:35:53,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 159 transitions. [2018-01-24 13:35:53,205 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 159 transitions. Word has length 8 [2018-01-24 13:35:53,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:35:53,206 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 159 transitions. [2018-01-24 13:35:53,206 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:35:53,206 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 159 transitions. [2018-01-24 13:35:53,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 13:35:53,206 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:35:53,206 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:35:53,206 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:35:53,207 INFO L82 PathProgramCache]: Analyzing trace with hash 726209747, now seen corresponding path program 1 times [2018-01-24 13:35:53,207 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:35:53,208 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:53,208 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:35:53,208 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:53,208 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:35:53,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:35:53,226 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:35:53,316 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 13:35:53,317 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:35:53,317 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:35:53,317 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:35:53,319 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:35:53,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:35:53,319 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:35:53,320 INFO L87 Difference]: Start difference. First operand 154 states and 159 transitions. Second operand 4 states. [2018-01-24 13:35:53,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:35:53,497 INFO L93 Difference]: Finished difference Result 154 states and 159 transitions. [2018-01-24 13:35:53,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:35:53,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 13:35:53,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:35:53,499 INFO L225 Difference]: With dead ends: 154 [2018-01-24 13:35:53,500 INFO L226 Difference]: Without dead ends: 151 [2018-01-24 13:35:53,501 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 13:35:53,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-01-24 13:35:53,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-01-24 13:35:53,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-24 13:35:53,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 156 transitions. [2018-01-24 13:35:53,514 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 156 transitions. Word has length 8 [2018-01-24 13:35:53,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:35:53,514 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 156 transitions. [2018-01-24 13:35:53,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:35:53,515 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 156 transitions. [2018-01-24 13:35:53,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 13:35:53,515 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:35:53,516 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:35:53,516 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:35:53,516 INFO L82 PathProgramCache]: Analyzing trace with hash 3311897, now seen corresponding path program 1 times [2018-01-24 13:35:53,516 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:35:53,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:53,518 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:35:53,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:53,518 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:35:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:35:53,541 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:35:53,581 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 13:35:53,581 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:35:53,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:35:53,581 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:35:53,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:35:53,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:35:53,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:35:53,582 INFO L87 Difference]: Start difference. First operand 151 states and 156 transitions. Second operand 4 states. [2018-01-24 13:35:53,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:35:53,716 INFO L93 Difference]: Finished difference Result 170 states and 180 transitions. [2018-01-24 13:35:53,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:35:53,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 13:35:53,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:35:53,717 INFO L225 Difference]: With dead ends: 170 [2018-01-24 13:35:53,717 INFO L226 Difference]: Without dead ends: 162 [2018-01-24 13:35:53,718 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 13:35:53,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-01-24 13:35:53,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 147. [2018-01-24 13:35:53,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-01-24 13:35:53,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 154 transitions. [2018-01-24 13:35:53,727 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 154 transitions. Word has length 13 [2018-01-24 13:35:53,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:35:53,728 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 154 transitions. [2018-01-24 13:35:53,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:35:53,728 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 154 transitions. [2018-01-24 13:35:53,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 13:35:53,728 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:35:53,729 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:35:53,729 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:35:53,729 INFO L82 PathProgramCache]: Analyzing trace with hash 3311898, now seen corresponding path program 1 times [2018-01-24 13:35:53,729 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:35:53,731 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:53,731 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:35:53,731 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:53,731 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:35:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:35:53,749 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:35:53,813 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 13:35:53,813 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:35:53,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:35:53,814 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:35:53,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:35:53,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:35:53,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:35:53,815 INFO L87 Difference]: Start difference. First operand 147 states and 154 transitions. Second operand 4 states. [2018-01-24 13:35:53,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:35:53,973 INFO L93 Difference]: Finished difference Result 167 states and 173 transitions. [2018-01-24 13:35:53,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:35:53,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 13:35:53,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:35:53,975 INFO L225 Difference]: With dead ends: 167 [2018-01-24 13:35:53,975 INFO L226 Difference]: Without dead ends: 159 [2018-01-24 13:35:53,976 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 13:35:53,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-24 13:35:53,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 151. [2018-01-24 13:35:53,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-24 13:35:53,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 158 transitions. [2018-01-24 13:35:53,988 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 158 transitions. Word has length 13 [2018-01-24 13:35:53,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:35:53,989 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 158 transitions. [2018-01-24 13:35:53,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:35:53,989 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 158 transitions. [2018-01-24 13:35:53,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 13:35:53,990 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:35:53,990 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:35:53,990 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:35:53,990 INFO L82 PathProgramCache]: Analyzing trace with hash -969711578, now seen corresponding path program 1 times [2018-01-24 13:35:53,991 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:35:53,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:53,992 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:35:53,993 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:53,993 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:35:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:35:54,022 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:35:54,128 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 13:35:54,128 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:35:54,128 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:35:54,128 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:35:54,129 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:35:54,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:35:54,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:35:54,129 INFO L87 Difference]: Start difference. First operand 151 states and 158 transitions. Second operand 4 states. [2018-01-24 13:35:54,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:35:54,269 INFO L93 Difference]: Finished difference Result 170 states and 178 transitions. [2018-01-24 13:35:54,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:35:54,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-01-24 13:35:54,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:35:54,270 INFO L225 Difference]: With dead ends: 170 [2018-01-24 13:35:54,270 INFO L226 Difference]: Without dead ends: 154 [2018-01-24 13:35:54,271 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 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 13:35:54,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-24 13:35:54,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 139. [2018-01-24 13:35:54,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-01-24 13:35:54,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 148 transitions. [2018-01-24 13:35:54,279 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 148 transitions. Word has length 21 [2018-01-24 13:35:54,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:35:54,279 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 148 transitions. [2018-01-24 13:35:54,279 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:35:54,280 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 148 transitions. [2018-01-24 13:35:54,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 13:35:54,280 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:35:54,280 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:35:54,281 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:35:54,281 INFO L82 PathProgramCache]: Analyzing trace with hash -969711577, now seen corresponding path program 1 times [2018-01-24 13:35:54,281 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:35:54,282 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:54,282 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:35:54,283 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:54,283 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:35:54,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:35:54,300 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:35:54,431 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 13:35:54,432 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:35:54,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 13:35:54,432 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:35:54,432 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 13:35:54,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 13:35:54,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:35:54,433 INFO L87 Difference]: Start difference. First operand 139 states and 148 transitions. Second operand 7 states. [2018-01-24 13:35:54,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:35:54,755 INFO L93 Difference]: Finished difference Result 182 states and 192 transitions. [2018-01-24 13:35:54,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:35:54,756 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-01-24 13:35:54,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:35:54,757 INFO L225 Difference]: With dead ends: 182 [2018-01-24 13:35:54,757 INFO L226 Difference]: Without dead ends: 175 [2018-01-24 13:35:54,758 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-24 13:35:54,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-01-24 13:35:54,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 150. [2018-01-24 13:35:54,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-24 13:35:54,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 162 transitions. [2018-01-24 13:35:54,765 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 162 transitions. Word has length 21 [2018-01-24 13:35:54,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:35:54,765 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 162 transitions. [2018-01-24 13:35:54,765 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 13:35:54,766 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 162 transitions. [2018-01-24 13:35:54,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 13:35:54,766 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:35:54,767 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 13:35:54,767 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:35:54,767 INFO L82 PathProgramCache]: Analyzing trace with hash 115077033, now seen corresponding path program 1 times [2018-01-24 13:35:54,767 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:35:54,768 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:54,769 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:35:54,769 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:54,769 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:35:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:35:54,785 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:35:54,825 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 13:35:54,826 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:35:54,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:35:54,826 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:35:54,826 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:35:54,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:35:54,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:35:54,827 INFO L87 Difference]: Start difference. First operand 150 states and 162 transitions. Second operand 5 states. [2018-01-24 13:35:55,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:35:55,040 INFO L93 Difference]: Finished difference Result 198 states and 215 transitions. [2018-01-24 13:35:55,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:35:55,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-01-24 13:35:55,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:35:55,042 INFO L225 Difference]: With dead ends: 198 [2018-01-24 13:35:55,043 INFO L226 Difference]: Without dead ends: 197 [2018-01-24 13:35:55,043 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:35:55,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-01-24 13:35:55,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 149. [2018-01-24 13:35:55,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-01-24 13:35:55,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 160 transitions. [2018-01-24 13:35:55,051 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 160 transitions. Word has length 23 [2018-01-24 13:35:55,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:35:55,052 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 160 transitions. [2018-01-24 13:35:55,052 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:35:55,052 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 160 transitions. [2018-01-24 13:35:55,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 13:35:55,052 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:35:55,053 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 13:35:55,053 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:35:55,053 INFO L82 PathProgramCache]: Analyzing trace with hash 115077034, now seen corresponding path program 1 times [2018-01-24 13:35:55,053 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:35:55,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:55,054 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:35:55,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:55,054 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:35:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:35:55,069 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:35:55,140 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 13:35:55,140 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:35:55,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:35:55,141 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:35:55,141 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:35:55,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:35:55,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:35:55,142 INFO L87 Difference]: Start difference. First operand 149 states and 160 transitions. Second operand 5 states. [2018-01-24 13:35:55,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:35:55,348 INFO L93 Difference]: Finished difference Result 220 states and 238 transitions. [2018-01-24 13:35:55,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:35:55,349 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-01-24 13:35:55,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:35:55,350 INFO L225 Difference]: With dead ends: 220 [2018-01-24 13:35:55,350 INFO L226 Difference]: Without dead ends: 219 [2018-01-24 13:35:55,350 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:35:55,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-01-24 13:35:55,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 148. [2018-01-24 13:35:55,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-01-24 13:35:55,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2018-01-24 13:35:55,356 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 23 [2018-01-24 13:35:55,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:35:55,356 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions. [2018-01-24 13:35:55,356 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:35:55,356 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions. [2018-01-24 13:35:55,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 13:35:55,357 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:35:55,357 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] [2018-01-24 13:35:55,357 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:35:55,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1386253035, now seen corresponding path program 1 times [2018-01-24 13:35:55,357 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:35:55,358 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:55,358 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:35:55,358 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:55,359 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:35:55,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:35:55,376 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:35:55,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:35:55,484 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:35:55,484 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 13:35:55,484 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:35:55,484 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 13:35:55,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 13:35:55,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 13:35:55,485 INFO L87 Difference]: Start difference. First operand 148 states and 158 transitions. Second operand 9 states. [2018-01-24 13:35:56,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:35:56,378 INFO L93 Difference]: Finished difference Result 162 states and 172 transitions. [2018-01-24 13:35:56,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 13:35:56,378 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-01-24 13:35:56,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:35:56,379 INFO L225 Difference]: With dead ends: 162 [2018-01-24 13:35:56,379 INFO L226 Difference]: Without dead ends: 161 [2018-01-24 13:35:56,380 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-01-24 13:35:56,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-01-24 13:35:56,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 147. [2018-01-24 13:35:56,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-01-24 13:35:56,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 157 transitions. [2018-01-24 13:35:56,388 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 157 transitions. Word has length 27 [2018-01-24 13:35:56,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:35:56,388 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 157 transitions. [2018-01-24 13:35:56,388 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 13:35:56,388 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 157 transitions. [2018-01-24 13:35:56,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 13:35:56,389 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:35:56,389 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] [2018-01-24 13:35:56,389 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:35:56,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1386253036, now seen corresponding path program 1 times [2018-01-24 13:35:56,389 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:35:56,390 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:56,391 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:35:56,391 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:56,391 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:35:56,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:35:56,411 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:35:56,597 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 13:35:56,598 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:35:56,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 13:35:56,598 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:35:56,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 13:35:56,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 13:35:56,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-24 13:35:56,599 INFO L87 Difference]: Start difference. First operand 147 states and 157 transitions. Second operand 10 states. [2018-01-24 13:35:57,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:35:57,320 INFO L93 Difference]: Finished difference Result 188 states and 199 transitions. [2018-01-24 13:35:57,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 13:35:57,321 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-01-24 13:35:57,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:35:57,322 INFO L225 Difference]: With dead ends: 188 [2018-01-24 13:35:57,322 INFO L226 Difference]: Without dead ends: 177 [2018-01-24 13:35:57,322 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-01-24 13:35:57,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-01-24 13:35:57,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 152. [2018-01-24 13:35:57,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-24 13:35:57,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 162 transitions. [2018-01-24 13:35:57,328 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 162 transitions. Word has length 27 [2018-01-24 13:35:57,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:35:57,329 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 162 transitions. [2018-01-24 13:35:57,329 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 13:35:57,329 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2018-01-24 13:35:57,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 13:35:57,330 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:35:57,330 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:35:57,331 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:35:57,331 INFO L82 PathProgramCache]: Analyzing trace with hash 78293977, now seen corresponding path program 1 times [2018-01-24 13:35:57,331 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:35:57,332 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:57,332 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:35:57,333 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:57,333 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:35:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:35:57,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:35:57,446 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 13:35:57,446 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:35:57,447 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 13:35:57,447 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:35:57,447 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 13:35:57,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 13:35:57,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:35:57,448 INFO L87 Difference]: Start difference. First operand 152 states and 162 transitions. Second operand 8 states. [2018-01-24 13:35:57,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:35:57,624 INFO L93 Difference]: Finished difference Result 216 states and 231 transitions. [2018-01-24 13:35:57,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 13:35:57,625 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-01-24 13:35:57,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:35:57,626 INFO L225 Difference]: With dead ends: 216 [2018-01-24 13:35:57,626 INFO L226 Difference]: Without dead ends: 180 [2018-01-24 13:35:57,627 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-01-24 13:35:57,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-01-24 13:35:57,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 152. [2018-01-24 13:35:57,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-24 13:35:57,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 161 transitions. [2018-01-24 13:35:57,634 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 161 transitions. Word has length 33 [2018-01-24 13:35:57,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:35:57,635 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 161 transitions. [2018-01-24 13:35:57,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 13:35:57,635 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 161 transitions. [2018-01-24 13:35:57,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 13:35:57,636 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:35: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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:35:57,636 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:35:57,636 INFO L82 PathProgramCache]: Analyzing trace with hash -133974448, now seen corresponding path program 1 times [2018-01-24 13:35:57,636 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:35:57,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:57,637 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:35:57,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:57,637 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:35:57,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:35:57,652 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:35:57,699 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 13:35:57,699 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:35:57,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:35:57,699 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:35:57,700 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:35:57,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:35:57,700 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:35:57,700 INFO L87 Difference]: Start difference. First operand 152 states and 161 transitions. Second operand 5 states. [2018-01-24 13:35:57,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:35:57,992 INFO L93 Difference]: Finished difference Result 227 states and 242 transitions. [2018-01-24 13:35:57,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:35:57,992 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-24 13:35:57,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:35:57,994 INFO L225 Difference]: With dead ends: 227 [2018-01-24 13:35:57,994 INFO L226 Difference]: Without dead ends: 226 [2018-01-24 13:35:57,994 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:35:57,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-01-24 13:35:58,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 151. [2018-01-24 13:35:58,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-24 13:35:58,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2018-01-24 13:35:58,005 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 34 [2018-01-24 13:35:58,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:35:58,006 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-01-24 13:35:58,006 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:35:58,006 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-01-24 13:35:58,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 13:35:58,007 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:35:58,007 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:35:58,007 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:35:58,008 INFO L82 PathProgramCache]: Analyzing trace with hash -133974447, now seen corresponding path program 1 times [2018-01-24 13:35:58,008 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:35:58,009 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:58,009 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:35:58,009 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:58,010 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:35:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:35:58,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:35:58,104 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 13:35:58,104 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:35:58,104 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:35:58,104 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:35:58,105 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:35:58,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:35:58,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:35:58,105 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 5 states. [2018-01-24 13:35:58,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:35:58,307 INFO L93 Difference]: Finished difference Result 249 states and 266 transitions. [2018-01-24 13:35:58,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:35:58,308 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-24 13:35:58,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:35:58,309 INFO L225 Difference]: With dead ends: 249 [2018-01-24 13:35:58,309 INFO L226 Difference]: Without dead ends: 248 [2018-01-24 13:35:58,309 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:35:58,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-01-24 13:35:58,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 150. [2018-01-24 13:35:58,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-24 13:35:58,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 159 transitions. [2018-01-24 13:35:58,318 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 159 transitions. Word has length 34 [2018-01-24 13:35:58,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:35:58,319 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 159 transitions. [2018-01-24 13:35:58,319 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:35:58,319 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 159 transitions. [2018-01-24 13:35:58,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 13:35:58,320 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:35:58,320 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:35:58,320 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:35:58,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1586747252, now seen corresponding path program 1 times [2018-01-24 13:35:58,321 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:35:58,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:58,322 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:35:58,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:35:58,322 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:35:58,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:35:58,336 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:35:58,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:35:58,507 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:35:58,507 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 13:35:58,515 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:35:58,515 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:35:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:35:58,558 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:35:58,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 13:35:58,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:35:58,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:35:58,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-01-24 13:35:58,710 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 11 treesize of output 8 [2018-01-24 13:35:58,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 13:35:58,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:35:58,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:35:58,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:35:58,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-01-24 13:35:58,747 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 21 treesize of output 16 [2018-01-24 13:35:58,750 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:35:58,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-24 13:35:58,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:35:58,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:35:58,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:35:58,770 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-01-24 13:35:58,792 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 36 treesize of output 29 [2018-01-24 13:35:58,796 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:35:58,797 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:35:58,798 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:35:58,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-01-24 13:35:58,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:35:58,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:35:58,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:35:58,822 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:33 [2018-01-24 13:35:58,895 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 36 treesize of output 26 [2018-01-24 13:35:58,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2018-01-24 13:35:58,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:35:58,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:35:58,906 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 13:35:58,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:15 [2018-01-24 13:35:58,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:35:58,969 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:35:59,257 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:35:59,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:35:59,269 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:35:59,277 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:35:59,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 13:35:59,285 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:67, output treesize:37 [2018-01-24 13:36:08,896 WARN L143 SmtUtils]: Spent 6341ms on a formula simplification that was a NOOP. DAG size: 20 [2018-01-24 13:36:08,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:36:08,938 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:36:08,938 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 13:36:08,942 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:36:08,942 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:36:08,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:36:08,986 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:36:08,989 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 13:36:08,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:36:08,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:36:08,992 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 13:36:09,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 13:36:09,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:36:09,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:36:09,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-01-24 13:36:09,024 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 11 treesize of output 8 [2018-01-24 13:36:09,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 13:36:09,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:36:09,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:36:09,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:36:09,034 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-01-24 13:36:09,037 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 21 treesize of output 16 [2018-01-24 13:36:09,041 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:36:09,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-24 13:36:09,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:36:09,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:36:09,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:36:09,056 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-01-24 13:36:09,061 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 36 treesize of output 29 [2018-01-24 13:36:09,069 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:36:09,070 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:36:09,071 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:36:09,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-01-24 13:36:09,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:36:09,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:36:09,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:36:09,095 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:33 [2018-01-24 13:36:09,104 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 36 treesize of output 26 [2018-01-24 13:36:09,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2018-01-24 13:36:09,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:36:09,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:36:09,117 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 13:36:09,117 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:15 [2018-01-24 13:36:09,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:36:09,166 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:36:09,174 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:36:09,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:36:09,180 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:36:09,185 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:36:09,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 13:36:09,196 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:67, output treesize:37 [2018-01-24 13:36:23,983 WARN L143 SmtUtils]: Spent 7323ms on a formula simplification that was a NOOP. DAG size: 20 [2018-01-24 13:36:32,873 WARN L143 SmtUtils]: Spent 6838ms on a formula simplification that was a NOOP. DAG size: 20 [2018-01-24 13:36:32,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:36:32,881 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:36:32,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 9, 11, 10] total 28 [2018-01-24 13:36:32,881 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:36:32,882 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 13:36:32,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 13:36:32,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=643, Unknown=7, NotChecked=0, Total=756 [2018-01-24 13:36:32,882 INFO L87 Difference]: Start difference. First operand 150 states and 159 transitions. Second operand 17 states. [2018-01-24 13:36:33,573 WARN L146 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 35 DAG size of output 33 [2018-01-24 13:36:33,844 WARN L146 SmtUtils]: Spent 161ms on a formula simplification. DAG size of input: 37 DAG size of output 35 [2018-01-24 13:36:34,071 WARN L146 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 52 DAG size of output 49 [2018-01-24 13:36:34,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:36:34,937 INFO L93 Difference]: Finished difference Result 282 states and 301 transitions. [2018-01-24 13:36:34,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-24 13:36:34,937 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-01-24 13:36:34,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:36:34,939 INFO L225 Difference]: With dead ends: 282 [2018-01-24 13:36:34,939 INFO L226 Difference]: Without dead ends: 225 [2018-01-24 13:36:34,940 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 119 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 35.4s TimeCoverageRelationStatistics Valid=521, Invalid=1634, Unknown=7, NotChecked=0, Total=2162 [2018-01-24 13:36:34,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-01-24 13:36:34,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 169. [2018-01-24 13:36:34,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-01-24 13:36:34,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 180 transitions. [2018-01-24 13:36:34,951 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 180 transitions. Word has length 36 [2018-01-24 13:36:34,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:36:34,952 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 180 transitions. [2018-01-24 13:36:34,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 13:36:34,952 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 180 transitions. [2018-01-24 13:36:34,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 13:36:34,953 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:36:34,953 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:36:34,953 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:36:34,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1203027346, now seen corresponding path program 1 times [2018-01-24 13:36:34,954 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:36:34,955 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:36:34,955 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:36:34,955 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:36:34,955 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:36:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:36:34,980 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:36:35,109 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 13:36:35,109 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:36:35,109 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-24 13:36:35,109 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:36:35,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 13:36:35,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 13:36:35,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-24 13:36:35,110 INFO L87 Difference]: Start difference. First operand 169 states and 180 transitions. Second operand 12 states. [2018-01-24 13:36:35,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:36:35,506 INFO L93 Difference]: Finished difference Result 172 states and 182 transitions. [2018-01-24 13:36:35,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 13:36:35,506 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-01-24 13:36:35,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:36:35,507 INFO L225 Difference]: With dead ends: 172 [2018-01-24 13:36:35,507 INFO L226 Difference]: Without dead ends: 171 [2018-01-24 13:36:35,508 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2018-01-24 13:36:35,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-01-24 13:36:35,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 168. [2018-01-24 13:36:35,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-01-24 13:36:35,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 179 transitions. [2018-01-24 13:36:35,516 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 179 transitions. Word has length 38 [2018-01-24 13:36:35,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:36:35,516 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 179 transitions. [2018-01-24 13:36:35,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 13:36:35,516 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 179 transitions. [2018-01-24 13:36:35,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 13:36:35,517 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:36:35,517 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:36:35,517 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:36:35,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1203027347, now seen corresponding path program 1 times [2018-01-24 13:36:35,517 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:36:35,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:36:35,518 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:36:35,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:36:35,519 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:36:35,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:36:35,536 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:36:35,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:36:35,730 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:36:35,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 13:36:35,730 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:36:35,730 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 13:36:35,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 13:36:35,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-01-24 13:36:35,731 INFO L87 Difference]: Start difference. First operand 168 states and 179 transitions. Second operand 13 states. [2018-01-24 13:36:36,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:36:36,230 INFO L93 Difference]: Finished difference Result 173 states and 183 transitions. [2018-01-24 13:36:36,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 13:36:36,230 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-01-24 13:36:36,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:36:36,231 INFO L225 Difference]: With dead ends: 173 [2018-01-24 13:36:36,231 INFO L226 Difference]: Without dead ends: 166 [2018-01-24 13:36:36,232 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2018-01-24 13:36:36,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-01-24 13:36:36,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 141. [2018-01-24 13:36:36,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-01-24 13:36:36,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 151 transitions. [2018-01-24 13:36:36,240 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 151 transitions. Word has length 38 [2018-01-24 13:36:36,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:36:36,240 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 151 transitions. [2018-01-24 13:36:36,240 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 13:36:36,240 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 151 transitions. [2018-01-24 13:36:36,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 13:36:36,241 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:36:36,241 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:36:36,241 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:36:36,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1775732296, now seen corresponding path program 1 times [2018-01-24 13:36:36,241 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:36:36,242 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:36:36,243 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:36:36,243 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:36:36,243 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:36:36,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:36:36,253 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:36:36,337 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 13:36:36,338 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:36:36,338 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:36:36,338 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:36:36,338 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:36:36,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:36:36,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:36:36,338 INFO L87 Difference]: Start difference. First operand 141 states and 151 transitions. Second operand 5 states. [2018-01-24 13:36:36,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:36:36,437 INFO L93 Difference]: Finished difference Result 203 states and 218 transitions. [2018-01-24 13:36:36,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:36:36,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-01-24 13:36:36,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:36:36,438 INFO L225 Difference]: With dead ends: 203 [2018-01-24 13:36:36,439 INFO L226 Difference]: Without dead ends: 145 [2018-01-24 13:36:36,439 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 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 13:36:36,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-01-24 13:36:36,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 140. [2018-01-24 13:36:36,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-24 13:36:36,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 148 transitions. [2018-01-24 13:36:36,444 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 148 transitions. Word has length 38 [2018-01-24 13:36:36,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:36:36,445 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 148 transitions. [2018-01-24 13:36:36,445 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:36:36,445 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 148 transitions. [2018-01-24 13:36:36,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-24 13:36:36,445 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:36:36,446 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, 1, 1, 1, 1, 1, 1] [2018-01-24 13:36:36,446 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:36:36,446 INFO L82 PathProgramCache]: Analyzing trace with hash 377492563, now seen corresponding path program 1 times [2018-01-24 13:36:36,446 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:36:36,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:36:36,447 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:36:36,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:36:36,447 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:36:36,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:36:36,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:36:36,539 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 13:36:36,539 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:36:36,539 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 13:36:36,547 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:36:36,547 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:36:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:36:36,567 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:36:36,590 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:36:36,603 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:36:36,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 13:36:36,604 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:36:36,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:36:36,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-01-24 13:36:36,621 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 13:36:36,622 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:36:36,643 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 13:36:36,676 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 13:36:36,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [9] total 12 [2018-01-24 13:36:36,677 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:36:36,677 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:36:36,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:36:36,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-01-24 13:36:36,677 INFO L87 Difference]: Start difference. First operand 140 states and 148 transitions. Second operand 5 states. [2018-01-24 13:36:36,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:36:36,833 INFO L93 Difference]: Finished difference Result 169 states and 177 transitions. [2018-01-24 13:36:36,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:36:36,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-01-24 13:36:36,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:36:36,835 INFO L225 Difference]: With dead ends: 169 [2018-01-24 13:36:36,835 INFO L226 Difference]: Without dead ends: 166 [2018-01-24 13:36:36,836 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-01-24 13:36:36,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-01-24 13:36:36,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 140. [2018-01-24 13:36:36,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-24 13:36:36,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 147 transitions. [2018-01-24 13:36:36,843 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 147 transitions. Word has length 39 [2018-01-24 13:36:36,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:36:36,843 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 147 transitions. [2018-01-24 13:36:36,843 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:36:36,844 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 147 transitions. [2018-01-24 13:36:36,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-24 13:36:36,844 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:36:36,844 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:36:36,844 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:36:36,845 INFO L82 PathProgramCache]: Analyzing trace with hash 595067423, now seen corresponding path program 1 times [2018-01-24 13:36:36,845 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:36:36,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:36:36,846 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:36:36,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:36:36,846 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:36:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:36:36,857 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:36:36,955 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 13:36:36,956 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:36:36,956 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:36:36,963 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:36:36,963 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:36:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:36:36,993 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:36:37,004 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 13 treesize of output 10 [2018-01-24 13:36:37,006 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 10 treesize of output 9 [2018-01-24 13:36:37,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:36:37,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:36:37,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:36:37,010 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-24 13:36:37,016 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 13:36:37,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-24 13:36:37,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:36:37,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:36:37,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:36:37,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-01-24 13:36:37,028 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 13:36:37,029 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:36:37,046 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 13:36:37,079 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 13:36:37,079 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 9 [2018-01-24 13:36:37,079 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:36:37,080 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:36:37,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:36:37,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-24 13:36:37,080 INFO L87 Difference]: Start difference. First operand 140 states and 147 transitions. Second operand 4 states. [2018-01-24 13:36:37,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:36:37,216 INFO L93 Difference]: Finished difference Result 179 states and 188 transitions. [2018-01-24 13:36:37,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:36:37,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-01-24 13:36:37,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:36:37,217 INFO L225 Difference]: With dead ends: 179 [2018-01-24 13:36:37,217 INFO L226 Difference]: Without dead ends: 150 [2018-01-24 13:36:37,218 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 82 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-24 13:36:37,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-24 13:36:37,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 144. [2018-01-24 13:36:37,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-24 13:36:37,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 151 transitions. [2018-01-24 13:36:37,223 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 151 transitions. Word has length 43 [2018-01-24 13:36:37,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:36:37,223 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 151 transitions. [2018-01-24 13:36:37,223 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:36:37,223 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 151 transitions. [2018-01-24 13:36:37,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-24 13:36:37,224 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:36:37,224 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:36:37,224 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:36:37,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1932461330, now seen corresponding path program 1 times [2018-01-24 13:36:37,224 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:36:37,225 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:36:37,225 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:36:37,225 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:36:37,225 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:36:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:36:37,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:36:37,586 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:36:37,587 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:36:37,587 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:36:37,608 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:36:37,608 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:36:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:36:37,644 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:36:37,717 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 19 treesize of output 16 [2018-01-24 13:36:37,719 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 16 treesize of output 1 [2018-01-24 13:36:37,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:36:37,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:36:37,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:36:37,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:3 [2018-01-24 13:36:37,778 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 15 treesize of output 11 [2018-01-24 13:36:37,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-24 13:36:37,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:36:37,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:36:37,806 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 15 treesize of output 11 [2018-01-24 13:36:37,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-24 13:36:37,809 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:36:37,811 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:36:37,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:36:37,817 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:10 [2018-01-24 13:36:37,865 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:36:37,865 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:36:37,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2018-01-24 13:36:37,956 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 14 treesize of output 12 [2018-01-24 13:36:38,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:36:38,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 13:36:38,089 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:36:38,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:36:38,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:36:38,105 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2018-01-24 13:36:38,132 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:36:38,152 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:36:38,152 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 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 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:36:38,164 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:36:38,164 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:36:38,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:36:38,207 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:36:38,269 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 19 treesize of output 16 [2018-01-24 13:36:38,272 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 16 treesize of output 1 [2018-01-24 13:36:38,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:36:38,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:36:38,292 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 19 treesize of output 16 [2018-01-24 13:36:38,294 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 16 treesize of output 1 [2018-01-24 13:36:38,295 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:36:38,295 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:36:38,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:36:38,299 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:45, output treesize:7 [2018-01-24 13:36:38,409 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 15 treesize of output 11 [2018-01-24 13:36:38,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-24 13:36:38,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:36:38,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:36:38,508 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 15 treesize of output 11 [2018-01-24 13:36:38,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 3 [2018-01-24 13:36:38,510 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:36:38,524 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:36:38,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:36:38,548 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:10 [2018-01-24 13:36:38,616 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:36:38,617 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:36:38,755 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:36:38,757 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:36:38,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 10, 13, 9] total 36 [2018-01-24 13:36:38,757 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:36:38,758 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 13:36:38,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 13:36:38,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1112, Unknown=0, NotChecked=0, Total=1260 [2018-01-24 13:36:38,758 INFO L87 Difference]: Start difference. First operand 144 states and 151 transitions. Second operand 16 states. [2018-01-24 13:36:39,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:36:39,231 INFO L93 Difference]: Finished difference Result 222 states and 235 transitions. [2018-01-24 13:36:39,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 13:36:39,231 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-01-24 13:36:39,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:36:39,232 INFO L225 Difference]: With dead ends: 222 [2018-01-24 13:36:39,232 INFO L226 Difference]: Without dead ends: 196 [2018-01-24 13:36:39,233 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 149 SyntacticMatches, 9 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=230, Invalid=1492, Unknown=0, NotChecked=0, Total=1722 [2018-01-24 13:36:39,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-01-24 13:36:39,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 157. [2018-01-24 13:36:39,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-01-24 13:36:39,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 166 transitions. [2018-01-24 13:36:39,241 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 166 transitions. Word has length 46 [2018-01-24 13:36:39,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:36:39,241 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 166 transitions. [2018-01-24 13:36:39,241 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 13:36:39,241 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 166 transitions. [2018-01-24 13:36:39,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-24 13:36:39,242 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:36:39,242 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:36:39,242 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 13:36:39,243 INFO L82 PathProgramCache]: Analyzing trace with hash -223241516, now seen corresponding path program 1 times [2018-01-24 13:36:39,243 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:36:39,244 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:36:39,244 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:36:39,244 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:36:39,244 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:36:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 13:36:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 13:36:39,297 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-24 13:36:39,323 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 13:36:39,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 01:36:39 BoogieIcfgContainer [2018-01-24 13:36:39,347 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 13:36:39,348 INFO L168 Benchmark]: Toolchain (without parser) took 47864.33 ms. Allocated memory was 304.6 MB in the beginning and 600.8 MB in the end (delta: 296.2 MB). Free memory was 264.7 MB in the beginning and 346.9 MB in the end (delta: -82.3 MB). Peak memory consumption was 214.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:36:39,350 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 304.6 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 13:36:39,350 INFO L168 Benchmark]: CACSL2BoogieTranslator took 229.11 ms. Allocated memory is still 304.6 MB. Free memory was 263.7 MB in the beginning and 251.5 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. [2018-01-24 13:36:39,350 INFO L168 Benchmark]: Boogie Preprocessor took 43.06 ms. Allocated memory is still 304.6 MB. Free memory was 251.5 MB in the beginning and 249.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:36:39,350 INFO L168 Benchmark]: RCFGBuilder took 658.85 ms. Allocated memory is still 304.6 MB. Free memory was 249.5 MB in the beginning and 209.3 MB in the end (delta: 40.2 MB). Peak memory consumption was 40.2 MB. Max. memory is 5.3 GB. [2018-01-24 13:36:39,351 INFO L168 Benchmark]: TraceAbstraction took 46925.72 ms. Allocated memory was 304.6 MB in the beginning and 600.8 MB in the end (delta: 296.2 MB). Free memory was 209.3 MB in the beginning and 346.9 MB in the end (delta: -137.6 MB). Peak memory consumption was 158.6 MB. Max. memory is 5.3 GB. [2018-01-24 13:36:39,352 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.14 ms. Allocated memory is still 304.6 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 229.11 ms. Allocated memory is still 304.6 MB. Free memory was 263.7 MB in the beginning and 251.5 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.06 ms. Allocated memory is still 304.6 MB. Free memory was 251.5 MB in the beginning and 249.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 658.85 ms. Allocated memory is still 304.6 MB. Free memory was 249.5 MB in the beginning and 209.3 MB in the end (delta: 40.2 MB). Peak memory consumption was 40.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 46925.72 ms. Allocated memory was 304.6 MB in the beginning and 600.8 MB in the end (delta: 296.2 MB). Free memory was 209.3 MB in the beginning and 346.9 MB in the end (delta: -137.6 MB). Peak memory consumption was 158.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 985]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 985. Possible FailurePath: [L987] EXPR, FCALL malloc(sizeof(struct TSLL)) VAL [malloc(sizeof(struct TSLL))={19:0}] [L987] struct TSLL* null = malloc(sizeof(struct TSLL)); VAL [malloc(sizeof(struct TSLL))={19:0}, null={19:0}] [L988] FCALL null->next = ((void*)0) VAL [malloc(sizeof(struct TSLL))={19:0}, null={19:0}] [L989] FCALL null->prev = ((void*)0) VAL [malloc(sizeof(struct TSLL))={19:0}, null={19:0}] [L990] FCALL null->colour = BLACK VAL [malloc(sizeof(struct TSLL))={19:0}, null={19:0}] [L992] EXPR, FCALL malloc(sizeof(struct TSLL)) VAL [malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={17:0}, null={19:0}] [L992] struct TSLL* list = malloc(sizeof(struct TSLL)); VAL [list={17:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={17:0}, null={19:0}] [L993] FCALL list->next = null VAL [list={17:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={17:0}, null={19:0}] [L994] FCALL list->prev = null VAL [list={17:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={17:0}, null={19:0}] [L995] FCALL list->colour = BLACK VAL [list={17:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={17:0}, null={19:0}] [L997] struct TSLL* end = list; VAL [end={17:0}, list={17:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={17:0}, null={19:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={17:0}, list={17:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={17:0}, null={19:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={17:0}, list={17:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={17:0}, null={19:0}] [L1030] COND FALSE !(0) VAL [end={17:0}, list={17:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={17:0}, null={19:0}] [L1031] EXPR, FCALL end->colour VAL [end={17:0}, end->colour=1, list={17:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={17:0}, null={19:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1031] COND FALSE !(0) VAL [end={17:0}, list={17:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={17:0}, null={19:0}] [L1032] COND TRUE null != end VAL [end={17:0}, list={17:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={17:0}, null={19:0}] [L1034] EXPR, FCALL end->colour VAL [end={17:0}, end->colour=1, list={17:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={17:0}, null={19:0}] [L1034] COND FALSE !(RED == end->colour) [L1041] EXPR, FCALL end->next VAL [end={17:0}, end->next={19:0}, list={17:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={17:0}, null={19:0}] [L1041] end = end->next [L1032] COND FALSE !(null != end) VAL [end={19:0}, list={17:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={17:0}, null={19:0}] [L1045] COND TRUE null != list VAL [end={19:0}, list={17:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={17:0}, null={19:0}] [L1047] EXPR, FCALL list->colour VAL [end={19:0}, list={17:0}, list->colour=1, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={17:0}, null={19:0}] [L1047] COND FALSE !(RED == list->colour) [L1056] EXPR, FCALL list->next VAL [end={19:0}, list={17:0}, list->next={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={17:0}, null={19:0}] [L1056] end = list->next [L1057] FCALL free(list) VAL [end={19:0}, list={17:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={17:0}, null={19:0}] [L1058] list = end VAL [end={19:0}, list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={17:0}, null={19:0}] [L1045] COND FALSE !(null != list) VAL [end={19:0}, list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={17:0}, null={19:0}] [L1062] return 0; VAL [\result=0, end={19:0}, list={19:0}, malloc(sizeof(struct TSLL))={19:0}, malloc(sizeof(struct TSLL))={17:0}, null={19:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 160 locations, 67 error locations. UNSAFE Result, 46.8s OverallTime, 21 OverallIterations, 2 TraceHistogramMax, 7.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1886 SDtfs, 5015 SDslu, 4348 SDs, 0 SdLazy, 5824 SolverSat, 370 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 731 GetRequests, 457 SyntacticMatches, 33 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 970 ImplicationChecksByTransitivity, 38.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 605 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 37.6s InterpolantComputationTime, 856 NumberOfCodeBlocks, 856 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1023 ConstructedInterpolants, 16 QuantifiedInterpolants, 275398 SizeOfPredicates, 67 NumberOfNonLiveVariables, 980 ConjunctsInSsa, 141 ConjunctsInUnsatCore, 32 InterpolantComputations, 20 PerfectInterpolantSequences, 14/52 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_13-36-39-361.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_13-36-39-361.csv Received shutdown request...