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_mostprecise.epf -i ../../../trunk/examples/svcomp/array-memsafety/add_last-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 19:43:11,135 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 19:43:11,137 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 19:43:11,153 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 19:43:11,153 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 19:43:11,154 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 19:43:11,155 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 19:43:11,157 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 19:43:11,159 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 19:43:11,159 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 19:43:11,160 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 19:43:11,160 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 19:43:11,161 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 19:43:11,162 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 19:43:11,162 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 19:43:11,165 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 19:43:11,167 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 19:43:11,169 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 19:43:11,171 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 19:43:11,172 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 19:43:11,175 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 19:43:11,175 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 19:43:11,175 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 19:43:11,176 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 19:43:11,177 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 19:43:11,179 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 19:43:11,179 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 19:43:11,180 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 19:43:11,180 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 19:43:11,180 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 19:43:11,181 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 19:43:11,181 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_mostprecise.epf [2018-01-24 19:43:11,191 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 19:43:11,191 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 19:43:11,192 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 19:43:11,192 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 19:43:11,192 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 19:43:11,192 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 19:43:11,193 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 19:43:11,193 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-24 19:43:11,193 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 19:43:11,194 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 19:43:11,194 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 19:43:11,194 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 19:43:11,194 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 19:43:11,194 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 19:43:11,195 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 19:43:11,195 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 19:43:11,195 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 19:43:11,195 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 19:43:11,195 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 19:43:11,195 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 19:43:11,196 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 19:43:11,196 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 19:43:11,196 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 19:43:11,196 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 19:43:11,196 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 19:43:11,197 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 19:43:11,197 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 19:43:11,197 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 19:43:11,197 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 19:43:11,197 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 19:43:11,198 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 19:43:11,198 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 19:43:11,198 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 19:43:11,198 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 19:43:11,198 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 19:43:11,199 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 19:43:11,199 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 19:43:11,234 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 19:43:11,247 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 19:43:11,252 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 19:43:11,253 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 19:43:11,254 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 19:43:11,255 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/add_last-alloca_true-valid-memsafety_true-termination.i [2018-01-24 19:43:11,429 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 19:43:11,434 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 19:43:11,435 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 19:43:11,435 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 19:43:11,440 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 19:43:11,441 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 07:43:11" (1/1) ... [2018-01-24 19:43:11,444 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21503e3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:43:11, skipping insertion in model container [2018-01-24 19:43:11,444 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 07:43:11" (1/1) ... [2018-01-24 19:43:11,457 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 19:43:11,491 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 19:43:11,605 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 19:43:11,622 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 19:43:11,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:43:11 WrapperNode [2018-01-24 19:43:11,629 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 19:43:11,630 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 19:43:11,630 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 19:43:11,631 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 19:43:11,647 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:43:11" (1/1) ... [2018-01-24 19:43:11,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:43:11" (1/1) ... [2018-01-24 19:43:11,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:43:11" (1/1) ... [2018-01-24 19:43:11,656 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:43:11" (1/1) ... [2018-01-24 19:43:11,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:43:11" (1/1) ... [2018-01-24 19:43:11,663 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:43:11" (1/1) ... [2018-01-24 19:43:11,664 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:43:11" (1/1) ... [2018-01-24 19:43:11,665 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 19:43:11,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 19:43:11,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 19:43:11,666 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 19:43:11,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:43:11" (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 19:43:11,710 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 19:43:11,710 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 19:43:11,710 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 19:43:11,710 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 19:43:11,710 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 19:43:11,710 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 19:43:11,710 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 19:43:11,711 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 19:43:11,711 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 19:43:11,711 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 19:43:11,711 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 19:43:11,711 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 19:43:11,892 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 19:43:11,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 07:43:11 BoogieIcfgContainer [2018-01-24 19:43:11,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 19:43:11,894 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 19:43:11,894 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 19:43:11,897 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 19:43:11,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 07:43:11" (1/3) ... [2018-01-24 19:43:11,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a0f9ae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 07:43:11, skipping insertion in model container [2018-01-24 19:43:11,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:43:11" (2/3) ... [2018-01-24 19:43:11,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a0f9ae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 07:43:11, skipping insertion in model container [2018-01-24 19:43:11,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 07:43:11" (3/3) ... [2018-01-24 19:43:11,901 INFO L105 eAbstractionObserver]: Analyzing ICFG add_last-alloca_true-valid-memsafety_true-termination.i [2018-01-24 19:43:11,911 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 19:43:11,919 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-01-24 19:43:11,968 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 19:43:11,969 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 19:43:11,969 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 19:43:11,969 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 19:43:11,969 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 19:43:11,969 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 19:43:11,969 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 19:43:11,970 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 19:43:11,970 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 19:43:11,990 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-01-24 19:43:11,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 19:43:11,996 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:43:11,997 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:43:11,997 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-24 19:43:12,001 INFO L82 PathProgramCache]: Analyzing trace with hash 756039163, now seen corresponding path program 1 times [2018-01-24 19:43:12,004 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:43:12,045 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:43:12,046 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:43:12,046 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:43:12,046 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:43:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:43:12,102 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:43:12,192 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 19:43:12,194 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:43:12,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 19:43:12,195 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:43:12,198 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 19:43:12,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 19:43:12,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 19:43:12,213 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 5 states. [2018-01-24 19:43:12,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:43:12,348 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-01-24 19:43:12,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 19:43:12,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-01-24 19:43:12,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:43:12,426 INFO L225 Difference]: With dead ends: 46 [2018-01-24 19:43:12,426 INFO L226 Difference]: Without dead ends: 30 [2018-01-24 19:43:12,429 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 19:43:12,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-01-24 19:43:12,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-01-24 19:43:12,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-01-24 19:43:12,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-01-24 19:43:12,458 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 12 [2018-01-24 19:43:12,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:43:12,459 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-01-24 19:43:12,459 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 19:43:12,459 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-01-24 19:43:12,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 19:43:12,459 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:43:12,459 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:43:12,459 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-24 19:43:12,460 INFO L82 PathProgramCache]: Analyzing trace with hash 756039164, now seen corresponding path program 1 times [2018-01-24 19:43:12,460 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:43:12,461 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:43:12,461 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:43:12,461 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:43:12,461 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:43:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:43:12,478 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:43:12,595 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 19:43:12,596 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:43:12,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 19:43:12,596 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:43:12,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 19:43:12,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 19:43:12,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 19:43:12,599 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 6 states. [2018-01-24 19:43:12,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:43:12,792 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-01-24 19:43:12,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 19:43:12,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-01-24 19:43:12,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:43:12,795 INFO L225 Difference]: With dead ends: 48 [2018-01-24 19:43:12,795 INFO L226 Difference]: Without dead ends: 45 [2018-01-24 19:43:12,796 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-01-24 19:43:12,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-24 19:43:12,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2018-01-24 19:43:12,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 19:43:12,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-01-24 19:43:12,805 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 12 [2018-01-24 19:43:12,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:43:12,805 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-01-24 19:43:12,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 19:43:12,806 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-01-24 19:43:12,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 19:43:12,806 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:43:12,806 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:43:12,807 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-24 19:43:12,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1962282239, now seen corresponding path program 1 times [2018-01-24 19:43:12,807 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:43:12,808 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:43:12,808 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:43:12,808 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:43:12,809 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:43:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:43:12,819 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:43:12,847 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 19:43:12,847 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:43:12,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 19:43:12,847 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:43:12,848 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 19:43:12,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 19:43:12,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 19:43:12,848 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 4 states. [2018-01-24 19:43:12,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:43:12,874 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-01-24 19:43:12,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 19:43:12,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 19:43:12,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:43:12,875 INFO L225 Difference]: With dead ends: 39 [2018-01-24 19:43:12,875 INFO L226 Difference]: Without dead ends: 35 [2018-01-24 19:43:12,876 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 19:43:12,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-24 19:43:12,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-01-24 19:43:12,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-24 19:43:12,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-01-24 19:43:12,883 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 13 [2018-01-24 19:43:12,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:43:12,883 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-01-24 19:43:12,883 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 19:43:12,883 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-01-24 19:43:12,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 19:43:12,884 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:43:12,884 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:43:12,884 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-24 19:43:12,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1962377572, now seen corresponding path program 1 times [2018-01-24 19:43:12,885 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:43:12,886 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:43:12,886 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:43:12,886 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:43:12,886 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:43:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:43:12,900 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:43:13,003 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 19:43:13,003 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:43:13,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 19:43:13,003 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:43:13,004 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 19:43:13,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 19:43:13,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 19:43:13,005 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 5 states. [2018-01-24 19:43:13,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:43:13,054 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-01-24 19:43:13,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 19:43:13,055 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-01-24 19:43:13,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:43:13,055 INFO L225 Difference]: With dead ends: 35 [2018-01-24 19:43:13,056 INFO L226 Difference]: Without dead ends: 33 [2018-01-24 19:43:13,056 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 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 19:43:13,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-01-24 19:43:13,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-01-24 19:43:13,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-01-24 19:43:13,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-01-24 19:43:13,061 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 13 [2018-01-24 19:43:13,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:43:13,061 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-01-24 19:43:13,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 19:43:13,061 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-01-24 19:43:13,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 19:43:13,062 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:43:13,062 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 19:43:13,063 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-24 19:43:13,063 INFO L82 PathProgramCache]: Analyzing trace with hash -676062270, now seen corresponding path program 1 times [2018-01-24 19:43:13,063 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:43:13,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:43:13,064 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:43:13,065 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:43:13,065 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:43:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:43:13,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:43:13,139 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 19:43:13,139 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:43:13,139 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 19:43:13,140 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:43:13,140 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 19:43:13,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 19:43:13,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 19:43:13,141 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 4 states. [2018-01-24 19:43:13,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:43:13,187 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-01-24 19:43:13,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 19:43:13,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-01-24 19:43:13,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:43:13,191 INFO L225 Difference]: With dead ends: 33 [2018-01-24 19:43:13,192 INFO L226 Difference]: Without dead ends: 28 [2018-01-24 19:43:13,192 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 19:43:13,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-01-24 19:43:13,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-01-24 19:43:13,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-01-24 19:43:13,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-01-24 19:43:13,197 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 18 [2018-01-24 19:43:13,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:43:13,197 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-01-24 19:43:13,197 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 19:43:13,198 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-01-24 19:43:13,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 19:43:13,198 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:43:13,198 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:43:13,198 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-24 19:43:13,199 INFO L82 PathProgramCache]: Analyzing trace with hash 236614827, now seen corresponding path program 1 times [2018-01-24 19:43:13,199 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:43:13,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:43:13,200 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:43:13,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:43:13,200 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:43:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:43:13,216 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:43:13,457 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 19:43:13,457 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:43:13,458 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 19:43:13,458 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:43:13,458 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 19:43:13,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 19:43:13,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 19:43:13,459 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 8 states. [2018-01-24 19:43:13,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:43:13,651 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-01-24 19:43:13,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 19:43:13,651 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-01-24 19:43:13,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:43:13,652 INFO L225 Difference]: With dead ends: 49 [2018-01-24 19:43:13,652 INFO L226 Difference]: Without dead ends: 28 [2018-01-24 19:43:13,652 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-01-24 19:43:13,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-01-24 19:43:13,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-01-24 19:43:13,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-01-24 19:43:13,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-01-24 19:43:13,656 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 20 [2018-01-24 19:43:13,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:43:13,656 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-01-24 19:43:13,656 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 19:43:13,656 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-01-24 19:43:13,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 19:43:13,657 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:43:13,657 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:43:13,657 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-24 19:43:13,657 INFO L82 PathProgramCache]: Analyzing trace with hash -774502423, now seen corresponding path program 1 times [2018-01-24 19:43:13,657 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:43:13,658 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:43:13,658 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:43:13,658 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:43:13,658 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:43:13,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:43:13,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:43:13,971 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 19:43:13,972 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:43:13,972 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 19:43:13,973 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-01-24 19:43:13,975 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [10], [12], [13], [19], [23], [25], [27], [28], [35], [36], [39], [42], [45], [54], [55], [56] [2018-01-24 19:43:14,019 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 19:43:14,020 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 19:43:50,016 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 19:43:50,018 INFO L268 AbstractInterpreter]: Visited 19 different actions 41 times. Merged at 9 different actions 22 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-01-24 19:43:50,032 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 19:43:50,032 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:43:50,033 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 19:43:50,045 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:43:50,045 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 19:43:50,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:43:50,071 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:43:50,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 19:43:50,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:50,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:50,119 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-24 19:43:50,230 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 19:43:50,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 19:43:50,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 19:43:50,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:43:50,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 19:43:50,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:40 [2018-01-24 19:43:50,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:43:50,350 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:43:50,435 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 19:43:50,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:50,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2018-01-24 19:43:50,447 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 27 treesize of output 20 [2018-01-24 19:43:50,448 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:50,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-01-24 19:43:50,480 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:50,492 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:43:50,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:43:50,503 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:55, output treesize:36 [2018-01-24 19:43:50,632 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 19:43:50,663 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:43:50,663 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 19:43:50,668 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:43:50,668 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 19:43:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:43:50,704 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:43:50,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 19:43:50,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:50,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:50,713 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-24 19:43:50,718 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 19:43:50,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 19:43:50,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 19:43:50,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:43:50,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 19:43:50,788 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:40 [2018-01-24 19:43:50,819 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 19:43:50,819 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:43:50,826 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 19:43:50,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:50,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2018-01-24 19:43:50,838 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 27 treesize of output 25 [2018-01-24 19:43:50,839 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:50,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-01-24 19:43:50,876 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:50,887 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:43:50,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:43:50,899 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:55, output treesize:36 [2018-01-24 19:43:50,912 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 19:43:50,914 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 19:43:50,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9] total 24 [2018-01-24 19:43:50,914 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 19:43:50,915 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 19:43:50,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 19:43:50,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2018-01-24 19:43:50,916 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 18 states. [2018-01-24 19:43:51,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:43:51,229 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-01-24 19:43:51,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 19:43:51,230 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 20 [2018-01-24 19:43:51,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:43:51,231 INFO L225 Difference]: With dead ends: 40 [2018-01-24 19:43:51,231 INFO L226 Difference]: Without dead ends: 37 [2018-01-24 19:43:51,231 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=213, Invalid=717, Unknown=0, NotChecked=0, Total=930 [2018-01-24 19:43:51,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-01-24 19:43:51,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-01-24 19:43:51,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 19:43:51,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-01-24 19:43:51,237 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 20 [2018-01-24 19:43:51,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:43:51,237 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-01-24 19:43:51,237 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 19:43:51,237 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-01-24 19:43:51,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 19:43:51,238 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:43:51,238 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:43:51,238 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-24 19:43:51,238 INFO L82 PathProgramCache]: Analyzing trace with hash 476184984, now seen corresponding path program 2 times [2018-01-24 19:43:51,238 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:43:51,239 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:43:51,239 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:43:51,239 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:43:51,239 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:43:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:43:51,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:43:51,874 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:43:51,874 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:43:51,874 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 19:43:51,874 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 19:43:51,874 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 19:43:51,874 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:43:51,875 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 19:43:51,891 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 19:43:51,891 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 19:43:51,903 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 19:43:51,913 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 19:43:51,915 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 19:43:51,918 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:43:51,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 19:43:51,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:51,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:51,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-24 19:43:51,947 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 13 treesize of output 10 [2018-01-24 19:43:51,949 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 10 treesize of output 9 [2018-01-24 19:43:51,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:51,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:51,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:51,958 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-01-24 19:43:51,992 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 19:43:51,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 19:43:52,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 19:43:52,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:43:52,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 19:43:52,010 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-01-24 19:43:52,094 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:43:52,094 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:43:52,230 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 41 treesize of output 37 [2018-01-24 19:43:52,238 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 14 treesize of output 7 [2018-01-24 19:43:52,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:52,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:52,248 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 45 treesize of output 43 [2018-01-24 19:43:52,257 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 9 treesize of output 5 [2018-01-24 19:43:52,257 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:52,262 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:52,265 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 39 treesize of output 35 [2018-01-24 19:43:52,272 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 14 treesize of output 7 [2018-01-24 19:43:52,272 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:52,279 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:52,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 54 [2018-01-24 19:43:52,304 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 39 treesize of output 31 [2018-01-24 19:43:52,304 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:52,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2018-01-24 19:43:52,331 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:52,343 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:43:52,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 49 [2018-01-24 19:43:52,370 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 39 treesize of output 32 [2018-01-24 19:43:52,371 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:52,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-01-24 19:43:52,387 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:52,418 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:43:52,419 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 43 treesize of output 41 [2018-01-24 19:43:52,428 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 9 treesize of output 5 [2018-01-24 19:43:52,428 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:52,433 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:52,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 51 [2018-01-24 19:43:52,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2018-01-24 19:43:52,460 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:52,476 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 41 treesize of output 34 [2018-01-24 19:43:52,476 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:52,507 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:43:52,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 56 [2018-01-24 19:43:52,530 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 41 treesize of output 34 [2018-01-24 19:43:52,530 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:52,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-01-24 19:43:52,545 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:52,558 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 27 treesize of output 23 [2018-01-24 19:43:52,558 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:52,567 INFO L267 ElimStorePlain]: Start of recursive call 19: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:43:52,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-01-24 19:43:52,600 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 3 variables, input treesize:95, output treesize:131 [2018-01-24 19:43:52,730 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:43:52,751 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:43:52,751 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 19:43:52,756 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 19:43:52,756 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 19:43:52,772 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 19:43:52,791 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 19:43:52,820 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 19:43:52,826 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:43:52,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 19:43:52,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:52,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:52,835 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-24 19:43:52,910 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 13 treesize of output 10 [2018-01-24 19:43:52,924 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 10 treesize of output 9 [2018-01-24 19:43:52,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:52,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:52,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:52,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-01-24 19:43:52,995 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 19:43:53,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 19:43:53,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 19:43:53,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:43:53,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 19:43:53,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-01-24 19:43:53,060 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:43:53,060 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:43:53,099 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 41 treesize of output 37 [2018-01-24 19:43:53,106 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 14 treesize of output 7 [2018-01-24 19:43:53,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:53,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:53,115 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 45 treesize of output 43 [2018-01-24 19:43:53,123 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 9 treesize of output 5 [2018-01-24 19:43:53,124 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:53,129 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:53,131 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 39 treesize of output 35 [2018-01-24 19:43:53,138 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 14 treesize of output 7 [2018-01-24 19:43:53,138 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:53,145 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:53,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 54 [2018-01-24 19:43:53,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2018-01-24 19:43:53,169 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:53,186 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 39 treesize of output 32 [2018-01-24 19:43:53,187 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:53,200 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 25 treesize of output 21 [2018-01-24 19:43:53,201 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:53,210 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:43:53,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 49 [2018-01-24 19:43:53,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-01-24 19:43:53,235 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:53,251 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 39 treesize of output 32 [2018-01-24 19:43:53,252 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:53,277 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:43:53,278 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 43 treesize of output 41 [2018-01-24 19:43:53,286 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 9 treesize of output 5 [2018-01-24 19:43:53,287 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:53,291 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:53,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 51 [2018-01-24 19:43:53,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2018-01-24 19:43:53,321 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:53,339 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 41 treesize of output 37 [2018-01-24 19:43:53,339 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:53,367 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:43:53,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 56 [2018-01-24 19:43:53,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-01-24 19:43:53,391 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:53,406 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 41 treesize of output 34 [2018-01-24 19:43:53,406 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:53,419 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 27 treesize of output 23 [2018-01-24 19:43:53,420 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:53,429 INFO L267 ElimStorePlain]: Start of recursive call 20: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:43:53,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-01-24 19:43:53,464 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 3 variables, input treesize:95, output treesize:131 [2018-01-24 19:43:53,563 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:43:53,565 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 19:43:53,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10, 9, 11] total 27 [2018-01-24 19:43:53,565 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 19:43:53,566 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 19:43:53,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 19:43:53,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2018-01-24 19:43:53,566 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 16 states. [2018-01-24 19:43:53,976 WARN L143 SmtUtils]: Spent 186ms on a formula simplification that was a NOOP. DAG size: 27 [2018-01-24 19:43:54,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:43:54,030 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-01-24 19:43:54,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 19:43:54,030 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-01-24 19:43:54,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:43:54,031 INFO L225 Difference]: With dead ends: 48 [2018-01-24 19:43:54,031 INFO L226 Difference]: Without dead ends: 45 [2018-01-24 19:43:54,032 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 85 SyntacticMatches, 10 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=254, Invalid=936, Unknown=0, NotChecked=0, Total=1190 [2018-01-24 19:43:54,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-24 19:43:54,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-01-24 19:43:54,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-24 19:43:54,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-01-24 19:43:54,038 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 28 [2018-01-24 19:43:54,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:43:54,038 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-01-24 19:43:54,038 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 19:43:54,038 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-01-24 19:43:54,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 19:43:54,039 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:43:54,040 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:43:54,040 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-24 19:43:54,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1767056313, now seen corresponding path program 3 times [2018-01-24 19:43:54,040 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:43:54,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:43:54,041 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 19:43:54,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:43:54,041 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:43:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:43:54,062 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:43:54,615 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:43:54,615 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:43:54,615 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 19:43:54,616 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 19:43:54,616 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 19:43:54,616 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:43:54,616 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 19:43:54,623 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 19:43:54,623 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-24 19:43:54,633 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 19:43:54,637 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 19:43:54,642 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 19:43:54,648 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 19:43:54,649 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 19:43:54,652 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:43:54,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 19:43:54,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:54,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:54,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-24 19:43:54,727 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 19:43:54,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 19:43:54,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 19:43:54,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:43:54,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 19:43:54,745 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:34 [2018-01-24 19:43:54,874 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:43:54,874 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:43:54,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 21 [2018-01-24 19:43:54,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-01-24 19:43:54,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:54,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 12 [2018-01-24 19:43:54,981 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:54,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:43:54,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:43:54,992 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:34, output treesize:48 [2018-01-24 19:43:55,147 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:43:55,168 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:43:55,168 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 19:43:55,171 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 19:43:55,171 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-24 19:43:55,182 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 19:43:55,192 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 19:43:55,213 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 19:43:55,250 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 19:43:55,291 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 19:43:55,297 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:43:55,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 19:43:55,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:55,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:55,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-24 19:43:55,321 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 13 treesize of output 10 [2018-01-24 19:43:55,323 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 10 treesize of output 9 [2018-01-24 19:43:55,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:55,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:55,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:55,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-01-24 19:43:55,353 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 13 treesize of output 10 [2018-01-24 19:43:55,356 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 10 treesize of output 9 [2018-01-24 19:43:55,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:55,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:55,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:55,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-01-24 19:43:55,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-24 19:43:55,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 19:43:55,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 19:43:55,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:43:55,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 19:43:55,385 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:34 [2018-01-24 19:43:55,409 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:43:55,409 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:43:56,052 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 48 treesize of output 44 [2018-01-24 19:43:56,055 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 30 [2018-01-24 19:43:56,062 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:56,063 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 23 treesize of output 16 [2018-01-24 19:43:56,063 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:56,065 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:56,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:56,074 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 61 treesize of output 57 [2018-01-24 19:43:56,077 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2018-01-24 19:43:56,090 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:56,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 39 [2018-01-24 19:43:56,097 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-24 19:43:56,099 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:56,100 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 28 treesize of output 21 [2018-01-24 19:43:56,101 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:56,103 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:56,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 43 [2018-01-24 19:43:56,109 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-01-24 19:43:56,122 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:43:56,129 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:56,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 87 [2018-01-24 19:43:56,147 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 86 [2018-01-24 19:43:56,197 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:56,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 57 [2018-01-24 19:43:56,204 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-01-24 19:43:56,207 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:56,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 53 [2018-01-24 19:43:56,220 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-01-24 19:43:56,239 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:56,256 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:56,316 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 46 treesize of output 42 [2018-01-24 19:43:56,318 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 26 treesize of output 19 [2018-01-24 19:43:56,319 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:56,327 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:56,329 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 59 treesize of output 55 [2018-01-24 19:43:56,331 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2018-01-24 19:43:56,344 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:56,346 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 28 treesize of output 21 [2018-01-24 19:43:56,346 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:56,348 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:56,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 39 [2018-01-24 19:43:56,355 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-01-24 19:43:56,357 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:56,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 43 [2018-01-24 19:43:56,363 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-01-24 19:43:56,373 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:56,378 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:56,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-24 19:43:56,398 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 10 variables, input treesize:123, output treesize:83 [2018-01-24 19:43:56,596 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:43:56,597 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 19:43:56,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11, 14] total 39 [2018-01-24 19:43:56,598 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 19:43:56,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 19:43:56,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 19:43:56,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1325, Unknown=0, NotChecked=0, Total=1560 [2018-01-24 19:43:56,599 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 19 states. [2018-01-24 19:43:57,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:43:57,055 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-01-24 19:43:57,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 19:43:57,088 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-01-24 19:43:57,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:43:57,089 INFO L225 Difference]: With dead ends: 56 [2018-01-24 19:43:57,089 INFO L226 Difference]: Without dead ends: 53 [2018-01-24 19:43:57,090 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 100 SyntacticMatches, 16 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 881 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=433, Invalid=1919, Unknown=0, NotChecked=0, Total=2352 [2018-01-24 19:43:57,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-24 19:43:57,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-01-24 19:43:57,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 19:43:57,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-01-24 19:43:57,094 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 36 [2018-01-24 19:43:57,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:43:57,094 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-01-24 19:43:57,094 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 19:43:57,094 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-01-24 19:43:57,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-24 19:43:57,095 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:43:57,095 INFO L322 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:43:57,095 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-24 19:43:57,095 INFO L82 PathProgramCache]: Analyzing trace with hash -934963210, now seen corresponding path program 4 times [2018-01-24 19:43:57,095 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:43:57,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:43:57,096 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 19:43:57,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:43:57,096 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:43:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:43:57,119 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:43:57,700 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:43:57,700 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:43:57,700 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 19:43:57,700 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 19:43:57,700 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 19:43:57,700 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:43:57,700 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 19:43:57,705 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-24 19:43:57,706 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-24 19:43:57,725 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 19:43:57,727 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:43:57,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 19:43:57,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:57,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:57,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-24 19:43:57,819 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 19:43:57,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 19:43:57,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 19:43:57,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:43:57,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 19:43:57,836 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-01-24 19:43:57,921 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:43:57,921 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:43:58,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2018-01-24 19:43:58,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-01-24 19:43:58,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:58,016 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 31 treesize of output 29 [2018-01-24 19:43:58,017 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:58,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:43:58,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 34 [2018-01-24 19:43:58,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2018-01-24 19:43:58,046 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:58,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-24 19:43:58,066 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:58,076 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:43:58,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-24 19:43:58,095 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:63, output treesize:83 [2018-01-24 19:43:58,340 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:43:58,361 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:43:58,361 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 19:43:58,366 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-24 19:43:58,366 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-24 19:43:58,417 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 19:43:58,423 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:43:58,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 19:43:58,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:58,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:58,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-24 19:43:58,450 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 13 treesize of output 10 [2018-01-24 19:43:58,453 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 10 treesize of output 9 [2018-01-24 19:43:58,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:58,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:58,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:58,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-01-24 19:43:58,468 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 13 treesize of output 10 [2018-01-24 19:43:58,470 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 10 treesize of output 9 [2018-01-24 19:43:58,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:58,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:58,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:58,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-01-24 19:43:58,486 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 13 treesize of output 10 [2018-01-24 19:43:58,492 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 10 treesize of output 9 [2018-01-24 19:43:58,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:58,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:58,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:58,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-01-24 19:43:58,510 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 19:43:58,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 19:43:58,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 19:43:58,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:43:58,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 19:43:58,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-01-24 19:43:58,562 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:43:58,562 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:43:59,149 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 75 treesize of output 71 [2018-01-24 19:43:59,152 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2018-01-24 19:43:59,154 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,156 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52 [2018-01-24 19:43:59,175 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,175 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,176 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-01-24 19:43:59,180 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:59,182 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,182 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,183 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 72 [2018-01-24 19:43:59,200 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-01-24 19:43:59,207 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,208 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,209 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 68 [2018-01-24 19:43:59,233 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-01-24 19:43:59,253 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:59,254 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:59,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:59,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 108 [2018-01-24 19:43:59,271 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 103 treesize of output 96 [2018-01-24 19:43:59,271 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:59,291 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 68 [2018-01-24 19:43:59,294 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,296 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52 [2018-01-24 19:43:59,312 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,312 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,313 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-01-24 19:43:59,316 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:59,319 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,319 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,320 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 68 [2018-01-24 19:43:59,336 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-01-24 19:43:59,338 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,338 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,339 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 72 [2018-01-24 19:43:59,355 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 4 xjuncts. [2018-01-24 19:43:59,376 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:59,381 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:59,413 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 107 [2018-01-24 19:43:59,416 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,418 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 80 [2018-01-24 19:43:59,442 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,443 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-01-24 19:43:59,446 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:59,453 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:59,472 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 103 [2018-01-24 19:43:59,548 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,549 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,549 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,549 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,550 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 19:43:59,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 66 [2018-01-24 19:43:59,554 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:59,593 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,593 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,594 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 82 [2018-01-24 19:43:59,611 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 4 xjuncts. [2018-01-24 19:43:59,613 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,614 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,614 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 86 [2018-01-24 19:43:59,631 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 4 xjuncts. [2018-01-24 19:43:59,735 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:43:59,744 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:59,753 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:59,756 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 55 treesize of output 51 [2018-01-24 19:43:59,758 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2018-01-24 19:43:59,761 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,762 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 45 [2018-01-24 19:43:59,772 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,772 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,772 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-01-24 19:43:59,776 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:59,777 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:59,779 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:59,801 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:59,943 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 53 treesize of output 49 [2018-01-24 19:43:59,950 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 33 treesize of output 26 [2018-01-24 19:43:59,951 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-01-24 19:43:59,959 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:43:59,961 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 73 treesize of output 69 [2018-01-24 19:43:59,964 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2018-01-24 19:43:59,966 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,968 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52 [2018-01-24 19:43:59,983 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,984 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,984 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:43:59,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 68 [2018-01-24 19:43:59,998 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 4 xjuncts. [2018-01-24 19:44:00,000 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:00,001 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:00,001 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:00,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 72 [2018-01-24 19:44:00,017 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 4 xjuncts. [2018-01-24 19:44:00,020 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:00,020 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:00,020 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:00,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-01-24 19:44:00,024 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-01-24 19:44:00,042 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:44:00,044 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:44:00,049 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:44:00,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-24 19:44:00,068 INFO L202 ElimStorePlain]: Needed 33 recursive calls to eliminate 14 variables, input treesize:151, output treesize:83 [2018-01-24 19:44:00,103 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:44:00,105 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 19:44:00,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12, 11, 15] total 36 [2018-01-24 19:44:00,105 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 19:44:00,105 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 19:44:00,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 19:44:00,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=1064, Unknown=0, NotChecked=0, Total=1332 [2018-01-24 19:44:00,106 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 20 states. [2018-01-24 19:44:00,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:44:00,553 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-01-24 19:44:00,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 19:44:00,553 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2018-01-24 19:44:00,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:44:00,554 INFO L225 Difference]: With dead ends: 64 [2018-01-24 19:44:00,554 INFO L226 Difference]: Without dead ends: 61 [2018-01-24 19:44:00,554 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 136 SyntacticMatches, 16 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 868 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=448, Invalid=1622, Unknown=0, NotChecked=0, Total=2070 [2018-01-24 19:44:00,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-24 19:44:00,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-01-24 19:44:00,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-24 19:44:00,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-01-24 19:44:00,560 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 44 [2018-01-24 19:44:00,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:44:00,561 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-01-24 19:44:00,561 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-24 19:44:00,561 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-01-24 19:44:00,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-24 19:44:00,562 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:44:00,562 INFO L322 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:44:00,563 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr9RequiresViolation, mainErr8RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr10EnsuresViolation]=== [2018-01-24 19:44:00,563 INFO L82 PathProgramCache]: Analyzing trace with hash 968570021, now seen corresponding path program 5 times [2018-01-24 19:44:00,563 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:44:00,563 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:44:00,563 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 19:44:00,564 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:44:00,564 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:44:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:44:00,588 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:44:01,267 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:44:01,267 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:44:01,267 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 19:44:01,267 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 19:44:01,267 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 19:44:01,267 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:44:01,268 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 19:44:01,273 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-24 19:44:01,273 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 19:44:01,283 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 19:44:01,286 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 19:44:01,290 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 19:44:01,294 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 19:44:01,302 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 19:44:01,311 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 19:44:01,315 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 19:44:01,318 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:44:01,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 19:44:01,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:44:01,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:44:01,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-24 19:44:01,337 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 13 treesize of output 10 [2018-01-24 19:44:01,339 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 10 treesize of output 9 [2018-01-24 19:44:01,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:44:01,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:44:01,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:44:01,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-01-24 19:44:01,373 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 13 treesize of output 10 [2018-01-24 19:44:01,375 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 10 treesize of output 9 [2018-01-24 19:44:01,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:44:01,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:44:01,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:44:01,394 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2018-01-24 19:44:01,434 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 13 treesize of output 10 [2018-01-24 19:44:01,437 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 10 treesize of output 9 [2018-01-24 19:44:01,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:44:01,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:44:01,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:44:01,454 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:24 [2018-01-24 19:44:01,506 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 13 treesize of output 10 [2018-01-24 19:44:01,507 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 10 treesize of output 9 [2018-01-24 19:44:01,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:44:01,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:44:01,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:44:01,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:24 [2018-01-24 19:44:01,563 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 19:44:01,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 19:44:01,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 19:44:01,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 19:44:01,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 19:44:01,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:44 [2018-01-24 19:44:01,701 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:44:01,702 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:44:02,619 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 89 treesize of output 85 [2018-01-24 19:44:02,621 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 65 [2018-01-24 19:44:02,646 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:02,647 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 66 [2018-01-24 19:44:02,650 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:02,650 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:02,650 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:02,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 74 [2018-01-24 19:44:02,669 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:02,669 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:02,669 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:02,671 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:02,671 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:02,671 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:02,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 104 [2018-01-24 19:44:02,693 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 8 xjuncts. [2018-01-24 19:44:02,696 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:02,696 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:02,697 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:02,698 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:02,698 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:02,698 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:02,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 108 [2018-01-24 19:44:02,719 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 8 xjuncts. [2018-01-24 19:44:02,722 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:02,722 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:02,722 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:02,723 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:02,723 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:02,723 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:02,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 52 [2018-01-24 19:44:02,731 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 19:44:02,788 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:44:02,792 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:44:02,794 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:44:02,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:44:02,803 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 62 treesize of output 58 [2018-01-24 19:44:02,805 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 40 treesize of output 33 [2018-01-24 19:44:02,805 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-24 19:44:02,812 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:44:02,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 129 [2018-01-24 19:44:02,823 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 124 treesize of output 117 [2018-01-24 19:44:02,823 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-24 19:44:02,849 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 121 treesize of output 128 [2018-01-24 19:44:02,853 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:02,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 124 [2018-01-24 19:44:02,869 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:02,871 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:02,873 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:02,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 108 treesize of output 125 [2018-01-24 19:44:02,954 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:02,955 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:02,955 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:02,956 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:02,956 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:02,957 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:02,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 118 [2018-01-24 19:44:02,978 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 8 xjuncts. [2018-01-24 19:44:02,981 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:02,982 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:02,982 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:02,984 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:02,984 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:02,985 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 19:44:03,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 122 [2018-01-24 19:44:03,009 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 8 xjuncts. Received shutdown request... [2018-01-24 19:44:03,095 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 19:44:03,096 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 19:44:03,099 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 19:44:03,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 07:44:03 BoogieIcfgContainer [2018-01-24 19:44:03,099 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 19:44:03,100 INFO L168 Benchmark]: Toolchain (without parser) took 51670.25 ms. Allocated memory was 302.5 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 259.8 MB in the beginning and 519.3 MB in the end (delta: -259.5 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. [2018-01-24 19:44:03,101 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 302.5 MB. Free memory is still 265.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 19:44:03,101 INFO L168 Benchmark]: CACSL2BoogieTranslator took 194.89 ms. Allocated memory is still 302.5 MB. Free memory was 259.8 MB in the beginning and 249.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 19:44:03,101 INFO L168 Benchmark]: Boogie Preprocessor took 34.76 ms. Allocated memory is still 302.5 MB. Free memory was 249.9 MB in the beginning and 247.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 19:44:03,101 INFO L168 Benchmark]: RCFGBuilder took 227.98 ms. Allocated memory is still 302.5 MB. Free memory was 247.9 MB in the beginning and 233.3 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. [2018-01-24 19:44:03,102 INFO L168 Benchmark]: TraceAbstraction took 51205.26 ms. Allocated memory was 302.5 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 231.3 MB in the beginning and 519.3 MB in the end (delta: -288.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. [2018-01-24 19:44:03,103 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.18 ms. Allocated memory is still 302.5 MB. Free memory is still 265.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 194.89 ms. Allocated memory is still 302.5 MB. Free memory was 259.8 MB in the beginning and 249.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.76 ms. Allocated memory is still 302.5 MB. Free memory was 249.9 MB in the beginning and 247.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 227.98 ms. Allocated memory is still 302.5 MB. Free memory was 247.9 MB in the beginning and 233.3 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 51205.26 ms. Allocated memory was 302.5 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 231.3 MB in the beginning and 519.3 MB in the end (delta: -288.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 18 LocStat_MAX_WEQGRAPH_SIZE : 3 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 198 LocStat_NO_SUPPORTING_DISEQUALITIES : 38 LocStat_NO_DISJUNCTIONS : -36 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 23 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 42 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 25 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 9.509751 RENAME_VARIABLES(MILLISECONDS) : 2.531890 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 9.437764 PROJECTAWAY(MILLISECONDS) : 0.132032 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.080103 DISJOIN(MILLISECONDS) : 1.710695 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 2.576912 ADD_EQUALITY(MILLISECONDS) : 0.016995 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.021321 #CONJOIN_DISJUNCTIVE : 79 #RENAME_VARIABLES : 141 #UNFREEZE : 0 #CONJOIN : 118 #PROJECTAWAY : 98 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 19 #RENAME_VARIABLES_DISJUNCTIVE : 133 #ADD_EQUALITY : 41 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - TimeoutResultAtElement [Line: 540]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 540). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 6, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 83. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 38 locations, 11 error locations. TIMEOUT Result, 51.1s OverallTime, 11 OverallIterations, 6 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 161 SDtfs, 736 SDslu, 525 SDs, 0 SdLazy, 1139 SolverSat, 89 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 627 GetRequests, 393 SyntacticMatches, 47 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2340 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 36.0s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 12 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 472 NumberOfCodeBlocks, 468 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 702 ConstructedInterpolants, 80 QuantifiedInterpolants, 574020 SizeOfPredicates, 98 NumberOfNonLiveVariables, 1096 ConjunctsInSsa, 248 ConjunctsInUnsatCore, 26 InterpolantComputations, 6 PerfectInterpolantSequences, 2/502 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/add_last-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_19-44-03-111.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/add_last-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_19-44-03-111.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/add_last-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_19-44-03-111.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/add_last-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_19-44-03-111.csv Completed graceful shutdown