java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 23:20:36,480 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 23:20:36,481 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 23:20:36,496 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 23:20:36,497 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 23:20:36,498 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 23:20:36,499 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 23:20:36,500 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 23:20:36,503 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 23:20:36,503 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 23:20:36,504 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 23:20:36,505 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 23:20:36,505 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 23:20:36,507 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 23:20:36,508 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 23:20:36,510 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 23:20:36,512 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 23:20:36,514 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 23:20:36,515 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 23:20:36,517 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 23:20:36,519 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 23:20:36,519 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 23:20:36,519 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 23:20:36,520 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 23:20:36,521 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 23:20:36,522 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 23:20:36,523 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 23:20:36,523 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 23:20:36,523 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 23:20:36,524 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 23:20:36,524 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 23:20:36,524 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf [2018-01-24 23:20:36,533 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 23:20:36,533 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 23:20:36,534 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 23:20:36,534 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 23:20:36,534 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 23:20:36,534 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 23:20:36,534 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 23:20:36,534 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 23:20:36,535 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 23:20:36,535 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 23:20:36,535 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 23:20:36,535 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 23:20:36,535 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 23:20:36,536 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 23:20:36,536 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 23:20:36,536 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 23:20:36,536 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 23:20:36,536 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 23:20:36,536 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 23:20:36,536 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 23:20:36,536 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 23:20:36,537 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 23:20:36,537 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 23:20:36,537 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 23:20:36,537 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 23:20:36,537 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 23:20:36,538 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 23:20:36,538 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 23:20:36,538 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 23:20:36,538 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 23:20:36,538 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 23:20:36,538 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 23:20:36,538 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 23:20:36,538 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 23:20:36,539 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 23:20:36,539 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 23:20:36,571 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 23:20:36,581 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 23:20:36,584 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 23:20:36,585 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 23:20:36,586 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 23:20:36,586 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-01-24 23:20:36,740 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 23:20:36,745 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 23:20:36,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 23:20:36,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 23:20:36,750 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 23:20:36,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:20:36" (1/1) ... [2018-01-24 23:20:36,753 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29a59f06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:20:36, skipping insertion in model container [2018-01-24 23:20:36,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:20:36" (1/1) ... [2018-01-24 23:20:36,767 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 23:20:36,799 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 23:20:36,915 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 23:20:36,930 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 23:20:36,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:20:36 WrapperNode [2018-01-24 23:20:36,936 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 23:20:36,936 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 23:20:36,937 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 23:20:36,937 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 23:20:36,950 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:20:36" (1/1) ... [2018-01-24 23:20:36,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:20:36" (1/1) ... [2018-01-24 23:20:36,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:20:36" (1/1) ... [2018-01-24 23:20:36,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:20:36" (1/1) ... [2018-01-24 23:20:36,964 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:20:36" (1/1) ... [2018-01-24 23:20:36,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:20:36" (1/1) ... [2018-01-24 23:20:36,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:20:36" (1/1) ... [2018-01-24 23:20:36,969 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 23:20:36,970 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 23:20:36,970 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 23:20:36,970 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 23:20:36,971 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:20:36" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 23:20:37,017 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 23:20:37,017 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 23:20:37,017 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-01-24 23:20:37,017 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 23:20:37,018 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 23:20:37,018 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 23:20:37,018 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 23:20:37,018 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 23:20:37,018 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 23:20:37,018 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 23:20:37,018 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-01-24 23:20:37,018 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 23:20:37,018 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 23:20:37,018 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 23:20:37,247 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 23:20:37,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:20:37 BoogieIcfgContainer [2018-01-24 23:20:37,247 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 23:20:37,248 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 23:20:37,248 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 23:20:37,250 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 23:20:37,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:20:36" (1/3) ... [2018-01-24 23:20:37,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2def1c1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:20:37, skipping insertion in model container [2018-01-24 23:20:37,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:20:36" (2/3) ... [2018-01-24 23:20:37,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2def1c1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:20:37, skipping insertion in model container [2018-01-24 23:20:37,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:20:37" (3/3) ... [2018-01-24 23:20:37,253 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-01-24 23:20:37,259 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 23:20:37,265 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-24 23:20:37,304 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 23:20:37,305 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 23:20:37,305 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 23:20:37,305 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 23:20:37,305 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 23:20:37,305 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 23:20:37,305 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 23:20:37,306 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 23:20:37,306 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 23:20:37,328 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-01-24 23:20:37,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 23:20:37,335 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:20:37,336 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:20:37,337 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 23:20:37,342 INFO L82 PathProgramCache]: Analyzing trace with hash -417514722, now seen corresponding path program 1 times [2018-01-24 23:20:37,345 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:20:37,388 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:37,388 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:20:37,388 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:37,388 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:20:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:20:37,448 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:20:37,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:20:37,550 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:20:37,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 23:20:37,551 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:20:37,553 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 23:20:37,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 23:20:37,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 23:20:37,643 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 4 states. [2018-01-24 23:20:37,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:20:37,787 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-01-24 23:20:37,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 23:20:37,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 23:20:37,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:20:37,799 INFO L225 Difference]: With dead ends: 71 [2018-01-24 23:20:37,800 INFO L226 Difference]: Without dead ends: 54 [2018-01-24 23:20:37,803 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:20:37,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-24 23:20:37,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-24 23:20:37,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 23:20:37,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-01-24 23:20:37,836 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 13 [2018-01-24 23:20:37,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:20:37,836 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-01-24 23:20:37,836 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 23:20:37,836 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-01-24 23:20:37,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 23:20:37,837 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:20:37,837 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:20:37,837 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 23:20:37,837 INFO L82 PathProgramCache]: Analyzing trace with hash -417514721, now seen corresponding path program 1 times [2018-01-24 23:20:37,837 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:20:37,838 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:37,838 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:20:37,838 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:37,839 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:20:37,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:20:37,852 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:20:38,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:20:38,002 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:20:38,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 23:20:38,002 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:20:38,004 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 23:20:38,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 23:20:38,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:20:38,005 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 6 states. [2018-01-24 23:20:38,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:20:38,083 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-01-24 23:20:38,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:20:38,083 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-24 23:20:38,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:20:38,084 INFO L225 Difference]: With dead ends: 54 [2018-01-24 23:20:38,084 INFO L226 Difference]: Without dead ends: 53 [2018-01-24 23:20:38,085 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-24 23:20:38,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-24 23:20:38,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-24 23:20:38,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 23:20:38,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-01-24 23:20:38,093 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 13 [2018-01-24 23:20:38,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:20:38,093 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-01-24 23:20:38,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 23:20:38,093 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-01-24 23:20:38,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 23:20:38,094 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:20:38,094 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:20:38,094 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 23:20:38,094 INFO L82 PathProgramCache]: Analyzing trace with hash -58054499, now seen corresponding path program 1 times [2018-01-24 23:20:38,094 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:20:38,095 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:38,095 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:20:38,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:38,096 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:20:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:20:38,112 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:20:38,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:20:38,152 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:20:38,152 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 23:20:38,152 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:20:38,153 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 23:20:38,153 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 23:20:38,153 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 23:20:38,153 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 4 states. [2018-01-24 23:20:38,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:20:38,239 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-01-24 23:20:38,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 23:20:38,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 23:20:38,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:20:38,241 INFO L225 Difference]: With dead ends: 53 [2018-01-24 23:20:38,241 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 23:20:38,242 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:20:38,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 23:20:38,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-24 23:20:38,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 23:20:38,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-01-24 23:20:38,247 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 14 [2018-01-24 23:20:38,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:20:38,248 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-01-24 23:20:38,248 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 23:20:38,248 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-01-24 23:20:38,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 23:20:38,248 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:20:38,248 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:20:38,248 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 23:20:38,249 INFO L82 PathProgramCache]: Analyzing trace with hash -58054498, now seen corresponding path program 1 times [2018-01-24 23:20:38,249 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:20:38,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:38,250 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:20:38,250 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:38,250 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:20:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:20:38,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:20:38,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:20:38,323 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:20:38,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 23:20:38,323 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:20:38,323 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 23:20:38,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 23:20:38,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:20:38,324 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-01-24 23:20:38,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:20:38,386 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-01-24 23:20:38,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:20:38,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 23:20:38,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:20:38,387 INFO L225 Difference]: With dead ends: 52 [2018-01-24 23:20:38,387 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 23:20:38,388 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:20:38,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 23:20:38,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-24 23:20:38,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 23:20:38,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-01-24 23:20:38,392 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 14 [2018-01-24 23:20:38,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:20:38,392 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-01-24 23:20:38,392 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 23:20:38,392 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-01-24 23:20:38,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 23:20:38,393 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:20:38,393 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] [2018-01-24 23:20:38,393 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 23:20:38,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1465356832, now seen corresponding path program 1 times [2018-01-24 23:20:38,393 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:20:38,394 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:38,394 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:20:38,394 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:38,394 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:20:38,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:20:38,411 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:20:38,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:20:38,504 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:20:38,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 23:20:38,504 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:20:38,504 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 23:20:38,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 23:20:38,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 23:20:38,505 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 8 states. [2018-01-24 23:20:38,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:20:38,647 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-01-24 23:20:38,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 23:20:38,647 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-01-24 23:20:38,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:20:38,650 INFO L225 Difference]: With dead ends: 70 [2018-01-24 23:20:38,651 INFO L226 Difference]: Without dead ends: 68 [2018-01-24 23:20:38,651 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-24 23:20:38,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-24 23:20:38,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2018-01-24 23:20:38,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-24 23:20:38,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2018-01-24 23:20:38,659 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 20 [2018-01-24 23:20:38,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:20:38,659 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2018-01-24 23:20:38,659 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 23:20:38,659 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2018-01-24 23:20:38,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 23:20:38,660 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:20:38,660 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] [2018-01-24 23:20:38,660 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 23:20:38,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1465356831, now seen corresponding path program 1 times [2018-01-24 23:20:38,661 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:20:38,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:38,662 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:20:38,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:38,662 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:20:38,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:20:38,675 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:20:38,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:20:38,712 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:20:38,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 23:20:38,713 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:20:38,713 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 23:20:38,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 23:20:38,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:20:38,714 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand 5 states. [2018-01-24 23:20:38,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:20:38,779 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2018-01-24 23:20:38,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 23:20:38,780 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-24 23:20:38,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:20:38,781 INFO L225 Difference]: With dead ends: 57 [2018-01-24 23:20:38,781 INFO L226 Difference]: Without dead ends: 55 [2018-01-24 23:20:38,781 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:20:38,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-24 23:20:38,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-24 23:20:38,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 23:20:38,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-01-24 23:20:38,787 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 20 [2018-01-24 23:20:38,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:20:38,788 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-01-24 23:20:38,788 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 23:20:38,788 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-01-24 23:20:38,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 23:20:38,789 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:20:38,789 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:20:38,789 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 23:20:38,790 INFO L82 PathProgramCache]: Analyzing trace with hash -541357888, now seen corresponding path program 1 times [2018-01-24 23:20:38,790 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:20:38,791 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:38,791 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:20:38,791 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:38,791 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:20:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:20:38,805 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:20:38,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:20:38,856 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:20:38,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 23:20:38,856 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:20:38,856 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 23:20:38,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 23:20:38,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:20:38,857 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 6 states. [2018-01-24 23:20:38,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:20:38,946 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-01-24 23:20:38,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:20:38,948 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-24 23:20:38,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:20:38,949 INFO L225 Difference]: With dead ends: 55 [2018-01-24 23:20:38,950 INFO L226 Difference]: Without dead ends: 54 [2018-01-24 23:20:38,950 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 23:20:38,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-24 23:20:38,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-24 23:20:38,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 23:20:38,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2018-01-24 23:20:38,956 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 22 [2018-01-24 23:20:38,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:20:38,956 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2018-01-24 23:20:38,956 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 23:20:38,956 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-01-24 23:20:38,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 23:20:38,957 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:20:38,957 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:20:38,957 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 23:20:38,958 INFO L82 PathProgramCache]: Analyzing trace with hash -541357887, now seen corresponding path program 1 times [2018-01-24 23:20:38,958 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:20:38,959 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:38,959 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:20:38,959 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:38,959 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:20:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:20:38,971 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:20:39,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:20:39,172 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:20:39,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 23:20:39,173 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:20:39,173 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 23:20:39,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 23:20:39,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 23:20:39,174 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 9 states. [2018-01-24 23:20:39,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:20:39,273 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2018-01-24 23:20:39,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 23:20:39,273 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-24 23:20:39,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:20:39,274 INFO L225 Difference]: With dead ends: 57 [2018-01-24 23:20:39,274 INFO L226 Difference]: Without dead ends: 56 [2018-01-24 23:20:39,274 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-24 23:20:39,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-24 23:20:39,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-01-24 23:20:39,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 23:20:39,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-01-24 23:20:39,281 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 22 [2018-01-24 23:20:39,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:20:39,281 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-01-24 23:20:39,281 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 23:20:39,282 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-01-24 23:20:39,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 23:20:39,282 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:20:39,283 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:20:39,283 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 23:20:39,283 INFO L82 PathProgramCache]: Analyzing trace with hash -553886463, now seen corresponding path program 1 times [2018-01-24 23:20:39,283 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:20:39,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:39,284 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:20:39,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:39,284 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:20:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:20:39,296 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:20:39,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:20:39,343 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:20:39,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 23:20:39,344 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:20:39,344 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 23:20:39,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 23:20:39,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:20:39,345 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 6 states. [2018-01-24 23:20:39,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:20:39,414 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-01-24 23:20:39,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:20:39,415 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-24 23:20:39,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:20:39,416 INFO L225 Difference]: With dead ends: 54 [2018-01-24 23:20:39,416 INFO L226 Difference]: Without dead ends: 53 [2018-01-24 23:20:39,416 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 23:20:39,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-24 23:20:39,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-24 23:20:39,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 23:20:39,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-01-24 23:20:39,422 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 24 [2018-01-24 23:20:39,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:20:39,423 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-01-24 23:20:39,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 23:20:39,423 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-01-24 23:20:39,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 23:20:39,424 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:20:39,424 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] [2018-01-24 23:20:39,424 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 23:20:39,424 INFO L82 PathProgramCache]: Analyzing trace with hash -553886462, now seen corresponding path program 1 times [2018-01-24 23:20:39,424 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:20:39,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:39,425 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:20:39,426 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:39,426 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:20:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:20:39,439 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:20:39,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:20:39,554 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:20:39,554 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 23:20:39,554 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:20:39,555 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 23:20:39,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 23:20:39,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 23:20:39,555 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 8 states. [2018-01-24 23:20:39,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:20:39,784 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2018-01-24 23:20:39,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 23:20:39,784 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-01-24 23:20:39,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:20:39,785 INFO L225 Difference]: With dead ends: 65 [2018-01-24 23:20:39,785 INFO L226 Difference]: Without dead ends: 64 [2018-01-24 23:20:39,785 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-24 23:20:39,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-24 23:20:39,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2018-01-24 23:20:39,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 23:20:39,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-01-24 23:20:39,791 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 24 [2018-01-24 23:20:39,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:20:39,792 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-01-24 23:20:39,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 23:20:39,792 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-01-24 23:20:39,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 23:20:39,793 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:20:39,793 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:20:39,793 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 23:20:39,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1181606150, now seen corresponding path program 1 times [2018-01-24 23:20:39,794 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:20:39,794 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:39,795 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:20:39,795 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:39,795 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:20:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:20:39,809 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:20:39,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:20:39,901 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:20:39,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 23:20:39,901 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:20:39,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 23:20:39,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 23:20:39,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:20:39,902 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 6 states. [2018-01-24 23:20:40,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:20:40,047 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-01-24 23:20:40,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 23:20:40,077 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-24 23:20:40,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:20:40,078 INFO L225 Difference]: With dead ends: 54 [2018-01-24 23:20:40,078 INFO L226 Difference]: Without dead ends: 43 [2018-01-24 23:20:40,078 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 23:20:40,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-24 23:20:40,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-24 23:20:40,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-24 23:20:40,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-01-24 23:20:40,083 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 26 [2018-01-24 23:20:40,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:20:40,084 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-01-24 23:20:40,084 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 23:20:40,084 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-01-24 23:20:40,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 23:20:40,085 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:20:40,085 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:20:40,085 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 23:20:40,085 INFO L82 PathProgramCache]: Analyzing trace with hash 290777922, now seen corresponding path program 1 times [2018-01-24 23:20:40,085 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:20:40,086 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:40,086 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:20:40,087 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:40,087 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:20:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:20:40,101 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:20:40,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:20:40,153 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:20:40,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 23:20:40,154 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:20:40,154 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 23:20:40,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 23:20:40,155 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:20:40,155 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 6 states. [2018-01-24 23:20:40,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:20:40,221 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-01-24 23:20:40,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:20:40,222 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-24 23:20:40,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:20:40,222 INFO L225 Difference]: With dead ends: 43 [2018-01-24 23:20:40,222 INFO L226 Difference]: Without dead ends: 42 [2018-01-24 23:20:40,223 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 23:20:40,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-24 23:20:40,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-01-24 23:20:40,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-24 23:20:40,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-01-24 23:20:40,227 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 26 [2018-01-24 23:20:40,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:20:40,228 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-01-24 23:20:40,228 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 23:20:40,228 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-01-24 23:20:40,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 23:20:40,229 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:20:40,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] [2018-01-24 23:20:40,229 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 23:20:40,229 INFO L82 PathProgramCache]: Analyzing trace with hash 290777923, now seen corresponding path program 1 times [2018-01-24 23:20:40,229 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:20:40,230 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:40,230 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:20:40,231 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:40,231 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:20:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:20:40,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:20:40,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:20:40,404 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:20:40,404 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 23:20:40,404 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:20:40,405 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 23:20:40,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 23:20:40,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-24 23:20:40,405 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 11 states. [2018-01-24 23:20:40,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:20:40,577 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-01-24 23:20:40,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 23:20:40,577 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-01-24 23:20:40,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:20:40,578 INFO L225 Difference]: With dead ends: 52 [2018-01-24 23:20:40,578 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 23:20:40,578 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-01-24 23:20:40,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 23:20:40,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2018-01-24 23:20:40,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 23:20:40,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-01-24 23:20:40,582 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 26 [2018-01-24 23:20:40,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:20:40,582 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-01-24 23:20:40,582 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 23:20:40,582 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-01-24 23:20:40,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 23:20:40,583 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:20:40,583 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:20:40,583 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 23:20:40,583 INFO L82 PathProgramCache]: Analyzing trace with hash -716230416, now seen corresponding path program 1 times [2018-01-24 23:20:40,583 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:20:40,584 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:40,584 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:20:40,584 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:40,584 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:20:40,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:20:40,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:20:40,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:20:40,782 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:20:40,782 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 23:20:40,782 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:20:40,782 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 23:20:40,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 23:20:40,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-24 23:20:40,783 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 12 states. [2018-01-24 23:20:40,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:20:40,966 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-01-24 23:20:40,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 23:20:40,966 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-01-24 23:20:40,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:20:40,967 INFO L225 Difference]: With dead ends: 76 [2018-01-24 23:20:40,967 INFO L226 Difference]: Without dead ends: 41 [2018-01-24 23:20:40,968 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-01-24 23:20:40,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-24 23:20:40,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-24 23:20:40,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 23:20:40,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-01-24 23:20:40,971 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 29 [2018-01-24 23:20:40,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:20:40,971 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-01-24 23:20:40,971 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 23:20:40,972 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-01-24 23:20:40,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 23:20:40,972 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:20:40,972 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:20:40,972 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 23:20:40,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1773298546, now seen corresponding path program 1 times [2018-01-24 23:20:40,972 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:20:40,973 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:40,973 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:20:40,973 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:20:40,973 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:20:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:20:40,989 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:20:41,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:20:41,255 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:20:41,255 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 23:20:41,256 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-24 23:20:41,257 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [20], [21], [22], [25], [28], [37], [41], [45], [46], [48], [49], [50], [64], [65], [72], [74], [79], [85], [86], [87], [89] [2018-01-24 23:20:41,304 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 23:20:41,304 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 23:21:11,338 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 23:21:11,340 INFO L268 AbstractInterpreter]: Visited 28 different actions 37 times. Merged at 9 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-01-24 23:21:11,354 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 23:21:11,354 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:21:11,354 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 23:21:11,360 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:21:11,361 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 23:21:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:21:11,406 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 23:21:11,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 23:21:11,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 23:21:11,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:21:11,437 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 23:21:11,544 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 23:21:11,545 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 23:21:11,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 23:21:11,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 23:21:11,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:21:11,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-24 23:21:11,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 23:21:11,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 23:21:11,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 23:21:11,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:21:11,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 23:21:11,613 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-24 23:21:11,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-01-24 23:21:11,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 23:21:11,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 23:21:11,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:21:11,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-24 23:21:11,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-24 23:21:11,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-01-24 23:21:11,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 23:21:11,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 23:21:11,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-01-24 23:21:11,926 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 23:21:11,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 23:21:11,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 23:21:11,957 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-01-24 23:21:12,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:21:12,010 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 23:21:12,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-24 23:21:12,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 23:21:12,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 23:21:12,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 23:21:12,242 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 23:21:12,244 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:21:12,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:21:12,250 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-01-24 23:21:12,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:21:12,330 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:21:12,330 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 23:21:12,334 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:21:12,334 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 23:21:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:21:12,391 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 23:21:12,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 23:21:12,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 23:21:12,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 23:21:12,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 23:21:12,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:21:12,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 23:21:12,475 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 23:21:12,475 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 23:21:12,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 23:21:12,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 23:21:12,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 23:21:12,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 23:21:12,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:21:12,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-24 23:21:12,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 23:21:12,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 23:21:12,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 23:21:12,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:21:12,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:21:12,568 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-24 23:21:12,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-01-24 23:21:12,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 23:21:12,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 23:21:12,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:21:12,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 23:21:12,617 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-01-24 23:21:13,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-01-24 23:21:13,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-01-24 23:21:13,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 23:21:13,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 23:21:13,104 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 23:21:13,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 23:21:13,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 23:21:13,115 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:43, output treesize:30 [2018-01-24 23:21:13,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:21:13,206 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 23:21:13,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 23:21:13,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 23:21:13,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 23:21:13,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:21:13,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:21:13,411 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:21 [2018-01-24 23:21:13,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:21:13,568 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 23:21:13,569 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 9, 13, 11] total 47 [2018-01-24 23:21:13,569 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 23:21:13,569 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-24 23:21:13,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-24 23:21:13,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2085, Unknown=0, NotChecked=0, Total=2256 [2018-01-24 23:21:13,570 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 23 states. [2018-01-24 23:21:14,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:21:14,783 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2018-01-24 23:21:14,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 23:21:14,784 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2018-01-24 23:21:14,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:21:14,784 INFO L225 Difference]: With dead ends: 56 [2018-01-24 23:21:14,784 INFO L226 Difference]: Without dead ends: 54 [2018-01-24 23:21:14,785 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 77 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=302, Invalid=3004, Unknown=0, NotChecked=0, Total=3306 [2018-01-24 23:21:14,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-24 23:21:14,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2018-01-24 23:21:14,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 23:21:14,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-01-24 23:21:14,790 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 29 [2018-01-24 23:21:14,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:21:14,790 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-01-24 23:21:14,790 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-24 23:21:14,790 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-01-24 23:21:14,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 23:21:14,791 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:21:14,791 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:21:14,791 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-24 23:21:14,791 INFO L82 PathProgramCache]: Analyzing trace with hash -962114157, now seen corresponding path program 1 times [2018-01-24 23:21:14,791 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:21:14,792 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:21:14,792 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:21:14,792 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:21:14,792 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:21:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:21:14,813 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:21:15,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:21:15,165 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:21:15,165 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 23:21:15,165 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-01-24 23:21:15,165 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [20], [21], [22], [25], [28], [37], [41], [45], [46], [49], [50], [52], [64], [65], [72], [74], [79], [85], [86], [87], [89] [2018-01-24 23:21:15,167 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 23:21:15,167 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