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/list-ext-properties/test-0504_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 03:20:25,896 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 03:20:25,898 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 03:20:25,915 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 03:20:25,915 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 03:20:25,916 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 03:20:25,917 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 03:20:25,919 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 03:20:25,921 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 03:20:25,922 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 03:20:25,923 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 03:20:25,923 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 03:20:25,924 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 03:20:25,926 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 03:20:25,927 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 03:20:25,929 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 03:20:25,932 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 03:20:25,934 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 03:20:25,935 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 03:20:25,936 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 03:20:25,939 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 03:20:25,939 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 03:20:25,939 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 03:20:26,004 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 03:20:26,006 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 03:20:26,007 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 03:20:26,007 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 03:20:26,008 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 03:20:26,008 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 03:20:26,008 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 03:20:26,009 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 03:20:26,009 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:20:26,019 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 03:20:26,019 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 03:20:26,020 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 03:20:26,020 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 03:20:26,020 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 03:20:26,020 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 03:20:26,021 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 03:20:26,021 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 03:20:26,021 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 03:20:26,022 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 03:20:26,022 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 03:20:26,022 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 03:20:26,022 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 03:20:26,022 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 03:20:26,023 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 03:20:26,023 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 03:20:26,023 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 03:20:26,023 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 03:20:26,023 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 03:20:26,023 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 03:20:26,024 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 03:20:26,024 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 03:20:26,024 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 03:20:26,024 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 03:20:26,024 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 03:20:26,025 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:20:26,025 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 03:20:26,025 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 03:20:26,025 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 03:20:26,025 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 03:20:26,026 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 03:20:26,026 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 03:20:26,026 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 03:20:26,026 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 03:20:26,026 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 03:20:26,027 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 03:20:26,027 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 03:20:26,063 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 03:20:26,076 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 03:20:26,080 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 03:20:26,082 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 03:20:26,082 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 03:20:26,083 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0504_1_true-valid-memsafety.i [2018-01-25 03:20:26,353 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 03:20:26,358 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 03:20:26,358 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 03:20:26,359 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 03:20:26,364 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 03:20:26,365 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:20:26" (1/1) ... [2018-01-25 03:20:26,368 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48f31c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:20:26, skipping insertion in model container [2018-01-25 03:20:26,368 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:20:26" (1/1) ... [2018-01-25 03:20:26,382 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:20:26,421 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:20:26,545 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:20:26,571 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:20:26,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:20:26 WrapperNode [2018-01-25 03:20:26,581 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 03:20:26,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 03:20:26,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 03:20:26,582 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 03:20:26,598 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:20:26" (1/1) ... [2018-01-25 03:20:26,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:20:26" (1/1) ... [2018-01-25 03:20:26,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:20:26" (1/1) ... [2018-01-25 03:20:26,608 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:20:26" (1/1) ... [2018-01-25 03:20:26,616 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:20:26" (1/1) ... [2018-01-25 03:20:26,620 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:20:26" (1/1) ... [2018-01-25 03:20:26,622 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:20:26" (1/1) ... [2018-01-25 03:20:26,625 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 03:20:26,626 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 03:20:26,626 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 03:20:26,626 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 03:20:26,627 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:20:26" (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:20:26,676 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 03:20:26,677 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 03:20:26,677 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 03:20:26,677 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 03:20:26,677 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 03:20:26,677 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 03:20:26,677 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 03:20:26,678 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 03:20:26,678 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 03:20:26,678 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 03:20:26,678 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 03:20:26,678 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 03:20:26,678 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-25 03:20:26,679 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 03:20:26,679 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 03:20:26,679 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 03:20:26,679 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 03:20:27,128 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 03:20:27,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:20:27 BoogieIcfgContainer [2018-01-25 03:20:27,130 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 03:20:27,131 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 03:20:27,131 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 03:20:27,135 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 03:20:27,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 03:20:26" (1/3) ... [2018-01-25 03:20:27,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3681dd75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:20:27, skipping insertion in model container [2018-01-25 03:20:27,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:20:26" (2/3) ... [2018-01-25 03:20:27,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3681dd75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:20:27, skipping insertion in model container [2018-01-25 03:20:27,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:20:27" (3/3) ... [2018-01-25 03:20:27,141 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0504_1_true-valid-memsafety.i [2018-01-25 03:20:27,148 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 03:20:27,155 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2018-01-25 03:20:27,207 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 03:20:27,207 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 03:20:27,207 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 03:20:27,207 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 03:20:27,208 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 03:20:27,208 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 03:20:27,208 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 03:20:27,208 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 03:20:27,209 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 03:20:27,236 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states. [2018-01-25 03:20:27,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-25 03:20:27,243 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:20:27,245 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:20:27,245 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 03:20:27,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1548810554, now seen corresponding path program 1 times [2018-01-25 03:20:27,253 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:20:27,315 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:20:27,315 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:20:27,316 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:20:27,316 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:20:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:20:27,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:20:27,421 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:20:27,424 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:20:27,425 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 03:20:27,425 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:20:27,428 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-25 03:20:27,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-25 03:20:27,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 03:20:27,448 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 2 states. [2018-01-25 03:20:27,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:20:27,592 INFO L93 Difference]: Finished difference Result 196 states and 222 transitions. [2018-01-25 03:20:27,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-25 03:20:27,593 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-01-25 03:20:27,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:20:27,603 INFO L225 Difference]: With dead ends: 196 [2018-01-25 03:20:27,603 INFO L226 Difference]: Without dead ends: 98 [2018-01-25 03:20:27,608 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 03:20:27,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-25 03:20:27,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-01-25 03:20:27,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-25 03:20:27,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2018-01-25 03:20:27,644 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 10 [2018-01-25 03:20:27,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:20:27,644 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2018-01-25 03:20:27,644 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-25 03:20:27,645 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2018-01-25 03:20:27,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 03:20:27,645 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:20:27,645 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:20:27,645 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 03:20:27,646 INFO L82 PathProgramCache]: Analyzing trace with hash -2085004617, now seen corresponding path program 1 times [2018-01-25 03:20:27,646 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:20:27,647 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:20:27,647 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:20:27,647 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:20:27,647 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:20:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:20:27,670 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:20:27,713 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:20:27,714 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:20:27,714 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:20:27,714 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:20:27,716 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 03:20:27,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 03:20:27,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:20:27,717 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand 3 states. [2018-01-25 03:20:27,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:20:27,754 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2018-01-25 03:20:27,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 03:20:27,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-25 03:20:27,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:20:27,757 INFO L225 Difference]: With dead ends: 136 [2018-01-25 03:20:27,757 INFO L226 Difference]: Without dead ends: 107 [2018-01-25 03:20:27,758 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:20:27,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-25 03:20:27,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2018-01-25 03:20:27,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-25 03:20:27,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2018-01-25 03:20:27,771 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 13 [2018-01-25 03:20:27,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:20:27,771 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2018-01-25 03:20:27,771 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 03:20:27,771 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2018-01-25 03:20:27,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 03:20:27,772 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:20:27,772 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:20:27,772 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 03:20:27,773 INFO L82 PathProgramCache]: Analyzing trace with hash -211715870, now seen corresponding path program 1 times [2018-01-25 03:20:27,773 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:20:27,774 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:20:27,774 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:20:27,774 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:20:27,774 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:20:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:20:27,792 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:20:27,932 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:20:27,933 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:20:27,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:20:27,933 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:20:27,934 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:20:27,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:20:27,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:20:27,934 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand 4 states. [2018-01-25 03:20:28,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:20:28,192 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2018-01-25 03:20:28,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:20:28,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 03:20:28,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:20:28,195 INFO L225 Difference]: With dead ends: 135 [2018-01-25 03:20:28,195 INFO L226 Difference]: Without dead ends: 127 [2018-01-25 03:20:28,196 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:20:28,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-25 03:20:28,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 96. [2018-01-25 03:20:28,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-25 03:20:28,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2018-01-25 03:20:28,203 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 14 [2018-01-25 03:20:28,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:20:28,204 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2018-01-25 03:20:28,204 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:20:28,204 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2018-01-25 03:20:28,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 03:20:28,204 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:20:28,205 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:20:28,205 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 03:20:28,205 INFO L82 PathProgramCache]: Analyzing trace with hash -211715869, now seen corresponding path program 1 times [2018-01-25 03:20:28,205 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:20:28,206 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:20:28,206 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:20:28,206 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:20:28,206 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:20:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:20:28,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:20:28,314 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:20:28,315 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:20:28,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:20:28,315 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:20:28,315 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:20:28,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:20:28,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:20:28,316 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand 4 states. [2018-01-25 03:20:28,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:20:28,439 INFO L93 Difference]: Finished difference Result 144 states and 160 transitions. [2018-01-25 03:20:28,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:20:28,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 03:20:28,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:20:28,441 INFO L225 Difference]: With dead ends: 144 [2018-01-25 03:20:28,441 INFO L226 Difference]: Without dead ends: 138 [2018-01-25 03:20:28,442 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:20:28,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-01-25 03:20:28,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 99. [2018-01-25 03:20:28,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-25 03:20:28,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2018-01-25 03:20:28,452 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 14 [2018-01-25 03:20:28,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:20:28,452 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2018-01-25 03:20:28,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:20:28,452 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2018-01-25 03:20:28,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 03:20:28,453 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:20:28,453 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:20:28,453 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 03:20:28,454 INFO L82 PathProgramCache]: Analyzing trace with hash -210634142, now seen corresponding path program 1 times [2018-01-25 03:20:28,454 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:20:28,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:20:28,455 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:20:28,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:20:28,455 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:20:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:20:28,464 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:20:28,485 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:20:28,485 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:20:28,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 03:20:28,486 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:20:28,486 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 03:20:28,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 03:20:28,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:20:28,487 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand 3 states. [2018-01-25 03:20:28,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:20:28,546 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2018-01-25 03:20:28,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 03:20:28,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-01-25 03:20:28,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:20:28,548 INFO L225 Difference]: With dead ends: 103 [2018-01-25 03:20:28,548 INFO L226 Difference]: Without dead ends: 98 [2018-01-25 03:20:28,549 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:20:28,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-25 03:20:28,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-01-25 03:20:28,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-25 03:20:28,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2018-01-25 03:20:28,557 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 14 [2018-01-25 03:20:28,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:20:28,557 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2018-01-25 03:20:28,557 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 03:20:28,558 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2018-01-25 03:20:28,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 03:20:28,558 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:20:28,559 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:20:28,559 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 03:20:28,559 INFO L82 PathProgramCache]: Analyzing trace with hash 479661366, now seen corresponding path program 1 times [2018-01-25 03:20:28,559 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:20:28,560 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:20:28,560 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:20:28,560 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:20:28,560 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:20:28,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:20:28,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:20:28,657 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:20:28,657 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:20:28,657 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:20:28,657 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:20:28,658 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 03:20:28,658 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 03:20:28,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:20:28,658 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand 3 states. [2018-01-25 03:20:28,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:20:28,685 INFO L93 Difference]: Finished difference Result 230 states and 261 transitions. [2018-01-25 03:20:28,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 03:20:28,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-01-25 03:20:28,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:20:28,687 INFO L225 Difference]: With dead ends: 230 [2018-01-25 03:20:28,687 INFO L226 Difference]: Without dead ends: 143 [2018-01-25 03:20:28,688 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:20:28,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-25 03:20:28,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 125. [2018-01-25 03:20:28,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-25 03:20:28,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 152 transitions. [2018-01-25 03:20:28,700 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 152 transitions. Word has length 26 [2018-01-25 03:20:28,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:20:28,701 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 152 transitions. [2018-01-25 03:20:28,701 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 03:20:28,701 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 152 transitions. [2018-01-25 03:20:28,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 03:20:28,702 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:20:28,702 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:20:28,702 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 03:20:28,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1985366289, now seen corresponding path program 1 times [2018-01-25 03:20:28,702 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:20:28,703 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:20:28,704 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:20:28,704 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:20:28,704 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:20:28,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:20:28,734 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:20:28,905 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:20:28,905 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:20:28,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:20:28,905 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:20:28,906 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:20:28,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:20:28,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:20:28,906 INFO L87 Difference]: Start difference. First operand 125 states and 152 transitions. Second operand 5 states. [2018-01-25 03:20:29,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:20:29,088 INFO L93 Difference]: Finished difference Result 228 states and 263 transitions. [2018-01-25 03:20:29,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 03:20:29,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-01-25 03:20:29,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:20:29,090 INFO L225 Difference]: With dead ends: 228 [2018-01-25 03:20:29,090 INFO L226 Difference]: Without dead ends: 225 [2018-01-25 03:20:29,091 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:20:29,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-01-25 03:20:29,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 114. [2018-01-25 03:20:29,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-25 03:20:29,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 134 transitions. [2018-01-25 03:20:29,105 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 134 transitions. Word has length 27 [2018-01-25 03:20:29,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:20:29,106 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 134 transitions. [2018-01-25 03:20:29,106 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:20:29,106 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 134 transitions. [2018-01-25 03:20:29,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 03:20:29,107 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:20:29,107 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:20:29,107 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 03:20:29,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1416812824, now seen corresponding path program 1 times [2018-01-25 03:20:29,108 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:20:29,109 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:20:29,109 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:20:29,110 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:20:29,110 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:20:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:20:29,129 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:20:29,164 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:20:29,165 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:20:29,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:20:29,165 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:20:29,165 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:20:29,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:20:29,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:20:29,166 INFO L87 Difference]: Start difference. First operand 114 states and 134 transitions. Second operand 4 states. [2018-01-25 03:20:29,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:20:29,376 INFO L93 Difference]: Finished difference Result 175 states and 204 transitions. [2018-01-25 03:20:29,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:20:29,376 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-25 03:20:29,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:20:29,378 INFO L225 Difference]: With dead ends: 175 [2018-01-25 03:20:29,378 INFO L226 Difference]: Without dead ends: 171 [2018-01-25 03:20:29,379 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:20:29,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-01-25 03:20:29,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 110. [2018-01-25 03:20:29,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-01-25 03:20:29,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 126 transitions. [2018-01-25 03:20:29,385 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 126 transitions. Word has length 28 [2018-01-25 03:20:29,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:20:29,386 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 126 transitions. [2018-01-25 03:20:29,386 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:20:29,386 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 126 transitions. [2018-01-25 03:20:29,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 03:20:29,387 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:20:29,387 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:20:29,387 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 03:20:29,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1416812825, now seen corresponding path program 1 times [2018-01-25 03:20:29,387 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:20:29,388 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:20:29,388 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:20:29,388 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:20:29,388 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:20:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:20:29,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:20:29,497 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:20:29,498 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:20:29,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:20:29,498 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:20:29,498 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:20:29,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:20:29,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:20:29,499 INFO L87 Difference]: Start difference. First operand 110 states and 126 transitions. Second operand 4 states. [2018-01-25 03:20:29,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:20:29,598 INFO L93 Difference]: Finished difference Result 163 states and 188 transitions. [2018-01-25 03:20:29,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:20:29,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-25 03:20:29,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:20:29,599 INFO L225 Difference]: With dead ends: 163 [2018-01-25 03:20:29,599 INFO L226 Difference]: Without dead ends: 159 [2018-01-25 03:20:29,600 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:20:29,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-25 03:20:29,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 106. [2018-01-25 03:20:29,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-25 03:20:29,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2018-01-25 03:20:29,606 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 28 [2018-01-25 03:20:29,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:20:29,607 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2018-01-25 03:20:29,607 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:20:29,607 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2018-01-25 03:20:29,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 03:20:29,608 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:20:29,608 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:20:29,608 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 03:20:29,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1627264726, now seen corresponding path program 1 times [2018-01-25 03:20:29,608 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:20:29,609 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:20:29,609 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:20:29,609 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:20:29,609 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:20:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:20:29,630 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:20:29,713 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:20:29,714 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:20:29,714 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:20:29,714 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:20:29,714 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:20:29,714 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:20:29,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:20:29,715 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand 6 states. [2018-01-25 03:20:29,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:20:29,953 INFO L93 Difference]: Finished difference Result 186 states and 209 transitions. [2018-01-25 03:20:29,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 03:20:29,953 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-25 03:20:29,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:20:29,954 INFO L225 Difference]: With dead ends: 186 [2018-01-25 03:20:29,954 INFO L226 Difference]: Without dead ends: 185 [2018-01-25 03:20:29,955 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-25 03:20:29,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-01-25 03:20:29,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 130. [2018-01-25 03:20:29,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-25 03:20:29,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 148 transitions. [2018-01-25 03:20:29,963 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 148 transitions. Word has length 31 [2018-01-25 03:20:29,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:20:29,963 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 148 transitions. [2018-01-25 03:20:29,963 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:20:29,964 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 148 transitions. [2018-01-25 03:20:29,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 03:20:29,965 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:20:29,965 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:20:29,965 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 03:20:29,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1627264727, now seen corresponding path program 1 times [2018-01-25 03:20:29,965 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:20:29,966 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:20:29,966 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:20:29,967 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:20:29,967 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:20:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:20:29,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:20:30,253 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:20:30,254 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:20:30,254 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 03:20:30,254 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:20:30,254 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 03:20:30,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 03:20:30,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-25 03:20:30,255 INFO L87 Difference]: Start difference. First operand 130 states and 148 transitions. Second operand 10 states. [2018-01-25 03:20:30,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:20:30,697 INFO L93 Difference]: Finished difference Result 235 states and 261 transitions. [2018-01-25 03:20:30,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 03:20:30,697 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-01-25 03:20:30,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:20:30,699 INFO L225 Difference]: With dead ends: 235 [2018-01-25 03:20:30,700 INFO L226 Difference]: Without dead ends: 234 [2018-01-25 03:20:30,700 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-01-25 03:20:30,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-01-25 03:20:30,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 130. [2018-01-25 03:20:30,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-25 03:20:30,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 146 transitions. [2018-01-25 03:20:30,713 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 146 transitions. Word has length 31 [2018-01-25 03:20:30,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:20:30,714 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 146 transitions. [2018-01-25 03:20:30,714 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 03:20:30,715 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 146 transitions. [2018-01-25 03:20:30,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 03:20:30,716 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:20:30,716 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:20:30,716 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 03:20:30,716 INFO L82 PathProgramCache]: Analyzing trace with hash 414150462, now seen corresponding path program 1 times [2018-01-25 03:20:30,716 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:20:30,717 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:20:30,717 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:20:30,718 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:20:30,718 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:20:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:20:30,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:20:30,790 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:20:30,790 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:20:30,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:20:30,791 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:20:30,791 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:20:30,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:20:30,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:20:30,792 INFO L87 Difference]: Start difference. First operand 130 states and 146 transitions. Second operand 4 states. [2018-01-25 03:20:30,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:20:30,934 INFO L93 Difference]: Finished difference Result 161 states and 177 transitions. [2018-01-25 03:20:30,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:20:30,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-01-25 03:20:30,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:20:30,935 INFO L225 Difference]: With dead ends: 161 [2018-01-25 03:20:30,935 INFO L226 Difference]: Without dead ends: 160 [2018-01-25 03:20:30,935 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:20:30,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-01-25 03:20:30,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 133. [2018-01-25 03:20:30,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-25 03:20:30,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 151 transitions. [2018-01-25 03:20:30,942 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 151 transitions. Word has length 32 [2018-01-25 03:20:30,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:20:30,943 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 151 transitions. [2018-01-25 03:20:30,943 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:20:30,943 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 151 transitions. [2018-01-25 03:20:30,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 03:20:30,943 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:20:30,944 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:20:30,944 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 03:20:30,944 INFO L82 PathProgramCache]: Analyzing trace with hash 414150463, now seen corresponding path program 1 times [2018-01-25 03:20:30,944 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:20:30,945 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:20:30,945 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:20:30,945 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:20:30,945 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:20:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:20:30,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:20:31,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:20:31,025 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:20:31,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:20:31,025 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:20:31,026 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:20:31,026 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:20:31,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:20:31,027 INFO L87 Difference]: Start difference. First operand 133 states and 151 transitions. Second operand 5 states. [2018-01-25 03:20:31,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:20:31,163 INFO L93 Difference]: Finished difference Result 213 states and 243 transitions. [2018-01-25 03:20:31,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:20:31,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-01-25 03:20:31,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:20:31,164 INFO L225 Difference]: With dead ends: 213 [2018-01-25 03:20:31,164 INFO L226 Difference]: Without dead ends: 212 [2018-01-25 03:20:31,165 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:20:31,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-01-25 03:20:31,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 162. [2018-01-25 03:20:31,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-01-25 03:20:31,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 189 transitions. [2018-01-25 03:20:31,176 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 189 transitions. Word has length 32 [2018-01-25 03:20:31,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:20:31,176 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 189 transitions. [2018-01-25 03:20:31,176 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:20:31,176 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 189 transitions. [2018-01-25 03:20:31,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 03:20:31,177 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:20:31,177 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:20:31,177 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-25 03:20:31,178 INFO L82 PathProgramCache]: Analyzing trace with hash -46238021, now seen corresponding path program 1 times [2018-01-25 03:20:31,178 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:20:31,178 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:20:31,179 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:20:31,179 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:20:31,179 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:20:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:20:31,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:20:31,219 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:20:31,220 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:20:31,220 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:20:31,221 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-01-25 03:20:31,223 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [9], [15], [17], [18], [19], [24], [26], [29], [32], [35], [38], [41], [45], [47], [50], [56], [94], [97], [113], [117], [163], [165], [166], [167], [171], [172], [173] [2018-01-25 03:20:31,291 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:20:31,291 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