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/cstrcspn-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:46:18,865 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:46:18,866 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:46:18,882 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:46:18,882 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:46:18,883 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:46:18,884 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:46:18,885 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:46:18,886 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:46:18,887 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:46:18,887 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:46:18,887 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:46:18,888 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:46:18,889 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:46:18,890 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:46:18,893 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:46:18,895 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:46:18,897 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:46:18,898 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:46:18,899 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:46:18,901 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:46:18,902 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:46:18,902 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:46:18,903 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:46:18,904 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:46:18,905 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:46:18,905 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:46:18,906 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:46:18,906 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:46:18,906 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:46:18,907 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:46:18,907 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:46:18,917 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:46:18,917 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:46:18,918 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:46:18,918 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:46:18,918 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:46:18,919 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:46:18,919 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:46:18,919 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:46:18,920 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:46:18,920 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:46:18,920 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:46:18,920 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:46:18,920 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:46:18,921 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:46:18,921 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:46:18,921 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:46:18,921 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:46:18,921 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:46:18,922 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:46:18,922 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:46:18,922 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:46:18,922 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:46:18,922 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:46:18,922 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:46:18,923 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:46:18,923 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:46:18,923 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:46:18,923 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:46:18,924 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 12:46:18,924 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:46:18,924 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:46:18,924 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:46:18,925 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:46:18,925 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:46:18,959 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:46:18,971 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:46:18,975 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:46:18,977 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:46:18,977 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:46:18,978 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-01-24 12:46:19,144 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:46:19,150 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:46:19,150 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:46:19,150 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:46:19,155 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:46:19,156 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:46:19" (1/1) ... [2018-01-24 12:46:19,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e47ad9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:46:19, skipping insertion in model container [2018-01-24 12:46:19,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:46:19" (1/1) ... [2018-01-24 12:46:19,177 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:46:19,217 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:46:19,327 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:46:19,342 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:46:19,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:46:19 WrapperNode [2018-01-24 12:46:19,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:46:19,350 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:46:19,350 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:46:19,350 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:46:19,366 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:46:19" (1/1) ... [2018-01-24 12:46:19,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:46:19" (1/1) ... [2018-01-24 12:46:19,378 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:46:19" (1/1) ... [2018-01-24 12:46:19,379 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:46:19" (1/1) ... [2018-01-24 12:46:19,384 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:46:19" (1/1) ... [2018-01-24 12:46:19,388 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:46:19" (1/1) ... [2018-01-24 12:46:19,390 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:46:19" (1/1) ... [2018-01-24 12:46:19,392 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:46:19,393 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:46:19,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:46:19,393 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:46:19,394 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:46:19" (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:46:19,447 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:46:19,447 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:46:19,447 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcspn [2018-01-24 12:46:19,447 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:46:19,447 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:46:19,448 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:46:19,448 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:46:19,448 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:46:19,448 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:46:19,448 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:46:19,448 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcspn [2018-01-24 12:46:19,449 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:46:19,449 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:46:19,449 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:46:19,707 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:46:19,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:46:19 BoogieIcfgContainer [2018-01-24 12:46:19,708 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:46:19,708 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:46:19,708 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:46:19,710 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:46:19,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:46:19" (1/3) ... [2018-01-24 12:46:19,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44023eb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:46:19, skipping insertion in model container [2018-01-24 12:46:19,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:46:19" (2/3) ... [2018-01-24 12:46:19,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44023eb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:46:19, skipping insertion in model container [2018-01-24 12:46:19,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:46:19" (3/3) ... [2018-01-24 12:46:19,713 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-01-24 12:46:19,720 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:46:19,725 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-24 12:46:19,769 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:46:19,770 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:46:19,770 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:46:19,770 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:46:19,770 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:46:19,770 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:46:19,770 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:46:19,770 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:46:19,771 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:46:19,792 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-01-24 12:46:19,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 12:46:19,800 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:46:19,801 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:46:19,801 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:46:19,806 INFO L82 PathProgramCache]: Analyzing trace with hash -21044599, now seen corresponding path program 1 times [2018-01-24 12:46:19,809 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:46:19,864 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:19,865 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:19,865 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:19,865 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:46:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:19,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:46:20,046 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:46:20,048 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:46:20,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:46:20,049 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:46:20,051 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:46:20,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:46:20,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:46:20,131 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 4 states. [2018-01-24 12:46:20,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:46:20,259 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2018-01-24 12:46:20,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:46:20,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 12:46:20,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:46:20,272 INFO L225 Difference]: With dead ends: 96 [2018-01-24 12:46:20,272 INFO L226 Difference]: Without dead ends: 54 [2018-01-24 12:46:20,276 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:46:20,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-24 12:46:20,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-24 12:46:20,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 12:46:20,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-01-24 12:46:20,317 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 13 [2018-01-24 12:46:20,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:46:20,318 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-01-24 12:46:20,318 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:46:20,318 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-01-24 12:46:20,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 12:46:20,319 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:46:20,319 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:46:20,319 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:46:20,319 INFO L82 PathProgramCache]: Analyzing trace with hash -21044598, now seen corresponding path program 1 times [2018-01-24 12:46:20,319 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:46:20,321 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:20,321 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:20,321 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:20,321 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:46:20,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:20,337 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:46:20,458 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:46:20,459 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:46:20,459 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:46:20,459 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:46:20,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:46:20,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:46:20,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:46:20,462 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 6 states. [2018-01-24 12:46:20,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:46:20,580 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-01-24 12:46:20,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:46:20,581 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-24 12:46:20,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:46:20,582 INFO L225 Difference]: With dead ends: 54 [2018-01-24 12:46:20,582 INFO L226 Difference]: Without dead ends: 53 [2018-01-24 12:46:20,583 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:46:20,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-24 12:46:20,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-24 12:46:20,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 12:46:20,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-01-24 12:46:20,591 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 13 [2018-01-24 12:46:20,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:46:20,591 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-01-24 12:46:20,591 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:46:20,591 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-01-24 12:46:20,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:46:20,592 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:46:20,592 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:46:20,592 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:46:20,592 INFO L82 PathProgramCache]: Analyzing trace with hash -652382516, now seen corresponding path program 1 times [2018-01-24 12:46:20,592 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:46:20,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:20,593 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:20,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:20,594 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:46:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:20,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:46:20,664 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:46:20,664 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:46:20,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:46:20,665 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:46:20,665 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:46:20,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:46:20,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:46:20,666 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 4 states. [2018-01-24 12:46:20,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:46:20,776 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-01-24 12:46:20,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:46:20,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 12:46:20,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:46:20,777 INFO L225 Difference]: With dead ends: 53 [2018-01-24 12:46:20,777 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 12:46:20,777 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:46:20,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 12:46:20,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-24 12:46:20,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 12:46:20,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-01-24 12:46:20,782 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 14 [2018-01-24 12:46:20,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:46:20,783 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-01-24 12:46:20,783 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:46:20,783 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-01-24 12:46:20,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:46:20,784 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:46:20,784 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:46:20,784 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:46:20,784 INFO L82 PathProgramCache]: Analyzing trace with hash -652382515, now seen corresponding path program 1 times [2018-01-24 12:46:20,784 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:46:20,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:20,785 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:20,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:20,785 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:46:20,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:20,797 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:46:20,862 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:46:20,862 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:46:20,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:46:20,863 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:46:20,863 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:46:20,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:46:20,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:46:20,863 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-01-24 12:46:20,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:46:20,927 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-01-24 12:46:20,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:46:20,928 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 12:46:20,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:46:20,929 INFO L225 Difference]: With dead ends: 52 [2018-01-24 12:46:20,929 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 12:46:20,929 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:46:20,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 12:46:20,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-24 12:46:20,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 12:46:20,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-01-24 12:46:20,936 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 14 [2018-01-24 12:46:20,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:46:20,936 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-01-24 12:46:20,936 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:46:20,936 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-01-24 12:46:20,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 12:46:20,937 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:46:20,937 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:46:20,937 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:46:20,938 INFO L82 PathProgramCache]: Analyzing trace with hash 470787565, now seen corresponding path program 1 times [2018-01-24 12:46:20,938 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:46:20,939 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:20,939 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:20,939 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:20,939 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:46:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:20,954 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:46:21,002 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:46:21,003 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:46:21,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:46:21,003 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:46:21,003 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:46:21,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:46:21,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:46:21,004 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 5 states. [2018-01-24 12:46:21,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:46:21,066 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-01-24 12:46:21,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:46:21,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 12:46:21,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:46:21,067 INFO L225 Difference]: With dead ends: 51 [2018-01-24 12:46:21,067 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 12:46:21,068 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:46:21,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 12:46:21,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-24 12:46:21,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 12:46:21,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-01-24 12:46:21,074 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 18 [2018-01-24 12:46:21,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:46:21,075 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-01-24 12:46:21,075 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:46:21,075 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-01-24 12:46:21,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 12:46:21,076 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:46:21,076 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:46:21,076 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:46:21,076 INFO L82 PathProgramCache]: Analyzing trace with hash 470787566, now seen corresponding path program 1 times [2018-01-24 12:46:21,077 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:46:21,077 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:21,078 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:21,078 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:21,078 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:46:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:21,092 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:46:21,174 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:46:21,174 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:46:21,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:46:21,174 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:46:21,174 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:46:21,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:46:21,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:46:21,175 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 8 states. [2018-01-24 12:46:21,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:46:21,280 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2018-01-24 12:46:21,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:46:21,280 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-24 12:46:21,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:46:21,283 INFO L225 Difference]: With dead ends: 75 [2018-01-24 12:46:21,283 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 12:46:21,284 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:46:21,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 12:46:21,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2018-01-24 12:46:21,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 12:46:21,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-01-24 12:46:21,289 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 18 [2018-01-24 12:46:21,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:46:21,290 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-01-24 12:46:21,290 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:46:21,290 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-01-24 12:46:21,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 12:46:21,291 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:46:21,291 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] [2018-01-24 12:46:21,291 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:46:21,291 INFO L82 PathProgramCache]: Analyzing trace with hash 947097224, now seen corresponding path program 1 times [2018-01-24 12:46:21,291 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:46:21,292 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:21,292 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:21,292 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:21,292 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:46:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:21,304 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:46:21,345 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:46:21,345 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:46:21,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:46:21,345 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:46:21,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:46:21,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:46:21,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:46:21,346 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 6 states. [2018-01-24 12:46:21,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:46:21,456 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-01-24 12:46:21,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:46:21,457 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-24 12:46:21,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:46:21,458 INFO L225 Difference]: With dead ends: 56 [2018-01-24 12:46:21,458 INFO L226 Difference]: Without dead ends: 53 [2018-01-24 12:46:21,458 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:46:21,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-24 12:46:21,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-01-24 12:46:21,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 12:46:21,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-01-24 12:46:21,464 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 23 [2018-01-24 12:46:21,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:46:21,464 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-01-24 12:46:21,465 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:46:21,465 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-01-24 12:46:21,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 12:46:21,466 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:46:21,466 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] [2018-01-24 12:46:21,466 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:46:21,466 INFO L82 PathProgramCache]: Analyzing trace with hash 947097225, now seen corresponding path program 1 times [2018-01-24 12:46:21,466 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:46:21,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:21,467 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:21,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:21,467 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:46:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:21,480 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:46:21,591 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:46:21,591 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:46:21,591 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:46:21,592 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:46:21,592 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:46:21,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:46:21,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:46:21,593 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 9 states. [2018-01-24 12:46:21,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:46:21,744 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-01-24 12:46:21,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:46:21,745 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-01-24 12:46:21,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:46:21,746 INFO L225 Difference]: With dead ends: 70 [2018-01-24 12:46:21,746 INFO L226 Difference]: Without dead ends: 67 [2018-01-24 12:46:21,747 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:46:21,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-24 12:46:21,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2018-01-24 12:46:21,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-24 12:46:21,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-01-24 12:46:21,754 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 23 [2018-01-24 12:46:21,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:46:21,755 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-01-24 12:46:21,755 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:46:21,755 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-01-24 12:46:21,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 12:46:21,756 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:46:21,756 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:46:21,756 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:46:21,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1236428998, now seen corresponding path program 1 times [2018-01-24 12:46:21,757 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:46:21,757 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:21,758 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:21,758 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:21,758 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:46:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:21,773 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:46:21,860 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:46:21,861 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:46:21,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:46:21,861 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:46:21,861 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:46:21,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:46:21,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:46:21,862 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 6 states. [2018-01-24 12:46:22,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:46:22,081 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2018-01-24 12:46:22,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:46:22,117 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-01-24 12:46:22,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:46:22,118 INFO L225 Difference]: With dead ends: 58 [2018-01-24 12:46:22,118 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 12:46:22,118 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:46:22,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 12:46:22,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-24 12:46:22,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 12:46:22,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-01-24 12:46:22,123 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 28 [2018-01-24 12:46:22,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:46:22,123 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-01-24 12:46:22,123 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:46:22,123 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-01-24 12:46:22,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 12:46:22,124 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:46:22,124 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:46:22,124 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:46:22,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1333847614, now seen corresponding path program 1 times [2018-01-24 12:46:22,124 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:46:22,125 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:22,125 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:22,125 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:22,125 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:46:22,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:22,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:46:22,163 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:46:22,163 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:46:22,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:46:22,164 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:46:22,164 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:46:22,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:46:22,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:46:22,165 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 3 states. [2018-01-24 12:46:22,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:46:22,176 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2018-01-24 12:46:22,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:46:22,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-01-24 12:46:22,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:46:22,177 INFO L225 Difference]: With dead ends: 78 [2018-01-24 12:46:22,177 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 12:46:22,178 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:46:22,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 12:46:22,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-24 12:46:22,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 12:46:22,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-01-24 12:46:22,185 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 28 [2018-01-24 12:46:22,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:46:22,185 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-01-24 12:46:22,185 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:46:22,185 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-01-24 12:46:22,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 12:46:22,186 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:46:22,186 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:46:22,187 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:46:22,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1745742785, now seen corresponding path program 1 times [2018-01-24 12:46:22,187 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:46:22,188 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:22,188 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:22,188 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:22,188 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:46:22,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:22,212 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:46:22,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:46:22,472 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:46:22,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-24 12:46:22,472 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:46:22,472 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 12:46:22,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 12:46:22,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:46:22,473 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 11 states. [2018-01-24 12:46:22,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:46:22,651 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2018-01-24 12:46:22,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:46:22,652 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-01-24 12:46:22,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:46:22,652 INFO L225 Difference]: With dead ends: 93 [2018-01-24 12:46:22,652 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 12:46:22,653 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-01-24 12:46:22,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 12:46:22,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-24 12:46:22,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 12:46:22,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-24 12:46:22,657 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 30 [2018-01-24 12:46:22,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:46:22,658 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-24 12:46:22,658 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 12:46:22,658 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-24 12:46:22,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 12:46:22,658 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:46:22,658 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:46:22,658 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:46:22,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1611729279, now seen corresponding path program 1 times [2018-01-24 12:46:22,659 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:46:22,659 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:22,659 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:22,660 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:22,660 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:46:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:22,676 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:46:22,884 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:46:22,884 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:46:22,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-24 12:46:22,885 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:46:22,885 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 12:46:22,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 12:46:22,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:46:22,886 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 11 states. [2018-01-24 12:46:23,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:46:23,059 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2018-01-24 12:46:23,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 12:46:23,059 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-01-24 12:46:23,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:46:23,060 INFO L225 Difference]: With dead ends: 107 [2018-01-24 12:46:23,060 INFO L226 Difference]: Without dead ends: 77 [2018-01-24 12:46:23,060 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-01-24 12:46:23,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-24 12:46:23,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-01-24 12:46:23,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-24 12:46:23,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-01-24 12:46:23,070 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 30 [2018-01-24 12:46:23,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:46:23,070 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-01-24 12:46:23,070 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 12:46:23,070 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-01-24 12:46:23,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 12:46:23,072 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:46:23,072 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:46:23,072 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:46:23,072 INFO L82 PathProgramCache]: Analyzing trace with hash -193709055, now seen corresponding path program 1 times [2018-01-24 12:46:23,072 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:46:23,073 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:23,073 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:23,073 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:23,074 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:46:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:23,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:46:23,279 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:46:23,279 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:46:23,279 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:46:23,286 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:23,286 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:46:23,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:23,334 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:46:23,400 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:46:23,409 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:46:23,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:23,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:23,417 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:46:23,418 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 12:46:23,629 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 18 treesize of output 14 [2018-01-24 12:46:23,651 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 14 treesize of output 11 [2018-01-24 12:46:23,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:46:23,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:46:23,681 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:46:23,681 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-24 12:46:23,853 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:46:23,854 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:46:24,169 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:46:24,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:24,176 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:46:24,188 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:46:24,188 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:24,190 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:24,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:24,196 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-24 12:46:24,206 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:46:24,241 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:46:24,241 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 12:46:24,250 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:24,251 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:46:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:24,319 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:46:24,336 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:46:24,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:24,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:24,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 12:46:24,395 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:46:24,397 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:46:24,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:24,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:24,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:24,405 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 12:46:24,582 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 19 treesize of output 15 [2018-01-24 12:46:24,589 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 16 [2018-01-24 12:46:24,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:46:24,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:46:24,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:46:24,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:30 [2018-01-24 12:46:24,711 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:46:24,712 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:46:24,812 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:46:24,819 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:46:24,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:24,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:24,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:24,824 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-24 12:46:24,902 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:46:24,904 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:46:24,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10, 12, 12] total 41 [2018-01-24 12:46:24,904 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:46:24,904 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 12:46:24,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 12:46:24,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1559, Unknown=0, NotChecked=0, Total=1722 [2018-01-24 12:46:24,906 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 20 states. [2018-01-24 12:46:25,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:46:25,736 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2018-01-24 12:46:25,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 12:46:25,737 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2018-01-24 12:46:25,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:46:25,739 INFO L225 Difference]: With dead ends: 106 [2018-01-24 12:46:25,739 INFO L226 Difference]: Without dead ends: 103 [2018-01-24 12:46:25,740 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 87 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=320, Invalid=2332, Unknown=0, NotChecked=0, Total=2652 [2018-01-24 12:46:25,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-24 12:46:25,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2018-01-24 12:46:25,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-24 12:46:25,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2018-01-24 12:46:25,754 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 30 [2018-01-24 12:46:25,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:46:25,754 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2018-01-24 12:46:25,754 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-24 12:46:25,754 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2018-01-24 12:46:25,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 12:46:25,755 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:46:25,755 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:46:25,756 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:46:25,756 INFO L82 PathProgramCache]: Analyzing trace with hash -276872451, now seen corresponding path program 1 times [2018-01-24 12:46:25,756 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:46:25,757 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:25,757 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:25,757 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:25,757 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:46:25,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:25,771 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:46:25,985 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:46:25,985 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:46:25,985 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:46:25,990 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:25,990 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:46:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:26,007 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:46:26,010 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:46:26,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:26,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:26,013 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 12:46:26,041 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:46:26,041 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:46:26,042 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:46:26,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:26,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:26,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-24 12:46:26,082 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:46:26,084 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:46:26,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:26,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:26,090 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:46:26,091 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-24 12:46:26,122 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:46:26,124 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:46:26,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:26,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:26,137 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:46:26,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-24 12:46:26,242 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 28 treesize of output 26 [2018-01-24 12:46:26,255 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 14 treesize of output 11 [2018-01-24 12:46:26,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:46:26,270 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:46:26,270 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:26,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:46:26,290 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:46:26,291 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-01-24 12:46:26,350 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:46:26,350 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:46:26,514 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:46:26,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:26,520 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:46:26,527 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:46:26,528 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:26,529 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:26,533 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:46:26,533 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-01-24 12:46:26,558 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:46:26,578 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:46:26,578 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 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 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 12:46:26,585 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:26,585 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:46:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:26,631 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:46:26,649 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:46:26,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:26,714 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:46:26,714 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:26,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:26,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 12:46:26,769 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:46:26,770 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:46:26,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 12:46:26,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:26,781 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:46:26,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:26,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:26,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-24 12:46:26,843 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:46:26,845 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:46:26,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:26,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:26,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:26,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-24 12:46:26,888 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:46:26,890 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:46:26,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:26,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:26,901 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:46:26,901 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-01-24 12:46:27,031 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:46:27,036 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 16 [2018-01-24 12:46:27,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:46:27,045 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:46:27,045 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:27,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:46:27,054 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:46:27,054 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:48, output treesize:34 [2018-01-24 12:46:27,129 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:46:27,129 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:46:27,337 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:46:27,343 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:46:27,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:27,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:27,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:27,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:21 [2018-01-24 12:46:27,481 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:46:27,482 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:46:27,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 9, 12, 11] total 46 [2018-01-24 12:46:27,483 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:46:27,483 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-24 12:46:27,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-24 12:46:27,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1990, Unknown=0, NotChecked=0, Total=2162 [2018-01-24 12:46:27,484 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 23 states. [2018-01-24 12:46:28,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:46:28,245 INFO L93 Difference]: Finished difference Result 172 states and 195 transitions. [2018-01-24 12:46:28,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 12:46:28,245 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 31 [2018-01-24 12:46:28,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:46:28,247 INFO L225 Difference]: With dead ends: 172 [2018-01-24 12:46:28,247 INFO L226 Difference]: Without dead ends: 170 [2018-01-24 12:46:28,248 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 86 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=311, Invalid=2881, Unknown=0, NotChecked=0, Total=3192 [2018-01-24 12:46:28,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-01-24 12:46:28,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 127. [2018-01-24 12:46:28,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-01-24 12:46:28,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2018-01-24 12:46:28,268 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 31 [2018-01-24 12:46:28,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:46:28,268 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2018-01-24 12:46:28,268 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-24 12:46:28,268 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2018-01-24 12:46:28,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 12:46:28,270 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:46:28,270 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, 1, 1, 1, 1, 1] [2018-01-24 12:46:28,270 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:46:28,270 INFO L82 PathProgramCache]: Analyzing trace with hash 149792585, now seen corresponding path program 2 times [2018-01-24 12:46:28,270 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:46:28,271 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:28,271 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:46:28,272 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:28,272 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:46:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:28,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:46:28,586 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:46:28,586 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:46:28,586 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:46:28,591 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:46:28,591 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 12:46:28,604 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:46:28,609 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:46:28,611 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:46:28,613 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:46:28,616 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:46:28,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:28,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:28,619 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 12:46:28,653 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:46:28,655 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:46:28,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:28,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:28,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:28,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-24 12:46:28,774 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 20 treesize of output 16 [2018-01-24 12:46:28,779 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:46:28,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:46:28,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:46:28,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-24 12:46:28,789 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:33 [2018-01-24 12:46:28,897 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:46:28,897 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:46:29,267 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 41 treesize of output 39 [2018-01-24 12:46:29,297 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:46:29,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:29,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:29,318 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 39 treesize of output 37 [2018-01-24 12:46:29,334 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:46:29,335 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:29,340 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:29,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:46:29,354 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:81, output treesize:98 [2018-01-24 12:46:29,446 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:46:29,465 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:46:29,465 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 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 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 12:46:29,468 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:46:29,469 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 12:46:29,484 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:46:29,517 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:46:29,551 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:46:29,556 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:46:29,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:46:29,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:29,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:29,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 12:46:29,567 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:46:29,568 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:46:29,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:29,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:29,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:29,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-24 12:46:29,831 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 20 treesize of output 16 [2018-01-24 12:46:29,832 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 12:46:29,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:29,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:29,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:29,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 [2018-01-24 12:46:29,864 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:46:29,864 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:46:30,134 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:46:30,143 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:46:30,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:30,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:30,150 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:46:30,150 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-01-24 12:46:30,247 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:46:30,249 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:46:30,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13, 14, 14] total 50 [2018-01-24 12:46:30,249 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:46:30,249 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-24 12:46:30,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-24 12:46:30,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=2326, Unknown=0, NotChecked=0, Total=2550 [2018-01-24 12:46:30,250 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand 24 states. [2018-01-24 12:46:31,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:46:31,283 INFO L93 Difference]: Finished difference Result 179 states and 199 transitions. [2018-01-24 12:46:31,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 12:46:31,283 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 37 [2018-01-24 12:46:31,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:46:31,284 INFO L225 Difference]: With dead ends: 179 [2018-01-24 12:46:31,284 INFO L226 Difference]: Without dead ends: 176 [2018-01-24 12:46:31,285 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 105 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 963 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=526, Invalid=3506, Unknown=0, NotChecked=0, Total=4032 [2018-01-24 12:46:31,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-01-24 12:46:31,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 92. [2018-01-24 12:46:31,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-01-24 12:46:31,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2018-01-24 12:46:31,298 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 37 [2018-01-24 12:46:31,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:46:31,298 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2018-01-24 12:46:31,298 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-24 12:46:31,298 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2018-01-24 12:46:31,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-24 12:46:31,299 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:46:31,299 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:46:31,299 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:46:31,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1598751668, now seen corresponding path program 2 times [2018-01-24 12:46:31,299 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:46:31,300 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:31,300 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:46:31,300 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:46:31,300 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:46:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:46:31,312 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:46:31,811 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:46:31,812 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:46:31,812 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:46:31,817 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:46:31,817 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 12:46:31,829 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:46:31,837 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:46:31,840 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:46:31,843 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:46:31,852 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:46:31,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:31,870 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:46:31,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:31,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:31,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 12:46:31,907 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:46:31,908 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:46:31,909 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:46:31,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:31,915 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:46:31,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:31,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:31,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-24 12:46:31,956 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:46:31,958 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:46:31,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:31,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:31,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:31,965 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-01-24 12:46:31,990 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:46:31,992 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:46:31,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:31,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:32,001 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:46:32,002 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2018-01-24 12:46:32,203 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 32 treesize of output 30 [2018-01-24 12:46:32,206 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:46:32,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:32,249 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:46:32,250 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 12:46:32,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:46:32,264 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:46:32,264 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:49 [2018-01-24 12:46:32,318 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:46:32,318 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:46:32,783 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 41 treesize of output 39 [2018-01-24 12:46:32,903 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 24 DAG size of output 22 [2018-01-24 12:46:32,917 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:46:32,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:32,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:33,040 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 39 treesize of output 37 [2018-01-24 12:46:33,168 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 22 DAG size of output 20 [2018-01-24 12:46:33,169 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:46:33,170 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:33,214 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:33,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:46:33,309 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:81, output treesize:98 [2018-01-24 12:46:34,886 WARN L143 SmtUtils]: Spent 1463ms on a formula simplification that was a NOOP. DAG size: 38 [2018-01-24 12:46:36,607 WARN L143 SmtUtils]: Spent 1676ms on a formula simplification that was a NOOP. DAG size: 38 [2018-01-24 12:46:36,629 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:46:36,657 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:46:36,658 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 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 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 12:46:36,661 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:46:36,661 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 12:46:36,675 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:46:36,698 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:46:36,733 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:46:36,739 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:46:36,742 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:46:36,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:36,747 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:46:36,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:36,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:36,750 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 12:46:36,779 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:46:36,780 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:46:36,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:36,788 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:46:36,788 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:46:36,789 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:46:36,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:36,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:36,793 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-24 12:46:36,851 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:46:36,852 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:46:36,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:36,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:36,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:36,858 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-24 12:46:36,885 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:46:36,891 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:46:36,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:36,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:36,904 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:46:36,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2018-01-24 12:46:37,059 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 32 treesize of output 30 [2018-01-24 12:46:37,067 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:46:37,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:46:37,075 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:46:37,076 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:37,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:46:37,091 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:46:37,091 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:57, output treesize:49 [2018-01-24 12:46:37,103 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:46:37,103 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:46:37,389 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:46:37,397 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:46:37,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:46:37,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:46:37,444 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:46:37,444 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:52 [2018-01-24 12:46:37,656 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:46:37,658 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:46:37,658 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 11, 13, 12] total 45 [2018-01-24 12:46:37,658 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:46:37,659 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-24 12:46:37,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-24 12:46:37,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1904, Unknown=0, NotChecked=0, Total=2070 [2018-01-24 12:46:37,659 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand 23 states. [2018-01-24 12:46:41,970 WARN L146 SmtUtils]: Spent 2027ms on a formula simplification. DAG size of input: 49 DAG size of output 46 [2018-01-24 12:46:42,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:46:42,023 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2018-01-24 12:46:42,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 12:46:42,023 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-01-24 12:46:42,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:46:42,023 INFO L225 Difference]: With dead ends: 113 [2018-01-24 12:46:42,023 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 12:46:42,025 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 138 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=382, Invalid=2924, Unknown=0, NotChecked=0, Total=3306 [2018-01-24 12:46:42,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 12:46:42,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 12:46:42,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 12:46:42,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 12:46:42,026 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2018-01-24 12:46:42,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:46:42,026 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 12:46:42,026 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-24 12:46:42,026 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 12:46:42,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 12:46:42,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 12:46:42,105 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 12:46:42,122 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 12:46:42,149 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 12:46:42,158 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 12:46:42,168 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 12:46:42,247 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 12:46:42,250 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 12:46:42,267 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 12:46:42,317 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 12:46:46,413 WARN L146 SmtUtils]: Spent 4083ms on a formula simplification. DAG size of input: 122 DAG size of output 1 [2018-01-24 12:46:46,659 WARN L146 SmtUtils]: Spent 244ms on a formula simplification. DAG size of input: 100 DAG size of output 72 Received shutdown request... [2018-01-24 12:47:24,428 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:47:24,429 INFO L168 Benchmark]: Toolchain (without parser) took 65284.92 ms. Allocated memory was 296.7 MB in the beginning and 618.1 MB in the end (delta: 321.4 MB). Free memory was 256.7 MB in the beginning and 424.0 MB in the end (delta: -167.3 MB). Peak memory consumption was 273.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:47:24,430 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 296.7 MB. Free memory is still 262.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:47:24,430 INFO L168 Benchmark]: CACSL2BoogieTranslator took 199.26 ms. Allocated memory is still 296.7 MB. Free memory was 255.7 MB in the beginning and 245.4 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 5.3 GB. [2018-01-24 12:47:24,430 INFO L168 Benchmark]: Boogie Preprocessor took 42.55 ms. Allocated memory is still 296.7 MB. Free memory was 245.4 MB in the beginning and 243.4 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:47:24,431 INFO L168 Benchmark]: RCFGBuilder took 315.07 ms. Allocated memory is still 296.7 MB. Free memory was 243.4 MB in the beginning and 223.4 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:47:24,431 INFO L168 Benchmark]: TraceAbstraction took 64720.25 ms. Allocated memory was 296.7 MB in the beginning and 618.1 MB in the end (delta: 321.4 MB). Free memory was 223.4 MB in the beginning and 424.0 MB in the end (delta: -200.6 MB). Peak memory consumption was 239.7 MB. Max. memory is 5.3 GB. [2018-01-24 12:47:24,433 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.17 ms. Allocated memory is still 296.7 MB. Free memory is still 262.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 199.26 ms. Allocated memory is still 296.7 MB. Free memory was 255.7 MB in the beginning and 245.4 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.55 ms. Allocated memory is still 296.7 MB. Free memory was 245.4 MB in the beginning and 243.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 315.07 ms. Allocated memory is still 296.7 MB. Free memory was 243.4 MB in the beginning and 223.4 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 64720.25 ms. Allocated memory was 296.7 MB in the beginning and 618.1 MB in the end (delta: 321.4 MB). Free memory was 223.4 MB in the beginning and 424.0 MB in the end (delta: -200.6 MB). Peak memory consumption was 239.7 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: 555]: 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 228. RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-47-24-440.csv Completed graceful shutdown