java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.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 16:42:00,865 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:42:00,867 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:42:00,882 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:42:00,882 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:42:00,883 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:42:00,884 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:42:00,886 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:42:00,888 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:42:00,889 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:42:00,889 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:42:00,890 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:42:00,891 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:42:00,892 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:42:00,893 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:42:00,895 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:42:00,897 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:42:00,899 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:42:00,901 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:42:00,902 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:42:00,904 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:42:00,905 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:42:00,905 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:42:00,906 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:42:00,907 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:42:00,908 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:42:00,908 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:42:00,909 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:42:00,909 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:42:00,909 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:42:00,910 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:42:00,910 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-24 16:42:00,918 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:42:00,918 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:42:00,919 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:42:00,919 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:42:00,919 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:42:00,920 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:42:00,920 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:42:00,920 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:42:00,920 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:42:00,920 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:42:00,920 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:42:00,921 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:42:00,921 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:42:00,921 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:42:00,921 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:42:00,921 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:42:00,921 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:42:00,921 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:42:00,921 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:42:00,922 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:42:00,922 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:42:00,922 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:42:00,922 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:42:00,922 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:42:00,922 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:42:00,923 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:42:00,923 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:42:00,923 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:42:00,923 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:42:00,923 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 16:42:00,923 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:42:00,924 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:42:00,924 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:42:00,924 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 16:42:00,924 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:42:00,924 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:42:00,956 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:42:00,967 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:42:00,970 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:42:00,971 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:42:00,972 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:42:00,972 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 16:42:01,126 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:42:01,130 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:42:01,131 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:42:01,131 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:42:01,136 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:42:01,137 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:42:01" (1/1) ... [2018-01-24 16:42:01,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1365a45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:42:01, skipping insertion in model container [2018-01-24 16:42:01,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:42:01" (1/1) ... [2018-01-24 16:42:01,152 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:42:01,191 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:42:01,296 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:42:01,312 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:42:01,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:42:01 WrapperNode [2018-01-24 16:42:01,319 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:42:01,319 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:42:01,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:42:01,320 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:42:01,333 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:42:01" (1/1) ... [2018-01-24 16:42:01,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:42:01" (1/1) ... [2018-01-24 16:42:01,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:42:01" (1/1) ... [2018-01-24 16:42:01,344 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:42:01" (1/1) ... [2018-01-24 16:42:01,347 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:42:01" (1/1) ... [2018-01-24 16:42:01,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:42:01" (1/1) ... [2018-01-24 16:42:01,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:42:01" (1/1) ... [2018-01-24 16:42:01,352 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:42:01,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:42:01,353 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:42:01,353 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:42:01,354 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:42:01" (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 16:42:01,396 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:42:01,396 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:42:01,396 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcspn [2018-01-24 16:42:01,396 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:42:01,396 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:42:01,396 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:42:01,396 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:42:01,397 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:42:01,397 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:42:01,397 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:42:01,397 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcspn [2018-01-24 16:42:01,397 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:42:01,397 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:42:01,397 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:42:01,627 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:42:01,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:42:01 BoogieIcfgContainer [2018-01-24 16:42:01,628 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:42:01,628 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 16:42:01,628 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 16:42:01,630 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 16:42:01,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 04:42:01" (1/3) ... [2018-01-24 16:42:01,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60bb3036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:42:01, skipping insertion in model container [2018-01-24 16:42:01,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:42:01" (2/3) ... [2018-01-24 16:42:01,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60bb3036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:42:01, skipping insertion in model container [2018-01-24 16:42:01,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:42:01" (3/3) ... [2018-01-24 16:42:01,633 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-01-24 16:42:01,639 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 16:42:01,645 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-24 16:42:01,679 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 16:42:01,679 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 16:42:01,679 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 16:42:01,679 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 16:42:01,679 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 16:42:01,679 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 16:42:01,680 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 16:42:01,680 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 16:42:01,680 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 16:42:01,702 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-01-24 16:42:01,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 16:42:01,709 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:42:01,710 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:42:01,710 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:42:01,715 INFO L82 PathProgramCache]: Analyzing trace with hash -21044599, now seen corresponding path program 1 times [2018-01-24 16:42:01,718 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:42:01,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:01,764 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:42:01,765 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:01,765 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:42:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:42:01,817 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:42:01,943 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 16:42:01,946 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:42:01,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:42:01,984 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:42:01,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:42:02,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:42:02,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:42:02,068 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 4 states. [2018-01-24 16:42:02,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:42:02,233 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2018-01-24 16:42:02,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:42:02,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 16:42:02,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:42:02,243 INFO L225 Difference]: With dead ends: 96 [2018-01-24 16:42:02,243 INFO L226 Difference]: Without dead ends: 54 [2018-01-24 16:42:02,245 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 16:42:02,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-24 16:42:02,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-24 16:42:02,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 16:42:02,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-01-24 16:42:02,274 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 13 [2018-01-24 16:42:02,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:42:02,275 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-01-24 16:42:02,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:42:02,275 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-01-24 16:42:02,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 16:42:02,275 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:42:02,276 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:42:02,276 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:42:02,276 INFO L82 PathProgramCache]: Analyzing trace with hash -21044598, now seen corresponding path program 1 times [2018-01-24 16:42:02,276 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:42:02,277 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:02,277 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:42:02,277 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:02,277 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:42:02,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:42:02,294 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:42:02,429 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 16:42:02,429 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:42:02,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:42:02,430 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:42:02,433 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:42:02,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:42:02,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:42:02,434 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 6 states. [2018-01-24 16:42:02,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:42:02,519 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-01-24 16:42:02,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:42:02,519 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-24 16:42:02,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:42:02,521 INFO L225 Difference]: With dead ends: 54 [2018-01-24 16:42:02,521 INFO L226 Difference]: Without dead ends: 53 [2018-01-24 16:42:02,522 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:42:02,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-24 16:42:02,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-24 16:42:02,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 16:42:02,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-01-24 16:42:02,529 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 13 [2018-01-24 16:42:02,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:42:02,530 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-01-24 16:42:02,530 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:42:02,530 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-01-24 16:42:02,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 16:42:02,530 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:42:02,531 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:42:02,531 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:42:02,531 INFO L82 PathProgramCache]: Analyzing trace with hash -652382516, now seen corresponding path program 1 times [2018-01-24 16:42:02,531 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:42:02,532 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:02,532 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:42:02,532 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:02,533 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:42:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:42:02,547 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:42:02,601 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 16:42:02,602 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:42:02,602 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:42:02,602 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:42:02,602 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:42:02,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:42:02,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:42:02,603 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 4 states. [2018-01-24 16:42:02,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:42:02,693 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-01-24 16:42:02,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:42:02,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 16:42:02,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:42:02,694 INFO L225 Difference]: With dead ends: 53 [2018-01-24 16:42:02,694 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 16:42:02,694 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 16:42:02,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 16:42:02,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-24 16:42:02,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 16:42:02,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-01-24 16:42:02,699 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 14 [2018-01-24 16:42:02,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:42:02,700 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-01-24 16:42:02,700 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:42:02,700 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-01-24 16:42:02,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 16:42:02,701 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:42:02,701 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:42:02,701 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:42:02,701 INFO L82 PathProgramCache]: Analyzing trace with hash -652382515, now seen corresponding path program 1 times [2018-01-24 16:42:02,701 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:42:02,702 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:02,702 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:42:02,702 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:02,702 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:42:02,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:42:02,715 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:42:02,768 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 16:42:02,768 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:42:02,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:42:02,768 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:42:02,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:42:02,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:42:02,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:42:02,769 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-01-24 16:42:02,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:42:02,842 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-01-24 16:42:02,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:42:02,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 16:42:02,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:42:02,844 INFO L225 Difference]: With dead ends: 52 [2018-01-24 16:42:02,844 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 16:42:02,844 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 16:42:02,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 16:42:02,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-24 16:42:02,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 16:42:02,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-01-24 16:42:02,849 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 14 [2018-01-24 16:42:02,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:42:02,849 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-01-24 16:42:02,849 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:42:02,849 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-01-24 16:42:02,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 16:42:02,849 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:42:02,849 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 16:42:02,850 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:42:02,850 INFO L82 PathProgramCache]: Analyzing trace with hash 470787565, now seen corresponding path program 1 times [2018-01-24 16:42:02,850 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:42:02,850 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:02,851 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:42:02,851 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:02,851 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:42:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:42:02,864 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:42:02,909 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 16:42:02,910 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:42:02,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:42:02,910 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:42:02,911 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:42:02,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:42:02,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:42:02,911 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 5 states. [2018-01-24 16:42:02,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:42:02,973 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-01-24 16:42:02,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:42:02,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 16:42:02,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:42:02,975 INFO L225 Difference]: With dead ends: 51 [2018-01-24 16:42:02,975 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 16:42:02,975 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 16:42:02,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 16:42:02,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-24 16:42:02,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 16:42:02,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-01-24 16:42:02,983 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 18 [2018-01-24 16:42:02,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:42:02,983 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-01-24 16:42:02,983 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:42:02,983 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-01-24 16:42:02,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 16:42:02,984 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:42:02,984 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 16:42:02,984 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:42:02,985 INFO L82 PathProgramCache]: Analyzing trace with hash 470787566, now seen corresponding path program 1 times [2018-01-24 16:42:02,985 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:42:02,986 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:02,986 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:42:02,986 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:02,986 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:42:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:42:03,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:42:03,086 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 16:42:03,086 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:42:03,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 16:42:03,087 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:42:03,087 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 16:42:03,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 16:42:03,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:42:03,087 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 8 states. [2018-01-24 16:42:03,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:42:03,208 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2018-01-24 16:42:03,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 16:42:03,208 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-24 16:42:03,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:42:03,211 INFO L225 Difference]: With dead ends: 75 [2018-01-24 16:42:03,211 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 16:42:03,212 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 16:42:03,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 16:42:03,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2018-01-24 16:42:03,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 16:42:03,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-01-24 16:42:03,217 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 18 [2018-01-24 16:42:03,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:42:03,218 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-01-24 16:42:03,218 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 16:42:03,218 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-01-24 16:42:03,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 16:42:03,218 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:42:03,219 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 16:42:03,219 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:42:03,219 INFO L82 PathProgramCache]: Analyzing trace with hash 947097224, now seen corresponding path program 1 times [2018-01-24 16:42:03,219 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:42:03,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:03,220 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:42:03,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:03,220 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:42:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:42:03,231 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:42:03,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:42:03,275 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:42:03,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:42:03,275 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:42:03,276 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:42:03,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:42:03,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:42:03,276 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 6 states. [2018-01-24 16:42:03,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:42:03,361 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-01-24 16:42:03,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:42:03,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-24 16:42:03,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:42:03,362 INFO L225 Difference]: With dead ends: 56 [2018-01-24 16:42:03,362 INFO L226 Difference]: Without dead ends: 53 [2018-01-24 16:42:03,363 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 16:42:03,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-24 16:42:03,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-01-24 16:42:03,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 16:42:03,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-01-24 16:42:03,368 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 23 [2018-01-24 16:42:03,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:42:03,368 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-01-24 16:42:03,368 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:42:03,368 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-01-24 16:42:03,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 16:42:03,369 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:42:03,369 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 16:42:03,370 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:42:03,370 INFO L82 PathProgramCache]: Analyzing trace with hash 947097225, now seen corresponding path program 1 times [2018-01-24 16:42:03,370 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:42:03,371 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:03,371 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:42:03,371 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:03,371 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:42:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:42:03,384 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:42:03,535 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 16:42:03,535 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:42:03,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 16:42:03,535 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:42:03,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 16:42:03,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 16:42:03,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:42:03,537 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 9 states. [2018-01-24 16:42:03,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:42:03,712 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-01-24 16:42:03,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 16:42:03,712 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-01-24 16:42:03,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:42:03,713 INFO L225 Difference]: With dead ends: 70 [2018-01-24 16:42:03,713 INFO L226 Difference]: Without dead ends: 67 [2018-01-24 16:42:03,714 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-24 16:42:03,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-24 16:42:03,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2018-01-24 16:42:03,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-24 16:42:03,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-01-24 16:42:03,720 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 23 [2018-01-24 16:42:03,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:42:03,721 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-01-24 16:42:03,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 16:42:03,721 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-01-24 16:42:03,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 16:42:03,722 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:42:03,722 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 16:42:03,722 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:42:03,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1236428998, now seen corresponding path program 1 times [2018-01-24 16:42:03,723 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:42:03,724 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:03,724 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:42:03,724 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:03,724 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:42:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:42:03,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:42:03,857 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 16:42:03,857 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:42:03,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:42:03,858 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:42:03,858 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:42:03,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:42:03,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:42:03,859 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 6 states. [2018-01-24 16:42:04,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:42:04,023 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2018-01-24 16:42:04,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:42:04,023 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-01-24 16:42:04,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:42:04,024 INFO L225 Difference]: With dead ends: 58 [2018-01-24 16:42:04,024 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 16:42:04,024 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 16:42:04,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 16:42:04,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-24 16:42:04,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 16:42:04,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-01-24 16:42:04,029 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 28 [2018-01-24 16:42:04,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:42:04,029 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-01-24 16:42:04,029 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:42:04,029 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-01-24 16:42:04,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 16:42:04,030 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:42:04,030 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 16:42:04,030 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:42:04,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1333847614, now seen corresponding path program 1 times [2018-01-24 16:42:04,030 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:42:04,031 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:04,031 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:42:04,031 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:04,031 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:42:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:42:04,044 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:42:04,069 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 16:42:04,069 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:42:04,069 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:42:04,070 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:42:04,070 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 16:42:04,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 16:42:04,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 16:42:04,070 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 3 states. [2018-01-24 16:42:04,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:42:04,079 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2018-01-24 16:42:04,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 16:42:04,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-01-24 16:42:04,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:42:04,080 INFO L225 Difference]: With dead ends: 78 [2018-01-24 16:42:04,080 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 16:42:04,081 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 16:42:04,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 16:42:04,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-24 16:42:04,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 16:42:04,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-01-24 16:42:04,087 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 28 [2018-01-24 16:42:04,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:42:04,087 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-01-24 16:42:04,087 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 16:42:04,087 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-01-24 16:42:04,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 16:42:04,088 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:42:04,088 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 16:42:04,089 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:42:04,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1745742785, now seen corresponding path program 1 times [2018-01-24 16:42:04,089 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:42:04,090 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:04,090 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:42:04,090 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:04,090 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:42:04,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:42:04,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:42:04,325 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 16:42:04,325 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:42:04,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-24 16:42:04,325 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:42:04,325 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 16:42:04,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 16:42:04,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-01-24 16:42:04,326 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 11 states. [2018-01-24 16:42:04,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:42:04,487 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2018-01-24 16:42:04,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 16:42:04,487 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-01-24 16:42:04,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:42:04,488 INFO L225 Difference]: With dead ends: 93 [2018-01-24 16:42:04,488 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 16:42:04,489 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-01-24 16:42:04,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 16:42:04,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-24 16:42:04,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 16:42:04,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-24 16:42:04,493 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 30 [2018-01-24 16:42:04,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:42:04,494 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-24 16:42:04,494 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 16:42:04,494 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-24 16:42:04,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 16:42:04,495 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:42:04,495 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 16:42:04,495 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:42:04,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1611729279, now seen corresponding path program 1 times [2018-01-24 16:42:04,496 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:42:04,496 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:04,497 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:42:04,497 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:04,497 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:42:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:42:04,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:42:04,683 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 16:42:04,684 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:42:04,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-24 16:42:04,684 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:42:04,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 16:42:04,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 16:42:04,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-24 16:42:04,684 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 11 states. [2018-01-24 16:42:04,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:42:04,805 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2018-01-24 16:42:04,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 16:42:04,805 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-01-24 16:42:04,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:42:04,806 INFO L225 Difference]: With dead ends: 107 [2018-01-24 16:42:04,806 INFO L226 Difference]: Without dead ends: 77 [2018-01-24 16:42:04,806 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-01-24 16:42:04,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-24 16:42:04,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-01-24 16:42:04,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-24 16:42:04,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-01-24 16:42:04,814 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 30 [2018-01-24 16:42:04,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:42:04,815 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-01-24 16:42:04,815 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 16:42:04,815 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-01-24 16:42:04,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 16:42:04,816 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:42:04,816 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 16:42:04,816 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:42:04,816 INFO L82 PathProgramCache]: Analyzing trace with hash -193709055, now seen corresponding path program 1 times [2018-01-24 16:42:04,817 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:42:04,817 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:04,818 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:42:04,818 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:04,818 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:42:04,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:42:04,834 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:42:05,117 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 16:42:05,118 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:42:05,118 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:42:05,119 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-01-24 16:42:05,121 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [7], [14], [15], [18], [22], [24], [26], [27], [30], [31], [34], [42], [63], [68], [74], [76], [77], [78], [79], [80], [83], [94], [95], [96], [98] [2018-01-24 16:42:05,175 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:42:05,175 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:42:05,475 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:42:05,477 INFO L268 AbstractInterpreter]: Visited 29 different actions 45 times. Merged at 8 different actions 16 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-01-24 16:42:05,493 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:42:05,493 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:42:05,493 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 16:42:05,502 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:42:05,502 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:42:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:42:05,545 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:42:05,584 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 16:42:05,587 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 16:42:05,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:05,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:05,617 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 16:42:05,617 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 16:42:05,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 18 treesize of output 14 [2018-01-24 16:42:05,791 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 16:42:05,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:42:05,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:42:05,844 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 16:42:05,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-24 16:42:05,990 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 16:42:05,990 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:42:06,335 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 16:42:06,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:06,343 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 16:42:06,352 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 16:42:06,352 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:06,354 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:06,359 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 16:42:06,359 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-24 16:42:06,375 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 16:42:06,408 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:42:06,408 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 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 16:42:06,412 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:42:06,412 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:42:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:42:06,472 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:42:06,476 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 16:42:06,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:06,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:06,480 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 16:42:06,532 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 16:42:06,534 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 16:42:06,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:06,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:06,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:06,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 16:42:06,657 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 16:42:06,662 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 16:42:06,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:42:06,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:42:06,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:42:06,681 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:30 [2018-01-24 16:42:06,834 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 16:42:06,834 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:42:06,923 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 16:42:06,931 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 16:42:06,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:06,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:06,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:06,984 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-24 16:42:07,056 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 16:42:07,057 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:42:07,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10, 12, 12] total 41 [2018-01-24 16:42:07,057 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:42:07,058 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 16:42:07,058 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 16:42:07,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1559, Unknown=0, NotChecked=0, Total=1722 [2018-01-24 16:42:07,059 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 20 states. [2018-01-24 16:42:07,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:42:07,831 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2018-01-24 16:42:07,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 16:42:07,831 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2018-01-24 16:42:07,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:42:07,833 INFO L225 Difference]: With dead ends: 106 [2018-01-24 16:42:07,833 INFO L226 Difference]: Without dead ends: 103 [2018-01-24 16:42:07,834 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 16:42:07,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-24 16:42:07,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2018-01-24 16:42:07,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-24 16:42:07,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2018-01-24 16:42:07,857 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 30 [2018-01-24 16:42:07,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:42:07,858 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2018-01-24 16:42:07,858 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-24 16:42:07,858 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2018-01-24 16:42:07,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 16:42:07,859 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:42:07,859 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 16:42:07,859 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:42:07,859 INFO L82 PathProgramCache]: Analyzing trace with hash -276872451, now seen corresponding path program 1 times [2018-01-24 16:42:07,859 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:42:07,860 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:07,860 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:42:07,860 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:07,860 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:42:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:42:07,875 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:42:08,149 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 16:42:08,149 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:42:08,149 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:42:08,149 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-01-24 16:42:08,150 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [7], [9], [14], [15], [18], [22], [24], [27], [36], [40], [46], [52], [54], [63], [68], [72], [76], [77], [78], [79], [80], [83], [94], [95], [96], [98] [2018-01-24 16:42:08,151 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:42:08,151 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:42:08,337 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:42:08,337 INFO L268 AbstractInterpreter]: Visited 30 different actions 50 times. Merged at 14 different actions 20 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 31 variables. [2018-01-24 16:42:08,351 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:42:08,351 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:42:08,351 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 16:42:08,361 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:42:08,362 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:42:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:42:08,387 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:42:08,392 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 16:42:08,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:08,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:08,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 16:42:08,433 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:42:08,434 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:42:08,434 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 16:42:08,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:08,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:08,438 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-24 16:42:08,478 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 16:42:08,480 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 16:42:08,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:08,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:08,490 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 16:42:08,491 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-24 16:42:08,520 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 16:42:08,523 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 16:42:08,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:08,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:08,538 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 16:42:08,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-24 16:42:08,635 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 16:42:08,647 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 16:42:08,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:42:08,657 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 16:42:08,658 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:08,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:42:08,673 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 16:42:08,673 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-01-24 16:42:08,723 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 16:42:08,723 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:42:08,898 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 16:42:08,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:08,904 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 16:42:08,911 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 16:42:08,912 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:08,913 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:08,918 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 16:42:08,918 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-01-24 16:42:08,970 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 16:42:08,990 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:42:08,991 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 16:42:08,999 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:42:08,999 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:42:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:42:09,065 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:42:09,075 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 16:42:09,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:09,089 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 16:42:09,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:09,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:09,096 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 16:42:09,151 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:42:09,152 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 16:42:09,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:09,160 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:42:09,161 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:42:09,161 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 16:42:09,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:09,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:09,166 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-24 16:42:09,215 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 16:42:09,217 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 16:42:09,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:09,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:09,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:09,224 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-24 16:42:09,259 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 16:42:09,261 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 16:42:09,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:09,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:09,272 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 16:42:09,272 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-01-24 16:42:09,425 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 16:42:09,431 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 16:42:09,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:42:09,439 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 16:42:09,439 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:09,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:42:09,448 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 16:42:09,448 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:48, output treesize:34 [2018-01-24 16:42:09,522 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 16:42:09,522 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:42:09,699 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 16:42:09,705 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 16:42:09,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:09,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:09,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:09,711 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:21 [2018-01-24 16:42:09,832 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 16:42:09,834 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:42:09,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 9, 12, 11] total 46 [2018-01-24 16:42:09,834 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:42:09,835 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-24 16:42:09,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-24 16:42:09,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1990, Unknown=0, NotChecked=0, Total=2162 [2018-01-24 16:42:09,835 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 23 states. [2018-01-24 16:42:10,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:42:10,682 INFO L93 Difference]: Finished difference Result 172 states and 195 transitions. [2018-01-24 16:42:10,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 16:42:10,682 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 31 [2018-01-24 16:42:10,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:42:10,683 INFO L225 Difference]: With dead ends: 172 [2018-01-24 16:42:10,683 INFO L226 Difference]: Without dead ends: 170 [2018-01-24 16:42:10,684 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 86 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=311, Invalid=2881, Unknown=0, NotChecked=0, Total=3192 [2018-01-24 16:42:10,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-01-24 16:42:10,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 127. [2018-01-24 16:42:10,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-01-24 16:42:10,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2018-01-24 16:42:10,701 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 31 [2018-01-24 16:42:10,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:42:10,701 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2018-01-24 16:42:10,701 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-24 16:42:10,701 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2018-01-24 16:42:10,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 16:42:10,702 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:42:10,702 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 16:42:10,702 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:42:10,703 INFO L82 PathProgramCache]: Analyzing trace with hash 149792585, now seen corresponding path program 2 times [2018-01-24 16:42:10,703 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:42:10,704 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:10,704 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:42:10,704 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:10,704 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:42:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:42:10,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:42:11,047 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 16:42:11,048 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:42:11,048 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:42:11,048 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 16:42:11,048 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 16:42:11,048 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:42:11,048 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 16:42:11,053 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:42:11,053 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:42:11,064 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:42:11,069 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:42:11,071 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:42:11,073 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:42:11,076 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 16:42:11,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:11,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:11,079 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 16:42:11,103 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 16:42:11,105 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 16:42:11,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:11,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:11,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:11,116 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-24 16:42:11,232 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 16:42:11,238 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 16:42:11,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:42:11,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:42:11,249 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 16:42:11,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:33 [2018-01-24 16:42:11,365 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 16:42:11,365 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:42:11,736 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 16:42:11,753 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 16:42:11,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:11,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:11,772 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 16:42:11,789 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 16:42:11,789 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:11,795 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:11,809 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 16:42:11,809 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:81, output treesize:98 [2018-01-24 16:42:11,902 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 16:42:11,921 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:42:11,922 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 16:42:11,924 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:42:11,925 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:42:11,939 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:42:11,973 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:42:12,007 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:42:12,012 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:42:12,016 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 16:42:12,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:12,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:12,019 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 16:42:12,025 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 16:42:12,027 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 16:42:12,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:12,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:12,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:12,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-24 16:42:12,274 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 16:42:12,276 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 16:42:12,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:12,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:12,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:12,281 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 [2018-01-24 16:42:12,300 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 16:42:12,300 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:42:12,585 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 16:42:12,593 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 16:42:12,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:12,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:12,599 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 16:42:12,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-01-24 16:42:12,708 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 16:42:12,710 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:42:12,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13, 14, 14] total 50 [2018-01-24 16:42:12,710 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:42:12,711 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-24 16:42:12,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-24 16:42:12,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=2326, Unknown=0, NotChecked=0, Total=2550 [2018-01-24 16:42:12,712 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand 24 states. [2018-01-24 16:42:13,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:42:13,791 INFO L93 Difference]: Finished difference Result 179 states and 199 transitions. [2018-01-24 16:42:13,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 16:42:13,791 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 37 [2018-01-24 16:42:13,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:42:13,792 INFO L225 Difference]: With dead ends: 179 [2018-01-24 16:42:13,792 INFO L226 Difference]: Without dead ends: 176 [2018-01-24 16:42:13,793 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 105 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 963 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=526, Invalid=3506, Unknown=0, NotChecked=0, Total=4032 [2018-01-24 16:42:13,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-01-24 16:42:13,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 92. [2018-01-24 16:42:13,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-01-24 16:42:13,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2018-01-24 16:42:13,806 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 37 [2018-01-24 16:42:13,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:42:13,807 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2018-01-24 16:42:13,807 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-24 16:42:13,807 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2018-01-24 16:42:13,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-24 16:42:13,807 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:42:13,807 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 16:42:13,807 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:42:13,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1598751668, now seen corresponding path program 2 times [2018-01-24 16:42:13,808 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:42:13,808 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:13,808 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 16:42:13,808 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:42:13,808 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:42:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:42:13,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:42:14,202 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 16:42:14,202 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:42:14,202 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:42:14,202 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 16:42:14,203 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 16:42:14,203 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:42:14,203 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 16:42:14,208 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:42:14,208 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:42:14,220 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:42:14,229 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:42:14,231 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:42:14,234 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:42:14,238 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 16:42:14,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:14,245 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 16:42:14,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:14,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:14,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 16:42:14,297 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:42:14,297 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:42:14,298 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 16:42:14,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:14,305 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 16:42:14,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:14,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:14,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-24 16:42:14,352 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 16:42:14,353 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 16:42:14,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:14,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:14,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:14,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-01-24 16:42:14,390 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 16:42:14,392 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 16:42:14,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:14,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:14,403 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 16:42:14,404 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2018-01-24 16:42:14,697 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 16:42:14,699 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 16:42:14,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:14,709 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 16:42:14,709 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 16:42:14,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:42:14,722 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 16:42:14,723 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:49 [2018-01-24 16:42:14,777 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 16:42:14,778 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:42:15,205 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 16:42:15,235 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 16:42:15,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:15,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:15,266 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 16:42:15,294 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 16:42:15,294 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:15,303 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:15,326 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 16:42:15,326 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:81, output treesize:98 [2018-01-24 16:42:17,112 WARN L143 SmtUtils]: Spent 1625ms on a formula simplification that was a NOOP. DAG size: 38 [2018-01-24 16:42:19,136 WARN L143 SmtUtils]: Spent 1979ms on a formula simplification that was a NOOP. DAG size: 38 [2018-01-24 16:42:19,155 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 16:42:19,179 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:42:19,179 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 16:42:19,182 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:42:19,182 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:42:19,197 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:42:19,220 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:42:19,255 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:42:19,260 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:42:19,263 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 16:42:19,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:19,267 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 16:42:19,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:19,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:19,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 16:42:19,300 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:42:19,301 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:42:19,301 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 16:42:19,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:19,309 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 16:42:19,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:19,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:19,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-24 16:42:19,394 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 16:42:19,396 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 16:42:19,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:19,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:19,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:19,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-24 16:42:19,426 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 16:42:19,428 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 16:42:19,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:19,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:19,440 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 16:42:19,440 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2018-01-24 16:42:19,590 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 16:42:19,598 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 16:42:19,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:42:19,607 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 16:42:19,607 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:19,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:42:19,623 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 16:42:19,623 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:57, output treesize:49 [2018-01-24 16:42:19,630 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 16:42:19,630 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:42:19,913 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 16:42:19,920 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 16:42:19,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:42:19,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:42:19,929 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 16:42:19,930 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:52 [2018-01-24 16:42:20,352 WARN L143 SmtUtils]: Spent 303ms on a formula simplification that was a NOOP. DAG size: 37 [2018-01-24 16:42:20,756 WARN L143 SmtUtils]: Spent 325ms on a formula simplification that was a NOOP. DAG size: 37 [2018-01-24 16:42:20,769 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 16:42:20,770 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:42:20,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 11, 13, 12] total 45 [2018-01-24 16:42:20,771 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:42:20,771 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-24 16:42:20,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-24 16:42:20,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1904, Unknown=0, NotChecked=0, Total=2070 [2018-01-24 16:42:20,772 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand 23 states. [2018-01-24 16:42:21,354 WARN L146 SmtUtils]: Spent 201ms on a formula simplification. DAG size of input: 57 DAG size of output 41 [2018-01-24 16:42:22,855 WARN L146 SmtUtils]: Spent 272ms on a formula simplification. DAG size of input: 64 DAG size of output 49 [2018-01-24 16:42:24,746 WARN L146 SmtUtils]: Spent 1705ms on a formula simplification. DAG size of input: 56 DAG size of output 45 [2018-01-24 16:42:27,070 WARN L146 SmtUtils]: Spent 2031ms on a formula simplification. DAG size of input: 59 DAG size of output 46 [2018-01-24 16:42:27,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:42:27,115 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2018-01-24 16:42:27,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 16:42:27,116 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-01-24 16:42:27,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:42:27,116 INFO L225 Difference]: With dead ends: 113 [2018-01-24 16:42:27,116 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 16:42:27,118 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 138 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=406, Invalid=2900, Unknown=0, NotChecked=0, Total=3306 [2018-01-24 16:42:27,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 16:42:27,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 16:42:27,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 16:42:27,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 16:42:27,119 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2018-01-24 16:42:27,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:42:27,119 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 16:42:27,119 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-24 16:42:27,119 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 16:42:27,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 16:42:27,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 16:42:27,198 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 16:42:27,215 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 16:42:27,237 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 16:42:27,245 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 16:42:27,250 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 16:42:27,329 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 16:42:27,331 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 16:42:27,334 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 16:42:27,359 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 16:42:27,394 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 16:42:32,952 WARN L146 SmtUtils]: Spent 5553ms on a formula simplification. DAG size of input: 124 DAG size of output 1 [2018-01-24 16:42:33,219 WARN L146 SmtUtils]: Spent 266ms on a formula simplification. DAG size of input: 100 DAG size of output 72 Received shutdown request... [2018-01-24 16:43:08,715 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 16:43:08,716 INFO L168 Benchmark]: Toolchain (without parser) took 67588.90 ms. Allocated memory was 305.1 MB in the beginning and 627.0 MB in the end (delta: 321.9 MB). Free memory was 265.2 MB in the beginning and 414.0 MB in the end (delta: -148.8 MB). Peak memory consumption was 275.2 MB. Max. memory is 5.3 GB. [2018-01-24 16:43:08,716 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 305.1 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:43:08,717 INFO L168 Benchmark]: CACSL2BoogieTranslator took 188.28 ms. Allocated memory is still 305.1 MB. Free memory was 264.2 MB in the beginning and 254.0 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-24 16:43:08,717 INFO L168 Benchmark]: Boogie Preprocessor took 33.32 ms. Allocated memory is still 305.1 MB. Free memory was 254.0 MB in the beginning and 252.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:43:08,717 INFO L168 Benchmark]: RCFGBuilder took 274.91 ms. Allocated memory is still 305.1 MB. Free memory was 252.0 MB in the beginning and 232.3 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 5.3 GB. [2018-01-24 16:43:08,717 INFO L168 Benchmark]: TraceAbstraction took 67086.85 ms. Allocated memory was 305.1 MB in the beginning and 627.0 MB in the end (delta: 321.9 MB). Free memory was 232.3 MB in the beginning and 414.0 MB in the end (delta: -181.7 MB). Peak memory consumption was 242.3 MB. Max. memory is 5.3 GB. [2018-01-24 16:43:08,719 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 305.1 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 188.28 ms. Allocated memory is still 305.1 MB. Free memory was 264.2 MB in the beginning and 254.0 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.32 ms. Allocated memory is still 305.1 MB. Free memory was 254.0 MB in the beginning and 252.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 274.91 ms. Allocated memory is still 305.1 MB. Free memory was 252.0 MB in the beginning and 232.3 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 67086.85 ms. Allocated memory was 305.1 MB in the beginning and 627.0 MB in the end (delta: 321.9 MB). Free memory was 232.3 MB in the beginning and 414.0 MB in the end (delta: -181.7 MB). Peak memory consumption was 242.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 28 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 344 LocStat_NO_SUPPORTING_DISEQUALITIES : 70 LocStat_NO_DISJUNCTIONS : -56 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 35 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 68 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 38 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.506585 RENAME_VARIABLES(MILLISECONDS) : 0.273577 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.474922 PROJECTAWAY(MILLISECONDS) : 0.518737 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001593 DISJOIN(MILLISECONDS) : 0.487010 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.306625 ADD_EQUALITY(MILLISECONDS) : 0.082717 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.019070 #CONJOIN_DISJUNCTIVE : 81 #RENAME_VARIABLES : 135 #UNFREEZE : 0 #CONJOIN : 140 #PROJECTAWAY : 109 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 15 #RENAME_VARIABLES_DISJUNCTIVE : 123 #ADD_EQUALITY : 70 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 29 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 384 LocStat_NO_SUPPORTING_DISEQUALITIES : 87 LocStat_NO_DISJUNCTIONS : -58 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 36 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 65 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 38 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.751912 RENAME_VARIABLES(MILLISECONDS) : 0.367804 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.705371 PROJECTAWAY(MILLISECONDS) : 0.295475 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000984 DISJOIN(MILLISECONDS) : 0.625537 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.404429 ADD_EQUALITY(MILLISECONDS) : 0.022906 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.015527 #CONJOIN_DISJUNCTIVE : 90 #RENAME_VARIABLES : 151 #UNFREEZE : 0 #CONJOIN : 144 #PROJECTAWAY : 114 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 14 #RENAME_VARIABLES_DISJUNCTIVE : 143 #ADD_EQUALITY : 67 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 * 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 224. 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_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_16-43-08-727.csv 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_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-43-08-727.csv 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_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-43-08-727.csv 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_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_16-43-08-727.csv 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_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_16-43-08-727.csv Completed graceful shutdown