java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/memsafety/test-0504_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 17:01:32,733 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 17:01:32,735 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 17:01:32,749 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 17:01:32,749 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 17:01:32,750 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 17:01:32,751 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 17:01:32,753 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 17:01:32,755 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 17:01:32,755 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 17:01:32,756 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 17:01:32,756 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 17:01:32,756 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 17:01:32,757 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 17:01:32,758 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 17:01:32,760 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 17:01:32,762 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 17:01:32,764 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 17:01:32,765 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 17:01:32,767 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 17:01:32,769 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 17:01:32,769 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 17:01:32,770 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 17:01:32,770 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 17:01:32,771 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 17:01:32,772 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 17:01:32,773 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 17:01:32,773 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 17:01:32,773 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 17:01:32,774 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 17:01:32,774 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 17:01:32,775 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-24 17:01:32,784 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 17:01:32,785 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 17:01:32,785 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 17:01:32,786 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 17:01:32,786 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 17:01:32,786 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 17:01:32,786 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 17:01:32,786 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 17:01:32,787 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 17:01:32,787 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 17:01:32,788 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 17:01:32,788 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 17:01:32,788 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 17:01:32,788 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 17:01:32,788 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 17:01:32,788 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 17:01:32,789 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 17:01:32,789 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 17:01:32,789 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 17:01:32,789 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 17:01:32,789 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 17:01:32,790 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 17:01:32,790 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 17:01:32,790 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 17:01:32,790 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 17:01:32,790 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 17:01:32,791 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 17:01:32,791 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 17:01:32,791 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 17:01:32,791 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 17:01:32,791 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 17:01:32,791 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 17:01:32,792 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 17:01:32,792 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 17:01:32,793 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 17:01:32,793 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 17:01:32,827 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 17:01:32,840 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 17:01:32,844 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 17:01:32,845 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 17:01:32,846 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 17:01:32,847 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0504_true-valid-memsafety.i [2018-01-24 17:01:33,033 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 17:01:33,039 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 17:01:33,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 17:01:33,040 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 17:01:33,044 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 17:01:33,045 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:01:33" (1/1) ... [2018-01-24 17:01:33,047 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fb77e6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:01:33, skipping insertion in model container [2018-01-24 17:01:33,047 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:01:33" (1/1) ... [2018-01-24 17:01:33,065 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:01:33,104 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:01:33,248 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:01:33,265 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:01:33,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:01:33 WrapperNode [2018-01-24 17:01:33,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 17:01:33,273 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 17:01:33,273 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 17:01:33,273 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 17:01:33,287 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:01:33" (1/1) ... [2018-01-24 17:01:33,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:01:33" (1/1) ... [2018-01-24 17:01:33,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:01:33" (1/1) ... [2018-01-24 17:01:33,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:01:33" (1/1) ... [2018-01-24 17:01:33,302 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:01:33" (1/1) ... [2018-01-24 17:01:33,305 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:01:33" (1/1) ... [2018-01-24 17:01:33,307 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:01:33" (1/1) ... [2018-01-24 17:01:33,310 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 17:01:33,310 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 17:01:33,310 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 17:01:33,310 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 17:01:33,311 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:01:33" (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 17:01:33,360 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 17:01:33,360 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 17:01:33,360 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 17:01:33,360 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 17:01:33,360 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 17:01:33,360 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 17:01:33,360 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 17:01:33,360 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 17:01:33,361 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 17:01:33,361 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 17:01:33,361 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 17:01:33,361 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 17:01:33,361 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-24 17:01:33,361 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 17:01:33,361 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 17:01:33,361 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 17:01:33,361 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 17:01:33,749 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 17:01:33,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:01:33 BoogieIcfgContainer [2018-01-24 17:01:33,750 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 17:01:33,751 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 17:01:33,751 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 17:01:33,753 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 17:01:33,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 05:01:33" (1/3) ... [2018-01-24 17:01:33,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@538c0706 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:01:33, skipping insertion in model container [2018-01-24 17:01:33,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:01:33" (2/3) ... [2018-01-24 17:01:33,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@538c0706 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:01:33, skipping insertion in model container [2018-01-24 17:01:33,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:01:33" (3/3) ... [2018-01-24 17:01:33,757 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0504_true-valid-memsafety.i [2018-01-24 17:01:33,763 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 17:01:33,769 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 39 error locations. [2018-01-24 17:01:33,812 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 17:01:33,812 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 17:01:33,813 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 17:01:33,813 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 17:01:33,813 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 17:01:33,813 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 17:01:33,813 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 17:01:33,813 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 17:01:33,814 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 17:01:33,833 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states. [2018-01-24 17:01:33,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 17:01:33,840 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:01:33,841 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:01:33,842 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:01:33,847 INFO L82 PathProgramCache]: Analyzing trace with hash 23857872, now seen corresponding path program 1 times [2018-01-24 17:01:33,850 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:01:33,902 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:01:33,902 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:01:33,902 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:01:33,902 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:01:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:01:33,948 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:01:33,977 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 17:01:33,979 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:01:33,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 17:01:33,979 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:01:33,981 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-24 17:01:33,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-24 17:01:33,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 17:01:33,996 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 2 states. [2018-01-24 17:01:34,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:01:34,112 INFO L93 Difference]: Finished difference Result 182 states and 202 transitions. [2018-01-24 17:01:34,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-24 17:01:34,113 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-01-24 17:01:34,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:01:34,121 INFO L225 Difference]: With dead ends: 182 [2018-01-24 17:01:34,121 INFO L226 Difference]: Without dead ends: 91 [2018-01-24 17:01:34,124 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 17:01:34,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-24 17:01:34,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-01-24 17:01:34,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-24 17:01:34,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-01-24 17:01:34,158 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 10 [2018-01-24 17:01:34,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:01:34,158 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-01-24 17:01:34,158 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-24 17:01:34,159 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-01-24 17:01:34,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 17:01:34,159 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:01:34,159 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:01:34,159 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:01:34,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1271008375, now seen corresponding path program 1 times [2018-01-24 17:01:34,160 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:01:34,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:01:34,160 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:01:34,161 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:01:34,161 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:01:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:01:34,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:01:34,224 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 17:01:34,225 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:01:34,225 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:01:34,225 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:01:34,226 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 17:01:34,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 17:01:34,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:01:34,227 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 3 states. [2018-01-24 17:01:34,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:01:34,260 INFO L93 Difference]: Finished difference Result 231 states and 243 transitions. [2018-01-24 17:01:34,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 17:01:34,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-24 17:01:34,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:01:34,263 INFO L225 Difference]: With dead ends: 231 [2018-01-24 17:01:34,263 INFO L226 Difference]: Without dead ends: 146 [2018-01-24 17:01:34,265 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:01:34,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-24 17:01:34,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 122. [2018-01-24 17:01:34,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-24 17:01:34,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 152 transitions. [2018-01-24 17:01:34,278 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 152 transitions. Word has length 12 [2018-01-24 17:01:34,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:01:34,278 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 152 transitions. [2018-01-24 17:01:34,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 17:01:34,278 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 152 transitions. [2018-01-24 17:01:34,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 17:01:34,279 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:01:34,279 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:01:34,279 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:01:34,280 INFO L82 PathProgramCache]: Analyzing trace with hash -746554717, now seen corresponding path program 1 times [2018-01-24 17:01:34,280 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:01:34,281 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:01:34,281 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:01:34,281 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:01:34,281 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:01:34,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:01:34,292 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:01:34,313 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 17:01:34,314 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:01:34,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 17:01:34,314 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:01:34,314 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 17:01:34,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 17:01:34,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:01:34,315 INFO L87 Difference]: Start difference. First operand 122 states and 152 transitions. Second operand 3 states. [2018-01-24 17:01:34,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:01:34,439 INFO L93 Difference]: Finished difference Result 125 states and 154 transitions. [2018-01-24 17:01:34,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 17:01:34,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-24 17:01:34,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:01:34,441 INFO L225 Difference]: With dead ends: 125 [2018-01-24 17:01:34,441 INFO L226 Difference]: Without dead ends: 120 [2018-01-24 17:01:34,441 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:01:34,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-24 17:01:34,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-01-24 17:01:34,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-24 17:01:34,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 149 transitions. [2018-01-24 17:01:34,452 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 149 transitions. Word has length 13 [2018-01-24 17:01:34,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:01:34,453 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 149 transitions. [2018-01-24 17:01:34,453 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 17:01:34,453 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 149 transitions. [2018-01-24 17:01:34,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 17:01:34,453 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:01:34,454 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:01:34,454 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:01:34,454 INFO L82 PathProgramCache]: Analyzing trace with hash -747420669, now seen corresponding path program 1 times [2018-01-24 17:01:34,454 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:01:34,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:01:34,455 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:01:34,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:01:34,456 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:01:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:01:34,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:01:34,509 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 17:01:34,509 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:01:34,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:01:34,510 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:01:34,510 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:01:34,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:01:34,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:01:34,511 INFO L87 Difference]: Start difference. First operand 120 states and 149 transitions. Second operand 4 states. [2018-01-24 17:01:34,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:01:34,685 INFO L93 Difference]: Finished difference Result 145 states and 175 transitions. [2018-01-24 17:01:34,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 17:01:34,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 17:01:34,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:01:34,686 INFO L225 Difference]: With dead ends: 145 [2018-01-24 17:01:34,686 INFO L226 Difference]: Without dead ends: 137 [2018-01-24 17:01:34,687 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 17:01:34,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-24 17:01:34,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 112. [2018-01-24 17:01:34,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-24 17:01:34,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 134 transitions. [2018-01-24 17:01:34,696 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 134 transitions. Word has length 13 [2018-01-24 17:01:34,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:01:34,697 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 134 transitions. [2018-01-24 17:01:34,697 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:01:34,697 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 134 transitions. [2018-01-24 17:01:34,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 17:01:34,697 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:01:34,698 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:01:34,698 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:01:34,698 INFO L82 PathProgramCache]: Analyzing trace with hash -747420668, now seen corresponding path program 1 times [2018-01-24 17:01:34,698 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:01:34,699 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:01:34,699 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:01:34,699 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:01:34,699 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:01:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:01:34,708 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:01:34,775 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 17:01:34,775 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:01:34,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:01:34,775 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:01:34,776 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:01:34,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:01:34,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:01:34,777 INFO L87 Difference]: Start difference. First operand 112 states and 134 transitions. Second operand 4 states. [2018-01-24 17:01:34,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:01:34,906 INFO L93 Difference]: Finished difference Result 158 states and 185 transitions. [2018-01-24 17:01:34,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 17:01:34,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 17:01:34,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:01:34,907 INFO L225 Difference]: With dead ends: 158 [2018-01-24 17:01:34,907 INFO L226 Difference]: Without dead ends: 152 [2018-01-24 17:01:34,907 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:01:34,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-24 17:01:34,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 113. [2018-01-24 17:01:34,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-24 17:01:34,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 134 transitions. [2018-01-24 17:01:34,919 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 134 transitions. Word has length 13 [2018-01-24 17:01:34,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:01:34,919 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 134 transitions. [2018-01-24 17:01:34,920 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:01:34,920 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 134 transitions. [2018-01-24 17:01:34,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 17:01:34,921 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:01:34,921 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:01:34,921 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:01:34,922 INFO L82 PathProgramCache]: Analyzing trace with hash 2050240790, now seen corresponding path program 1 times [2018-01-24 17:01:34,922 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:01:34,923 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:01:34,923 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:01:34,923 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:01:34,923 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:01:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:01:34,951 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:01:35,057 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 17:01:35,057 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:01:35,058 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:01:35,058 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:01:35,058 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:01:35,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:01:35,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:01:35,059 INFO L87 Difference]: Start difference. First operand 113 states and 134 transitions. Second operand 5 states. [2018-01-24 17:01:35,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:01:35,214 INFO L93 Difference]: Finished difference Result 201 states and 225 transitions. [2018-01-24 17:01:35,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 17:01:35,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-24 17:01:35,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:01:35,215 INFO L225 Difference]: With dead ends: 201 [2018-01-24 17:01:35,215 INFO L226 Difference]: Without dead ends: 198 [2018-01-24 17:01:35,216 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:01:35,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-01-24 17:01:35,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 104. [2018-01-24 17:01:35,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-24 17:01:35,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 119 transitions. [2018-01-24 17:01:35,227 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 119 transitions. Word has length 25 [2018-01-24 17:01:35,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:01:35,227 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 119 transitions. [2018-01-24 17:01:35,228 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:01:35,228 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 119 transitions. [2018-01-24 17:01:35,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 17:01:35,229 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:01:35,229 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:01:35,229 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:01:35,229 INFO L82 PathProgramCache]: Analyzing trace with hash -867044953, now seen corresponding path program 1 times [2018-01-24 17:01:35,230 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:01:35,230 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:01:35,231 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:01:35,231 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:01:35,231 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:01:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:01:35,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:01:35,299 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 17:01:35,299 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:01:35,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:01:35,299 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:01:35,300 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:01:35,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:01:35,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:01:35,300 INFO L87 Difference]: Start difference. First operand 104 states and 119 transitions. Second operand 4 states. [2018-01-24 17:01:35,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:01:35,468 INFO L93 Difference]: Finished difference Result 156 states and 176 transitions. [2018-01-24 17:01:35,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 17:01:35,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-01-24 17:01:35,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:01:35,470 INFO L225 Difference]: With dead ends: 156 [2018-01-24 17:01:35,470 INFO L226 Difference]: Without dead ends: 152 [2018-01-24 17:01:35,471 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:01:35,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-24 17:01:35,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 100. [2018-01-24 17:01:35,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-24 17:01:35,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2018-01-24 17:01:35,479 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 26 [2018-01-24 17:01:35,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:01:35,479 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2018-01-24 17:01:35,479 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:01:35,479 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2018-01-24 17:01:35,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 17:01:35,480 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:01:35,480 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:01:35,480 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:01:35,480 INFO L82 PathProgramCache]: Analyzing trace with hash -867044952, now seen corresponding path program 1 times [2018-01-24 17:01:35,480 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:01:35,481 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:01:35,481 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:01:35,481 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:01:35,482 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:01:35,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:01:35,496 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:01:35,607 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 17:01:35,607 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:01:35,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:01:35,608 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:01:35,608 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:01:35,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:01:35,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:01:35,609 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand 4 states. [2018-01-24 17:01:35,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:01:35,689 INFO L93 Difference]: Finished difference Result 144 states and 160 transitions. [2018-01-24 17:01:35,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 17:01:35,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-01-24 17:01:35,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:01:35,691 INFO L225 Difference]: With dead ends: 144 [2018-01-24 17:01:35,691 INFO L226 Difference]: Without dead ends: 140 [2018-01-24 17:01:35,691 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:01:35,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-24 17:01:35,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 96. [2018-01-24 17:01:35,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-24 17:01:35,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2018-01-24 17:01:35,696 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 26 [2018-01-24 17:01:35,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:01:35,697 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2018-01-24 17:01:35,697 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:01:35,697 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2018-01-24 17:01:35,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 17:01:35,697 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:01:35,698 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:01:35,698 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:01:35,698 INFO L82 PathProgramCache]: Analyzing trace with hash -2023715676, now seen corresponding path program 1 times [2018-01-24 17:01:35,698 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:01:35,699 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:01:35,699 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:01:35,699 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:01:35,699 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:01:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:01:35,713 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:01:35,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:01:35,748 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:01:35,748 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:01:35,748 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:01:35,748 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:01:35,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:01:35,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:01:35,749 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 4 states. [2018-01-24 17:01:35,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:01:35,879 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2018-01-24 17:01:35,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:01:35,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-24 17:01:35,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:01:35,881 INFO L225 Difference]: With dead ends: 123 [2018-01-24 17:01:35,881 INFO L226 Difference]: Without dead ends: 122 [2018-01-24 17:01:35,881 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:01:35,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-24 17:01:35,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 99. [2018-01-24 17:01:35,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-24 17:01:35,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2018-01-24 17:01:35,887 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 28 [2018-01-24 17:01:35,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:01:35,888 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2018-01-24 17:01:35,888 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:01:35,888 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2018-01-24 17:01:35,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 17:01:35,889 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:01:35,889 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:01:35,889 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:01:35,890 INFO L82 PathProgramCache]: Analyzing trace with hash -2023715675, now seen corresponding path program 1 times [2018-01-24 17:01:35,890 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:01:35,890 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:01:35,891 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:01:35,891 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:01:35,891 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:01:35,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:01:35,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:01:36,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:01:36,042 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:01:36,042 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:01:36,042 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:01:36,043 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:01:36,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:01:36,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:01:36,043 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand 5 states. [2018-01-24 17:01:36,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:01:36,174 INFO L93 Difference]: Finished difference Result 177 states and 196 transitions. [2018-01-24 17:01:36,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:01:36,175 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-24 17:01:36,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:01:36,177 INFO L225 Difference]: With dead ends: 177 [2018-01-24 17:01:36,177 INFO L226 Difference]: Without dead ends: 176 [2018-01-24 17:01:36,178 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:01:36,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-01-24 17:01:36,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 129. [2018-01-24 17:01:36,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-24 17:01:36,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 147 transitions. [2018-01-24 17:01:36,187 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 147 transitions. Word has length 28 [2018-01-24 17:01:36,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:01:36,188 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 147 transitions. [2018-01-24 17:01:36,188 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:01:36,188 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 147 transitions. [2018-01-24 17:01:36,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 17:01:36,189 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:01:36,189 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:01:36,189 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:01:36,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1689322728, now seen corresponding path program 1 times [2018-01-24 17:01:36,189 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:01:36,190 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:01:36,190 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:01:36,190 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:01:36,190 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:01:36,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:01:36,203 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:01:36,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:01:36,238 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:01:36,238 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:01:36,239 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:01:36,239 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:01:36,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:01:36,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:01:36,239 INFO L87 Difference]: Start difference. First operand 129 states and 147 transitions. Second operand 5 states. [2018-01-24 17:01:36,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:01:36,392 INFO L93 Difference]: Finished difference Result 223 states and 252 transitions. [2018-01-24 17:01:36,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:01:36,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-24 17:01:36,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:01:36,394 INFO L225 Difference]: With dead ends: 223 [2018-01-24 17:01:36,394 INFO L226 Difference]: Without dead ends: 133 [2018-01-24 17:01:36,395 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 17:01:36,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-24 17:01:36,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 125. [2018-01-24 17:01:36,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-24 17:01:36,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2018-01-24 17:01:36,403 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 29 [2018-01-24 17:01:36,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:01:36,403 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2018-01-24 17:01:36,403 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:01:36,403 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2018-01-24 17:01:36,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 17:01:36,404 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:01:36,405 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:01:36,405 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:01:36,405 INFO L82 PathProgramCache]: Analyzing trace with hash -202845861, now seen corresponding path program 1 times [2018-01-24 17:01:36,405 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:01:36,406 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:01:36,406 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:01:36,406 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:01:36,407 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:01:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:01:36,420 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:01:36,507 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 17:01:36,507 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:01:36,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:01:36,507 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:01:36,507 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:01:36,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:01:36,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:01:36,508 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand 6 states. [2018-01-24 17:01:36,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:01:36,756 INFO L93 Difference]: Finished difference Result 195 states and 213 transitions. [2018-01-24 17:01:36,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 17:01:36,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-01-24 17:01:36,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:01:36,758 INFO L225 Difference]: With dead ends: 195 [2018-01-24 17:01:36,758 INFO L226 Difference]: Without dead ends: 194 [2018-01-24 17:01:36,759 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-24 17:01:36,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-24 17:01:36,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 144. [2018-01-24 17:01:36,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-24 17:01:36,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 159 transitions. [2018-01-24 17:01:36,770 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 159 transitions. Word has length 29 [2018-01-24 17:01:36,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:01:36,771 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 159 transitions. [2018-01-24 17:01:36,771 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:01:36,771 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 159 transitions. [2018-01-24 17:01:36,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 17:01:36,772 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:01:36,772 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:01:36,772 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:01:36,772 INFO L82 PathProgramCache]: Analyzing trace with hash -202845860, now seen corresponding path program 1 times [2018-01-24 17:01:36,772 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:01:36,773 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:01:36,773 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:01:36,774 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:01:36,774 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:01:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:01:36,788 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:01:37,042 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 17:01:37,042 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:01:37,042 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 17:01:37,043 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:01:37,043 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 17:01:37,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 17:01:37,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-24 17:01:37,043 INFO L87 Difference]: Start difference. First operand 144 states and 159 transitions. Second operand 10 states. [2018-01-24 17:01:37,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:01:37,533 INFO L93 Difference]: Finished difference Result 222 states and 239 transitions. [2018-01-24 17:01:37,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 17:01:37,533 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-01-24 17:01:37,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:01:37,535 INFO L225 Difference]: With dead ends: 222 [2018-01-24 17:01:37,535 INFO L226 Difference]: Without dead ends: 221 [2018-01-24 17:01:37,535 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-01-24 17:01:37,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-01-24 17:01:37,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 144. [2018-01-24 17:01:37,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-24 17:01:37,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 157 transitions. [2018-01-24 17:01:37,548 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 157 transitions. Word has length 29 [2018-01-24 17:01:37,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:01:37,549 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 157 transitions. [2018-01-24 17:01:37,549 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 17:01:37,549 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 157 transitions. [2018-01-24 17:01:37,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 17:01:37,550 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:01:37,550 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:01:37,550 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:01:37,550 INFO L82 PathProgramCache]: Analyzing trace with hash 829423013, now seen corresponding path program 1 times [2018-01-24 17:01:37,550 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:01:37,551 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:01:37,552 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:01:37,552 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:01:37,552 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:01:37,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:01:37,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:01:37,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 17:01:37,587 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:01:37,587 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:01:37,587 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:01:37,588 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:01:37,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:01:37,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:01:37,589 INFO L87 Difference]: Start difference. First operand 144 states and 157 transitions. Second operand 4 states. [2018-01-24 17:01:37,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:01:37,657 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2018-01-24 17:01:37,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:01:37,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-01-24 17:01:37,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:01:37,658 INFO L225 Difference]: With dead ends: 156 [2018-01-24 17:01:37,659 INFO L226 Difference]: Without dead ends: 154 [2018-01-24 17:01:37,659 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:01:37,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-24 17:01:37,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 146. [2018-01-24 17:01:37,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-01-24 17:01:37,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 161 transitions. [2018-01-24 17:01:37,678 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 161 transitions. Word has length 30 [2018-01-24 17:01:37,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:01:37,679 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 161 transitions. [2018-01-24 17:01:37,679 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:01:37,679 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 161 transitions. [2018-01-24 17:01:37,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 17:01:37,680 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:01:37,680 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:01:37,680 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:01:37,680 INFO L82 PathProgramCache]: Analyzing trace with hash 829423014, now seen corresponding path program 1 times [2018-01-24 17:01:37,681 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:01:37,681 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:01:37,681 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:01:37,682 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:01:37,682 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:01:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:01:37,693 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:01:37,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:01:37,814 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:01:37,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:01:37,814 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:01:37,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:01:37,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:01:37,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:01:37,815 INFO L87 Difference]: Start difference. First operand 146 states and 161 transitions. Second operand 6 states. [2018-01-24 17:01:38,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:01:38,000 INFO L93 Difference]: Finished difference Result 214 states and 235 transitions. [2018-01-24 17:01:38,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 17:01:38,001 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-01-24 17:01:38,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:01:38,002 INFO L225 Difference]: With dead ends: 214 [2018-01-24 17:01:38,002 INFO L226 Difference]: Without dead ends: 212 [2018-01-24 17:01:38,002 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-24 17:01:38,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-01-24 17:01:38,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 158. [2018-01-24 17:01:38,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-01-24 17:01:38,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 180 transitions. [2018-01-24 17:01:38,012 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 180 transitions. Word has length 30 [2018-01-24 17:01:38,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:01:38,012 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 180 transitions. [2018-01-24 17:01:38,012 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:01:38,012 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 180 transitions. [2018-01-24 17:01:38,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 17:01:38,013 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:01:38,013 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:01:38,013 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:01:38,013 INFO L82 PathProgramCache]: Analyzing trace with hash -664393622, now seen corresponding path program 1 times [2018-01-24 17:01:38,013 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:01:38,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:01:38,014 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:01:38,015 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:01:38,015 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:01:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:01:38,025 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:01:38,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:01:38,131 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:01:38,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 17:01:38,165 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:01:38,165 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 17:01:38,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 17:01:38,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:01:38,166 INFO L87 Difference]: Start difference. First operand 158 states and 180 transitions. Second operand 7 states. [2018-01-24 17:01:38,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:01:38,396 INFO L93 Difference]: Finished difference Result 253 states and 291 transitions. [2018-01-24 17:01:38,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 17:01:38,396 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-01-24 17:01:38,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:01:38,397 INFO L225 Difference]: With dead ends: 253 [2018-01-24 17:01:38,397 INFO L226 Difference]: Without dead ends: 220 [2018-01-24 17:01:38,398 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-24 17:01:38,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-01-24 17:01:38,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 169. [2018-01-24 17:01:38,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-01-24 17:01:38,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 192 transitions. [2018-01-24 17:01:38,412 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 192 transitions. Word has length 34 [2018-01-24 17:01:38,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:01:38,412 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 192 transitions. [2018-01-24 17:01:38,412 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 17:01:38,413 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 192 transitions. [2018-01-24 17:01:38,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 17:01:38,413 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:01:38,414 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:01:38,414 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:01:38,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1742572463, now seen corresponding path program 1 times [2018-01-24 17:01:38,414 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:01:38,415 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:01:38,415 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:01:38,415 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:01:38,415 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:01:38,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:01:38,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:01:38,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:01:38,558 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:01:38,558 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:01:38,559 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-01-24 17:01:38,560 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [12], [13], [18], [20], [23], [26], [29], [32], [35], [39], [41], [44], [84], [100], [106], [107], [108], [110], [111], [114], [118], [122], [135], [144], [145], [149], [150], [151] [2018-01-24 17:01:38,604 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:01:38,605 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:01:39,140 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:01:39,142 INFO L268 AbstractInterpreter]: Visited 33 different actions 72 times. Merged at 27 different actions 37 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 34 variables. [2018-01-24 17:01:39,160 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:01:39,160 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:01:39,161 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 17:01:39,171 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:01:39,171 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:01:39,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:01:39,224 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:01:39,349 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 17:01:39,352 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 17:01:39,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:01:39,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:01:39,363 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 17:01:39,366 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 17:01:39,367 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:01:39,368 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:01:39,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:01:39,375 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-01-24 17:01:39,398 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 23 treesize of output 18 [2018-01-24 17:01:39,401 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:39,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-01-24 17:01:39,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:01:39,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:01:39,422 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 23 treesize of output 18 [2018-01-24 17:01:39,425 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:39,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-01-24 17:01:39,426 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:01:39,430 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:01:39,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:01:39,436 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2018-01-24 17:01:39,465 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 30 treesize of output 23 [2018-01-24 17:01:39,469 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:39,470 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:39,471 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:39,473 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-01-24 17:01:39,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:01:39,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:01:39,498 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 30 treesize of output 23 [2018-01-24 17:01:39,502 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:39,503 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:39,503 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:39,504 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:01:39,505 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 55 [2018-01-24 17:01:39,505 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:01:39,513 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:01:39,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:01:39,524 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:65, output treesize:57 [2018-01-24 17:01:39,568 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 39 treesize of output 30 [2018-01-24 17:01:39,585 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:39,587 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:39,588 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:39,589 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:39,591 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:39,592 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:39,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-01-24 17:01:39,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:01:39,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:01:39,700 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 39 treesize of output 30 [2018-01-24 17:01:39,703 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:39,704 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:39,705 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:39,705 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:39,706 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:39,707 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:39,707 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:01:39,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 90 [2018-01-24 17:01:39,708 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:01:39,719 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:01:39,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:01:39,737 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:75 [2018-01-24 17:01:39,769 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 54 treesize of output 43 [2018-01-24 17:01:39,802 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:39,803 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:39,805 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:39,806 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:39,807 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:39,808 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:39,809 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:39,810 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:39,811 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:39,811 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:39,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 107 [2018-01-24 17:01:39,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:01:39,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:01:39,865 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 54 treesize of output 43 [2018-01-24 17:01:39,879 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:39,880 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:39,881 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:39,881 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:39,882 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:39,883 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:39,884 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:39,884 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:39,885 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:39,885 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:39,886 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:01:39,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 120 [2018-01-24 17:01:39,891 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:01:39,905 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:01:39,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:01:39,923 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:75 [2018-01-24 17:01:39,998 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 44 treesize of output 34 [2018-01-24 17:01:40,002 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:40,005 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:40,005 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:40,006 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:40,007 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:40,007 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:40,008 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:40,009 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:40,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 81 [2018-01-24 17:01:40,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 17:01:40,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:01:40,078 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 44 treesize of output 34 [2018-01-24 17:01:40,081 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:40,083 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:40,084 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:40,084 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:40,085 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:40,085 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:40,086 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:40,086 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:40,089 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:01:40,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 84 [2018-01-24 17:01:40,098 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-24 17:01:40,121 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:01:40,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-24 17:01:40,136 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:99, output treesize:31 [2018-01-24 17:01:40,192 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:01:40,193 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:01:40,409 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:01:40,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:01:40,452 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:01:40,457 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:01:40,474 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 17:01:40,481 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:01:40,495 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:01:40,499 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:01:40,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-24 17:01:40,509 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:113, output treesize:43 [2018-01-24 17:01:40,651 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 17:01:40,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:01:40,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:01:40,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:1 [2018-01-24 17:01:40,664 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:01:40,698 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:01:40,698 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 17:01:40,701 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:01:40,702 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:01:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-01-24 17:01:52,778 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-01-24 17:01:52,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 9] total 22 [2018-01-24 17:01:52,779 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:01:52,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 17:01:52,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 17:01:52,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2018-01-24 17:01:52,780 INFO L87 Difference]: Start difference. First operand 169 states and 192 transitions. Second operand 16 states. [2018-01-24 17:01:56,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:01:56,104 INFO L93 Difference]: Finished difference Result 214 states and 238 transitions. [2018-01-24 17:01:56,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-24 17:01:56,105 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2018-01-24 17:01:56,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:01:56,106 INFO L225 Difference]: With dead ends: 214 [2018-01-24 17:01:56,106 INFO L226 Difference]: Without dead ends: 187 [2018-01-24 17:01:56,108 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=346, Invalid=1214, Unknown=0, NotChecked=0, Total=1560 [2018-01-24 17:01:56,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-01-24 17:01:56,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 172. [2018-01-24 17:01:56,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-01-24 17:01:56,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 195 transitions. [2018-01-24 17:01:56,126 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 195 transitions. Word has length 37 [2018-01-24 17:01:56,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:01:56,126 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 195 transitions. [2018-01-24 17:01:56,126 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 17:01:56,126 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 195 transitions. [2018-01-24 17:01:56,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 17:01:56,127 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:01:56,127 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:01:56,127 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:01:56,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1814827739, now seen corresponding path program 1 times [2018-01-24 17:01:56,128 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:01:56,129 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:01:56,129 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:01:56,129 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:01:56,129 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:01:56,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:01:56,146 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:01:56,275 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:01:56,276 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:01:56,276 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:01:56,276 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-01-24 17:01:56,276 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [12], [13], [18], [20], [23], [26], [29], [32], [35], [39], [41], [44], [84], [100], [104], [106], [107], [110], [111], [114], [118], [122], [135], [141], [143], [144], [145], [149], [150], [151] [2018-01-24 17:01:56,278 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:01:56,278 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:01:56,680 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:01:56,680 INFO L268 AbstractInterpreter]: Visited 35 different actions 79 times. Merged at 29 different actions 41 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 35 variables. [2018-01-24 17:01:56,685 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:01:56,685 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:01:56,685 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 17:01:56,697 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:01:56,697 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:01:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:01:56,727 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:01:56,861 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~x~10.base Int)) (and (= (select |c_old(#valid)| main_~x~10.base) 0) (= |c_#valid| (store |c_old(#valid)| main_~x~10.base 0)) (not (= main_~x~10.base 0)))) is different from true [2018-01-24 17:01:56,902 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-24 17:01:56,902 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:01:57,027 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc1.base_5| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc1.base_5|))) (= 0 |v_main_#t~malloc1.base_5|) (= (store |c_#valid| |v_main_#t~malloc1.base_5| 0) |c_old(#valid)|))) is different from false [2018-01-24 17:01:57,036 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-01-24 17:01:57,057 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:01:57,057 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 17:01:57,061 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:01:57,061 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:01:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:01:57,127 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:01:57,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 17:01:57,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:01:57,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:01:57,139 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 17:01:57,307 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:01:57,307 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:01:57,325 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc1.base_6| Int)) (or (= 0 |v_main_#t~malloc1.base_6|) (= (store |c_#valid| |v_main_#t~malloc1.base_6| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc1.base_6|))))) is different from false [2018-01-24 17:01:57,335 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-01-24 17:01:57,337 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:01:57,337 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9, 8, 7] total 25 [2018-01-24 17:01:57,337 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:01:57,337 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 17:01:57,337 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 17:01:57,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=428, Unknown=8, NotChecked=132, Total=650 [2018-01-24 17:01:57,338 INFO L87 Difference]: Start difference. First operand 172 states and 195 transitions. Second operand 14 states. [2018-01-24 17:01:57,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:01:57,811 INFO L93 Difference]: Finished difference Result 176 states and 198 transitions. [2018-01-24 17:01:57,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 17:01:57,812 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2018-01-24 17:01:57,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:01:57,813 INFO L225 Difference]: With dead ends: 176 [2018-01-24 17:01:57,813 INFO L226 Difference]: Without dead ends: 162 [2018-01-24 17:01:57,813 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 128 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=659, Unknown=8, NotChecked=168, Total=992 [2018-01-24 17:01:57,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-01-24 17:01:57,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-01-24 17:01:57,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-01-24 17:01:57,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 183 transitions. [2018-01-24 17:01:57,824 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 183 transitions. Word has length 38 [2018-01-24 17:01:57,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:01:57,824 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 183 transitions. [2018-01-24 17:01:57,824 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 17:01:57,824 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 183 transitions. [2018-01-24 17:01:57,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-24 17:01:57,825 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:01:57,825 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:01:57,825 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:01:57,825 INFO L82 PathProgramCache]: Analyzing trace with hash 686838870, now seen corresponding path program 1 times [2018-01-24 17:01:57,825 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:01:57,826 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:01:57,826 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:01:57,826 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:01:57,826 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:01:57,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:01:57,836 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:01:58,056 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:01:58,057 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:01:58,057 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:01:58,057 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-01-24 17:01:58,057 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [11], [12], [13], [18], [20], [23], [26], [29], [32], [35], [39], [41], [44], [84], [86], [88], [144], [145], [149], [150], [151] [2018-01-24 17:01:58,059 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:01:58,059 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:01:58,159 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:01:58,159 INFO L268 AbstractInterpreter]: Visited 24 different actions 41 times. Merged at 16 different actions 16 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-01-24 17:01:58,162 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:01:58,163 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:01:58,163 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 17:01:58,177 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:01:58,178 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:01:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:01:58,212 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:01:58,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 17:01:58,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:01:58,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:01:58,312 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-24 17:01:58,349 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:01:58,349 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:01:58,386 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:01:58,421 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:01:58,421 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 17:01:58,427 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:01:58,427 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:01:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:01:58,480 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:01:58,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 17:01:58,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:01:58,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:01:58,485 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 17:01:58,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 17:01:58,493 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:01:58,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:01:58,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-01-24 17:01:58,504 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:01:58,504 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:01:58,537 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:01:58,539 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:01:58,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 4, 4] total 10 [2018-01-24 17:01:58,539 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:01:58,539 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 17:01:58,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 17:01:58,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-01-24 17:01:58,540 INFO L87 Difference]: Start difference. First operand 161 states and 183 transitions. Second operand 9 states. [2018-01-24 17:01:58,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:01:58,905 INFO L93 Difference]: Finished difference Result 182 states and 206 transitions. [2018-01-24 17:01:58,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:01:58,906 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-01-24 17:01:58,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:01:58,907 INFO L225 Difference]: With dead ends: 182 [2018-01-24 17:01:58,907 INFO L226 Difference]: Without dead ends: 181 [2018-01-24 17:01:58,907 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 143 SyntacticMatches, 13 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-01-24 17:01:58,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-01-24 17:01:58,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 160. [2018-01-24 17:01:58,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-01-24 17:01:58,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 181 transitions. [2018-01-24 17:01:58,916 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 181 transitions. Word has length 39 [2018-01-24 17:01:58,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:01:58,916 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 181 transitions. [2018-01-24 17:01:58,916 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 17:01:58,916 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 181 transitions. [2018-01-24 17:01:58,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-24 17:01:58,916 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:01:58,916 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:01:58,917 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:01:58,917 INFO L82 PathProgramCache]: Analyzing trace with hash 686838871, now seen corresponding path program 1 times [2018-01-24 17:01:58,917 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:01:58,917 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:01:58,917 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:01:58,918 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:01:58,918 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:01:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:01:58,927 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:01:59,015 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:01:59,015 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:01:59,015 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:01:59,015 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-01-24 17:01:59,015 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [11], [12], [13], [18], [20], [23], [26], [29], [32], [35], [39], [41], [44], [84], [86], [89], [144], [145], [149], [150], [151] [2018-01-24 17:01:59,017 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:01:59,017 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:01:59,118 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:01:59,118 INFO L268 AbstractInterpreter]: Visited 24 different actions 41 times. Merged at 16 different actions 16 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-01-24 17:01:59,119 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:01:59,119 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:01:59,119 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 17:01:59,132 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:01:59,132 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:01:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:01:59,165 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:01:59,283 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:59,284 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:59,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 17:01:59,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:01:59,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-01-24 17:01:59,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:01:59,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:01:59,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-01-24 17:01:59,338 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:01:59,338 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:01:59,432 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:01:59,466 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:01:59,466 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 17:01:59,470 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:01:59,471 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:01:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:01:59,527 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:01:59,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 17:01:59,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:01:59,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 17:01:59,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:01:59,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:01:59,543 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 17:01:59,568 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:59,570 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:01:59,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 17:01:59,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:01:59,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 17:01:59,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:01:59,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:01:59,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-01-24 17:01:59,616 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:01:59,616 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:01:59,725 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:01:59,726 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:01:59,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4, 5, 5] total 16 [2018-01-24 17:01:59,727 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:01:59,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 17:01:59,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 17:01:59,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-01-24 17:01:59,727 INFO L87 Difference]: Start difference. First operand 160 states and 181 transitions. Second operand 11 states. [2018-01-24 17:02:00,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:02:00,222 INFO L93 Difference]: Finished difference Result 236 states and 265 transitions. [2018-01-24 17:02:00,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 17:02:00,222 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2018-01-24 17:02:00,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:02:00,224 INFO L225 Difference]: With dead ends: 236 [2018-01-24 17:02:00,224 INFO L226 Difference]: Without dead ends: 235 [2018-01-24 17:02:00,224 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 147 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=470, Unknown=0, NotChecked=0, Total=650 [2018-01-24 17:02:00,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-01-24 17:02:00,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 159. [2018-01-24 17:02:00,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-01-24 17:02:00,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 179 transitions. [2018-01-24 17:02:00,233 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 179 transitions. Word has length 39 [2018-01-24 17:02:00,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:02:00,234 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 179 transitions. [2018-01-24 17:02:00,234 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 17:02:00,234 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 179 transitions. [2018-01-24 17:02:00,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-24 17:02:00,234 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:02:00,234 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:02:00,234 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:02:00,235 INFO L82 PathProgramCache]: Analyzing trace with hash -927394694, now seen corresponding path program 1 times [2018-01-24 17:02:00,235 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:02:00,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:02:00,235 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:02:00,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:02:00,236 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:02:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:02:00,252 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:02:00,522 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:02:00,523 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:02:00,523 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:02:00,523 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-01-24 17:02:00,524 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [12], [13], [18], [20], [23], [26], [29], [32], [35], [39], [41], [44], [46], [47], [48], [53], [55], [58], [61], [62], [65], [68], [69], [72], [75], [78], [84], [100], [106], [109], [144], [145], [149], [150], [151] [2018-01-24 17:02:00,525 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:02:00,525 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:02:00,868 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:02:00,868 INFO L268 AbstractInterpreter]: Visited 40 different actions 145 times. Merged at 34 different actions 99 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 3 different actions. Largest state had 34 variables. [2018-01-24 17:02:00,877 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:02:00,877 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:02:00,877 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 17:02:00,908 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:02:00,909 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:02:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:02:00,937 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:02:01,036 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:01,037 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:01,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-01-24 17:02:01,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:01,049 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:01,049 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:01,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 17:02:01,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:01,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:01,056 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:21 [2018-01-24 17:02:01,111 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:02:01,111 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:02:03,202 WARN L143 SmtUtils]: Spent 2035ms on a formula simplification that was a NOOP. DAG size: 26 [2018-01-24 17:02:03,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-01-24 17:02:03,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:03,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:03,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:12 [2018-01-24 17:02:03,286 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:02:03,308 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:02:03,308 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:02:03,312 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:02:03,313 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:02:03,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:02:03,367 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:02:03,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 17:02:03,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:03,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 17:02:03,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:03,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:03,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 17:02:03,416 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:03,417 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:03,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 17:02:03,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:03,424 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:03,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-01-24 17:02:03,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:03,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:02:03,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-01-24 17:02:03,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:02:03,510 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:02:03,612 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:02:03,614 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:02:03,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 6, 5, 5] total 22 [2018-01-24 17:02:03,614 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:02:03,614 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 17:02:03,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 17:02:03,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2018-01-24 17:02:03,615 INFO L87 Difference]: Start difference. First operand 159 states and 179 transitions. Second operand 14 states. [2018-01-24 17:02:04,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:02:04,070 INFO L93 Difference]: Finished difference Result 265 states and 298 transitions. [2018-01-24 17:02:04,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 17:02:04,071 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-01-24 17:02:04,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:02:04,072 INFO L225 Difference]: With dead ends: 265 [2018-01-24 17:02:04,073 INFO L226 Difference]: Without dead ends: 264 [2018-01-24 17:02:04,073 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 162 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=189, Invalid=681, Unknown=0, NotChecked=0, Total=870 [2018-01-24 17:02:04,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-01-24 17:02:04,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 181. [2018-01-24 17:02:04,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-01-24 17:02:04,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 203 transitions. [2018-01-24 17:02:04,091 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 203 transitions. Word has length 44 [2018-01-24 17:02:04,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:02:04,092 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 203 transitions. [2018-01-24 17:02:04,092 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 17:02:04,092 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 203 transitions. [2018-01-24 17:02:04,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-24 17:02:04,092 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:02:04,093 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:02:04,093 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:02:04,093 INFO L82 PathProgramCache]: Analyzing trace with hash -576633818, now seen corresponding path program 1 times [2018-01-24 17:02:04,093 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:02:04,094 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:02:04,094 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:02:04,094 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:02:04,094 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:02:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:02:04,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:02:04,261 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:02:04,262 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:02:04,262 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:02:04,262 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-01-24 17:02:04,262 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [11], [12], [13], [18], [20], [23], [26], [29], [32], [35], [39], [41], [46], [47], [48], [53], [55], [58], [61], [62], [65], [66], [68], [69], [72], [75], [78], [144], [145], [149], [150], [151] [2018-01-24 17:02:04,264 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:02:04,264 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:02:04,395 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:02:04,395 INFO L268 AbstractInterpreter]: Visited 35 different actions 43 times. Merged at 8 different actions 8 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 32 variables. [2018-01-24 17:02:04,415 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:02:04,415 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:02:04,415 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:02:04,424 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:02:04,424 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:02:04,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:02:04,458 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:02:04,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 17:02:04,475 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 17:02:04,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:04,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:04,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:04,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-01-24 17:02:04,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-24 17:02:04,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:04,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:04,506 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-01-24 17:02:04,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-01-24 17:02:04,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 23 [2018-01-24 17:02:04,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:04,609 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 22 treesize of output 21 [2018-01-24 17:02:04,610 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:04,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:04,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 17:02:04,625 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-01-24 17:02:04,673 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 28 [2018-01-24 17:02:04,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2018-01-24 17:02:04,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:04,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-01-24 17:02:04,688 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:04,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:04,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:02:04,695 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:33, output treesize:11 [2018-01-24 17:02:04,706 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:02:04,706 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:02:04,756 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:02:04,788 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:02:04,788 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:02:04,792 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:02:04,792 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:02:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:02:04,850 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:02:04,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 17:02:04,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:04,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:04,853 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 17:02:04,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 17:02:04,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:04,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:04,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-24 17:02:04,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 17:02:04,939 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 17:02:04,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:04,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:04,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:04,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:15 [2018-01-24 17:02:04,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2018-01-24 17:02:04,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:04,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:02:04,973 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:20 [2018-01-24 17:02:05,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-01-24 17:02:05,025 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 26 treesize of output 25 [2018-01-24 17:02:05,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:05,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:05,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 17:02:05,042 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-01-24 17:02:05,076 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 28 [2018-01-24 17:02:05,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2018-01-24 17:02:05,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:05,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-01-24 17:02:05,089 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:05,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-01-24 17:02:05,100 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:05,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:05,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:02:05,109 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:33, output treesize:11 [2018-01-24 17:02:05,150 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:02:05,151 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:02:05,209 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:02:05,211 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:02:05,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 9, 6] total 24 [2018-01-24 17:02:05,211 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:02:05,211 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 17:02:05,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 17:02:05,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2018-01-24 17:02:05,212 INFO L87 Difference]: Start difference. First operand 181 states and 203 transitions. Second operand 13 states. [2018-01-24 17:02:05,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:02:05,890 INFO L93 Difference]: Finished difference Result 200 states and 226 transitions. [2018-01-24 17:02:05,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 17:02:05,891 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2018-01-24 17:02:05,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:02:05,892 INFO L225 Difference]: With dead ends: 200 [2018-01-24 17:02:05,892 INFO L226 Difference]: Without dead ends: 199 [2018-01-24 17:02:05,893 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 152 SyntacticMatches, 11 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=188, Invalid=742, Unknown=0, NotChecked=0, Total=930 [2018-01-24 17:02:05,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-01-24 17:02:05,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 180. [2018-01-24 17:02:05,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-01-24 17:02:05,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 201 transitions. [2018-01-24 17:02:05,902 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 201 transitions. Word has length 45 [2018-01-24 17:02:05,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:02:05,902 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 201 transitions. [2018-01-24 17:02:05,902 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 17:02:05,902 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 201 transitions. [2018-01-24 17:02:05,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-24 17:02:05,902 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:02:05,902 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:02:05,903 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:02:05,903 INFO L82 PathProgramCache]: Analyzing trace with hash -576633817, now seen corresponding path program 1 times [2018-01-24 17:02:05,903 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:02:05,903 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:02:05,903 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:02:05,904 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:02:05,904 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:02:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:02:05,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:02:06,281 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:02:06,282 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:02:06,282 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:02:06,282 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-01-24 17:02:06,282 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [11], [12], [13], [18], [20], [23], [26], [29], [32], [35], [39], [41], [46], [47], [48], [53], [55], [58], [61], [62], [65], [67], [68], [69], [72], [75], [78], [144], [145], [149], [150], [151] [2018-01-24 17:02:06,283 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:02:06,284 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:02:06,381 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:02:06,381 INFO L268 AbstractInterpreter]: Visited 35 different actions 43 times. Merged at 8 different actions 8 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 32 variables. [2018-01-24 17:02:06,382 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:02:06,382 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:02:06,383 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:02:06,396 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:02:06,397 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:02:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:02:06,431 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:02:06,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 17:02:06,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:06,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:06,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 17:02:06,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 17:02:06,696 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 17:02:06,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:06,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:06,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 17:02:06,767 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 17:02:06,768 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:06,785 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:06,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:06,834 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:40, output treesize:34 [2018-01-24 17:02:06,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-01-24 17:02:06,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:06,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:06,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:31 [2018-01-24 17:02:06,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2018-01-24 17:02:06,998 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 33 treesize of output 32 [2018-01-24 17:02:06,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:07,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:07,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-01-24 17:02:07,044 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 26 treesize of output 25 [2018-01-24 17:02:07,044 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:07,057 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:07,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 17:02:07,066 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:61, output treesize:53 [2018-01-24 17:02:07,102 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 28 [2018-01-24 17:02:07,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-01-24 17:02:07,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:07,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:07,124 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 35 treesize of output 33 [2018-01-24 17:02:07,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-01-24 17:02:07,141 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:07,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-01-24 17:02:07,155 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:07,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2018-01-24 17:02:07,166 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:07,173 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:07,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:02:07,178 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:67, output treesize:19 [2018-01-24 17:02:07,202 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:02:07,202 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:02:07,686 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:02:07,719 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:02:07,727 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 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 15 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:02:07,731 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:02:07,731 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:02:07,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:02:07,800 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:02:07,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 17:02:07,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:07,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 17:02:07,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:07,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:07,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 17:02:07,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 17:02:07,944 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 17:02:07,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:07,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:07,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 17:02:07,954 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 17:02:07,955 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:07,956 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:07,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:07,962 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-01-24 17:02:07,985 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:07,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-24 17:02:07,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:08,012 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:08,013 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:08,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-01-24 17:02:08,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:08,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:02:08,022 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-01-24 17:02:08,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-01-24 17:02:08,096 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 24 treesize of output 23 [2018-01-24 17:02:08,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:08,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:08,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 41 [2018-01-24 17:02:08,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2018-01-24 17:02:08,148 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:08,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-01-24 17:02:08,165 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:08,173 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:08,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-24 17:02:08,200 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:60, output treesize:52 [2018-01-24 17:02:08,249 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 36 treesize of output 34 [2018-01-24 17:02:08,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2018-01-24 17:02:08,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:08,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:08,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-01-24 17:02:08,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-01-24 17:02:08,294 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:08,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-01-24 17:02:08,306 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:08,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-01-24 17:02:08,316 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:08,320 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:08,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:02:08,329 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:66, output treesize:18 [2018-01-24 17:02:08,358 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:02:08,358 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:02:08,556 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:02:08,557 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:02:08,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 9, 8, 8] total 34 [2018-01-24 17:02:08,558 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:02:08,558 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 17:02:08,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 17:02:08,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1047, Unknown=3, NotChecked=0, Total=1190 [2018-01-24 17:02:08,559 INFO L87 Difference]: Start difference. First operand 180 states and 201 transitions. Second operand 17 states. [2018-01-24 17:02:09,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:02:09,173 INFO L93 Difference]: Finished difference Result 262 states and 292 transitions. [2018-01-24 17:02:09,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 17:02:09,173 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 45 [2018-01-24 17:02:09,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:02:09,175 INFO L225 Difference]: With dead ends: 262 [2018-01-24 17:02:09,175 INFO L226 Difference]: Without dead ends: 261 [2018-01-24 17:02:09,176 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=339, Invalid=1550, Unknown=3, NotChecked=0, Total=1892 [2018-01-24 17:02:09,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-01-24 17:02:09,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 160. [2018-01-24 17:02:09,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-01-24 17:02:09,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 179 transitions. [2018-01-24 17:02:09,191 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 179 transitions. Word has length 45 [2018-01-24 17:02:09,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:02:09,191 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 179 transitions. [2018-01-24 17:02:09,191 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 17:02:09,191 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 179 transitions. [2018-01-24 17:02:09,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-24 17:02:09,192 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:02:09,192 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:02:09,192 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:02:09,193 INFO L82 PathProgramCache]: Analyzing trace with hash 2126898235, now seen corresponding path program 1 times [2018-01-24 17:02:09,193 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:02:09,193 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:02:09,194 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:02:09,194 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:02:09,194 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:02:09,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:02:09,207 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:02:09,311 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 17:02:09,312 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:02:09,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 17:02:09,312 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:02:09,312 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 17:02:09,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 17:02:09,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:02:09,313 INFO L87 Difference]: Start difference. First operand 160 states and 179 transitions. Second operand 7 states. [2018-01-24 17:02:09,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:02:09,494 INFO L93 Difference]: Finished difference Result 185 states and 206 transitions. [2018-01-24 17:02:09,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 17:02:09,494 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-01-24 17:02:09,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:02:09,495 INFO L225 Difference]: With dead ends: 185 [2018-01-24 17:02:09,495 INFO L226 Difference]: Without dead ends: 183 [2018-01-24 17:02:09,496 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-01-24 17:02:09,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-01-24 17:02:09,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 138. [2018-01-24 17:02:09,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-24 17:02:09,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 155 transitions. [2018-01-24 17:02:09,506 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 155 transitions. Word has length 46 [2018-01-24 17:02:09,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:02:09,506 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 155 transitions. [2018-01-24 17:02:09,506 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 17:02:09,506 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 155 transitions. [2018-01-24 17:02:09,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-24 17:02:09,507 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:02:09,507 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:02:09,507 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:02:09,507 INFO L82 PathProgramCache]: Analyzing trace with hash 613203071, now seen corresponding path program 1 times [2018-01-24 17:02:09,507 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:02:09,508 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:02:09,508 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:02:09,508 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:02:09,508 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:02:09,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:02:09,522 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:02:09,606 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:02:09,606 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:02:09,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 17:02:09,607 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:02:09,607 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 17:02:09,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 17:02:09,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:02:09,608 INFO L87 Difference]: Start difference. First operand 138 states and 155 transitions. Second operand 8 states. [2018-01-24 17:02:09,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:02:09,804 INFO L93 Difference]: Finished difference Result 169 states and 187 transitions. [2018-01-24 17:02:09,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 17:02:09,805 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-01-24 17:02:09,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:02:09,805 INFO L225 Difference]: With dead ends: 169 [2018-01-24 17:02:09,805 INFO L226 Difference]: Without dead ends: 168 [2018-01-24 17:02:09,806 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-01-24 17:02:09,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-01-24 17:02:09,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 150. [2018-01-24 17:02:09,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-24 17:02:09,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 170 transitions. [2018-01-24 17:02:09,815 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 170 transitions. Word has length 50 [2018-01-24 17:02:09,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:02:09,815 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 170 transitions. [2018-01-24 17:02:09,815 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 17:02:09,815 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 170 transitions. [2018-01-24 17:02:09,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-24 17:02:09,816 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:02:09,816 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:02:09,816 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:02:09,816 INFO L82 PathProgramCache]: Analyzing trace with hash 613203072, now seen corresponding path program 1 times [2018-01-24 17:02:09,816 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:02:09,817 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:02:09,817 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:02:09,817 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:02:09,817 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:02:09,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:02:09,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:02:09,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:02:09,947 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:02:09,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 17:02:09,947 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:02:09,947 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 17:02:09,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 17:02:09,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-24 17:02:09,948 INFO L87 Difference]: Start difference. First operand 150 states and 170 transitions. Second operand 9 states. [2018-01-24 17:02:10,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:02:10,322 INFO L93 Difference]: Finished difference Result 272 states and 308 transitions. [2018-01-24 17:02:10,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 17:02:10,326 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-01-24 17:02:10,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:02:10,328 INFO L225 Difference]: With dead ends: 272 [2018-01-24 17:02:10,328 INFO L226 Difference]: Without dead ends: 271 [2018-01-24 17:02:10,328 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-01-24 17:02:10,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-01-24 17:02:10,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 150. [2018-01-24 17:02:10,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-24 17:02:10,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 169 transitions. [2018-01-24 17:02:10,345 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 169 transitions. Word has length 50 [2018-01-24 17:02:10,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:02:10,346 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 169 transitions. [2018-01-24 17:02:10,346 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 17:02:10,346 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 169 transitions. [2018-01-24 17:02:10,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-24 17:02:10,347 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:02:10,347 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:02:10,347 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:02:10,347 INFO L82 PathProgramCache]: Analyzing trace with hash 877634816, now seen corresponding path program 1 times [2018-01-24 17:02:10,347 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:02:10,348 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:02:10,348 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:02:10,348 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:02:10,348 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:02:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:02:10,361 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:02:10,500 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:02:10,500 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:02:10,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 17:02:10,501 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:02:10,501 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 17:02:10,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 17:02:10,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 17:02:10,501 INFO L87 Difference]: Start difference. First operand 150 states and 169 transitions. Second operand 10 states. [2018-01-24 17:02:10,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:02:10,872 INFO L93 Difference]: Finished difference Result 341 states and 380 transitions. [2018-01-24 17:02:10,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 17:02:10,872 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-01-24 17:02:10,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:02:10,874 INFO L225 Difference]: With dead ends: 341 [2018-01-24 17:02:10,874 INFO L226 Difference]: Without dead ends: 340 [2018-01-24 17:02:10,875 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2018-01-24 17:02:10,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-01-24 17:02:10,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 152. [2018-01-24 17:02:10,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-24 17:02:10,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 172 transitions. [2018-01-24 17:02:10,892 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 172 transitions. Word has length 52 [2018-01-24 17:02:10,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:02:10,892 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 172 transitions. [2018-01-24 17:02:10,892 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 17:02:10,893 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 172 transitions. [2018-01-24 17:02:10,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-24 17:02:10,893 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:02:10,893 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:02:10,893 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:02:10,894 INFO L82 PathProgramCache]: Analyzing trace with hash 877634817, now seen corresponding path program 1 times [2018-01-24 17:02:10,894 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:02:10,894 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:02:10,895 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:02:10,895 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:02:10,895 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:02:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:02:10,906 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:02:10,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 17:02:10,953 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:02:10,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 17:02:10,953 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:02:10,954 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:02:10,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:02:10,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:02:10,954 INFO L87 Difference]: Start difference. First operand 152 states and 172 transitions. Second operand 4 states. [2018-01-24 17:02:11,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:02:11,033 INFO L93 Difference]: Finished difference Result 152 states and 172 transitions. [2018-01-24 17:02:11,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:02:11,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2018-01-24 17:02:11,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:02:11,034 INFO L225 Difference]: With dead ends: 152 [2018-01-24 17:02:11,035 INFO L226 Difference]: Without dead ends: 151 [2018-01-24 17:02:11,035 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:02:11,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-01-24 17:02:11,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-01-24 17:02:11,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-24 17:02:11,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 169 transitions. [2018-01-24 17:02:11,051 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 169 transitions. Word has length 52 [2018-01-24 17:02:11,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:02:11,052 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 169 transitions. [2018-01-24 17:02:11,052 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:02:11,052 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 169 transitions. [2018-01-24 17:02:11,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-24 17:02:11,052 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:02:11,053 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:02:11,053 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 17:02:11,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1507118755, now seen corresponding path program 1 times [2018-01-24 17:02:11,053 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:02:11,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:02:11,054 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:02:11,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:02:11,055 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:02:11,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:02:11,070 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:02:11,718 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:02:11,719 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:02:11,719 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:02:11,719 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-01-24 17:02:11,719 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [12], [13], [18], [20], [23], [26], [29], [32], [35], [39], [41], [44], [84], [86], [87], [90], [93], [100], [106], [107], [110], [111], [114], [118], [124], [126], [144], [145], [149], [150], [151] [2018-01-24 17:02:11,721 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:02:11,721 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:02:12,146 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:02:12,146 INFO L268 AbstractInterpreter]: Visited 36 different actions 116 times. Merged at 30 different actions 76 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 36 variables. [2018-01-24 17:02:12,165 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:02:12,166 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:02:12,166 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:02:12,173 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:02:12,173 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:02:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:02:12,214 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:02:12,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 17:02:12,279 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 17:02:12,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:12,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:12,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 17:02:12,301 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 17:02:12,302 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:12,303 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:12,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:12,324 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-01-24 17:02:12,335 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 26 treesize of output 21 [2018-01-24 17:02:12,350 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:12,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-24 17:02:12,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:12,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:12,366 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 26 treesize of output 21 [2018-01-24 17:02:12,370 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:12,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-24 17:02:12,371 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:12,375 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:12,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:12,384 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:59, output treesize:41 [2018-01-24 17:02:12,416 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 36 treesize of output 29 [2018-01-24 17:02:12,419 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:12,420 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:12,421 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:12,423 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-01-24 17:02:12,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:12,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:12,441 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 36 treesize of output 29 [2018-01-24 17:02:12,443 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:12,444 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:12,444 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:12,446 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-01-24 17:02:12,446 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:12,451 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:12,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:12,459 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:79, output treesize:41 [2018-01-24 17:02:12,486 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:12,487 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:12,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 17:02:12,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:12,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:12,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:46 [2018-01-24 17:02:12,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-01-24 17:02:12,564 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 17:02:12,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:12,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:12,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-01-24 17:02:12,593 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 17:02:12,593 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:12,599 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:12,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:12,614 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:69 [2018-01-24 17:02:12,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-01-24 17:02:12,660 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:12,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-01-24 17:02:12,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:12,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:12,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-01-24 17:02:12,699 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:12,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-01-24 17:02:12,700 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:12,708 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:12,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:12,727 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:95, output treesize:87 [2018-01-24 17:02:12,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-01-24 17:02:12,822 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:12,823 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:12,823 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:12,824 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:02:12,824 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 55 [2018-01-24 17:02:12,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:12,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:12,871 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:12,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 46 treesize of output 52 [2018-01-24 17:02:12,878 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:12,879 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:12,880 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:12,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 54 [2018-01-24 17:02:12,885 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:12,899 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:12,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:12,925 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:112, output treesize:104 [2018-01-24 17:02:12,990 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:12,992 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:12,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 55 treesize of output 67 [2018-01-24 17:02:12,998 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:12,999 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:13,001 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:13,002 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:13,004 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:13,007 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:13,047 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 106 [2018-01-24 17:02:13,048 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 17:02:13,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:13,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 50 [2018-01-24 17:02:13,177 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:13,178 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:13,179 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:13,180 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:13,181 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:13,181 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:13,182 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:02:13,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 90 [2018-01-24 17:02:13,183 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:13,200 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:13,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:13,229 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:130, output treesize:122 [2018-01-24 17:02:13,289 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:13,291 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:13,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 70 treesize of output 86 [2018-01-24 17:02:13,298 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:13,300 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:13,301 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:13,303 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:13,304 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:13,305 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:13,307 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:13,308 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:13,310 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:13,312 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:13,341 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 136 [2018-01-24 17:02:13,342 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 17:02:13,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:13,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 63 [2018-01-24 17:02:13,439 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:13,440 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:13,441 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:13,441 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:13,442 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:13,443 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:13,443 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:13,444 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:13,445 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:13,446 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:13,446 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:02:13,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 120 [2018-01-24 17:02:13,451 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:13,484 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:13,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:13,518 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:160, output treesize:122 [2018-01-24 17:02:13,524 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:13,527 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:13,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 64 treesize of output 78 [2018-01-24 17:02:13,535 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:13,567 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 93 [2018-01-24 17:02:13,571 INFO L267 ElimStorePlain]: Start of recursive call 3: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 14 xjuncts. [2018-01-24 17:02:13,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 17:02:13,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 61 [2018-01-24 17:02:13,720 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:13,722 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:02:13,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 35 [2018-01-24 17:02:13,723 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:13,736 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:13,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-24 17:02:13,797 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:148, output treesize:417 [2018-01-24 17:02:14,063 WARN L146 SmtUtils]: Spent 226ms on a formula simplification. DAG size of input: 67 DAG size of output 67 [2018-01-24 17:02:14,082 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:14,084 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:14,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 337 treesize of output 322 [2018-01-24 17:02:14,102 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:14,103 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:14,104 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:14,106 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:14,107 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:14,108 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:14,119 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:14,134 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 108 treesize of output 292 [2018-01-24 17:02:14,136 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-24 17:02:14,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-24 17:02:14,729 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:14,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 315 treesize of output 290 [2018-01-24 17:02:14,734 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:14,735 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:14,736 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:14,736 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:14,737 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:14,738 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:14,738 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:02:14,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 232 [2018-01-24 17:02:14,739 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:14,784 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:15,180 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:15,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 324 treesize of output 293 [2018-01-24 17:02:15,188 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:15,189 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:15,190 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:15,191 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:15,192 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:15,193 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:15,193 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:02:15,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 243 [2018-01-24 17:02:15,199 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:15,247 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:15,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 320 treesize of output 279 [2018-01-24 17:02:15,255 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:15,256 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:15,257 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:15,257 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:15,258 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:15,259 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:15,259 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:02:15,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 243 [2018-01-24 17:02:15,264 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:15,308 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:15,311 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:15,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 325 treesize of output 294 [2018-01-24 17:02:15,318 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:15,319 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:15,320 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:15,321 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:15,321 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:15,322 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:15,322 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:02:15,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 243 [2018-01-24 17:02:15,327 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:15,375 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:15,711 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:15,713 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:15,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 275 treesize of output 260 [2018-01-24 17:02:15,720 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:15,723 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:15,724 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:15,725 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:15,725 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:15,726 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:15,727 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:15,735 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:15,752 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 108 treesize of output 319 [2018-01-24 17:02:15,753 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-24 17:02:15,847 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-24 17:02:16,254 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:16,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 285 treesize of output 270 [2018-01-24 17:02:16,258 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:16,259 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:16,260 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:16,260 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:16,261 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:16,262 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:16,262 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:02:16,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 224 [2018-01-24 17:02:16,263 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:16,308 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:16,650 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:16,651 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:16,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 249 treesize of output 244 [2018-01-24 17:02:16,656 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:16,662 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:16,663 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:16,664 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:16,664 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:16,665 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:16,666 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:16,675 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:16,691 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 102 treesize of output 299 [2018-01-24 17:02:16,693 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-24 17:02:16,787 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-24 17:02:17,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 9 dim-0 vars, and 9 xjuncts. [2018-01-24 17:02:17,225 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:938, output treesize:2413 [2018-01-24 17:02:18,604 WARN L146 SmtUtils]: Spent 1267ms on a formula simplification. DAG size of input: 235 DAG size of output 130 [2018-01-24 17:02:18,786 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:18,787 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:18,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 307 treesize of output 264 [2018-01-24 17:02:18,795 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:18,830 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 163 treesize of output 278 [2018-01-24 17:02:18,830 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-01-24 17:02:18,840 INFO L267 ElimStorePlain]: Start of recursive call 3: 12 dim-0 vars, End of recursive call: 12 dim-0 vars, and 15 xjuncts. [2018-01-24 17:02:19,007 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:19,008 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:19,008 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:19,009 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:19,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 218 treesize of output 260 [2018-01-24 17:02:19,019 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 17:02:19,022 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:19,023 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:19,024 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:19,024 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:19,027 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 214 [2018-01-24 17:02:19,028 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:02:19,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-01-24 17:02:19,336 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 171 treesize of output 135 [2018-01-24 17:02:19,339 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:19,339 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:19,340 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:19,341 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:19,342 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:19,342 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:19,343 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:02:19,346 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 109 [2018-01-24 17:02:19,346 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:19,372 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:19,372 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:19,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2018-01-24 17:02:19,373 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:19,384 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:19,387 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 197 treesize of output 155 [2018-01-24 17:02:19,390 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:19,391 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:19,391 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:19,392 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:19,394 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:19,395 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:19,395 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:02:19,398 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 109 [2018-01-24 17:02:19,399 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:19,428 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:19,429 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:19,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 46 [2018-01-24 17:02:19,429 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:19,443 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:19,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 189 treesize of output 149 [2018-01-24 17:02:19,448 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:19,449 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:19,450 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:19,451 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:19,451 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:19,452 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:19,453 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 17:02:19,456 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 109 [2018-01-24 17:02:19,456 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:19,486 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:19,487 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:19,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 40 [2018-01-24 17:02:19,487 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-24 17:02:19,500 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:02:19,635 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:19,636 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:19,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 278 treesize of output 237 [2018-01-24 17:02:19,639 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:19,642 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:19,656 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 160 treesize of output 208 [2018-01-24 17:02:19,659 INFO L267 ElimStorePlain]: Start of recursive call 16: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 7 xjuncts. [2018-01-24 17:02:19,724 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:19,725 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:19,725 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:19,726 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:02:19,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 215 [2018-01-24 17:02:19,730 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 17:02:19,758 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. Received shutdown request... [2018-01-24 17:02:19,822 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 17:02:19,822 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 17:02:19,826 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 17:02:19,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 05:02:19 BoogieIcfgContainer [2018-01-24 17:02:19,827 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 17:02:19,827 INFO L168 Benchmark]: Toolchain (without parser) took 46793.93 ms. Allocated memory was 305.1 MB in the beginning and 751.3 MB in the end (delta: 446.2 MB). Free memory was 265.2 MB in the beginning and 641.7 MB in the end (delta: -376.5 MB). Peak memory consumption was 386.9 MB. Max. memory is 5.3 GB. [2018-01-24 17:02:19,828 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 305.1 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 17:02:19,828 INFO L168 Benchmark]: CACSL2BoogieTranslator took 233.15 ms. Allocated memory is still 305.1 MB. Free memory was 264.2 MB in the beginning and 253.2 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:02:19,828 INFO L168 Benchmark]: Boogie Preprocessor took 36.91 ms. Allocated memory is still 305.1 MB. Free memory was 253.2 MB in the beginning and 251.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:02:19,829 INFO L168 Benchmark]: RCFGBuilder took 440.09 ms. Allocated memory is still 305.1 MB. Free memory was 251.2 MB in the beginning and 223.6 MB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 5.3 GB. [2018-01-24 17:02:19,829 INFO L168 Benchmark]: TraceAbstraction took 46075.74 ms. Allocated memory was 305.1 MB in the beginning and 751.3 MB in the end (delta: 446.2 MB). Free memory was 223.6 MB in the beginning and 641.7 MB in the end (delta: -418.1 MB). Peak memory consumption was 345.3 MB. Max. memory is 5.3 GB. [2018-01-24 17:02:19,830 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 305.1 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 233.15 ms. Allocated memory is still 305.1 MB. Free memory was 264.2 MB in the beginning and 253.2 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.91 ms. Allocated memory is still 305.1 MB. Free memory was 253.2 MB in the beginning and 251.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 440.09 ms. Allocated memory is still 305.1 MB. Free memory was 251.2 MB in the beginning and 223.6 MB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 46075.74 ms. Allocated memory was 305.1 MB in the beginning and 751.3 MB in the end (delta: 446.2 MB). Free memory was 223.6 MB in the beginning and 641.7 MB in the end (delta: -418.1 MB). Peak memory consumption was 345.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 31 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 280 LocStat_NO_SUPPORTING_DISEQUALITIES : 42 LocStat_NO_DISJUNCTIONS : -62 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 37 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 83 TransStat_NO_SUPPORTING_DISEQUALITIES : 12 TransStat_NO_DISJUNCTIONS : 42 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2.536283 RENAME_VARIABLES(MILLISECONDS) : 0.862142 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.579904 PROJECTAWAY(MILLISECONDS) : 0.433175 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.002680 DISJOIN(MILLISECONDS) : 0.773268 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.916461 ADD_EQUALITY(MILLISECONDS) : 0.020867 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.021826 #CONJOIN_DISJUNCTIVE : 128 #RENAME_VARIABLES : 236 #UNFREEZE : 0 #CONJOIN : 242 #PROJECTAWAY : 151 #ADD_WEAK_EQUALITY : 34 #DISJOIN : 23 #RENAME_VARIABLES_DISJUNCTIVE : 215 #ADD_EQUALITY : 94 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 33 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 294 LocStat_NO_SUPPORTING_DISEQUALITIES : 42 LocStat_NO_DISJUNCTIONS : -66 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 39 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 86 TransStat_NO_SUPPORTING_DISEQUALITIES : 12 TransStat_NO_DISJUNCTIONS : 44 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2.020906 RENAME_VARIABLES(MILLISECONDS) : 0.627320 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.413269 PROJECTAWAY(MILLISECONDS) : 0.344131 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.002430 DISJOIN(MILLISECONDS) : 0.604212 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.671247 ADD_EQUALITY(MILLISECONDS) : 0.024095 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.013146 #CONJOIN_DISJUNCTIVE : 138 #RENAME_VARIABLES : 254 #UNFREEZE : 0 #CONJOIN : 252 #PROJECTAWAY : 161 #ADD_WEAK_EQUALITY : 34 #DISJOIN : 23 #RENAME_VARIABLES_DISJUNCTIVE : 233 #ADD_EQUALITY : 97 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 23 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 248 LocStat_NO_SUPPORTING_DISEQUALITIES : 50 LocStat_NO_DISJUNCTIONS : -46 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 52 TransStat_NO_SUPPORTING_DISEQUALITIES : 10 TransStat_NO_DISJUNCTIONS : 30 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.317562 RENAME_VARIABLES(MILLISECONDS) : 0.185088 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.298438 PROJECTAWAY(MILLISECONDS) : 0.063050 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001025 DISJOIN(MILLISECONDS) : 0.426543 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.206229 ADD_EQUALITY(MILLISECONDS) : 0.012952 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012351 #CONJOIN_DISJUNCTIVE : 75 #RENAME_VARIABLES : 129 #UNFREEZE : 0 #CONJOIN : 142 #PROJECTAWAY : 88 #ADD_WEAK_EQUALITY : 33 #DISJOIN : 16 #RENAME_VARIABLES_DISJUNCTIVE : 123 #ADD_EQUALITY : 73 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 7 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 23 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 248 LocStat_NO_SUPPORTING_DISEQUALITIES : 49 LocStat_NO_DISJUNCTIONS : -46 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 54 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 31 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.974967 RENAME_VARIABLES(MILLISECONDS) : 0.239272 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.442382 PROJECTAWAY(MILLISECONDS) : 0.067673 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000974 DISJOIN(MILLISECONDS) : 0.357091 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.269074 ADD_EQUALITY(MILLISECONDS) : 0.013235 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.004402 #CONJOIN_DISJUNCTIVE : 75 #RENAME_VARIABLES : 130 #UNFREEZE : 0 #CONJOIN : 143 #PROJECTAWAY : 90 #ADD_WEAK_EQUALITY : 33 #DISJOIN : 17 #RENAME_VARIABLES_DISJUNCTIVE : 123 #ADD_EQUALITY : 75 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 38 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 437 LocStat_NO_SUPPORTING_DISEQUALITIES : 89 LocStat_NO_DISJUNCTIONS : -76 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 44 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 87 TransStat_NO_SUPPORTING_DISEQUALITIES : 16 TransStat_NO_DISJUNCTIONS : 48 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.463898 RENAME_VARIABLES(MILLISECONDS) : 0.308314 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.429147 PROJECTAWAY(MILLISECONDS) : 0.290625 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001485 DISJOIN(MILLISECONDS) : 0.546494 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.337292 ADD_EQUALITY(MILLISECONDS) : 0.008378 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006686 #CONJOIN_DISJUNCTIVE : 228 #RENAME_VARIABLES : 426 #UNFREEZE : 0 #CONJOIN : 355 #PROJECTAWAY : 250 #ADD_WEAK_EQUALITY : 65 #DISJOIN : 7 #RENAME_VARIABLES_DISJUNCTIVE : 407 #ADD_EQUALITY : 127 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 10 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 34 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 496 LocStat_NO_SUPPORTING_DISEQUALITIES : 122 LocStat_NO_DISJUNCTIONS : -68 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 39 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 73 TransStat_NO_SUPPORTING_DISEQUALITIES : 15 TransStat_NO_DISJUNCTIONS : 41 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.809423 RENAME_VARIABLES(MILLISECONDS) : 0.372957 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.769725 PROJECTAWAY(MILLISECONDS) : 0.404109 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000827 DISJOIN(MILLISECONDS) : 0.596960 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.409413 ADD_EQUALITY(MILLISECONDS) : 0.011642 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.018770 #CONJOIN_DISJUNCTIVE : 77 #RENAME_VARIABLES : 113 #UNFREEZE : 0 #CONJOIN : 182 #PROJECTAWAY : 95 #ADD_WEAK_EQUALITY : 65 #DISJOIN : 8 #RENAME_VARIABLES_DISJUNCTIVE : 109 #ADD_EQUALITY : 115 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 9 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 34 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 496 LocStat_NO_SUPPORTING_DISEQUALITIES : 119 LocStat_NO_DISJUNCTIONS : -68 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 39 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 75 TransStat_NO_SUPPORTING_DISEQUALITIES : 14 TransStat_NO_DISJUNCTIONS : 42 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.456724 RENAME_VARIABLES(MILLISECONDS) : 0.202863 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.439645 PROJECTAWAY(MILLISECONDS) : 0.215062 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000693 DISJOIN(MILLISECONDS) : 0.631352 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.224093 ADD_EQUALITY(MILLISECONDS) : 0.007960 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.005461 #CONJOIN_DISJUNCTIVE : 77 #RENAME_VARIABLES : 114 #UNFREEZE : 0 #CONJOIN : 183 #PROJECTAWAY : 97 #ADD_WEAK_EQUALITY : 65 #DISJOIN : 9 #RENAME_VARIABLES_DISJUNCTIVE : 109 #ADD_EQUALITY : 117 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 8 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 34 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 311 LocStat_NO_SUPPORTING_DISEQUALITIES : 50 LocStat_NO_DISJUNCTIONS : -68 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 40 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 79 TransStat_NO_SUPPORTING_DISEQUALITIES : 14 TransStat_NO_DISJUNCTIONS : 44 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.489530 RENAME_VARIABLES(MILLISECONDS) : 0.373635 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.459860 PROJECTAWAY(MILLISECONDS) : 0.295380 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000193 DISJOIN(MILLISECONDS) : 0.624936 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.406764 ADD_EQUALITY(MILLISECONDS) : 0.013501 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.016664 #CONJOIN_DISJUNCTIVE : 195 #RENAME_VARIABLES : 367 #UNFREEZE : 0 #CONJOIN : 304 #PROJECTAWAY : 214 #ADD_WEAK_EQUALITY : 45 #DISJOIN : 8 #RENAME_VARIABLES_DISJUNCTIVE : 345 #ADD_EQUALITY : 104 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 11 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 132. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 132. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 132. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 132. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 132. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 132. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 132. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 132. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 132. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 132. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 132. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 132. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 132. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 132. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 132. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 132. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 132. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 132. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 132. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 670). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 132. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 132. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 132. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 132. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 132. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 132. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 132. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 132. - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 132. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 132. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 132. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 132. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 132. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 132. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 132. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 132. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 670). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 132. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 132. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 132. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 132. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 94 locations, 39 error locations. TIMEOUT Result, 46.0s OverallTime, 29 OverallIterations, 3 TraceHistogramMax, 10.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1800 SDtfs, 4911 SDslu, 5038 SDs, 0 SdLazy, 4362 SolverSat, 387 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 6.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1391 GetRequests, 989 SyntacticMatches, 55 SemanticMatches, 347 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1848 ImplicationChecksByTransitivity, 9.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=181occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.2s AbstIntTime, 8 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 28 MinimizatonAttempts, 1284 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 12.7s SatisfiabilityAnalysisTime, 11.0s InterpolantComputationTime, 1486 NumberOfCodeBlocks, 1486 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1932 ConstructedInterpolants, 198 QuantifiedInterpolants, 676836 SizeOfPredicates, 120 NumberOfNonLiveVariables, 2407 ConjunctsInSsa, 220 ConjunctsInUnsatCore, 54 InterpolantComputations, 21 PerfectInterpolantSequences, 193/391 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/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_17-02-19-846.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_17-02-19-846.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_17-02-19-846.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_17-02-19-846.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_17-02-19-846.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_17-02-19-846.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_17-02-19-846.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-24_17-02-19-846.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-24_17-02-19-846.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-4-2018-01-24_17-02-19-846.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-4-2018-01-24_17-02-19-846.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-5-2018-01-24_17-02-19-846.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-5-2018-01-24_17-02-19-846.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-6-2018-01-24_17-02-19-846.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-6-2018-01-24_17-02-19-846.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-7-2018-01-24_17-02-19-846.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-7-2018-01-24_17-02-19-846.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_17-02-19-846.csv Completed graceful shutdown