java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-circular_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 03:44:08,626 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 03:44:08,628 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 03:44:08,643 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 03:44:08,643 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 03:44:08,644 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 03:44:08,645 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 03:44:08,647 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 03:44:08,649 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 03:44:08,650 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 03:44:08,651 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 03:44:08,651 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 03:44:08,652 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 03:44:08,653 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 03:44:08,661 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 03:44:08,664 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 03:44:08,666 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 03:44:08,668 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 03:44:08,669 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 03:44:08,670 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 03:44:08,673 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 03:44:08,673 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 03:44:08,673 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 03:44:08,674 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 03:44:08,675 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 03:44:08,676 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 03:44:08,676 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 03:44:08,677 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 03:44:08,677 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 03:44:08,677 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 03:44:08,678 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 03:44:08,678 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf [2018-01-25 03:44:08,688 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 03:44:08,688 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 03:44:08,689 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 03:44:08,689 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 03:44:08,689 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 03:44:08,690 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 03:44:08,690 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 03:44:08,690 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 03:44:08,690 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 03:44:08,691 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 03:44:08,691 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 03:44:08,691 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 03:44:08,692 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 03:44:08,692 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 03:44:08,692 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 03:44:08,692 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 03:44:08,692 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 03:44:08,692 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 03:44:08,693 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 03:44:08,693 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 03:44:08,693 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 03:44:08,693 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 03:44:08,693 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 03:44:08,694 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 03:44:08,694 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 03:44:08,694 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:44:08,694 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 03:44:08,695 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 03:44:08,695 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 03:44:08,695 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 03:44:08,695 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 03:44:08,695 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 03:44:08,695 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 03:44:08,696 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 03:44:08,696 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 03:44:08,697 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 03:44:08,697 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 03:44:08,734 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 03:44:08,750 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 03:44:08,756 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 03:44:08,759 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 03:44:08,759 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 03:44:08,760 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-circular_true-unreach-call_true-valid-memsafety.i [2018-01-25 03:44:09,036 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 03:44:09,042 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 03:44:09,043 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 03:44:09,044 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 03:44:09,049 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 03:44:09,050 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:44:09" (1/1) ... [2018-01-25 03:44:09,053 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 03:44:09, skipping insertion in model container [2018-01-25 03:44:09,053 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:44:09" (1/1) ... [2018-01-25 03:44:09,073 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:44:09,120 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:44:09,252 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:44:09,278 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:44:09,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:44:09 WrapperNode [2018-01-25 03:44:09,287 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 03:44:09,288 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 03:44:09,288 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 03:44:09,288 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 03:44:09,299 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:44:09" (1/1) ... [2018-01-25 03:44:09,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:44:09" (1/1) ... [2018-01-25 03:44:09,308 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:44:09" (1/1) ... [2018-01-25 03:44:09,308 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:44:09" (1/1) ... [2018-01-25 03:44:09,312 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:44:09" (1/1) ... [2018-01-25 03:44:09,315 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:44:09" (1/1) ... [2018-01-25 03:44:09,317 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:44:09" (1/1) ... [2018-01-25 03:44:09,320 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 03:44:09,321 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 03:44:09,321 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 03:44:09,321 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 03:44:09,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:44:09" (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 03:44:09,376 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 03:44:09,376 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 03:44:09,376 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 03:44:09,377 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 03:44:09,377 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 03:44:09,377 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 03:44:09,377 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 03:44:09,377 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 03:44:09,377 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 03:44:09,378 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 03:44:09,378 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 03:44:09,378 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 03:44:09,378 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 03:44:09,378 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-25 03:44:09,378 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 03:44:09,379 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 03:44:09,379 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 03:44:09,980 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 03:44:09,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:44:09 BoogieIcfgContainer [2018-01-25 03:44:09,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 03:44:09,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 03:44:09,982 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 03:44:09,984 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 03:44:09,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 03:44:09" (1/3) ... [2018-01-25 03:44:09,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1718b9a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:44:09, skipping insertion in model container [2018-01-25 03:44:09,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:44:09" (2/3) ... [2018-01-25 03:44:09,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1718b9a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:44:09, skipping insertion in model container [2018-01-25 03:44:09,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:44:09" (3/3) ... [2018-01-25 03:44:09,989 INFO L105 eAbstractionObserver]: Analyzing ICFG dll-circular_true-unreach-call_true-valid-memsafety.i [2018-01-25 03:44:09,995 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 03:44:10,003 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 47 error locations. [2018-01-25 03:44:10,056 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 03:44:10,056 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 03:44:10,057 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 03:44:10,057 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 03:44:10,057 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 03:44:10,057 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 03:44:10,057 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 03:44:10,057 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 03:44:10,058 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 03:44:10,077 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2018-01-25 03:44:10,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-25 03:44:10,084 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:44:10,085 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:44:10,086 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 03:44:10,091 INFO L82 PathProgramCache]: Analyzing trace with hash 414289043, now seen corresponding path program 1 times [2018-01-25 03:44:10,094 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:44:10,157 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:44:10,157 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:44:10,157 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:44:10,158 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:44:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:44:10,212 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:44:10,307 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 03:44:10,308 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:44:10,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:44:10,309 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:44:10,311 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:44:10,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:44:10,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:44:10,324 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 4 states. [2018-01-25 03:44:10,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:44:10,665 INFO L93 Difference]: Finished difference Result 222 states and 262 transitions. [2018-01-25 03:44:10,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:44:10,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-25 03:44:10,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:44:10,678 INFO L225 Difference]: With dead ends: 222 [2018-01-25 03:44:10,678 INFO L226 Difference]: Without dead ends: 120 [2018-01-25 03:44:10,682 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 03:44:10,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-25 03:44:10,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 105. [2018-01-25 03:44:10,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-25 03:44:10,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2018-01-25 03:44:10,723 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 8 [2018-01-25 03:44:10,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:44:10,724 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2018-01-25 03:44:10,724 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:44:10,724 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2018-01-25 03:44:10,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-25 03:44:10,725 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:44:10,725 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:44:10,725 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 03:44:10,726 INFO L82 PathProgramCache]: Analyzing trace with hash 414289044, now seen corresponding path program 1 times [2018-01-25 03:44:10,726 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:44:10,727 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:44:10,727 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:44:10,727 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:44:10,727 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:44:10,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:44:10,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:44:10,809 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 03:44:10,809 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:44:10,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:44:10,810 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:44:10,811 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:44:10,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:44:10,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:44:10,811 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 4 states. [2018-01-25 03:44:11,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:44:11,115 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2018-01-25 03:44:11,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:44:11,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-25 03:44:11,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:44:11,118 INFO L225 Difference]: With dead ends: 116 [2018-01-25 03:44:11,118 INFO L226 Difference]: Without dead ends: 111 [2018-01-25 03:44:11,120 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 03:44:11,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-25 03:44:11,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2018-01-25 03:44:11,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-25 03:44:11,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-01-25 03:44:11,134 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 8 [2018-01-25 03:44:11,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:44:11,134 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-01-25 03:44:11,134 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:44:11,134 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-01-25 03:44:11,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 03:44:11,135 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:44:11,135 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:44:11,135 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 03:44:11,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1743556376, now seen corresponding path program 1 times [2018-01-25 03:44:11,136 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:44:11,137 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:44:11,137 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:44:11,137 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:44:11,137 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:44:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:44:11,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:44:11,283 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 03:44:11,283 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:44:11,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:44:11,284 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:44:11,284 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:44:11,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:44:11,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:44:11,285 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 4 states. [2018-01-25 03:44:11,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:44:11,444 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2018-01-25 03:44:11,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:44:11,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-25 03:44:11,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:44:11,445 INFO L225 Difference]: With dead ends: 107 [2018-01-25 03:44:11,446 INFO L226 Difference]: Without dead ends: 95 [2018-01-25 03:44:11,446 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 03:44:11,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-25 03:44:11,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2018-01-25 03:44:11,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-25 03:44:11,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-01-25 03:44:11,456 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 15 [2018-01-25 03:44:11,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:44:11,456 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-01-25 03:44:11,456 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:44:11,456 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-01-25 03:44:11,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 03:44:11,457 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:44:11,457 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:44:11,457 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 03:44:11,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1743556377, now seen corresponding path program 1 times [2018-01-25 03:44:11,458 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:44:11,459 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:44:11,459 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:44:11,459 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:44:11,459 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:44:11,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:44:11,480 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:44:11,593 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 03:44:11,593 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:44:11,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:44:11,594 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:44:11,594 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:44:11,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:44:11,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:44:11,594 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 5 states. [2018-01-25 03:44:11,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:44:11,801 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-01-25 03:44:11,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:44:11,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-25 03:44:11,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:44:11,804 INFO L225 Difference]: With dead ends: 117 [2018-01-25 03:44:11,804 INFO L226 Difference]: Without dead ends: 113 [2018-01-25 03:44:11,805 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 03:44:11,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-25 03:44:11,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 98. [2018-01-25 03:44:11,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-25 03:44:11,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2018-01-25 03:44:11,823 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 15 [2018-01-25 03:44:11,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:44:11,823 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2018-01-25 03:44:11,823 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:44:11,823 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2018-01-25 03:44:11,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 03:44:11,824 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:44:11,824 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 03:44:11,824 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 03:44:11,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1046426684, now seen corresponding path program 1 times [2018-01-25 03:44:11,824 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:44:11,825 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:44:11,825 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:44:11,825 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:44:11,825 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:44:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:44:11,848 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:44:11,941 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 03:44:11,941 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:44:11,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:44:11,941 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:44:11,942 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:44:11,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:44:11,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:44:11,943 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand 5 states. [2018-01-25 03:44:12,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:44:12,258 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2018-01-25 03:44:12,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:44:12,258 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-25 03:44:12,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:44:12,259 INFO L225 Difference]: With dead ends: 146 [2018-01-25 03:44:12,259 INFO L226 Difference]: Without dead ends: 145 [2018-01-25 03:44:12,260 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-25 03:44:12,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-01-25 03:44:12,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 97. [2018-01-25 03:44:12,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-25 03:44:12,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2018-01-25 03:44:12,269 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 18 [2018-01-25 03:44:12,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:44:12,270 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2018-01-25 03:44:12,270 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:44:12,270 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2018-01-25 03:44:12,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 03:44:12,270 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:44:12,270 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 03:44:12,271 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 03:44:12,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1046426685, now seen corresponding path program 1 times [2018-01-25 03:44:12,271 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:44:12,272 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:44:12,272 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:44:12,272 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:44:12,272 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:44:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:44:12,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:44:12,364 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 03:44:12,365 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:44:12,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:44:12,365 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:44:12,366 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:44:12,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:44:12,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:44:12,366 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 5 states. [2018-01-25 03:44:12,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:44:12,672 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2018-01-25 03:44:12,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:44:12,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-25 03:44:12,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:44:12,674 INFO L225 Difference]: With dead ends: 142 [2018-01-25 03:44:12,674 INFO L226 Difference]: Without dead ends: 141 [2018-01-25 03:44:12,674 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 03:44:12,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-01-25 03:44:12,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 96. [2018-01-25 03:44:12,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-25 03:44:12,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2018-01-25 03:44:12,686 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 18 [2018-01-25 03:44:12,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:44:12,686 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2018-01-25 03:44:12,686 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:44:12,687 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2018-01-25 03:44:12,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 03:44:12,687 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:44:12,687 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:44:12,688 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 03:44:12,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1771867382, now seen corresponding path program 1 times [2018-01-25 03:44:12,688 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:44:12,689 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:44:12,689 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:44:12,689 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:44:12,689 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:44:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:44:12,710 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:44:13,089 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 03:44:13,216 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:44:13,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 03:44:13,217 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:44:13,217 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 03:44:13,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 03:44:13,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-01-25 03:44:13,218 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 10 states. [2018-01-25 03:44:13,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:44:13,631 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2018-01-25 03:44:13,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 03:44:13,632 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-01-25 03:44:13,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:44:13,633 INFO L225 Difference]: With dead ends: 140 [2018-01-25 03:44:13,633 INFO L226 Difference]: Without dead ends: 139 [2018-01-25 03:44:13,638 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2018-01-25 03:44:13,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-25 03:44:13,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 103. [2018-01-25 03:44:13,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-25 03:44:13,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2018-01-25 03:44:13,650 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 22 [2018-01-25 03:44:13,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:44:13,650 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2018-01-25 03:44:13,650 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 03:44:13,650 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2018-01-25 03:44:13,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 03:44:13,651 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:44:13,651 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:44:13,651 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 03:44:13,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1771867381, now seen corresponding path program 1 times [2018-01-25 03:44:13,652 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:44:13,653 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:44:13,653 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:44:13,653 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:44:13,653 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:44:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:44:13,669 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:44:13,976 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 03:44:13,977 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:44:13,977 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 03:44:13,977 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:44:13,977 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 03:44:13,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 03:44:13,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-25 03:44:13,978 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 9 states. [2018-01-25 03:44:14,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:44:14,270 INFO L93 Difference]: Finished difference Result 177 states and 188 transitions. [2018-01-25 03:44:14,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 03:44:14,270 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-25 03:44:14,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:44:14,271 INFO L225 Difference]: With dead ends: 177 [2018-01-25 03:44:14,271 INFO L226 Difference]: Without dead ends: 172 [2018-01-25 03:44:14,272 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-01-25 03:44:14,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-01-25 03:44:14,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 116. [2018-01-25 03:44:14,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-25 03:44:14,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 129 transitions. [2018-01-25 03:44:14,282 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 129 transitions. Word has length 22 [2018-01-25 03:44:14,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:44:14,282 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 129 transitions. [2018-01-25 03:44:14,282 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 03:44:14,282 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 129 transitions. [2018-01-25 03:44:14,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 03:44:14,283 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:44:14,283 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:44:14,284 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 03:44:14,284 INFO L82 PathProgramCache]: Analyzing trace with hash 687906629, now seen corresponding path program 1 times [2018-01-25 03:44:14,284 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:44:14,285 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:44:14,285 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:44:14,285 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:44:14,285 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:44:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:44:14,297 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:44:14,384 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 03:44:14,385 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:44:14,385 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 03:44:14,385 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:44:14,385 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 03:44:14,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 03:44:14,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-25 03:44:14,385 INFO L87 Difference]: Start difference. First operand 116 states and 129 transitions. Second operand 9 states. [2018-01-25 03:44:14,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:44:14,826 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2018-01-25 03:44:14,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 03:44:14,826 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-25 03:44:14,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:44:14,828 INFO L225 Difference]: With dead ends: 123 [2018-01-25 03:44:14,828 INFO L226 Difference]: Without dead ends: 122 [2018-01-25 03:44:14,828 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2018-01-25 03:44:14,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-25 03:44:14,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 115. [2018-01-25 03:44:14,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-25 03:44:14,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 128 transitions. [2018-01-25 03:44:14,836 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 128 transitions. Word has length 22 [2018-01-25 03:44:14,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:44:14,836 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 128 transitions. [2018-01-25 03:44:14,836 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 03:44:14,837 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2018-01-25 03:44:14,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 03:44:14,837 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:44:14,837 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:44:14,838 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 03:44:14,838 INFO L82 PathProgramCache]: Analyzing trace with hash 687906630, now seen corresponding path program 1 times [2018-01-25 03:44:14,838 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:44:14,839 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:44:14,839 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:44:14,839 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:44:14,839 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:44:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:44:14,853 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:44:15,011 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 03:44:15,012 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:44:15,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 03:44:15,012 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:44:15,012 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 03:44:15,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 03:44:15,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-25 03:44:15,013 INFO L87 Difference]: Start difference. First operand 115 states and 128 transitions. Second operand 10 states. [2018-01-25 03:44:15,523 WARN L143 SmtUtils]: Spent 104ms on a formula simplification that was a NOOP. DAG size: 34 [2018-01-25 03:44:15,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:44:15,616 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2018-01-25 03:44:15,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 03:44:15,617 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-01-25 03:44:15,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:44:15,618 INFO L225 Difference]: With dead ends: 123 [2018-01-25 03:44:15,618 INFO L226 Difference]: Without dead ends: 117 [2018-01-25 03:44:15,618 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-01-25 03:44:15,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-25 03:44:15,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2018-01-25 03:44:15,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-25 03:44:15,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2018-01-25 03:44:15,625 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 22 [2018-01-25 03:44:15,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:44:15,625 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2018-01-25 03:44:15,626 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 03:44:15,626 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2018-01-25 03:44:15,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 03:44:15,626 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:44:15,626 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 03:44:15,626 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 03:44:15,627 INFO L82 PathProgramCache]: Analyzing trace with hash 36223985, now seen corresponding path program 1 times [2018-01-25 03:44:15,627 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:44:15,627 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:44:15,627 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:44:15,627 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:44:15,628 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:44:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:44:15,641 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:44:15,984 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 03:44:15,984 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:44:15,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 03:44:15,985 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:44:15,985 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 03:44:15,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 03:44:15,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-25 03:44:15,986 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand 10 states. [2018-01-25 03:44:16,253 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 47 DAG size of output 38 [2018-01-25 03:44:16,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:44:16,569 INFO L93 Difference]: Finished difference Result 147 states and 159 transitions. [2018-01-25 03:44:16,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 03:44:16,569 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-01-25 03:44:16,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:44:16,571 INFO L225 Difference]: With dead ends: 147 [2018-01-25 03:44:16,571 INFO L226 Difference]: Without dead ends: 146 [2018-01-25 03:44:16,571 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-01-25 03:44:16,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-25 03:44:16,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 103. [2018-01-25 03:44:16,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-25 03:44:16,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2018-01-25 03:44:16,579 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 26 [2018-01-25 03:44:16,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:44:16,579 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2018-01-25 03:44:16,580 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 03:44:16,580 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2018-01-25 03:44:16,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 03:44:16,581 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:44:16,581 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 03:44:16,581 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 03:44:16,581 INFO L82 PathProgramCache]: Analyzing trace with hash 36223986, now seen corresponding path program 1 times [2018-01-25 03:44:16,581 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:44:16,582 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:44:16,582 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:44:16,583 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:44:16,583 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:44:16,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:44:16,596 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:44:17,105 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 34 DAG size of output 26 [2018-01-25 03:44:17,175 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 03:44:17,175 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:44:17,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 03:44:17,175 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:44:17,176 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 03:44:17,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 03:44:17,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-25 03:44:17,176 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 9 states. [2018-01-25 03:44:17,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:44:17,491 INFO L93 Difference]: Finished difference Result 159 states and 170 transitions. [2018-01-25 03:44:17,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 03:44:17,491 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-01-25 03:44:17,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:44:17,492 INFO L225 Difference]: With dead ends: 159 [2018-01-25 03:44:17,492 INFO L226 Difference]: Without dead ends: 158 [2018-01-25 03:44:17,493 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-01-25 03:44:17,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-25 03:44:17,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 103. [2018-01-25 03:44:17,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-25 03:44:17,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2018-01-25 03:44:17,500 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 26 [2018-01-25 03:44:17,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:44:17,501 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2018-01-25 03:44:17,501 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 03:44:17,501 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2018-01-25 03:44:17,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 03:44:17,502 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:44:17,502 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:44:17,502 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 03:44:17,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1122483890, now seen corresponding path program 1 times [2018-01-25 03:44:17,503 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:44:17,504 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:44:17,504 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:44:17,504 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:44:17,504 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:44:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:44:17,514 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:44:17,568 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 03:44:17,568 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:44:17,568 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:44:17,568 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:44:17,568 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 03:44:17,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 03:44:17,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:44:17,569 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand 7 states. [2018-01-25 03:44:17,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:44:17,766 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2018-01-25 03:44:17,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 03:44:17,767 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-01-25 03:44:17,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:44:17,768 INFO L225 Difference]: With dead ends: 140 [2018-01-25 03:44:17,768 INFO L226 Difference]: Without dead ends: 139 [2018-01-25 03:44:17,768 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-01-25 03:44:17,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-25 03:44:17,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 105. [2018-01-25 03:44:17,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-25 03:44:17,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2018-01-25 03:44:17,779 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 27 [2018-01-25 03:44:17,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:44:17,779 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2018-01-25 03:44:17,779 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 03:44:17,779 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2018-01-25 03:44:17,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 03:44:17,780 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:44:17,780 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:44:17,781 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 03:44:17,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1122483891, now seen corresponding path program 1 times [2018-01-25 03:44:17,782 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:44:17,783 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:44:17,783 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:44:17,783 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:44:17,783 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:44:17,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:44:17,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:44:18,262 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 03:44:18,338 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:44:18,338 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 03:44:18,338 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:44:18,338 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 03:44:18,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 03:44:18,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-25 03:44:18,339 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 11 states. [2018-01-25 03:44:18,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:44:18,809 INFO L93 Difference]: Finished difference Result 169 states and 181 transitions. [2018-01-25 03:44:18,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 03:44:18,809 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-01-25 03:44:18,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:44:18,810 INFO L225 Difference]: With dead ends: 169 [2018-01-25 03:44:18,810 INFO L226 Difference]: Without dead ends: 165 [2018-01-25 03:44:18,811 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2018-01-25 03:44:18,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-01-25 03:44:18,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 130. [2018-01-25 03:44:18,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-25 03:44:18,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 155 transitions. [2018-01-25 03:44:18,819 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 155 transitions. Word has length 27 [2018-01-25 03:44:18,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:44:18,819 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 155 transitions. [2018-01-25 03:44:18,819 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 03:44:18,819 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 155 transitions. [2018-01-25 03:44:18,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 03:44:18,820 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:44:18,820 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:44:18,821 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 03:44:18,821 INFO L82 PathProgramCache]: Analyzing trace with hash -152260992, now seen corresponding path program 1 times [2018-01-25 03:44:18,821 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:44:18,822 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:44:18,822 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:44:18,822 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:44:18,822 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:44:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:44:18,833 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:44:19,200 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 03:44:19,200 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:44:19,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 03:44:19,201 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:44:19,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 03:44:19,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 03:44:19,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-25 03:44:19,202 INFO L87 Difference]: Start difference. First operand 130 states and 155 transitions. Second operand 10 states. [2018-01-25 03:44:19,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:44:19,653 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2018-01-25 03:44:19,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 03:44:19,653 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-01-25 03:44:19,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:44:19,654 INFO L225 Difference]: With dead ends: 144 [2018-01-25 03:44:19,655 INFO L226 Difference]: Without dead ends: 140 [2018-01-25 03:44:19,655 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-01-25 03:44:19,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-25 03:44:19,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 129. [2018-01-25 03:44:19,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-25 03:44:19,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 153 transitions. [2018-01-25 03:44:19,674 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 153 transitions. Word has length 31 [2018-01-25 03:44:19,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:44:19,675 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 153 transitions. [2018-01-25 03:44:19,675 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 03:44:19,675 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 153 transitions. [2018-01-25 03:44:19,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 03:44:19,676 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:44:19,676 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:44:19,676 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 03:44:19,676 INFO L82 PathProgramCache]: Analyzing trace with hash -771319912, now seen corresponding path program 1 times [2018-01-25 03:44:19,677 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:44:19,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:44:19,680 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:44:19,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:44:19,680 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:44:19,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:44:19,693 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:44:19,928 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 03:44:19,929 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:44:19,929 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 03:44:19,929 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:44:19,929 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 03:44:19,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 03:44:19,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-25 03:44:19,930 INFO L87 Difference]: Start difference. First operand 129 states and 153 transitions. Second operand 9 states. [2018-01-25 03:44:20,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:44:20,342 INFO L93 Difference]: Finished difference Result 154 states and 165 transitions. [2018-01-25 03:44:20,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 03:44:20,342 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-01-25 03:44:20,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:44:20,343 INFO L225 Difference]: With dead ends: 154 [2018-01-25 03:44:20,343 INFO L226 Difference]: Without dead ends: 153 [2018-01-25 03:44:20,344 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 3 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 03:44:20,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-01-25 03:44:20,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 129. [2018-01-25 03:44:20,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-25 03:44:20,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 152 transitions. [2018-01-25 03:44:20,361 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 152 transitions. Word has length 31 [2018-01-25 03:44:20,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:44:20,362 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 152 transitions. [2018-01-25 03:44:20,362 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 03:44:20,362 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2018-01-25 03:44:20,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 03:44:20,363 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:44:20,363 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:44:20,363 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 03:44:20,364 INFO L82 PathProgramCache]: Analyzing trace with hash -771319913, now seen corresponding path program 1 times [2018-01-25 03:44:20,364 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:44:20,365 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:44:20,365 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:44:20,365 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:44:20,365 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:44:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:44:20,377 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:44:20,583 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 28 DAG size of output 23 [2018-01-25 03:44:20,800 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 03:44:20,801 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:44:20,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 03:44:20,801 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:44:20,801 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 03:44:20,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 03:44:20,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-25 03:44:20,802 INFO L87 Difference]: Start difference. First operand 129 states and 152 transitions. Second operand 10 states. [2018-01-25 03:44:21,317 WARN L146 SmtUtils]: Spent 217ms on a formula simplification. DAG size of input: 41 DAG size of output 32 [2018-01-25 03:44:21,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:44:21,623 INFO L93 Difference]: Finished difference Result 148 states and 160 transitions. [2018-01-25 03:44:21,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 03:44:21,624 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-01-25 03:44:21,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:44:21,625 INFO L225 Difference]: With dead ends: 148 [2018-01-25 03:44:21,625 INFO L226 Difference]: Without dead ends: 147 [2018-01-25 03:44:21,625 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-01-25 03:44:21,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-01-25 03:44:21,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 129. [2018-01-25 03:44:21,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-25 03:44:21,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 151 transitions. [2018-01-25 03:44:21,636 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 151 transitions. Word has length 31 [2018-01-25 03:44:21,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:44:21,637 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 151 transitions. [2018-01-25 03:44:21,637 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 03:44:21,637 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 151 transitions. [2018-01-25 03:44:21,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 03:44:21,638 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:44:21,638 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 03:44:21,638 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 03:44:21,638 INFO L82 PathProgramCache]: Analyzing trace with hash -246205034, now seen corresponding path program 1 times [2018-01-25 03:44:21,639 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:44:21,640 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:44:21,640 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:44:21,640 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:44:21,640 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:44:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:44:21,657 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:44:22,196 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 03:44:22,196 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:44:22,196 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-25 03:44:22,196 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:44:22,196 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 03:44:22,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 03:44:22,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-01-25 03:44:22,197 INFO L87 Difference]: Start difference. First operand 129 states and 151 transitions. Second operand 13 states. [2018-01-25 03:44:22,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:44:22,919 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2018-01-25 03:44:22,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 03:44:22,920 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-01-25 03:44:22,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:44:22,920 INFO L225 Difference]: With dead ends: 165 [2018-01-25 03:44:22,921 INFO L226 Difference]: Without dead ends: 142 [2018-01-25 03:44:22,921 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2018-01-25 03:44:22,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-01-25 03:44:22,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 129. [2018-01-25 03:44:22,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-25 03:44:22,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2018-01-25 03:44:22,929 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 33 [2018-01-25 03:44:22,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:44:22,929 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2018-01-25 03:44:22,929 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 03:44:22,929 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2018-01-25 03:44:22,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 03:44:22,930 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:44:22,930 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:44:22,930 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 03:44:22,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1646590979, now seen corresponding path program 1 times [2018-01-25 03:44:22,930 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:44:22,931 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:44:22,931 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:44:22,931 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:44:22,931 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:44:22,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:44:22,941 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:44:23,194 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 03:44:23,195 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:44:23,195 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:44:23,196 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-01-25 03:44:23,198 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [5], [8], [11], [15], [17], [20], [83], [86], [89], [93], [98], [102], [110], [112], [113], [119], [123], [124], [127], [130], [133], [151], [155], [161], [164], [201], [202], [206], [207], [208] [2018-01-25 03:44:23,253 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:44:23,358 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