java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-circular_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 00:23:28,728 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 00:23:28,730 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 00:23:28,745 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 00:23:28,745 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 00:23:28,746 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 00:23:28,747 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 00:23:28,749 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 00:23:28,751 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 00:23:28,751 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 00:23:28,752 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 00:23:28,753 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 00:23:28,754 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 00:23:28,755 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 00:23:28,756 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 00:23:28,758 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 00:23:28,760 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 00:23:28,763 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 00:23:28,764 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 00:23:28,765 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 00:23:28,767 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 00:23:28,768 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 00:23:28,768 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 00:23:28,769 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 00:23:28,770 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 00:23:28,771 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 00:23:28,772 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 00:23:28,772 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 00:23:28,772 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 00:23:28,773 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 00:23:28,773 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 00:23:28,774 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf [2018-01-25 00:23:28,782 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 00:23:28,782 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 00:23:28,783 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 00:23:28,783 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 00:23:28,784 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 00:23:28,784 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 00:23:28,784 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 00:23:28,784 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 00:23:28,785 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 00:23:28,785 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 00:23:28,785 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 00:23:28,785 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 00:23:28,786 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 00:23:28,786 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 00:23:28,786 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 00:23:28,786 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 00:23:28,786 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 00:23:28,787 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 00:23:28,787 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 00:23:28,787 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 00:23:28,787 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 00:23:28,788 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 00:23:28,788 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 00:23:28,788 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 00:23:28,788 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 00:23:28,788 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 00:23:28,789 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 00:23:28,789 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 00:23:28,789 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 00:23:28,789 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 00:23:28,789 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 00:23:28,789 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 00:23:28,790 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 00:23:28,790 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 00:23:28,791 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 00:23:28,791 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 00:23:28,826 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 00:23:28,839 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 00:23:28,843 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 00:23:28,845 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 00:23:28,845 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 00:23:28,846 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-circular_true-unreach-call_true-valid-memsafety.i [2018-01-25 00:23:29,013 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 00:23:29,019 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 00:23:29,020 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 00:23:29,020 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 00:23:29,025 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 00:23:29,026 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 12:23:29" (1/1) ... [2018-01-25 00:23:29,028 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cdc1dbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:23:29, skipping insertion in model container [2018-01-25 00:23:29,028 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 12:23:29" (1/1) ... [2018-01-25 00:23:29,046 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 00:23:29,089 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 00:23:29,206 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 00:23:29,225 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 00:23:29,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:23:29 WrapperNode [2018-01-25 00:23:29,231 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 00:23:29,232 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 00:23:29,232 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 00:23:29,232 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 00:23:29,249 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:23:29" (1/1) ... [2018-01-25 00:23:29,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:23:29" (1/1) ... [2018-01-25 00:23:29,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:23:29" (1/1) ... [2018-01-25 00:23:29,263 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:23:29" (1/1) ... [2018-01-25 00:23:29,269 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:23:29" (1/1) ... [2018-01-25 00:23:29,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:23:29" (1/1) ... [2018-01-25 00:23:29,276 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:23:29" (1/1) ... [2018-01-25 00:23:29,279 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 00:23:29,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 00:23:29,280 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 00:23:29,280 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 00:23:29,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:23:29" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 00:23:29,343 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 00:23:29,343 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 00:23:29,343 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 00:23:29,343 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 00:23:29,343 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 00:23:29,343 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 00:23:29,344 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 00:23:29,344 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 00:23:29,344 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 00:23:29,344 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 00:23:29,344 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 00:23:29,344 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 00:23:29,345 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 00:23:29,345 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-25 00:23:29,345 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 00:23:29,345 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 00:23:29,345 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 00:23:29,739 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 00:23:29,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 12:23:29 BoogieIcfgContainer [2018-01-25 00:23:29,740 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 00:23:29,741 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 00:23:29,741 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 00:23:29,743 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 00:23:29,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 12:23:29" (1/3) ... [2018-01-25 00:23:29,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76dc62e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 12:23:29, skipping insertion in model container [2018-01-25 00:23:29,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:23:29" (2/3) ... [2018-01-25 00:23:29,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76dc62e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 12:23:29, skipping insertion in model container [2018-01-25 00:23:29,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 12:23:29" (3/3) ... [2018-01-25 00:23:29,747 INFO L105 eAbstractionObserver]: Analyzing ICFG sll-circular_true-unreach-call_true-valid-memsafety.i [2018-01-25 00:23:29,754 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 00:23:29,761 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2018-01-25 00:23:29,800 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 00:23:29,800 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 00:23:29,800 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 00:23:29,800 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 00:23:29,800 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 00:23:29,801 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 00:23:29,801 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 00:23:29,801 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 00:23:29,801 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 00:23:29,819 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2018-01-25 00:23:29,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-25 00:23:29,825 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:23:29,826 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:23:29,826 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 00:23:29,830 INFO L82 PathProgramCache]: Analyzing trace with hash -414871971, now seen corresponding path program 1 times [2018-01-25 00:23:29,832 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:23:29,872 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:23:29,872 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:23:29,872 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:23:29,872 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:23:29,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:23:29,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:23:29,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:23:29,985 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:23:29,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 00:23:29,985 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:23:29,988 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 00:23:29,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 00:23:29,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 00:23:30,001 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 4 states. [2018-01-25 00:23:30,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:23:30,259 INFO L93 Difference]: Finished difference Result 205 states and 245 transitions. [2018-01-25 00:23:30,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 00:23:30,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-25 00:23:30,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:23:30,275 INFO L225 Difference]: With dead ends: 205 [2018-01-25 00:23:30,276 INFO L226 Difference]: Without dead ends: 111 [2018-01-25 00:23:30,280 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:23:30,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-25 00:23:30,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 96. [2018-01-25 00:23:30,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-25 00:23:30,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2018-01-25 00:23:30,327 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 8 [2018-01-25 00:23:30,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:23:30,328 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2018-01-25 00:23:30,328 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 00:23:30,328 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2018-01-25 00:23:30,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-25 00:23:30,328 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:23:30,329 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:23:30,329 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 00:23:30,329 INFO L82 PathProgramCache]: Analyzing trace with hash -414871970, now seen corresponding path program 1 times [2018-01-25 00:23:30,329 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:23:30,330 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:23:30,330 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:23:30,331 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:23:30,331 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:23:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:23:30,348 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:23:30,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:23:30,413 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:23:30,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 00:23:30,413 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:23:30,414 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 00:23:30,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 00:23:30,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 00:23:30,415 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand 4 states. [2018-01-25 00:23:30,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:23:30,531 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2018-01-25 00:23:30,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 00:23:30,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-25 00:23:30,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:23:30,534 INFO L225 Difference]: With dead ends: 107 [2018-01-25 00:23:30,534 INFO L226 Difference]: Without dead ends: 103 [2018-01-25 00:23:30,535 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:23:30,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-25 00:23:30,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 92. [2018-01-25 00:23:30,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-01-25 00:23:30,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2018-01-25 00:23:30,544 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 8 [2018-01-25 00:23:30,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:23:30,545 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2018-01-25 00:23:30,545 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 00:23:30,545 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2018-01-25 00:23:30,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 00:23:30,546 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:23:30,546 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:23:30,546 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 00:23:30,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1612643290, now seen corresponding path program 1 times [2018-01-25 00:23:30,546 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:23:30,548 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:23:30,548 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:23:30,548 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:23:30,548 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:23:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:23:30,563 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:23:30,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:23:30,601 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:23:30,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 00:23:30,601 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:23:30,602 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 00:23:30,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 00:23:30,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 00:23:30,602 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand 4 states. [2018-01-25 00:23:30,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:23:30,759 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2018-01-25 00:23:30,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 00:23:30,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 00:23:30,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:23:30,761 INFO L225 Difference]: With dead ends: 99 [2018-01-25 00:23:30,761 INFO L226 Difference]: Without dead ends: 88 [2018-01-25 00:23:30,762 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:23:30,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-25 00:23:30,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2018-01-25 00:23:30,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-25 00:23:30,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-01-25 00:23:30,771 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 14 [2018-01-25 00:23:30,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:23:30,771 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-01-25 00:23:30,771 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 00:23:30,771 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-01-25 00:23:30,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 00:23:30,772 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:23:30,772 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:23:30,772 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 00:23:30,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1612643291, now seen corresponding path program 1 times [2018-01-25 00:23:30,773 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:23:30,774 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:23:30,774 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:23:30,775 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:23:30,775 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:23:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:23:30,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:23:30,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:23:30,866 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:23:30,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 00:23:30,867 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:23:30,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 00:23:30,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 00:23:30,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:23:30,867 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 5 states. [2018-01-25 00:23:31,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:23:31,010 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2018-01-25 00:23:31,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 00:23:31,010 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 00:23:31,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:23:31,012 INFO L225 Difference]: With dead ends: 104 [2018-01-25 00:23:31,012 INFO L226 Difference]: Without dead ends: 101 [2018-01-25 00:23:31,012 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-25 00:23:31,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-25 00:23:31,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 88. [2018-01-25 00:23:31,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-25 00:23:31,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-01-25 00:23:31,020 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 14 [2018-01-25 00:23:31,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:23:31,020 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-01-25 00:23:31,020 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 00:23:31,021 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-01-25 00:23:31,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 00:23:31,021 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:23:31,021 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:23:31,021 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 00:23:31,021 INFO L82 PathProgramCache]: Analyzing trace with hash -22797273, now seen corresponding path program 1 times [2018-01-25 00:23:31,022 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:23:31,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:23:31,022 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:23:31,023 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:23:31,023 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:23:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:23:31,042 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:23:31,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:23:31,094 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:23:31,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 00:23:31,094 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:23:31,095 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 00:23:31,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 00:23:31,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 00:23:31,096 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 6 states. [2018-01-25 00:23:31,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:23:31,340 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2018-01-25 00:23:31,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 00:23:31,375 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-01-25 00:23:31,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:23:31,376 INFO L225 Difference]: With dead ends: 133 [2018-01-25 00:23:31,376 INFO L226 Difference]: Without dead ends: 132 [2018-01-25 00:23:31,377 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-25 00:23:31,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-25 00:23:31,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 87. [2018-01-25 00:23:31,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-25 00:23:31,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2018-01-25 00:23:31,387 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 18 [2018-01-25 00:23:31,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:23:31,388 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2018-01-25 00:23:31,388 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 00:23:31,388 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2018-01-25 00:23:31,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 00:23:31,389 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:23:31,389 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:23:31,389 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 00:23:31,390 INFO L82 PathProgramCache]: Analyzing trace with hash -22797272, now seen corresponding path program 1 times [2018-01-25 00:23:31,390 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:23:31,391 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:23:31,391 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:23:31,391 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:23:31,391 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:23:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:23:31,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:23:31,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:23:31,528 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:23:31,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 00:23:31,528 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:23:31,529 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 00:23:31,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 00:23:31,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 00:23:31,529 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand 6 states. [2018-01-25 00:23:31,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:23:31,855 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2018-01-25 00:23:31,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 00:23:31,855 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-01-25 00:23:31,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:23:31,856 INFO L225 Difference]: With dead ends: 136 [2018-01-25 00:23:31,856 INFO L226 Difference]: Without dead ends: 131 [2018-01-25 00:23:31,856 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-01-25 00:23:31,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-25 00:23:31,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 75. [2018-01-25 00:23:31,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-25 00:23:31,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2018-01-25 00:23:31,864 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 18 [2018-01-25 00:23:31,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:23:31,865 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2018-01-25 00:23:31,865 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 00:23:31,865 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2018-01-25 00:23:31,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 00:23:31,866 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:23:31,866 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:23:31,866 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 00:23:31,866 INFO L82 PathProgramCache]: Analyzing trace with hash -152886338, now seen corresponding path program 1 times [2018-01-25 00:23:31,866 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:23:31,867 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:23:31,868 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:23:31,868 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:23:31,868 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:23:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:23:31,882 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:23:32,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:23:32,070 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:23:32,070 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 00:23:32,070 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:23:32,071 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 00:23:32,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 00:23:32,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-25 00:23:32,071 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 9 states. [2018-01-25 00:23:32,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:23:32,295 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2018-01-25 00:23:32,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 00:23:32,296 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-01-25 00:23:32,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:23:32,296 INFO L225 Difference]: With dead ends: 128 [2018-01-25 00:23:32,297 INFO L226 Difference]: Without dead ends: 127 [2018-01-25 00:23:32,297 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-01-25 00:23:32,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-25 00:23:32,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 86. [2018-01-25 00:23:32,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-25 00:23:32,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2018-01-25 00:23:32,305 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 21 [2018-01-25 00:23:32,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:23:32,306 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2018-01-25 00:23:32,306 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 00:23:32,306 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2018-01-25 00:23:32,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 00:23:32,307 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:23:32,307 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:23:32,307 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 00:23:32,307 INFO L82 PathProgramCache]: Analyzing trace with hash -152886337, now seen corresponding path program 1 times [2018-01-25 00:23:32,307 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:23:32,308 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:23:32,309 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:23:32,309 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:23:32,309 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:23:32,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:23:32,327 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:23:32,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:23:32,536 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:23:32,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 00:23:32,537 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:23:32,537 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 00:23:32,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 00:23:32,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-25 00:23:32,538 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand 9 states. [2018-01-25 00:23:32,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:23:32,794 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2018-01-25 00:23:32,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 00:23:32,794 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-01-25 00:23:32,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:23:32,795 INFO L225 Difference]: With dead ends: 163 [2018-01-25 00:23:32,795 INFO L226 Difference]: Without dead ends: 158 [2018-01-25 00:23:32,795 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-01-25 00:23:32,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-25 00:23:32,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 99. [2018-01-25 00:23:32,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-25 00:23:32,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2018-01-25 00:23:32,806 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 21 [2018-01-25 00:23:32,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:23:32,806 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2018-01-25 00:23:32,806 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 00:23:32,806 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2018-01-25 00:23:32,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 00:23:32,807 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:23:32,807 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:23:32,807 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 00:23:32,808 INFO L82 PathProgramCache]: Analyzing trace with hash -986431451, now seen corresponding path program 1 times [2018-01-25 00:23:32,808 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:23:32,808 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:23:32,808 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:23:32,809 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:23:32,809 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:23:32,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:23:32,819 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:23:33,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:23:33,017 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:23:33,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 00:23:33,017 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:23:33,017 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 00:23:33,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 00:23:33,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-01-25 00:23:33,018 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand 10 states. [2018-01-25 00:23:33,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:23:33,454 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2018-01-25 00:23:33,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 00:23:33,455 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-01-25 00:23:33,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:23:33,456 INFO L225 Difference]: With dead ends: 146 [2018-01-25 00:23:33,456 INFO L226 Difference]: Without dead ends: 145 [2018-01-25 00:23:33,457 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2018-01-25 00:23:33,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-01-25 00:23:33,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 99. [2018-01-25 00:23:33,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-25 00:23:33,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2018-01-25 00:23:33,466 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 25 [2018-01-25 00:23:33,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:23:33,466 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2018-01-25 00:23:33,466 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 00:23:33,466 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2018-01-25 00:23:33,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 00:23:33,467 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:23:33,467 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:23:33,468 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 00:23:33,468 INFO L82 PathProgramCache]: Analyzing trace with hash -986431450, now seen corresponding path program 1 times [2018-01-25 00:23:33,468 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:23:33,469 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:23:33,469 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:23:33,469 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:23:33,469 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:23:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:23:33,480 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:23:33,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:23:33,705 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:23:33,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 00:23:33,705 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:23:33,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 00:23:33,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 00:23:33,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-25 00:23:33,706 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 9 states. [2018-01-25 00:23:34,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:23:34,199 INFO L93 Difference]: Finished difference Result 155 states and 166 transitions. [2018-01-25 00:23:34,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 00:23:34,200 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-01-25 00:23:34,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:23:34,200 INFO L225 Difference]: With dead ends: 155 [2018-01-25 00:23:34,201 INFO L226 Difference]: Without dead ends: 154 [2018-01-25 00:23:34,201 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-01-25 00:23:34,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-25 00:23:34,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 99. [2018-01-25 00:23:34,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-25 00:23:34,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2018-01-25 00:23:34,207 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 25 [2018-01-25 00:23:34,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:23:34,208 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2018-01-25 00:23:34,208 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 00:23:34,208 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2018-01-25 00:23:34,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 00:23:34,209 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:23:34,209 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] [2018-01-25 00:23:34,209 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 00:23:34,210 INFO L82 PathProgramCache]: Analyzing trace with hash -515063564, now seen corresponding path program 1 times [2018-01-25 00:23:34,210 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:23:34,211 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:23:34,211 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:23:34,211 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:23:34,211 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:23:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:23:34,221 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:23:34,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:23:34,334 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:23:34,334 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 00:23:34,334 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:23:34,334 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 00:23:34,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 00:23:34,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 00:23:34,334 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand 7 states. [2018-01-25 00:23:34,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:23:34,721 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2018-01-25 00:23:34,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 00:23:34,721 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-01-25 00:23:34,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:23:34,722 INFO L225 Difference]: With dead ends: 136 [2018-01-25 00:23:34,722 INFO L226 Difference]: Without dead ends: 135 [2018-01-25 00:23:34,722 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-01-25 00:23:34,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-25 00:23:34,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 101. [2018-01-25 00:23:34,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-25 00:23:34,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2018-01-25 00:23:34,729 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 26 [2018-01-25 00:23:34,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:23:34,729 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2018-01-25 00:23:34,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 00:23:34,729 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2018-01-25 00:23:34,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 00:23:34,730 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:23:34,730 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] [2018-01-25 00:23:34,731 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 00:23:34,731 INFO L82 PathProgramCache]: Analyzing trace with hash -515063563, now seen corresponding path program 1 times [2018-01-25 00:23:34,731 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:23:34,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:23:34,732 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:23:34,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:23:34,732 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:23:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:23:34,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:23:34,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:23:34,991 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:23:34,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 00:23:34,991 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:23:34,991 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 00:23:34,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 00:23:34,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-25 00:23:34,992 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand 11 states. [2018-01-25 00:23:35,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:23:35,357 INFO L93 Difference]: Finished difference Result 162 states and 174 transitions. [2018-01-25 00:23:35,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 00:23:35,358 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-01-25 00:23:35,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:23:35,359 INFO L225 Difference]: With dead ends: 162 [2018-01-25 00:23:35,360 INFO L226 Difference]: Without dead ends: 158 [2018-01-25 00:23:35,360 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2018-01-25 00:23:35,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-25 00:23:35,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 126. [2018-01-25 00:23:35,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-25 00:23:35,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 151 transitions. [2018-01-25 00:23:35,374 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 151 transitions. Word has length 26 [2018-01-25 00:23:35,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:23:35,375 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 151 transitions. [2018-01-25 00:23:35,375 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 00:23:35,375 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 151 transitions. [2018-01-25 00:23:35,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 00:23:35,376 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:23:35,377 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] [2018-01-25 00:23:35,377 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 00:23:35,377 INFO L82 PathProgramCache]: Analyzing trace with hash -90305214, now seen corresponding path program 1 times [2018-01-25 00:23:35,377 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:23:35,378 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:23:35,378 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:23:35,379 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:23:35,379 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:23:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:23:35,394 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:23:35,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:23:35,745 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:23:35,745 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-25 00:23:35,746 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:23:35,746 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 00:23:35,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 00:23:35,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-01-25 00:23:35,746 INFO L87 Difference]: Start difference. First operand 126 states and 151 transitions. Second operand 13 states. [2018-01-25 00:23:36,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:23:36,397 INFO L93 Difference]: Finished difference Result 145 states and 157 transitions. [2018-01-25 00:23:36,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-25 00:23:36,430 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-01-25 00:23:36,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:23:36,431 INFO L225 Difference]: With dead ends: 145 [2018-01-25 00:23:36,431 INFO L226 Difference]: Without dead ends: 141 [2018-01-25 00:23:36,432 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2018-01-25 00:23:36,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-01-25 00:23:36,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 125. [2018-01-25 00:23:36,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-25 00:23:36,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 149 transitions. [2018-01-25 00:23:36,441 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 149 transitions. Word has length 30 [2018-01-25 00:23:36,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:23:36,442 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 149 transitions. [2018-01-25 00:23:36,442 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 00:23:36,442 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 149 transitions. [2018-01-25 00:23:36,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 00:23:36,443 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:23:36,443 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] [2018-01-25 00:23:36,443 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 00:23:36,444 INFO L82 PathProgramCache]: Analyzing trace with hash -709364135, now seen corresponding path program 1 times [2018-01-25 00:23:36,444 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:23:36,444 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:23:36,445 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:23:36,445 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:23:36,445 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:23:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:23:36,456 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:23:36,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:23:36,620 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:23:36,620 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 00:23:36,620 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:23:36,620 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 00:23:36,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 00:23:36,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-01-25 00:23:36,621 INFO L87 Difference]: Start difference. First operand 125 states and 149 transitions. Second operand 10 states. [2018-01-25 00:23:36,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:23:36,893 INFO L93 Difference]: Finished difference Result 145 states and 157 transitions. [2018-01-25 00:23:36,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 00:23:36,893 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-01-25 00:23:36,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:23:36,894 INFO L225 Difference]: With dead ends: 145 [2018-01-25 00:23:36,894 INFO L226 Difference]: Without dead ends: 144 [2018-01-25 00:23:36,895 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-01-25 00:23:36,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-25 00:23:36,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 125. [2018-01-25 00:23:36,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-25 00:23:36,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 148 transitions. [2018-01-25 00:23:36,906 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 148 transitions. Word has length 30 [2018-01-25 00:23:36,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:23:36,907 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 148 transitions. [2018-01-25 00:23:36,907 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 00:23:36,907 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 148 transitions. [2018-01-25 00:23:36,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 00:23:36,908 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:23:36,908 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] [2018-01-25 00:23:36,908 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 00:23:36,908 INFO L82 PathProgramCache]: Analyzing trace with hash -709364134, now seen corresponding path program 1 times [2018-01-25 00:23:36,908 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:23:36,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:23:36,909 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:23:36,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:23:36,910 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:23:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:23:36,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:23:37,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:23:37,122 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:23:37,122 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 00:23:37,122 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:23:37,122 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 00:23:37,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 00:23:37,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-25 00:23:37,123 INFO L87 Difference]: Start difference. First operand 125 states and 148 transitions. Second operand 9 states. [2018-01-25 00:23:37,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:23:37,503 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2018-01-25 00:23:37,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 00:23:37,503 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-01-25 00:23:37,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:23:37,504 INFO L225 Difference]: With dead ends: 149 [2018-01-25 00:23:37,505 INFO L226 Difference]: Without dead ends: 148 [2018-01-25 00:23:37,505 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-01-25 00:23:37,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-25 00:23:37,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 125. [2018-01-25 00:23:37,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-25 00:23:37,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 147 transitions. [2018-01-25 00:23:37,518 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 147 transitions. Word has length 30 [2018-01-25 00:23:37,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:23:37,518 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 147 transitions. [2018-01-25 00:23:37,518 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 00:23:37,518 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 147 transitions. [2018-01-25 00:23:37,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 00:23:37,519 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:23:37,519 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] [2018-01-25 00:23:37,519 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 00:23:37,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1139830908, now seen corresponding path program 1 times [2018-01-25 00:23:37,520 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:23:37,521 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:23:37,521 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:23:37,521 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:23:37,521 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:23:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:23:37,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:23:37,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:23:37,576 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:23:37,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 00:23:37,576 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:23:37,576 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 00:23:37,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 00:23:37,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 00:23:37,577 INFO L87 Difference]: Start difference. First operand 125 states and 147 transitions. Second operand 3 states. [2018-01-25 00:23:37,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:23:37,618 INFO L93 Difference]: Finished difference Result 258 states and 293 transitions. [2018-01-25 00:23:37,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 00:23:37,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-01-25 00:23:37,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:23:37,622 INFO L225 Difference]: With dead ends: 258 [2018-01-25 00:23:37,622 INFO L226 Difference]: Without dead ends: 191 [2018-01-25 00:23:37,623 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 00:23:37,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-01-25 00:23:37,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 140. [2018-01-25 00:23:37,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-25 00:23:37,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 164 transitions. [2018-01-25 00:23:37,641 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 164 transitions. Word has length 30 [2018-01-25 00:23:37,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:23:37,641 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 164 transitions. [2018-01-25 00:23:37,642 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 00:23:37,642 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 164 transitions. [2018-01-25 00:23:37,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 00:23:37,642 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:23:37,642 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] [2018-01-25 00:23:37,643 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 00:23:37,643 INFO L82 PathProgramCache]: Analyzing trace with hash -836244840, now seen corresponding path program 1 times [2018-01-25 00:23:37,643 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:23:37,644 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:23:37,644 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:23:37,644 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:23:37,644 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:23:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:23:37,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:23:37,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:23:37,888 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:23:37,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-25 00:23:37,888 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:23:37,888 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 00:23:37,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 00:23:37,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-01-25 00:23:37,889 INFO L87 Difference]: Start difference. First operand 140 states and 164 transitions. Second operand 13 states. [2018-01-25 00:23:38,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:23:38,246 INFO L93 Difference]: Finished difference Result 176 states and 190 transitions. [2018-01-25 00:23:38,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 00:23:38,246 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-01-25 00:23:38,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:23:38,247 INFO L225 Difference]: With dead ends: 176 [2018-01-25 00:23:38,247 INFO L226 Difference]: Without dead ends: 153 [2018-01-25 00:23:38,247 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2018-01-25 00:23:38,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-01-25 00:23:38,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 140. [2018-01-25 00:23:38,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-25 00:23:38,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 163 transitions. [2018-01-25 00:23:38,256 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 163 transitions. Word has length 32 [2018-01-25 00:23:38,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:23:38,257 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 163 transitions. [2018-01-25 00:23:38,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 00:23:38,257 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 163 transitions. [2018-01-25 00:23:38,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 00:23:38,257 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:23:38,257 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:23:38,258 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 00:23:38,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1537011505, now seen corresponding path program 1 times [2018-01-25 00:23:38,258 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:23:38,258 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:23:38,259 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:23:38,259 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:23:38,259 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:23:38,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:23:38,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:23:38,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:23:38,401 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:23:38,402 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 00:23:38,402 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-01-25 00:23:38,404 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [5], [8], [12], [14], [17], [73], [76], [79], [83], [88], [92], [100], [102], [103], [109], [113], [114], [117], [120], [123], [141], [145], [151], [154], [191], [192], [196], [197], [198] [2018-01-25 00:23:38,448 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 00:23:38,448 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown