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/memsafety/test-0232_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 02:53:44,934 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 02:53:44,936 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 02:53:44,951 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 02:53:44,951 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 02:53:44,952 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 02:53:44,954 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 02:53:44,956 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 02:53:44,958 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 02:53:44,959 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 02:53:44,960 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 02:53:44,960 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 02:53:44,963 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 02:53:44,965 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 02:53:44,966 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 02:53:44,972 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 02:53:44,977 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 02:53:44,979 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 02:53:44,980 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 02:53:44,982 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 02:53:44,984 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 02:53:44,984 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 02:53:44,984 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 02:53:44,985 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 02:53:44,986 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 02:53:44,988 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 02:53:44,988 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 02:53:44,989 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 02:53:44,989 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 02:53:44,989 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 02:53:44,990 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 02:53:44,990 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 02:53:45,001 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 02:53:45,001 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 02:53:45,002 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 02:53:45,002 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 02:53:45,002 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 02:53:45,002 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 02:53:45,003 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 02:53:45,003 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 02:53:45,003 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 02:53:45,004 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 02:53:45,004 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 02:53:45,004 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 02:53:45,004 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 02:53:45,005 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 02:53:45,005 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 02:53:45,005 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 02:53:45,005 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 02:53:45,005 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 02:53:45,006 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 02:53:45,006 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 02:53:45,006 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 02:53:45,006 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 02:53:45,006 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 02:53:45,007 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 02:53:45,007 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 02:53:45,007 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:53:45,007 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 02:53:45,007 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 02:53:45,008 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 02:53:45,008 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 02:53:45,010 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 02:53:45,010 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 02:53:45,010 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 02:53:45,010 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 02:53:45,011 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 02:53:45,011 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 02:53:45,012 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 02:53:45,080 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 02:53:45,100 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 02:53:45,107 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 02:53:45,109 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 02:53:45,109 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 02:53:45,110 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0232_false-valid-free.i [2018-01-25 02:53:45,466 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 02:53:45,474 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 02:53:45,476 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 02:53:45,476 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 02:53:45,484 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 02:53:45,486 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:53:45" (1/1) ... [2018-01-25 02:53:45,491 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@504ca3c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:53:45, skipping insertion in model container [2018-01-25 02:53:45,491 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:53:45" (1/1) ... [2018-01-25 02:53:45,551 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:53:45,691 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:53:45,875 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:53:45,925 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:53:45,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:53:45 WrapperNode [2018-01-25 02:53:45,948 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 02:53:45,949 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 02:53:45,949 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 02:53:45,949 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 02:53:45,989 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:53:45" (1/1) ... [2018-01-25 02:53:45,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:53:45" (1/1) ... [2018-01-25 02:53:46,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:53:45" (1/1) ... [2018-01-25 02:53:46,003 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:53:45" (1/1) ... [2018-01-25 02:53:46,010 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:53:45" (1/1) ... [2018-01-25 02:53:46,014 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:53:45" (1/1) ... [2018-01-25 02:53:46,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:53:45" (1/1) ... [2018-01-25 02:53:46,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 02:53:46,019 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 02:53:46,019 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 02:53:46,019 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 02:53:46,020 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:53:45" (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 02:53:46,096 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 02:53:46,096 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 02:53:46,096 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-25 02:53:46,096 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 02:53:46,097 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 02:53:46,097 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 02:53:46,097 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 02:53:46,097 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 02:53:46,097 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 02:53:46,097 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 02:53:46,098 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 02:53:46,098 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 02:53:46,098 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-25 02:53:46,098 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 02:53:46,098 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 02:53:46,098 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 02:53:46,629 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 02:53:46,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:53:46 BoogieIcfgContainer [2018-01-25 02:53:46,630 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 02:53:46,631 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 02:53:46,631 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 02:53:46,634 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 02:53:46,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 02:53:45" (1/3) ... [2018-01-25 02:53:46,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485c3f21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:53:46, skipping insertion in model container [2018-01-25 02:53:46,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:53:45" (2/3) ... [2018-01-25 02:53:46,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485c3f21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:53:46, skipping insertion in model container [2018-01-25 02:53:46,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:53:46" (3/3) ... [2018-01-25 02:53:46,639 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0232_false-valid-free.i [2018-01-25 02:53:46,649 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 02:53:46,658 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 53 error locations. [2018-01-25 02:53:46,712 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 02:53:46,713 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 02:53:46,713 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 02:53:46,713 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 02:53:46,713 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 02:53:46,713 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 02:53:46,713 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 02:53:46,713 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 02:53:46,714 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 02:53:46,732 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states. [2018-01-25 02:53:46,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-25 02:53:46,738 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:53:46,739 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:53:46,739 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 02:53:46,743 INFO L82 PathProgramCache]: Analyzing trace with hash 842410072, now seen corresponding path program 1 times [2018-01-25 02:53:46,745 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:53:46,789 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:46,789 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:53:46,789 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:46,789 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:53:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:53:46,834 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:53:46,888 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 02:53:46,890 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:53:46,890 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 02:53:46,890 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:53:46,893 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 02:53:46,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 02:53:46,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 02:53:46,906 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 3 states. [2018-01-25 02:53:47,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:53:47,161 INFO L93 Difference]: Finished difference Result 188 states and 205 transitions. [2018-01-25 02:53:47,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 02:53:47,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-25 02:53:47,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:53:47,177 INFO L225 Difference]: With dead ends: 188 [2018-01-25 02:53:47,178 INFO L226 Difference]: Without dead ends: 112 [2018-01-25 02:53:47,182 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 02:53:47,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-25 02:53:47,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2018-01-25 02:53:47,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-25 02:53:47,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2018-01-25 02:53:47,236 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 7 [2018-01-25 02:53:47,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:53:47,236 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2018-01-25 02:53:47,236 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 02:53:47,236 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2018-01-25 02:53:47,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-25 02:53:47,237 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:53:47,237 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:53:47,237 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 02:53:47,237 INFO L82 PathProgramCache]: Analyzing trace with hash 842410073, now seen corresponding path program 1 times [2018-01-25 02:53:47,238 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:53:47,239 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:47,239 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:53:47,239 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:47,239 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:53:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:53:47,256 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:53:47,315 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 02:53:47,315 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:53:47,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 02:53:47,315 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:53:47,317 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 02:53:47,317 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 02:53:47,317 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 02:53:47,317 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand 3 states. [2018-01-25 02:53:47,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:53:47,458 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-01-25 02:53:47,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 02:53:47,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-25 02:53:47,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:53:47,460 INFO L225 Difference]: With dead ends: 111 [2018-01-25 02:53:47,460 INFO L226 Difference]: Without dead ends: 110 [2018-01-25 02:53:47,460 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 02:53:47,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-25 02:53:47,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2018-01-25 02:53:47,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-25 02:53:47,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2018-01-25 02:53:47,469 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 7 [2018-01-25 02:53:47,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:53:47,469 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2018-01-25 02:53:47,469 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 02:53:47,469 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2018-01-25 02:53:47,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 02:53:47,470 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:53:47,470 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:53:47,470 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 02:53:47,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1112643303, now seen corresponding path program 1 times [2018-01-25 02:53:47,470 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:53:47,471 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:47,471 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:53:47,472 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:47,472 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:53:47,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:53:47,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:53:47,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:53:47,597 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:53:47,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:53:47,597 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:53:47,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:53:47,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:53:47,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:53:47,598 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand 5 states. [2018-01-25 02:53:48,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:53:48,365 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-01-25 02:53:48,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:53:48,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-01-25 02:53:48,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:53:48,371 INFO L225 Difference]: With dead ends: 109 [2018-01-25 02:53:48,371 INFO L226 Difference]: Without dead ends: 106 [2018-01-25 02:53:48,371 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:53:48,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-25 02:53:48,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-01-25 02:53:48,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-25 02:53:48,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2018-01-25 02:53:48,380 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 13 [2018-01-25 02:53:48,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:53:48,380 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2018-01-25 02:53:48,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:53:48,380 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-01-25 02:53:48,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 02:53:48,381 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:53:48,381 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:53:48,381 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 02:53:48,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1112643304, now seen corresponding path program 1 times [2018-01-25 02:53:48,382 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:53:48,383 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:48,383 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:53:48,383 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:48,383 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:53:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:53:48,403 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:53:48,542 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 02:53:48,542 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:53:48,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 02:53:48,543 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:53:48,543 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 02:53:48,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 02:53:48,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:53:48,544 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 7 states. [2018-01-25 02:53:48,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:53:48,914 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-01-25 02:53:48,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:53:48,915 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-01-25 02:53:48,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:53:48,916 INFO L225 Difference]: With dead ends: 105 [2018-01-25 02:53:48,916 INFO L226 Difference]: Without dead ends: 93 [2018-01-25 02:53:48,917 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:53:48,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-25 02:53:48,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-01-25 02:53:48,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-25 02:53:48,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2018-01-25 02:53:48,923 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 13 [2018-01-25 02:53:48,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:53:48,923 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2018-01-25 02:53:48,923 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 02:53:48,923 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-01-25 02:53:48,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 02:53:48,924 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:53:48,924 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:53:48,924 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 02:53:48,924 INFO L82 PathProgramCache]: Analyzing trace with hash 132204114, now seen corresponding path program 1 times [2018-01-25 02:53:48,924 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:53:48,925 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:48,925 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:53:48,925 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:48,925 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:53:48,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:53:48,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:53:48,968 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 02:53:48,968 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:53:48,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:53:48,969 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:53:48,969 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:53:48,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:53:48,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:53:48,970 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 4 states. [2018-01-25 02:53:49,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:53:49,077 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2018-01-25 02:53:49,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:53:49,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 02:53:49,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:53:49,078 INFO L225 Difference]: With dead ends: 93 [2018-01-25 02:53:49,078 INFO L226 Difference]: Without dead ends: 89 [2018-01-25 02:53:49,078 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 02:53:49,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-25 02:53:49,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-01-25 02:53:49,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-25 02:53:49,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-01-25 02:53:49,084 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 14 [2018-01-25 02:53:49,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:53:49,084 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-01-25 02:53:49,084 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:53:49,085 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-01-25 02:53:49,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 02:53:49,085 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:53:49,085 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:53:49,085 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 02:53:49,085 INFO L82 PathProgramCache]: Analyzing trace with hash 132204115, now seen corresponding path program 1 times [2018-01-25 02:53:49,085 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:53:49,086 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:49,086 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:53:49,086 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:49,086 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:53:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:53:49,103 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:53:49,166 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 02:53:49,166 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:53:49,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:53:49,167 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:53:49,167 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:53:49,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:53:49,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:53:49,168 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 4 states. [2018-01-25 02:53:49,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:53:49,244 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-01-25 02:53:49,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:53:49,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 02:53:49,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:53:49,245 INFO L225 Difference]: With dead ends: 89 [2018-01-25 02:53:49,245 INFO L226 Difference]: Without dead ends: 85 [2018-01-25 02:53:49,245 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 02:53:49,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-25 02:53:49,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-25 02:53:49,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-25 02:53:49,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-01-25 02:53:49,254 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 14 [2018-01-25 02:53:49,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:53:49,255 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-01-25 02:53:49,255 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:53:49,255 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-01-25 02:53:49,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 02:53:49,256 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:53:49,256 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:53:49,256 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 02:53:49,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1054600686, now seen corresponding path program 1 times [2018-01-25 02:53:49,256 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:53:49,257 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:49,258 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:53:49,258 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:49,258 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:53:49,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:53:49,276 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:53:49,388 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 02:53:49,389 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:53:49,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 02:53:49,389 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:53:49,389 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 02:53:49,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 02:53:49,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:53:49,390 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 8 states. [2018-01-25 02:53:49,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:53:49,603 INFO L93 Difference]: Finished difference Result 178 states and 189 transitions. [2018-01-25 02:53:49,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 02:53:49,603 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-25 02:53:49,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:53:49,604 INFO L225 Difference]: With dead ends: 178 [2018-01-25 02:53:49,604 INFO L226 Difference]: Without dead ends: 100 [2018-01-25 02:53:49,605 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-01-25 02:53:49,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-25 02:53:49,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2018-01-25 02:53:49,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-25 02:53:49,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2018-01-25 02:53:49,611 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 19 [2018-01-25 02:53:49,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:53:49,612 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2018-01-25 02:53:49,612 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 02:53:49,612 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2018-01-25 02:53:49,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 02:53:49,613 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:53:49,613 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:53:49,614 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 02:53:49,614 INFO L82 PathProgramCache]: Analyzing trace with hash -882655928, now seen corresponding path program 1 times [2018-01-25 02:53:49,614 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:53:49,614 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:49,615 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:53:49,615 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:49,615 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:53:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:53:49,633 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:53:49,759 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 02:53:49,759 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:53:49,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 02:53:49,759 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:53:49,760 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 02:53:49,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 02:53:49,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:53:49,760 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand 7 states. [2018-01-25 02:53:49,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:53:49,997 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-01-25 02:53:49,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 02:53:49,998 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-01-25 02:53:49,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:53:50,000 INFO L225 Difference]: With dead ends: 117 [2018-01-25 02:53:50,000 INFO L226 Difference]: Without dead ends: 116 [2018-01-25 02:53:50,000 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-25 02:53:50,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-25 02:53:50,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 94. [2018-01-25 02:53:50,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-25 02:53:50,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2018-01-25 02:53:50,009 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 30 [2018-01-25 02:53:50,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:53:50,009 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2018-01-25 02:53:50,010 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 02:53:50,010 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2018-01-25 02:53:50,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 02:53:50,011 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:53:50,011 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:53:50,011 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 02:53:50,011 INFO L82 PathProgramCache]: Analyzing trace with hash -882655927, now seen corresponding path program 1 times [2018-01-25 02:53:50,012 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:53:50,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:50,013 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:53:50,013 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:50,013 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:53:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:53:50,045 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:53:50,275 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 02:53:50,275 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:53:50,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 02:53:50,275 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:53:50,276 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 02:53:50,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 02:53:50,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-25 02:53:50,276 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand 9 states. [2018-01-25 02:53:50,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:53:50,604 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2018-01-25 02:53:50,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 02:53:50,604 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-01-25 02:53:50,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:53:50,606 INFO L225 Difference]: With dead ends: 123 [2018-01-25 02:53:50,606 INFO L226 Difference]: Without dead ends: 122 [2018-01-25 02:53:50,606 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-01-25 02:53:50,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-25 02:53:50,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 93. [2018-01-25 02:53:50,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-25 02:53:50,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2018-01-25 02:53:50,631 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 30 [2018-01-25 02:53:50,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:53:50,634 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2018-01-25 02:53:50,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 02:53:50,634 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2018-01-25 02:53:50,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 02:53:50,635 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:53:50,635 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:53:50,635 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 02:53:50,636 INFO L82 PathProgramCache]: Analyzing trace with hash -552202616, now seen corresponding path program 1 times [2018-01-25 02:53:50,637 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:53:50,638 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:50,639 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:53:50,639 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:50,639 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:53:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:53:50,700 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:53:50,922 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 02:53:50,923 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:53:50,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:53:50,923 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:53:50,924 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:53:50,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:53:50,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:53:50,924 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand 5 states. [2018-01-25 02:53:50,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:53:50,991 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2018-01-25 02:53:50,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:53:50,992 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-25 02:53:50,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:53:50,993 INFO L225 Difference]: With dead ends: 130 [2018-01-25 02:53:50,993 INFO L226 Difference]: Without dead ends: 99 [2018-01-25 02:53:50,993 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:53:50,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-25 02:53:50,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2018-01-25 02:53:50,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-25 02:53:50,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2018-01-25 02:53:51,000 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 33 [2018-01-25 02:53:51,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:53:51,000 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2018-01-25 02:53:51,000 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:53:51,001 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2018-01-25 02:53:51,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 02:53:51,002 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:53:51,002 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:53:51,002 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 02:53:51,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1412958943, now seen corresponding path program 1 times [2018-01-25 02:53:51,002 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:53:51,003 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:51,004 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:53:51,004 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:51,004 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:53:51,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:53:51,020 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:53:51,105 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 02:53:51,106 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:53:51,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:53:51,106 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:53:51,106 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:53:51,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:53:51,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:53:51,107 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 5 states. [2018-01-25 02:53:51,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:53:51,305 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2018-01-25 02:53:51,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:53:51,305 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-25 02:53:51,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:53:51,306 INFO L225 Difference]: With dead ends: 96 [2018-01-25 02:53:51,306 INFO L226 Difference]: Without dead ends: 95 [2018-01-25 02:53:51,307 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:53:51,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-25 02:53:51,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-01-25 02:53:51,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-25 02:53:51,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2018-01-25 02:53:51,311 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 33 [2018-01-25 02:53:51,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:53:51,312 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2018-01-25 02:53:51,312 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:53:51,312 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2018-01-25 02:53:51,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 02:53:51,313 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:53:51,313 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:53:51,313 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 02:53:51,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1412958942, now seen corresponding path program 1 times [2018-01-25 02:53:51,314 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:53:51,314 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:51,315 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:53:51,315 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:51,315 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:53:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:53:51,337 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:53:51,679 WARN L146 SmtUtils]: Spent 181ms on a formula simplification. DAG size of input: 17 DAG size of output 16 [2018-01-25 02:53:51,803 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 02:53:51,803 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:53:51,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 02:53:51,804 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:53:51,804 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 02:53:51,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 02:53:51,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-01-25 02:53:51,805 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand 11 states. [2018-01-25 02:53:52,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:53:52,231 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2018-01-25 02:53:52,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-25 02:53:52,231 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2018-01-25 02:53:52,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:53:52,232 INFO L225 Difference]: With dead ends: 98 [2018-01-25 02:53:52,232 INFO L226 Difference]: Without dead ends: 97 [2018-01-25 02:53:52,233 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-01-25 02:53:52,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-25 02:53:52,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2018-01-25 02:53:52,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-25 02:53:52,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2018-01-25 02:53:52,237 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 33 [2018-01-25 02:53:52,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:53:52,237 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2018-01-25 02:53:52,237 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 02:53:52,237 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2018-01-25 02:53:52,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 02:53:52,238 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:53:52,239 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:53:52,239 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 02:53:52,239 INFO L82 PathProgramCache]: Analyzing trace with hash -852054260, now seen corresponding path program 1 times [2018-01-25 02:53:52,239 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:53:52,240 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:52,240 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:53:52,240 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:52,241 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:53:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:53:52,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:53:52,692 WARN L146 SmtUtils]: Spent 161ms on a formula simplification. DAG size of input: 20 DAG size of output 17 [2018-01-25 02:53:52,949 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 02:53:52,950 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:53:52,950 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-25 02:53:52,950 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:53:52,950 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 02:53:52,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 02:53:52,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-01-25 02:53:52,951 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand 15 states. [2018-01-25 02:53:53,515 WARN L143 SmtUtils]: Spent 247ms on a formula simplification that was a NOOP. DAG size: 34 [2018-01-25 02:53:54,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:53:54,214 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2018-01-25 02:53:54,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-25 02:53:54,215 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-01-25 02:53:54,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:53:54,217 INFO L225 Difference]: With dead ends: 133 [2018-01-25 02:53:54,217 INFO L226 Difference]: Without dead ends: 132 [2018-01-25 02:53:54,218 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2018-01-25 02:53:54,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-25 02:53:54,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 109. [2018-01-25 02:53:54,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-25 02:53:54,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2018-01-25 02:53:54,227 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 34 [2018-01-25 02:53:54,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:53:54,227 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2018-01-25 02:53:54,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 02:53:54,227 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2018-01-25 02:53:54,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 02:53:54,229 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:53:54,229 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:53:54,229 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 02:53:54,229 INFO L82 PathProgramCache]: Analyzing trace with hash -852054259, now seen corresponding path program 1 times [2018-01-25 02:53:54,229 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:53:54,230 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:54,230 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:53:54,231 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:54,231 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:53:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:53:54,252 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:53:54,670 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 02:53:54,670 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:53:54,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-25 02:53:54,671 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:53:54,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 02:53:54,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 02:53:54,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-01-25 02:53:54,672 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 15 states. [2018-01-25 02:53:55,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:53:55,251 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2018-01-25 02:53:55,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-25 02:53:55,252 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-01-25 02:53:55,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:53:55,252 INFO L225 Difference]: With dead ends: 122 [2018-01-25 02:53:55,253 INFO L226 Difference]: Without dead ends: 121 [2018-01-25 02:53:55,253 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=686, Unknown=0, NotChecked=0, Total=812 [2018-01-25 02:53:55,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-25 02:53:55,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 109. [2018-01-25 02:53:55,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-25 02:53:55,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2018-01-25 02:53:55,258 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 34 [2018-01-25 02:53:55,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:53:55,259 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2018-01-25 02:53:55,259 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 02:53:55,259 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2018-01-25 02:53:55,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-25 02:53:55,260 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:53:55,260 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:53:55,260 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 02:53:55,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1908491397, now seen corresponding path program 1 times [2018-01-25 02:53:55,261 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:53:55,262 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:55,262 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:53:55,262 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:55,262 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:53:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:53:55,273 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:53:55,339 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 02:53:55,339 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:53:55,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 02:53:55,340 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:53:55,340 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 02:53:55,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 02:53:55,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:53:55,341 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 8 states. [2018-01-25 02:53:55,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:53:55,639 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2018-01-25 02:53:55,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 02:53:55,639 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-01-25 02:53:55,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:53:55,640 INFO L225 Difference]: With dead ends: 114 [2018-01-25 02:53:55,640 INFO L226 Difference]: Without dead ends: 106 [2018-01-25 02:53:55,640 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-25 02:53:55,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-25 02:53:55,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-01-25 02:53:55,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-25 02:53:55,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-01-25 02:53:55,649 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 35 [2018-01-25 02:53:55,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:53:55,649 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-01-25 02:53:55,649 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 02:53:55,649 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-01-25 02:53:55,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-25 02:53:55,650 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:53:55,650 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:53:55,651 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 02:53:55,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1514610189, now seen corresponding path program 1 times [2018-01-25 02:53:55,651 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:53:55,652 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:55,652 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:53:55,652 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:55,652 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:53:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:53:55,672 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:53:56,334 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 02:53:56,334 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:53:56,334 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-25 02:53:56,334 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:53:56,335 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 02:53:56,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 02:53:56,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-01-25 02:53:56,335 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 15 states. [2018-01-25 02:53:56,868 WARN L146 SmtUtils]: Spent 356ms on a formula simplification. DAG size of input: 28 DAG size of output 28 [2018-01-25 02:53:57,412 WARN L146 SmtUtils]: Spent 274ms on a formula simplification. DAG size of input: 33 DAG size of output 32 [2018-01-25 02:53:58,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:53:58,710 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-01-25 02:53:58,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-25 02:53:58,710 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-01-25 02:53:58,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:53:58,712 INFO L225 Difference]: With dead ends: 145 [2018-01-25 02:53:58,712 INFO L226 Difference]: Without dead ends: 144 [2018-01-25 02:53:58,713 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=195, Invalid=797, Unknown=0, NotChecked=0, Total=992 [2018-01-25 02:53:58,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-25 02:53:58,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 118. [2018-01-25 02:53:58,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-25 02:53:58,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-01-25 02:53:58,722 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 36 [2018-01-25 02:53:58,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:53:58,722 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-01-25 02:53:58,722 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 02:53:58,723 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-01-25 02:53:58,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-25 02:53:58,723 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:53:58,723 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:53:58,724 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 02:53:58,724 INFO L82 PathProgramCache]: Analyzing trace with hash -291724377, now seen corresponding path program 1 times [2018-01-25 02:53:58,724 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:53:58,725 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:58,725 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:53:58,725 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:58,725 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:53:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:53:58,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:53:58,879 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 02:53:58,879 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:53:58,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 02:53:58,880 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:53:58,880 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 02:53:58,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 02:53:58,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:53:58,881 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 8 states. [2018-01-25 02:53:59,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:53:59,461 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2018-01-25 02:53:59,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 02:53:59,462 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-01-25 02:53:59,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:53:59,464 INFO L225 Difference]: With dead ends: 118 [2018-01-25 02:53:59,464 INFO L226 Difference]: Without dead ends: 117 [2018-01-25 02:53:59,464 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-25 02:53:59,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-25 02:53:59,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-01-25 02:53:59,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-25 02:53:59,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2018-01-25 02:53:59,472 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 37 [2018-01-25 02:53:59,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:53:59,472 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2018-01-25 02:53:59,472 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 02:53:59,472 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2018-01-25 02:53:59,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-25 02:53:59,473 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:53:59,473 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:53:59,473 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 02:53:59,473 INFO L82 PathProgramCache]: Analyzing trace with hash -291724376, now seen corresponding path program 1 times [2018-01-25 02:53:59,473 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:53:59,474 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:59,474 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:53:59,475 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:53:59,475 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:53:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:53:59,497 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:54:00,198 WARN L146 SmtUtils]: Spent 397ms on a formula simplification. DAG size of input: 19 DAG size of output 13 [2018-01-25 02:54:00,569 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 02:54:00,570 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:54:00,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-25 02:54:00,570 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:54:00,570 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 02:54:00,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 02:54:00,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-01-25 02:54:00,571 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand 15 states. [2018-01-25 02:54:01,015 WARN L146 SmtUtils]: Spent 202ms on a formula simplification. DAG size of input: 25 DAG size of output 24 [2018-01-25 02:54:01,320 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 35 DAG size of output 34 [2018-01-25 02:54:01,539 WARN L146 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 50 DAG size of output 49 [2018-01-25 02:54:01,936 WARN L146 SmtUtils]: Spent 287ms on a formula simplification. DAG size of input: 34 DAG size of output 28 [2018-01-25 02:54:02,311 WARN L146 SmtUtils]: Spent 211ms on a formula simplification. DAG size of input: 39 DAG size of output 33 [2018-01-25 02:54:02,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:54:02,634 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-01-25 02:54:02,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-25 02:54:02,634 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-01-25 02:54:02,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:54:02,635 INFO L225 Difference]: With dead ends: 128 [2018-01-25 02:54:02,635 INFO L226 Difference]: Without dead ends: 127 [2018-01-25 02:54:02,636 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2018-01-25 02:54:02,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-25 02:54:02,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 118. [2018-01-25 02:54:02,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-25 02:54:02,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-01-25 02:54:02,647 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 37 [2018-01-25 02:54:02,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:54:02,647 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-01-25 02:54:02,647 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 02:54:02,647 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-01-25 02:54:02,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-25 02:54:02,648 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:54:02,648 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:54:02,648 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 02:54:02,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1900218884, now seen corresponding path program 1 times [2018-01-25 02:54:02,649 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:54:02,650 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:54:02,650 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:54:02,650 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:54:02,650 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:54:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:54:02,662 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:54:02,910 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:54:02,910 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:54:02,910 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:54:02,911 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-01-25 02:54:02,912 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [6], [12], [15], [20], [113], [114], [115], [116], [119], [122], [123], [128], [129], [133], [137], [138], [139], [141], [144], [145], [148], [149], [150], [151], [153], [154] [2018-01-25 02:54:02,966 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:54:02,967 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