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_RubberTaipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:52:03,653 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:52:03,655 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:52:03,671 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:52:03,671 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:52:03,672 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:52:03,673 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:52:03,675 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:52:03,677 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:52:03,678 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:52:03,679 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:52:03,679 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:52:03,680 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:52:03,681 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:52:03,682 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:52:03,685 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:52:03,687 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:52:03,689 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:52:03,690 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:52:03,691 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:52:03,694 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:52:03,694 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:52:03,694 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:52:03,695 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:52:03,696 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:52:03,701 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:52:03,701 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:52:03,702 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:52:03,702 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:52:03,702 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:52:03,703 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:52:03,703 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 12:52:03,711 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:52:03,712 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:52:03,713 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:52:03,713 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:52:03,713 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:52:03,713 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:52:03,713 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:52:03,713 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:52:03,714 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:52:03,714 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:52:03,714 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:52:03,714 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:52:03,714 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:52:03,714 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:52:03,714 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:52:03,714 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:52:03,715 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:52:03,715 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:52:03,715 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:52:03,715 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:52:03,715 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:52:03,715 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:52:03,716 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:52:03,716 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:52:03,716 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:52:03,716 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:52:03,716 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:52:03,717 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:52:03,717 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 12:52:03,717 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:52:03,717 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:52:03,717 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:52:03,718 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:52:03,718 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:52:03,750 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:52:03,760 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:52:03,763 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:52:03,765 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:52:03,765 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:52:03,766 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-01-24 12:52:03,939 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:52:03,943 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:52:03,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:52:03,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:52:03,949 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:52:03,950 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:52:03" (1/1) ... [2018-01-24 12:52:03,952 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@173c865c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:52:03, skipping insertion in model container [2018-01-24 12:52:03,953 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:52:03" (1/1) ... [2018-01-24 12:52:03,966 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:52:04,002 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:52:04,104 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:52:04,118 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:52:04,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:52:04 WrapperNode [2018-01-24 12:52:04,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:52:04,125 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:52:04,125 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:52:04,126 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:52:04,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:52:04" (1/1) ... [2018-01-24 12:52:04,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:52:04" (1/1) ... [2018-01-24 12:52:04,152 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:52:04" (1/1) ... [2018-01-24 12:52:04,152 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:52:04" (1/1) ... [2018-01-24 12:52:04,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:52:04" (1/1) ... [2018-01-24 12:52:04,159 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:52:04" (1/1) ... [2018-01-24 12:52:04,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:52:04" (1/1) ... [2018-01-24 12:52:04,161 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:52:04,161 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:52:04,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:52:04,161 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:52:04,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:52:04" (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 12:52:04,205 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:52:04,205 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:52:04,205 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcmp [2018-01-24 12:52:04,205 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:52:04,205 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:52:04,205 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:52:04,205 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:52:04,206 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:52:04,206 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:52:04,206 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:52:04,206 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcmp [2018-01-24 12:52:04,206 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:52:04,206 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:52:04,206 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:52:04,396 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:52:04,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:52:04 BoogieIcfgContainer [2018-01-24 12:52:04,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:52:04,397 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:52:04,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:52:04,399 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:52:04,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:52:03" (1/3) ... [2018-01-24 12:52:04,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69cc36fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:52:04, skipping insertion in model container [2018-01-24 12:52:04,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:52:04" (2/3) ... [2018-01-24 12:52:04,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69cc36fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:52:04, skipping insertion in model container [2018-01-24 12:52:04,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:52:04" (3/3) ... [2018-01-24 12:52:04,402 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-01-24 12:52:04,408 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:52:04,414 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-24 12:52:04,458 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:52:04,458 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:52:04,458 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:52:04,459 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:52:04,459 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:52:04,459 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:52:04,459 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:52:04,459 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:52:04,460 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:52:04,479 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-01-24 12:52:04,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 12:52:04,486 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:52:04,487 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:52:04,487 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:52:04,492 INFO L82 PathProgramCache]: Analyzing trace with hash 955833556, now seen corresponding path program 1 times [2018-01-24 12:52:04,495 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:52:04,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:04,543 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:04,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:04,543 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:52:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:04,598 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:52:04,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:52:04,761 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:52:04,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:52:04,762 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:52:04,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:52:04,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:52:04,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:52:04,777 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 4 states. [2018-01-24 12:52:05,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:52:05,020 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-01-24 12:52:05,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:52:05,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 12:52:05,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:52:05,033 INFO L225 Difference]: With dead ends: 73 [2018-01-24 12:52:05,033 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 12:52:05,037 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:52:05,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 12:52:05,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-24 12:52:05,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 12:52:05,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-01-24 12:52:05,073 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 13 [2018-01-24 12:52:05,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:52:05,073 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-01-24 12:52:05,073 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:52:05,073 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-01-24 12:52:05,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 12:52:05,074 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:52:05,074 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:52:05,074 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:52:05,074 INFO L82 PathProgramCache]: Analyzing trace with hash 955833557, now seen corresponding path program 1 times [2018-01-24 12:52:05,074 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:52:05,075 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:05,076 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:05,076 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:05,076 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:52:05,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:05,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:52:05,268 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 12:52:05,268 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:52:05,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:52:05,269 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:52:05,271 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:52:05,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:52:05,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:52:05,271 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 6 states. [2018-01-24 12:52:05,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:52:05,454 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-01-24 12:52:05,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:52:05,454 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-24 12:52:05,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:52:05,455 INFO L225 Difference]: With dead ends: 49 [2018-01-24 12:52:05,455 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 12:52:05,457 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 12:52:05,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 12:52:05,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-24 12:52:05,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 12:52:05,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-01-24 12:52:05,464 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 13 [2018-01-24 12:52:05,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:52:05,464 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-01-24 12:52:05,464 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:52:05,465 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2018-01-24 12:52:05,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:52:05,465 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:52:05,465 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:52:05,465 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:52:05,465 INFO L82 PathProgramCache]: Analyzing trace with hash -433930803, now seen corresponding path program 1 times [2018-01-24 12:52:05,465 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:52:05,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:05,467 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:05,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:05,467 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:52:05,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:05,482 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:52:05,586 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 12:52:05,586 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:52:05,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:52:05,586 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:52:05,587 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:52:05,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:52:05,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:52:05,587 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 5 states. [2018-01-24 12:52:05,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:52:05,649 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2018-01-24 12:52:05,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:52:05,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 12:52:05,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:52:05,651 INFO L225 Difference]: With dead ends: 48 [2018-01-24 12:52:05,651 INFO L226 Difference]: Without dead ends: 47 [2018-01-24 12:52:05,651 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 12:52:05,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-24 12:52:05,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-24 12:52:05,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 12:52:05,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-01-24 12:52:05,656 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 14 [2018-01-24 12:52:05,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:52:05,656 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-01-24 12:52:05,656 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:52:05,656 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-01-24 12:52:05,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:52:05,657 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:52:05,657 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:52:05,657 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:52:05,657 INFO L82 PathProgramCache]: Analyzing trace with hash -433930804, now seen corresponding path program 1 times [2018-01-24 12:52:05,657 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:52:05,658 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:05,658 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:05,658 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:05,658 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:52:05,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:05,667 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:52:05,697 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 12:52:05,697 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:52:05,697 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:52:05,698 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:52:05,698 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:52:05,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:52:05,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:52:05,699 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 4 states. [2018-01-24 12:52:05,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:52:05,748 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-01-24 12:52:05,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:52:05,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 12:52:05,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:52:05,750 INFO L225 Difference]: With dead ends: 47 [2018-01-24 12:52:05,750 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 12:52:05,750 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 12:52:05,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 12:52:05,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-24 12:52:05,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 12:52:05,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-01-24 12:52:05,757 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 14 [2018-01-24 12:52:05,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:52:05,757 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-01-24 12:52:05,758 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:52:05,758 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-01-24 12:52:05,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 12:52:05,758 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:52:05,759 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:52:05,759 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:52:05,759 INFO L82 PathProgramCache]: Analyzing trace with hash 2009852195, now seen corresponding path program 1 times [2018-01-24 12:52:05,759 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:52:05,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:05,760 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:05,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:05,761 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:52:05,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:05,774 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:52:05,816 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 12:52:05,816 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:52:05,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:52:05,817 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:52:05,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:52:05,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:52:05,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:52:05,817 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 5 states. [2018-01-24 12:52:05,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:52:05,893 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-01-24 12:52:05,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:52:05,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 12:52:05,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:52:05,894 INFO L225 Difference]: With dead ends: 46 [2018-01-24 12:52:05,894 INFO L226 Difference]: Without dead ends: 44 [2018-01-24 12:52:05,894 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 12:52:05,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-24 12:52:05,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-01-24 12:52:05,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-24 12:52:05,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-01-24 12:52:05,899 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 18 [2018-01-24 12:52:05,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:52:05,899 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2018-01-24 12:52:05,899 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:52:05,899 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-01-24 12:52:05,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 12:52:05,900 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:52:05,900 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:52:05,900 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:52:05,900 INFO L82 PathProgramCache]: Analyzing trace with hash 2009852196, now seen corresponding path program 1 times [2018-01-24 12:52:05,900 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:52:05,901 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:05,901 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:05,901 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:05,902 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:52:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:05,913 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:52:06,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:52:06,018 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:52:06,018 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:52:06,018 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:52:06,018 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:52:06,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:52:06,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:52:06,019 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 8 states. [2018-01-24 12:52:06,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:52:06,119 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-01-24 12:52:06,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:52:06,119 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-24 12:52:06,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:52:06,122 INFO L225 Difference]: With dead ends: 61 [2018-01-24 12:52:06,123 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 12:52:06,123 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 12:52:06,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 12:52:06,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2018-01-24 12:52:06,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 12:52:06,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-01-24 12:52:06,130 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 18 [2018-01-24 12:52:06,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:52:06,130 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-01-24 12:52:06,130 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:52:06,130 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-01-24 12:52:06,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 12:52:06,131 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:52:06,131 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 12:52:06,131 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:52:06,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1267324412, now seen corresponding path program 1 times [2018-01-24 12:52:06,132 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:52:06,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:06,133 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:06,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:06,133 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:52:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:06,146 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:52:06,203 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 12:52:06,203 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:52:06,203 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:52:06,203 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:52:06,204 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:52:06,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:52:06,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:52:06,204 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 6 states. [2018-01-24 12:52:06,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:52:06,311 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-01-24 12:52:06,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:52:06,311 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-24 12:52:06,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:52:06,312 INFO L225 Difference]: With dead ends: 50 [2018-01-24 12:52:06,312 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 12:52:06,313 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 12:52:06,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 12:52:06,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-24 12:52:06,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 12:52:06,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-01-24 12:52:06,327 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 20 [2018-01-24 12:52:06,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:52:06,328 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-01-24 12:52:06,328 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:52:06,328 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-01-24 12:52:06,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 12:52:06,328 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:52:06,328 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 12:52:06,329 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:52:06,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1267324411, now seen corresponding path program 1 times [2018-01-24 12:52:06,329 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:52:06,330 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:06,330 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:06,330 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:06,330 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:52:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:06,339 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:52:06,422 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 12:52:06,423 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:52:06,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:52:06,423 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:52:06,423 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:52:06,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:52:06,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:52:06,424 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 9 states. [2018-01-24 12:52:06,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:52:06,529 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-01-24 12:52:06,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:52:06,530 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-01-24 12:52:06,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:52:06,531 INFO L225 Difference]: With dead ends: 50 [2018-01-24 12:52:06,531 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 12:52:06,531 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:52:06,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 12:52:06,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-24 12:52:06,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 12:52:06,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-01-24 12:52:06,537 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 20 [2018-01-24 12:52:06,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:52:06,538 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-01-24 12:52:06,538 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:52:06,538 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-01-24 12:52:06,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 12:52:06,539 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:52:06,539 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 12:52:06,539 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:52:06,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1871951781, now seen corresponding path program 1 times [2018-01-24 12:52:06,539 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:52:06,540 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:06,540 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:06,540 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:06,540 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:52:06,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:06,553 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:52:06,639 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 12:52:06,639 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:52:06,639 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:52:06,640 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:52:06,640 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:52:06,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:52:06,640 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:52:06,641 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 6 states. [2018-01-24 12:52:06,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:52:06,707 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-01-24 12:52:06,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:52:06,708 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-24 12:52:06,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:52:06,709 INFO L225 Difference]: With dead ends: 49 [2018-01-24 12:52:06,709 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 12:52:06,709 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 12:52:06,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 12:52:06,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-24 12:52:06,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 12:52:06,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-01-24 12:52:06,715 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 22 [2018-01-24 12:52:06,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:52:06,715 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-01-24 12:52:06,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:52:06,715 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-01-24 12:52:06,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 12:52:06,716 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:52:06,716 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 12:52:06,716 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:52:06,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1871951782, now seen corresponding path program 1 times [2018-01-24 12:52:06,717 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:52:06,717 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:06,718 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:06,718 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:06,718 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:52:06,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:06,729 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:52:06,853 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 12:52:06,853 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:52:06,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:52:06,853 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:52:06,854 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:52:06,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:52:06,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:52:06,854 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 8 states. [2018-01-24 12:52:06,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:52:06,968 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-01-24 12:52:06,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:52:06,968 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-01-24 12:52:06,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:52:06,969 INFO L225 Difference]: With dead ends: 58 [2018-01-24 12:52:06,969 INFO L226 Difference]: Without dead ends: 57 [2018-01-24 12:52:06,970 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 12:52:06,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-24 12:52:06,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2018-01-24 12:52:06,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 12:52:06,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-01-24 12:52:06,976 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 22 [2018-01-24 12:52:06,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:52:06,976 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-01-24 12:52:06,976 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:52:06,977 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-01-24 12:52:06,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 12:52:06,977 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:52:06,977 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 12:52:06,978 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:52:06,978 INFO L82 PathProgramCache]: Analyzing trace with hash -645685358, now seen corresponding path program 1 times [2018-01-24 12:52:06,978 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:52:06,979 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:06,979 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:06,979 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:06,979 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:52:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:06,989 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:52:07,014 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 12:52:07,015 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:52:07,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:52:07,015 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:52:07,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:52:07,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:52:07,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:52:07,015 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 6 states. [2018-01-24 12:52:07,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:52:07,068 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-01-24 12:52:07,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:52:07,068 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-24 12:52:07,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:52:07,069 INFO L225 Difference]: With dead ends: 49 [2018-01-24 12:52:07,069 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 12:52:07,069 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 12:52:07,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 12:52:07,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-24 12:52:07,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 12:52:07,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-01-24 12:52:07,073 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 24 [2018-01-24 12:52:07,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:52:07,073 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-01-24 12:52:07,073 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:52:07,073 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-01-24 12:52:07,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 12:52:07,073 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:52:07,073 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 12:52:07,074 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:52:07,074 INFO L82 PathProgramCache]: Analyzing trace with hash -645685357, now seen corresponding path program 1 times [2018-01-24 12:52:07,074 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:52:07,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:07,074 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:07,075 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:07,075 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:52:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:07,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:52:07,206 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 12:52:07,206 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:52:07,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:52:07,206 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:52:07,207 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:52:07,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:52:07,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:52:07,207 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 9 states. [2018-01-24 12:52:07,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:52:07,438 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-01-24 12:52:07,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:52:07,438 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-01-24 12:52:07,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:52:07,439 INFO L225 Difference]: With dead ends: 58 [2018-01-24 12:52:07,439 INFO L226 Difference]: Without dead ends: 57 [2018-01-24 12:52:07,439 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-01-24 12:52:07,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-24 12:52:07,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2018-01-24 12:52:07,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 12:52:07,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-01-24 12:52:07,443 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 24 [2018-01-24 12:52:07,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:52:07,443 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-01-24 12:52:07,443 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:52:07,443 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-01-24 12:52:07,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 12:52:07,444 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:52:07,444 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] [2018-01-24 12:52:07,444 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:52:07,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1460131898, now seen corresponding path program 1 times [2018-01-24 12:52:07,445 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:52:07,445 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:07,446 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:07,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:07,446 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:52:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:07,459 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:52:07,707 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 12:52:07,707 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:52:07,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 12:52:07,707 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:52:07,707 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 12:52:07,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 12:52:07,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:52:07,708 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 12 states. [2018-01-24 12:52:07,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:52:07,960 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2018-01-24 12:52:07,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 12:52:07,960 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-01-24 12:52:07,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:52:07,961 INFO L225 Difference]: With dead ends: 106 [2018-01-24 12:52:07,961 INFO L226 Difference]: Without dead ends: 81 [2018-01-24 12:52:07,961 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-01-24 12:52:07,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-24 12:52:07,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2018-01-24 12:52:07,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-24 12:52:07,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-01-24 12:52:07,967 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 25 [2018-01-24 12:52:07,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:52:07,967 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-01-24 12:52:07,967 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 12:52:07,967 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-01-24 12:52:07,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 12:52:07,968 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:52:07,968 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] [2018-01-24 12:52:07,968 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:52:07,968 INFO L82 PathProgramCache]: Analyzing trace with hash -228811844, now seen corresponding path program 1 times [2018-01-24 12:52:07,968 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:52:07,969 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:07,969 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:07,969 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:07,969 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:52:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:07,979 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:52:08,183 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 12:52:08,183 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:52:08,183 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 12:52:08,188 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:08,189 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:52:08,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:08,234 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:52:08,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-01-24 12:52:08,300 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 8 treesize of output 7 [2018-01-24 12:52:08,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:08,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:08,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:08,303 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-24 12:52:08,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-01-24 12:52:08,511 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 22 treesize of output 15 [2018-01-24 12:52:08,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:08,521 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 15 treesize of output 8 [2018-01-24 12:52:08,521 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:08,538 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 0 case distinctions, treesize of input 18 treesize of output 3 [2018-01-24 12:52:08,538 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:08,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:08,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:08,542 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-01-24 12:52:08,570 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 12:52:08,570 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:52:08,667 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 12:52:08,680 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 12:52:08,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:08,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:08,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:08,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:3 [2018-01-24 12:52:08,695 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 12:52:08,715 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:52:08,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [12] total 26 [2018-01-24 12:52:08,716 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:52:08,716 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 12:52:08,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 12:52:08,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2018-01-24 12:52:08,717 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 11 states. [2018-01-24 12:52:09,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:52:09,023 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2018-01-24 12:52:09,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:52:09,023 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-01-24 12:52:09,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:52:09,024 INFO L225 Difference]: With dead ends: 146 [2018-01-24 12:52:09,025 INFO L226 Difference]: Without dead ends: 121 [2018-01-24 12:52:09,025 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=956, Unknown=0, NotChecked=0, Total=1056 [2018-01-24 12:52:09,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-24 12:52:09,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 72. [2018-01-24 12:52:09,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-24 12:52:09,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-01-24 12:52:09,031 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 25 [2018-01-24 12:52:09,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:52:09,031 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-01-24 12:52:09,032 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 12:52:09,032 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-01-24 12:52:09,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 12:52:09,033 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:52:09,033 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] [2018-01-24 12:52:09,033 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:52:09,033 INFO L82 PathProgramCache]: Analyzing trace with hash 2072010746, now seen corresponding path program 1 times [2018-01-24 12:52:09,033 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:52:09,034 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:09,034 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:09,034 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:09,035 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:52:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:09,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:52:09,347 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 12:52:09,347 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:52:09,347 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:52:09,355 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:09,356 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:52:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:09,374 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:52:09,377 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 12:52:09,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:09,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:09,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 12:52:09,406 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:52:09,407 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:52:09,408 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 12:52:09,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:09,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:09,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-24 12:52:09,439 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 12:52:09,443 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 12:52:09,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:09,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:09,456 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 12:52:09,457 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-24 12:52:09,483 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 12:52:09,486 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 12:52:09,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:09,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:09,499 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 12:52:09,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-24 12:52:09,688 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 12:52:09,690 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 12:52:09,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:09,700 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 12:52:09,701 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 12:52:09,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:52:09,726 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 12:52:09,727 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-01-24 12:52:09,802 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 12:52:09,802 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:52:10,068 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 12:52:10,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:10,076 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 12:52:10,085 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 12:52:10,086 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:10,087 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:10,092 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 12:52:10,092 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-01-24 12:52:10,122 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 12:52:10,145 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:52:10,145 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 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 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 12:52:10,154 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:10,154 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:52:10,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:10,202 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:52:10,206 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 12:52:10,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:10,212 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 12:52:10,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:10,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:10,216 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 12:52:10,272 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:52:10,273 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:52:10,274 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 12:52:10,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:10,282 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 12:52:10,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:10,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:10,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-24 12:52:10,356 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 12:52:10,359 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 12:52:10,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:10,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:10,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:10,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-24 12:52:10,411 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 12:52:10,413 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 12:52:10,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:10,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:10,423 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 12:52:10,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-01-24 12:52:10,677 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 12:52:10,684 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 12:52:10,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:10,697 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 12:52:10,697 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 12:52:10,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:52:10,707 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 12:52:10,707 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:43, output treesize:30 [2018-01-24 12:52:10,800 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 12:52:10,800 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:52:10,970 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 12:52:10,978 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 12:52:10,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:10,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:10,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:10,984 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:21 [2018-01-24 12:52:11,125 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 12:52:11,127 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:52:11,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 9, 13, 11] total 47 [2018-01-24 12:52:11,127 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:52:11,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-24 12:52:11,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-24 12:52:11,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2085, Unknown=0, NotChecked=0, Total=2256 [2018-01-24 12:52:11,128 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 23 states. [2018-01-24 12:52:12,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:52:12,169 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2018-01-24 12:52:12,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 12:52:12,170 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 25 [2018-01-24 12:52:12,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:52:12,171 INFO L225 Difference]: With dead ends: 93 [2018-01-24 12:52:12,171 INFO L226 Difference]: Without dead ends: 91 [2018-01-24 12:52:12,172 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=329, Invalid=3211, Unknown=0, NotChecked=0, Total=3540 [2018-01-24 12:52:12,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-24 12:52:12,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2018-01-24 12:52:12,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-24 12:52:12,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2018-01-24 12:52:12,182 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 25 [2018-01-24 12:52:12,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:52:12,182 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2018-01-24 12:52:12,182 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-24 12:52:12,183 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2018-01-24 12:52:12,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 12:52:12,183 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:52:12,184 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] [2018-01-24 12:52:12,184 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:52:12,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1662500005, now seen corresponding path program 1 times [2018-01-24 12:52:12,184 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:52:12,185 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:12,185 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:12,185 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:12,185 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:52:12,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:12,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:52:12,630 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 12:52:12,630 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:52:12,630 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:52:12,645 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:12,645 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:52:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:12,671 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:52:12,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 14 treesize of output 11 [2018-01-24 12:52:12,685 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 12:52:12,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:12,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:12,694 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 12:52:12,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 12:52:13,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-01-24 12:52:13,036 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 27 treesize of output 20 [2018-01-24 12:52:13,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:13,074 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 20 treesize of output 18 [2018-01-24 12:52:13,075 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 12:52:13,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2018-01-24 12:52:13,122 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-24 12:52:13,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 12:52:13,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:52:13,168 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:49, output treesize:29 [2018-01-24 12:52:13,235 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 12:52:13,235 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:52:13,722 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 15 treesize of output 11 [2018-01-24 12:52:13,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:13,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-01-24 12:52:13,772 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-01-24 12:52:13,772 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:13,779 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:13,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:13,789 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:69, output treesize:7 [2018-01-24 12:52:13,803 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 12:52:13,834 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:52:13,834 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 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 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 12:52:13,839 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:13,840 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:52:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:13,906 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:52:13,981 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 12:52:13,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:13,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:13,987 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-01-24 12:52:14,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 13 [2018-01-24 12:52:14,052 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 12:52:14,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:14,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:14,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:14,058 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-01-24 12:52:14,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2018-01-24 12:52:14,330 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 26 treesize of output 24 [2018-01-24 12:52:14,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:52:14,348 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 12:52:14,348 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 12:52:14,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:52:14,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:52:14,362 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2018-01-24 12:52:14,465 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 12:52:14,465 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:52:14,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-01-24 12:52:14,706 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-01-24 12:52:14,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:14,717 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 12 treesize of output 10 [2018-01-24 12:52:14,717 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:14,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 11 [2018-01-24 12:52:14,728 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:14,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:14,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:52:14,737 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:58, output treesize:39 [2018-01-24 12:52:14,846 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 12:52:14,848 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:52:14,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12, 16, 14] total 52 [2018-01-24 12:52:14,848 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:52:14,848 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-24 12:52:14,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-24 12:52:14,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=2531, Unknown=0, NotChecked=0, Total=2756 [2018-01-24 12:52:14,849 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand 23 states. [2018-01-24 12:52:16,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:52:16,102 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2018-01-24 12:52:16,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 12:52:16,103 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 27 [2018-01-24 12:52:16,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:52:16,104 INFO L225 Difference]: With dead ends: 80 [2018-01-24 12:52:16,104 INFO L226 Difference]: Without dead ends: 79 [2018-01-24 12:52:16,105 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1060 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=374, Invalid=3786, Unknown=0, NotChecked=0, Total=4160 [2018-01-24 12:52:16,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-24 12:52:16,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-01-24 12:52:16,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-24 12:52:16,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2018-01-24 12:52:16,112 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 27 [2018-01-24 12:52:16,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:52:16,112 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2018-01-24 12:52:16,112 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-24 12:52:16,112 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2018-01-24 12:52:16,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 12:52:16,113 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:52:16,113 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:52:16,113 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:52:16,114 INFO L82 PathProgramCache]: Analyzing trace with hash 65327996, now seen corresponding path program 1 times [2018-01-24 12:52:16,114 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:52:16,114 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:16,115 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:16,115 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:16,115 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:52:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:16,124 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:52:16,298 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:52:16,298 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:52:16,299 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:52:16,304 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:16,305 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:52:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:16,324 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:52:16,342 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:52:16,342 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:52:16,366 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 8 treesize of output 6 [2018-01-24 12:52:16,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:16,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:16,367 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-01-24 12:52:16,388 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:52:16,408 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:52:16,408 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 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 8 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 12:52:16,411 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:16,411 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:52:16,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:16,446 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:52:16,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:52:16,449 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:52:16,453 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 8 treesize of output 6 [2018-01-24 12:52:16,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:16,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:16,454 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-01-24 12:52:16,458 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:52:16,460 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:52:16,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5, 5, 5] total 14 [2018-01-24 12:52:16,460 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:52:16,460 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 12:52:16,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 12:52:16,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-01-24 12:52:16,461 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 11 states. [2018-01-24 12:52:16,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:52:16,580 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2018-01-24 12:52:16,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:52:16,580 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-01-24 12:52:16,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:52:16,581 INFO L225 Difference]: With dead ends: 86 [2018-01-24 12:52:16,581 INFO L226 Difference]: Without dead ends: 84 [2018-01-24 12:52:16,581 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2018-01-24 12:52:16,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-24 12:52:16,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2018-01-24 12:52:16,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-24 12:52:16,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-01-24 12:52:16,589 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 29 [2018-01-24 12:52:16,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:52:16,589 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-01-24 12:52:16,589 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 12:52:16,589 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-01-24 12:52:16,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 12:52:16,590 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:52:16,590 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:52:16,590 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:52:16,590 INFO L82 PathProgramCache]: Analyzing trace with hash -580377695, now seen corresponding path program 1 times [2018-01-24 12:52:16,591 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:52:16,591 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:16,591 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:16,591 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:16,591 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:52:16,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:16,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:52:16,724 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 12:52:16,724 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:52:16,724 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:52:16,724 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:52:16,724 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:52:16,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:52:16,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:52:16,725 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 7 states. [2018-01-24 12:52:16,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:52:16,809 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2018-01-24 12:52:16,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:52:16,809 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-01-24 12:52:16,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:52:16,810 INFO L225 Difference]: With dead ends: 75 [2018-01-24 12:52:16,810 INFO L226 Difference]: Without dead ends: 40 [2018-01-24 12:52:16,810 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:52:16,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-24 12:52:16,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-01-24 12:52:16,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-24 12:52:16,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-01-24 12:52:16,814 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 31 [2018-01-24 12:52:16,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:52:16,814 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-01-24 12:52:16,814 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:52:16,814 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-01-24 12:52:16,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 12:52:16,815 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:52:16,815 INFO L322 BasicCegarLoop]: trace histogram [2, 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] [2018-01-24 12:52:16,815 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:52:16,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1644356119, now seen corresponding path program 1 times [2018-01-24 12:52:16,815 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:52:16,815 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:16,816 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:16,816 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:16,816 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:52:16,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:16,824 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:52:17,008 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:52:17,008 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:52:17,008 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:52:17,018 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:17,018 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:52:17,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:17,040 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:52:17,069 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:52:17,069 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:52:17,114 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 12 treesize of output 10 [2018-01-24 12:52:17,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:17,125 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2018-01-24 12:52:17,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:52:17,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 12:52:17,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:12 [2018-01-24 12:52:17,182 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:52:17,240 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:52:17,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [11] total 18 [2018-01-24 12:52:17,240 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:52:17,240 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:52:17,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:52:17,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2018-01-24 12:52:17,241 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 7 states. [2018-01-24 12:52:17,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:52:17,301 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-01-24 12:52:17,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:52:17,302 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-01-24 12:52:17,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:52:17,302 INFO L225 Difference]: With dead ends: 40 [2018-01-24 12:52:17,302 INFO L226 Difference]: Without dead ends: 36 [2018-01-24 12:52:17,303 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2018-01-24 12:52:17,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-24 12:52:17,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-24 12:52:17,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 12:52:17,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-01-24 12:52:17,306 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 31 [2018-01-24 12:52:17,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:52:17,306 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-01-24 12:52:17,306 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:52:17,306 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-01-24 12:52:17,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 12:52:17,307 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:52:17,307 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:52:17,307 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:52:17,307 INFO L82 PathProgramCache]: Analyzing trace with hash 566109348, now seen corresponding path program 2 times [2018-01-24 12:52:17,307 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:52:17,308 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:17,308 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:52:17,308 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:17,308 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:52:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:17,319 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:52:17,675 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:52:17,675 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:52:17,675 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:52:17,682 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:52:17,682 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 12:52:17,693 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:52:17,702 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:52:17,715 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:52:17,718 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:52:17,722 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 12:52:17,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:17,730 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 12:52:17,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:17,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:17,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 12:52:17,779 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:52:17,792 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:52:17,793 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 12:52:17,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:17,848 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 12:52:17,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:17,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:17,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-24 12:52:17,997 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 12:52:17,999 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 12:52:18,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:18,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:18,018 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 12:52:18,018 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-01-24 12:52:18,046 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 12:52:18,047 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 12:52:18,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:18,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:18,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-24 12:52:18,057 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-01-24 12:52:18,399 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 34 treesize of output 32 [2018-01-24 12:52:18,401 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 12:52:18,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:18,416 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 18 treesize of output 15 [2018-01-24 12:52:18,416 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 12:52:18,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:52:18,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:52:18,427 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2018-01-24 12:52:18,506 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:52:18,506 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:52:18,931 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 12:52:18,945 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 12:52:18,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:18,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:18,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:18,953 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:44 [2018-01-24 12:52:19,122 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:52:19,142 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:52:19,142 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 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 11 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 12:52:19,146 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:52:19,146 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 12:52:19,162 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:52:19,185 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:52:19,234 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:52:19,240 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:52:19,248 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 12:52:19,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:19,264 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 12:52:19,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:19,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:19,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 12:52:19,334 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:52:19,348 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 12:52:19,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:19,410 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:52:19,412 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:52:19,413 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 12:52:19,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:19,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:19,418 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-24 12:52:19,496 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 15 treesize of output 12 [2018-01-24 12:52:19,498 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 12 treesize of output 11 [2018-01-24 12:52:19,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:19,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:19,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:19,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 12:52:19,560 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 28 treesize of output 29 [2018-01-24 12:52:19,562 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 12:52:19,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:19,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:19,571 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 12:52:19,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-01-24 12:52:21,107 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 34 treesize of output 32 [2018-01-24 12:52:21,109 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 12:52:21,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:21,119 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 18 treesize of output 15 [2018-01-24 12:52:21,119 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 12:52:21,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:52:21,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:52:21,130 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2018-01-24 12:52:21,135 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:52:21,135 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:52:21,369 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 12:52:21,379 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 12:52:21,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:21,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:21,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:52:21,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-01-24 12:52:22,032 WARN L143 SmtUtils]: Spent 512ms on a formula simplification that was a NOOP. DAG size: 34 [2018-01-24 12:52:23,827 WARN L143 SmtUtils]: Spent 1733ms on a formula simplification that was a NOOP. DAG size: 34 [2018-01-24 12:52:23,836 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:52:23,838 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:52:23,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 13, 15, 13] total 48 [2018-01-24 12:52:23,838 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:52:23,838 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-24 12:52:23,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-24 12:52:23,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2174, Unknown=0, NotChecked=0, Total=2352 [2018-01-24 12:52:23,839 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 29 states. [2018-01-24 12:52:29,180 WARN L146 SmtUtils]: Spent 2575ms on a formula simplification. DAG size of input: 54 DAG size of output 44 [2018-01-24 12:52:31,943 WARN L146 SmtUtils]: Spent 2687ms on a formula simplification. DAG size of input: 50 DAG size of output 47 [2018-01-24 12:52:34,766 WARN L146 SmtUtils]: Spent 2778ms on a formula simplification. DAG size of input: 51 DAG size of output 48 [2018-01-24 12:52:35,428 WARN L143 SmtUtils]: Spent 597ms on a formula simplification that was a NOOP. DAG size: 47 [2018-01-24 12:52:36,081 WARN L146 SmtUtils]: Spent 606ms on a formula simplification. DAG size of input: 58 DAG size of output 56 [2018-01-24 12:52:36,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:52:36,208 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-01-24 12:52:36,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 12:52:36,209 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 32 [2018-01-24 12:52:36,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:52:36,209 INFO L225 Difference]: With dead ends: 37 [2018-01-24 12:52:36,209 INFO L226 Difference]: Without dead ends: 36 [2018-01-24 12:52:36,210 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 86 SyntacticMatches, 9 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 881 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=386, Invalid=3396, Unknown=0, NotChecked=0, Total=3782 [2018-01-24 12:52:36,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-24 12:52:36,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-01-24 12:52:36,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-24 12:52:36,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-01-24 12:52:36,214 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-01-24 12:52:36,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:52:36,214 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-01-24 12:52:36,215 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-24 12:52:36,215 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-01-24 12:52:36,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 12:52:36,215 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:52:36,215 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:52:36,215 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:52:36,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1429764731, now seen corresponding path program 2 times [2018-01-24 12:52:36,215 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:52:36,216 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:36,216 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:52:36,216 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:52:36,216 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:52:36,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:52:36,229 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:52:36,539 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:52:36,540 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:52:36,540 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:52:36,548 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:52:36,548 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 12:52:36,559 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:52:36,566 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:52:36,569 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:52:36,572 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:52:36,578 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 12:52:36,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:36,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:36,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 12:52:36,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 13 [2018-01-24 12:52:36,622 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 12:52:36,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:36,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:36,629 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 12:52:36,629 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-01-24 12:52:36,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2018-01-24 12:52:36,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2018-01-24 12:52:36,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:52:36,949 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 29 treesize of output 27 [2018-01-24 12:52:36,949 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 12:52:36,962 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 21 treesize of output 16 [2018-01-24 12:52:36,962 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:36,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 12:52:36,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:52:36,984 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:37 [2018-01-24 12:52:37,023 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:52:37,024 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:52:44,270 WARN L143 SmtUtils]: Spent 402ms on a formula simplification that was a NOOP. DAG size: 43 [2018-01-24 12:52:47,510 WARN L143 SmtUtils]: Spent 3191ms on a formula simplification that was a NOOP. DAG size: 47 [2018-01-24 12:52:47,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2018-01-24 12:52:47,771 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2018-01-24 12:52:47,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:47,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:47,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:47,785 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:77, output treesize:43 [2018-01-24 12:52:47,867 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:52:47,886 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:52:47,886 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 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 13 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 12:52:47,889 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:52:47,889 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 12:52:47,903 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:52:47,925 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:52:47,961 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:52:47,966 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:52:47,969 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 12:52:47,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:47,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:47,972 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 12:52:47,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 15 treesize of output 12 [2018-01-24 12:52:47,978 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 12 treesize of output 11 [2018-01-24 12:52:47,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:47,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:47,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:47,980 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-24 12:52:48,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2018-01-24 12:52:48,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 27 [2018-01-24 12:52:48,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:52:48,332 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 28 treesize of output 26 [2018-01-24 12:52:48,333 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 12:52:48,346 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 20 treesize of output 15 [2018-01-24 12:52:48,346 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:48,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 12:52:48,367 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 12:52:48,367 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2018-01-24 12:52:48,395 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:52:48,395 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:52:58,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-01-24 12:52:58,919 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-01-24 12:52:58,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:58,930 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 16 treesize of output 14 [2018-01-24 12:52:58,930 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:58,940 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-01-24 12:52:58,940 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:52:58,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:52:58,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-24 12:52:58,951 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:65, output treesize:74 [2018-01-24 12:52:59,073 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:52:59,075 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:52:59,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16, 15, 15] total 58 [2018-01-24 12:52:59,075 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:52:59,075 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-24 12:52:59,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-24 12:52:59,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=3083, Unknown=11, NotChecked=0, Total=3422 [2018-01-24 12:52:59,076 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 28 states. [2018-01-24 12:52:59,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:52:59,937 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-01-24 12:52:59,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 12:52:59,938 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 34 [2018-01-24 12:52:59,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:52:59,938 INFO L225 Difference]: With dead ends: 36 [2018-01-24 12:52:59,938 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 12:52:59,939 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 88 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 9 DeprecatedPredicates, 1442 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=687, Invalid=4704, Unknown=11, NotChecked=0, Total=5402 [2018-01-24 12:52:59,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 12:52:59,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 12:52:59,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 12:52:59,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 12:52:59,940 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2018-01-24 12:52:59,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:52:59,940 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 12:52:59,940 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-24 12:52:59,940 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 12:52:59,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 12:52:59,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. Received shutdown request... [2018-01-24 12:53:08,328 INFO L256 ToolchainWalker]: Toolchain cancelled while executing plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction. Reason: Timeout or Toolchain cancelled by user [2018-01-24 12:53:08,329 INFO L168 Benchmark]: Toolchain (without parser) took 64388.80 ms. Allocated memory was 308.3 MB in the beginning and 635.4 MB in the end (delta: 327.2 MB). Free memory was 268.3 MB in the beginning and 368.3 MB in the end (delta: -100.0 MB). Peak memory consumption was 227.2 MB. Max. memory is 5.3 GB. [2018-01-24 12:53:08,330 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 308.3 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:53:08,330 INFO L168 Benchmark]: CACSL2BoogieTranslator took 181.26 ms. Allocated memory is still 308.3 MB. Free memory was 267.3 MB in the beginning and 257.2 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-24 12:53:08,330 INFO L168 Benchmark]: Boogie Preprocessor took 35.57 ms. Allocated memory is still 308.3 MB. Free memory was 257.2 MB in the beginning and 255.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:53:08,331 INFO L168 Benchmark]: RCFGBuilder took 235.59 ms. Allocated memory is still 308.3 MB. Free memory was 255.2 MB in the beginning and 237.5 MB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 5.3 GB. [2018-01-24 12:53:08,331 INFO L168 Benchmark]: TraceAbstraction took 63930.85 ms. Allocated memory was 308.3 MB in the beginning and 635.4 MB in the end (delta: 327.2 MB). Free memory was 236.5 MB in the beginning and 368.3 MB in the end (delta: -131.8 MB). Peak memory consumption was 195.4 MB. Max. memory is 5.3 GB. [2018-01-24 12:53:08,333 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 308.3 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 181.26 ms. Allocated memory is still 308.3 MB. Free memory was 267.3 MB in the beginning and 257.2 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.57 ms. Allocated memory is still 308.3 MB. Free memory was 257.2 MB in the beginning and 255.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 235.59 ms. Allocated memory is still 308.3 MB. Free memory was 255.2 MB in the beginning and 237.5 MB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 63930.85 ms. Allocated memory was 308.3 MB in the beginning and 635.4 MB in the end (delta: 327.2 MB). Free memory was 236.5 MB in the beginning and 368.3 MB in the end (delta: -131.8 MB). Peak memory consumption was 195.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Toolchain cancelled while SimplifyDDAWithTimeout was simplifying term of DAG size 195. RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-53-08-339.csv Completed graceful shutdown