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_preciseopt.epf -i ../../../trunk/examples/svcomp/memsafety/20051113-1.c_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 02:54:49,745 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 02:54:49,747 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 02:54:49,761 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 02:54:49,761 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 02:54:49,761 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 02:54:49,762 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 02:54:49,764 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 02:54:49,766 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 02:54:49,766 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 02:54:49,767 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 02:54:49,767 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 02:54:49,768 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 02:54:49,768 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 02:54:49,769 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 02:54:49,771 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 02:54:49,773 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 02:54:49,775 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 02:54:49,777 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 02:54:49,778 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 02:54:49,781 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 02:54:49,781 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 02:54:49,781 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 02:54:49,782 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 02:54:49,783 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 02:54:49,784 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 02:54:49,785 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 02:54:49,785 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 02:54:49,786 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 02:54:49,786 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 02:54:49,786 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 02:54:49,787 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_preciseopt.epf [2018-01-25 02:54:49,844 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 02:54:49,844 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 02:54:49,845 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 02:54:49,845 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 02:54:49,845 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 02:54:49,845 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 02:54:49,846 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 02:54:49,846 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 02:54:49,846 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 02:54:49,847 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 02:54:49,847 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 02:54:49,847 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 02:54:49,847 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 02:54:49,848 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 02:54:49,848 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 02:54:49,848 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 02:54:49,848 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 02:54:49,848 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 02:54:49,849 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 02:54:49,849 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 02:54:49,849 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 02:54:49,849 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 02:54:49,849 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 02:54:49,850 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 02:54:49,850 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 02:54:49,850 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:54:49,850 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 02:54:49,850 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 02:54:49,851 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 02:54:49,851 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 02:54:49,851 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 02:54:49,851 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 02:54:49,851 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 02:54:49,852 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 02:54:49,852 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 02:54:49,853 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 02:54:49,853 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 02:54:49,888 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 02:54:49,903 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 02:54:49,910 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 02:54:49,913 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 02:54:49,914 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 02:54:49,915 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/20051113-1.c_false-valid-memtrack.i [2018-01-25 02:54:50,098 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 02:54:50,106 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 02:54:50,107 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 02:54:50,108 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 02:54:50,114 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 02:54:50,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:54:50" (1/1) ... [2018-01-25 02:54:50,117 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24f959c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:54:50, skipping insertion in model container [2018-01-25 02:54:50,117 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:54:50" (1/1) ... [2018-01-25 02:54:50,134 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:54:50,175 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:54:50,303 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:54:50,331 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:54:50,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:54:50 WrapperNode [2018-01-25 02:54:50,338 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 02:54:50,339 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 02:54:50,339 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 02:54:50,340 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 02:54:50,351 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:54:50" (1/1) ... [2018-01-25 02:54:50,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:54:50" (1/1) ... [2018-01-25 02:54:50,363 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:54:50" (1/1) ... [2018-01-25 02:54:50,363 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:54:50" (1/1) ... [2018-01-25 02:54:50,367 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:54:50" (1/1) ... [2018-01-25 02:54:50,370 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:54:50" (1/1) ... [2018-01-25 02:54:50,371 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:54:50" (1/1) ... [2018-01-25 02:54:50,373 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 02:54:50,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 02:54:50,373 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 02:54:50,373 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 02:54:50,374 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:54:50" (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-25 02:54:50,461 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 02:54:50,461 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 02:54:50,462 INFO L136 BoogieDeclarations]: Found implementation of procedure Sum [2018-01-25 02:54:50,462 INFO L136 BoogieDeclarations]: Found implementation of procedure Sum2 [2018-01-25 02:54:50,462 INFO L136 BoogieDeclarations]: Found implementation of procedure dummy_abort [2018-01-25 02:54:50,462 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 02:54:50,462 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 02:54:50,462 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 02:54:50,463 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 02:54:50,463 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 02:54:50,463 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 02:54:50,463 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-25 02:54:50,463 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-25 02:54:50,463 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-25 02:54:50,464 INFO L128 BoogieDeclarations]: Found specification of procedure Sum [2018-01-25 02:54:50,464 INFO L128 BoogieDeclarations]: Found specification of procedure Sum2 [2018-01-25 02:54:50,464 INFO L128 BoogieDeclarations]: Found specification of procedure dummy_abort [2018-01-25 02:54:50,464 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 02:54:50,464 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 02:54:50,464 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 02:54:50,621 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-25 02:54:50,874 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 02:54:50,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:54:50 BoogieIcfgContainer [2018-01-25 02:54:50,875 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 02:54:50,876 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 02:54:50,876 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 02:54:50,878 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 02:54:50,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 02:54:50" (1/3) ... [2018-01-25 02:54:50,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b9b0d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:54:50, skipping insertion in model container [2018-01-25 02:54:50,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:54:50" (2/3) ... [2018-01-25 02:54:50,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b9b0d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:54:50, skipping insertion in model container [2018-01-25 02:54:50,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:54:50" (3/3) ... [2018-01-25 02:54:50,882 INFO L105 eAbstractionObserver]: Analyzing ICFG 20051113-1.c_false-valid-memtrack.i [2018-01-25 02:54:50,889 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 02:54:50,942 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 25 error locations. [2018-01-25 02:54:50,985 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 02:54:50,985 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 02:54:50,985 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 02:54:50,985 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 02:54:50,985 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 02:54:50,986 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 02:54:50,986 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 02:54:50,986 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 02:54:50,987 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 02:54:51,010 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2018-01-25 02:54:51,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-25 02:54:51,017 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:54:51,018 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:54:51,019 INFO L371 AbstractCegarLoop]: === Iteration 1 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 02:54:51,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1274877597, now seen corresponding path program 1 times [2018-01-25 02:54:51,027 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:54:51,090 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:54:51,090 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:54:51,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:54:51,091 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:54:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:54:51,156 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:54:51,242 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-25 02:54:51,244 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:54:51,244 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:54:51,245 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:54:51,248 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:54:51,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:54:51,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:54:51,261 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 4 states. [2018-01-25 02:54:51,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:54:51,590 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2018-01-25 02:54:51,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:54:51,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-25 02:54:51,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:54:51,601 INFO L225 Difference]: With dead ends: 111 [2018-01-25 02:54:51,601 INFO L226 Difference]: Without dead ends: 69 [2018-01-25 02:54:51,604 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-25 02:54:51,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-25 02:54:51,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-01-25 02:54:51,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-25 02:54:51,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2018-01-25 02:54:51,648 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 8 [2018-01-25 02:54:51,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:54:51,648 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2018-01-25 02:54:51,648 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:54:51,649 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2018-01-25 02:54:51,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-25 02:54:51,649 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:54:51,649 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:54:51,649 INFO L371 AbstractCegarLoop]: === Iteration 2 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 02:54:51,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1274877596, now seen corresponding path program 1 times [2018-01-25 02:54:51,650 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:54:51,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:54:51,651 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:54:51,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:54:51,652 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:54:51,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:54:51,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:54:51,745 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-25 02:54:51,745 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:54:51,745 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:54:51,745 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:54:51,746 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:54:51,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:54:51,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:54:51,747 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 4 states. [2018-01-25 02:54:51,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:54:51,961 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2018-01-25 02:54:51,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:54:51,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-25 02:54:51,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:54:51,963 INFO L225 Difference]: With dead ends: 69 [2018-01-25 02:54:51,963 INFO L226 Difference]: Without dead ends: 61 [2018-01-25 02:54:51,964 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-25 02:54:51,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-25 02:54:51,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-25 02:54:51,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-25 02:54:51,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-01-25 02:54:51,974 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 8 [2018-01-25 02:54:51,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:54:51,975 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-01-25 02:54:51,975 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:54:51,975 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-01-25 02:54:51,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 02:54:51,976 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:54:51,976 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-25 02:54:51,976 INFO L371 AbstractCegarLoop]: === Iteration 3 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 02:54:51,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1852712777, now seen corresponding path program 1 times [2018-01-25 02:54:51,977 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:54:51,977 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:54:51,978 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:54:51,978 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:54:51,978 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:54:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:54:52,004 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:54:52,083 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-25 02:54:52,083 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:54:52,084 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:54:52,084 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:54:52,084 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:54:52,084 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:54:52,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:54:52,085 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 5 states. [2018-01-25 02:54:52,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:54:52,275 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2018-01-25 02:54:52,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:54:52,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-25 02:54:52,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:54:52,277 INFO L225 Difference]: With dead ends: 61 [2018-01-25 02:54:52,277 INFO L226 Difference]: Without dead ends: 59 [2018-01-25 02:54:52,278 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:54:52,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-25 02:54:52,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-25 02:54:52,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-25 02:54:52,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2018-01-25 02:54:52,287 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 25 [2018-01-25 02:54:52,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:54:52,287 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2018-01-25 02:54:52,288 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:54:52,288 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2018-01-25 02:54:52,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 02:54:52,289 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:54:52,289 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-25 02:54:52,289 INFO L371 AbstractCegarLoop]: === Iteration 4 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 02:54:52,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1852712776, now seen corresponding path program 1 times [2018-01-25 02:54:52,289 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:54:52,290 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:54:52,291 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:54:52,291 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:54:52,291 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:54:52,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:54:52,315 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:54:52,470 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-25 02:54:52,470 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:54:52,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:54:52,470 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:54:52,471 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:54:52,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:54:52,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:54:52,471 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand 6 states. [2018-01-25 02:54:52,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:54:52,606 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2018-01-25 02:54:52,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:54:52,606 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-25 02:54:52,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:54:52,607 INFO L225 Difference]: With dead ends: 59 [2018-01-25 02:54:52,607 INFO L226 Difference]: Without dead ends: 58 [2018-01-25 02:54:52,608 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:54:52,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-25 02:54:52,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-01-25 02:54:52,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-25 02:54:52,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2018-01-25 02:54:52,616 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 25 [2018-01-25 02:54:52,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:54:52,616 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2018-01-25 02:54:52,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:54:52,617 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2018-01-25 02:54:52,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 02:54:52,617 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:54:52,617 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] [2018-01-25 02:54:52,618 INFO L371 AbstractCegarLoop]: === Iteration 5 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 02:54:52,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1954449657, now seen corresponding path program 1 times [2018-01-25 02:54:52,618 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:54:52,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:54:52,619 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:54:52,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:54:52,619 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:54:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:54:52,646 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:54:53,027 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-25 02:54:53,027 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:54:53,027 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 02:54:53,027 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:54:53,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 02:54:53,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 02:54:53,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-25 02:54:53,029 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 9 states. [2018-01-25 02:54:53,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:54:53,221 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2018-01-25 02:54:53,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 02:54:53,222 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-01-25 02:54:53,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:54:53,223 INFO L225 Difference]: With dead ends: 93 [2018-01-25 02:54:53,223 INFO L226 Difference]: Without dead ends: 64 [2018-01-25 02:54:53,223 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-01-25 02:54:53,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-25 02:54:53,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-01-25 02:54:53,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-25 02:54:53,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2018-01-25 02:54:53,229 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 27 [2018-01-25 02:54:53,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:54:53,230 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2018-01-25 02:54:53,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 02:54:53,230 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2018-01-25 02:54:53,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 02:54:53,231 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:54:53,231 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] [2018-01-25 02:54:53,231 INFO L371 AbstractCegarLoop]: === Iteration 6 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 02:54:53,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1339860797, now seen corresponding path program 1 times [2018-01-25 02:54:53,231 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:54:53,232 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:54:53,232 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:54:53,232 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:54:53,232 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:54:53,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:54:53,248 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:54:53,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:54:53,429 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:54:53,429 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:54:53,429 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-01-25 02:54:53,431 INFO L201 CegarAbsIntRunner]: [24], [25], [31], [32], [34], [38], [39], [46], [47], [49], [50], [52], [58], [59], [63], [64], [67], [70], [73], [76], [79], [82], [105], [106], [110], [111], [112], [120], [121], [122] [2018-01-25 02:54:53,478 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:54:53,479 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 02:54:55,522 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 02:54:55,524 INFO L268 AbstractInterpreter]: Visited 30 different actions 37 times. Merged at 7 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 19 variables. [2018-01-25 02:54:55,533 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 02:54:55,533 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:54:55,533 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-25 02:54:55,546 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:54:55,546 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:54:55,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:54:55,596 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:54:55,666 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-25 02:54:55,702 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:54:55,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-25 02:54:55,813 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 02:54:55,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [6] total 11 [2018-01-25 02:54:55,813 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:54:55,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:54:55,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:54:55,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-25 02:54:55,815 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 4 states. [2018-01-25 02:54:55,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:54:55,844 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2018-01-25 02:54:55,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:54:55,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-01-25 02:54:55,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:54:55,846 INFO L225 Difference]: With dead ends: 114 [2018-01-25 02:54:55,847 INFO L226 Difference]: Without dead ends: 63 [2018-01-25 02:54:55,847 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-01-25 02:54:55,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-25 02:54:55,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-01-25 02:54:55,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-25 02:54:55,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-01-25 02:54:55,857 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 33 [2018-01-25 02:54:55,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:54:55,857 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-01-25 02:54:55,857 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:54:55,857 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-01-25 02:54:55,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 02:54:55,858 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:54:55,858 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] [2018-01-25 02:54:55,858 INFO L371 AbstractCegarLoop]: === Iteration 7 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 02:54:55,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1619594826, now seen corresponding path program 1 times [2018-01-25 02:54:55,859 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:54:55,860 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:54:55,860 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:54:55,860 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:54:55,860 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:54:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:54:55,882 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:54:56,173 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-25 02:54:56,173 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:54:56,174 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:54:56,174 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-01-25 02:54:56,174 INFO L201 CegarAbsIntRunner]: [24], [25], [29], [31], [32], [34], [38], [39], [46], [47], [49], [50], [52], [58], [59], [63], [64], [67], [70], [73], [76], [79], [82], [105], [106], [110], [111], [112], [120], [121], [122] [2018-01-25 02:54:56,176 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:54:56,176 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 02:55:01,385 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 02:55:01,386 INFO L268 AbstractInterpreter]: Visited 31 different actions 46 times. Merged at 10 different actions 13 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 19 variables. [2018-01-25 02:55:01,400 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 02:55:01,401 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:55:01,401 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 02:55:01,417 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:55:01,418 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:55:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:55:01,448 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:55:01,598 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-25 02:55:01,599 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:55:01,704 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-25 02:55:01,726 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:55:01,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 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 02:55:01,786 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:55:01,787 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:55:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:55:01,864 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:55:01,870 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-25 02:55:01,871 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:55:02,046 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-25 02:55:02,049 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 02:55:02,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 13 [2018-01-25 02:55:02,049 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 02:55:02,050 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 02:55:02,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 02:55:02,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-01-25 02:55:02,050 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 10 states. [2018-01-25 02:55:02,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:55:02,553 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2018-01-25 02:55:02,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 02:55:02,553 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-01-25 02:55:02,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:55:02,555 INFO L225 Difference]: With dead ends: 126 [2018-01-25 02:55:02,555 INFO L226 Difference]: Without dead ends: 75 [2018-01-25 02:55:02,556 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2018-01-25 02:55:02,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-25 02:55:02,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2018-01-25 02:55:02,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-25 02:55:02,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-01-25 02:55:02,569 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 34 [2018-01-25 02:55:02,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:55:02,569 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-01-25 02:55:02,569 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 02:55:02,569 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-01-25 02:55:02,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-25 02:55:02,570 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:55:02,571 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, 1, 1, 1, 1] [2018-01-25 02:55:02,571 INFO L371 AbstractCegarLoop]: === Iteration 8 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 02:55:02,571 INFO L82 PathProgramCache]: Analyzing trace with hash -341936469, now seen corresponding path program 1 times [2018-01-25 02:55:02,571 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:55:02,572 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:55:02,573 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:55:02,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:55:02,573 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:55:02,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:55:02,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:55:02,723 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-25 02:55:02,723 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:55:02,723 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:55:02,723 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:55:02,724 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:55:02,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:55:02,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:55:02,724 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 5 states. [2018-01-25 02:55:02,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:55:02,942 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-01-25 02:55:02,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:55:02,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-01-25 02:55:02,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:55:02,944 INFO L225 Difference]: With dead ends: 70 [2018-01-25 02:55:02,944 INFO L226 Difference]: Without dead ends: 68 [2018-01-25 02:55:02,944 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:55:02,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-25 02:55:02,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-01-25 02:55:02,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-25 02:55:02,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2018-01-25 02:55:02,952 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 42 [2018-01-25 02:55:02,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:55:02,952 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2018-01-25 02:55:02,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:55:02,952 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2018-01-25 02:55:02,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-25 02:55:02,953 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:55:02,953 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, 1, 1, 1, 1] [2018-01-25 02:55:02,953 INFO L371 AbstractCegarLoop]: === Iteration 9 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 02:55:02,953 INFO L82 PathProgramCache]: Analyzing trace with hash -341936468, now seen corresponding path program 1 times [2018-01-25 02:55:02,953 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:55:02,954 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:55:02,954 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:55:02,954 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:55:02,954 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:55:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:55:02,973 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:55:03,178 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-25 02:55:03,178 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:55:03,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:55:03,179 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:55:03,179 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:55:03,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:55:03,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:55:03,180 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 6 states. [2018-01-25 02:55:03,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:55:03,271 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2018-01-25 02:55:03,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:55:03,272 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-01-25 02:55:03,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:55:03,272 INFO L225 Difference]: With dead ends: 68 [2018-01-25 02:55:03,272 INFO L226 Difference]: Without dead ends: 67 [2018-01-25 02:55:03,273 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:55:03,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-25 02:55:03,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-01-25 02:55:03,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-25 02:55:03,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-01-25 02:55:03,278 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 42 [2018-01-25 02:55:03,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:55:03,278 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-01-25 02:55:03,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:55:03,278 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-01-25 02:55:03,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-25 02:55:03,279 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:55:03,279 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:55:03,279 INFO L371 AbstractCegarLoop]: === Iteration 10 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 02:55:03,280 INFO L82 PathProgramCache]: Analyzing trace with hash -614912991, now seen corresponding path program 2 times [2018-01-25 02:55:03,280 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:55:03,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:55:03,280 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:55:03,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:55:03,281 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:55:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:55:03,294 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:55:03,485 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-25 02:55:03,485 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:55:03,485 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:55:03,485 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 02:55:03,485 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 02:55:03,485 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:55:03,485 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 02:55:03,491 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 02:55:03,492 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 02:55:03,507 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 02:55:03,520 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 02:55:03,521 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 02:55:03,524 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:55:03,822 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-25 02:55:03,822 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:55:03,923 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-25 02:55:03,957 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:55:03,958 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 02:55:03,961 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 02:55:03,961 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 02:55:03,986 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 02:55:04,011 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 02:55:04,024 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 02:55:04,030 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:55:04,036 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-25 02:55:04,036 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:55:04,076 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-25 02:55:04,078 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 02:55:04,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6, 6, 6] total 16 [2018-01-25 02:55:04,078 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 02:55:04,079 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 02:55:04,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 02:55:04,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-01-25 02:55:04,079 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 12 states. [2018-01-25 02:55:04,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:55:04,414 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2018-01-25 02:55:04,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 02:55:04,414 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-01-25 02:55:04,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:55:04,415 INFO L225 Difference]: With dead ends: 136 [2018-01-25 02:55:04,415 INFO L226 Difference]: Without dead ends: 82 [2018-01-25 02:55:04,416 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 154 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2018-01-25 02:55:04,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-25 02:55:04,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 74. [2018-01-25 02:55:04,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-25 02:55:04,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-01-25 02:55:04,424 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 41 [2018-01-25 02:55:04,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:55:04,424 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-01-25 02:55:04,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-25 02:55:04,425 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-01-25 02:55:04,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-25 02:55:04,426 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:55:04,426 INFO L322 BasicCegarLoop]: trace histogram [3, 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-25 02:55:04,427 INFO L371 AbstractCegarLoop]: === Iteration 11 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 02:55:04,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1732121728, now seen corresponding path program 1 times [2018-01-25 02:55:04,427 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:55:04,428 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:55:04,428 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 02:55:04,428 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:55:04,428 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:55:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:55:04,446 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:55:04,890 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-25 02:55:04,890 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:55:04,890 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:55:04,890 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-01-25 02:55:04,891 INFO L201 CegarAbsIntRunner]: [0], [4], [5], [12], [15], [24], [25], [29], [31], [32], [34], [38], [39], [44], [46], [47], [50], [52], [56], [57], [58], [59], [63], [64], [67], [70], [73], [76], [79], [82], [91], [105], [106], [110], [111], [112], [113], [116], [120], [121], [122] [2018-01-25 02:55:04,893 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:55:04,893 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 02:55:08,099 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 02:55:08,099 INFO L268 AbstractInterpreter]: Visited 41 different actions 60 times. Merged at 13 different actions 16 times. Never widened. Found 5 fixpoints after 4 different actions. Largest state had 20 variables. [2018-01-25 02:55:08,112 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 02:55:08,113 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:55:08,113 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 02:55:08,120 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:55:08,120 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:55:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:55:08,140 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:55:08,205 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-25 02:55:08,205 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:55:08,290 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-25 02:55:08,311 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:55:08,311 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 02:55:08,316 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:55:08,316 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:55:08,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:55:08,355 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:55:08,360 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-25 02:55:08,360 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:55:08,381 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-25 02:55:08,890 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 02:55:08,890 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7, 7, 7] total 22 [2018-01-25 02:55:08,890 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 02:55:08,890 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-25 02:55:08,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-25 02:55:08,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2018-01-25 02:55:08,891 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 17 states. [2018-01-25 02:55:09,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:55:09,265 INFO L93 Difference]: Finished difference Result 144 states and 160 transitions. [2018-01-25 02:55:09,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 02:55:09,266 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 45 [2018-01-25 02:55:09,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:55:09,267 INFO L225 Difference]: With dead ends: 144 [2018-01-25 02:55:09,267 INFO L226 Difference]: Without dead ends: 84 [2018-01-25 02:55:09,268 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 168 SyntacticMatches, 10 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2018-01-25 02:55:09,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-25 02:55:09,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 79. [2018-01-25 02:55:09,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-25 02:55:09,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2018-01-25 02:55:09,276 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 45 [2018-01-25 02:55:09,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:55:09,276 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2018-01-25 02:55:09,276 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-25 02:55:09,276 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2018-01-25 02:55:09,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-25 02:55:09,277 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:55:09,278 INFO L322 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 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-25 02:55:09,278 INFO L371 AbstractCegarLoop]: === Iteration 12 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 02:55:09,278 INFO L82 PathProgramCache]: Analyzing trace with hash -117713403, now seen corresponding path program 3 times [2018-01-25 02:55:09,278 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:55:09,279 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:55:09,279 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:55:09,279 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:55:09,279 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:55:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:55:09,299 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:55:09,750 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 17 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-25 02:55:09,750 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:55:09,750 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:55:09,751 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 02:55:09,751 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 02:55:09,751 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:55:09,751 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 02:55:09,759 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-25 02:55:09,759 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-25 02:55:09,773 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 02:55:09,784 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 02:55:09,785 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 02:55:09,787 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:55:09,808 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-25 02:55:09,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:55:09,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:09,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 02:55:09,901 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-25 02:55:09,902 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-25 02:55:09,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:55:09,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:09,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:09,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-25 02:55:09,980 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 21 treesize of output 16 [2018-01-25 02:55:09,982 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:09,987 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:09,987 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 16 treesize of output 31 [2018-01-25 02:55:09,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:55:10,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:10,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:10,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-25 02:55:10,058 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-25 02:55:10,062 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,063 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,064 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,065 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,066 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,067 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 78 [2018-01-25 02:55:10,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:55:10,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:10,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:10,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-01-25 02:55:10,256 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-25 02:55:10,263 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,277 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,278 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,279 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,281 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,282 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,283 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,285 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,286 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,288 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,289 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,291 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 149 [2018-01-25 02:55:10,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:55:10,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:10,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:10,375 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2018-01-25 02:55:10,414 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 48 treesize of output 37 [2018-01-25 02:55:10,423 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,425 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,426 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,427 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,428 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,429 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,430 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,432 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,433 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,434 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,435 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,437 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,438 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,439 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,442 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,444 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 206 [2018-01-25 02:55:10,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:55:10,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:10,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:10,635 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2018-01-25 02:55:10,742 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 57 treesize of output 44 [2018-01-25 02:55:10,749 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,750 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,751 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,753 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,778 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,786 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,790 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,793 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,795 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,799 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,800 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,801 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,803 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,808 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,809 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,814 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,816 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,822 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,824 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,825 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,834 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:10,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 253 [2018-01-25 02:55:10,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:55:10,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:11,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:11,036 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:61 [2018-01-25 02:55:11,104 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 66 treesize of output 51 [2018-01-25 02:55:11,125 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,127 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,129 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,131 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,132 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,133 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,134 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,135 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,136 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,138 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,141 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,142 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,144 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,145 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,146 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,147 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,148 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,150 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,151 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,152 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,153 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,154 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,155 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,161 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,164 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,166 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,167 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 27 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 308 [2018-01-25 02:55:11,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:55:11,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:11,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:11,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:74, output treesize:70 [2018-01-25 02:55:11,688 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 69 treesize of output 53 [2018-01-25 02:55:11,721 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,739 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,748 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,749 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,750 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,751 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,752 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,753 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,754 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,755 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,756 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,757 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,758 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,759 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,760 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,761 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,762 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,763 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,764 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,765 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,767 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,768 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,769 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,770 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,771 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,772 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,773 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:11,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 27 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 160 [2018-01-25 02:55:11,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:55:11,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:11,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 02:55:11,818 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:25 [2018-01-25 02:55:11,931 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-25 02:55:11,931 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:55:13,033 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-25 02:55:13,060 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:55:13,060 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 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 10 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 02:55:13,063 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-25 02:55:13,064 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-25 02:55:13,088 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 02:55:13,111 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 02:55:13,134 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 02:55:13,140 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:55:13,143 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-25 02:55:13,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:55:13,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:13,152 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 02:55:13,294 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-25 02:55:13,296 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-25 02:55:13,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:55:13,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:13,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:13,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-25 02:55:13,350 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 21 treesize of output 16 [2018-01-25 02:55:13,354 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:13,354 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:13,355 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 16 treesize of output 31 [2018-01-25 02:55:13,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:55:13,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:13,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:13,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-25 02:55:13,481 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-25 02:55:13,487 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:13,488 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:13,489 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:13,496 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:13,497 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:13,498 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:13,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 78 [2018-01-25 02:55:13,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:55:13,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:13,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:13,583 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-01-25 02:55:13,669 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-25 02:55:13,674 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:13,676 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:13,677 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:13,678 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:13,681 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:13,682 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:13,683 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:13,683 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:13,689 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:13,690 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:13,691 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:13,692 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:13,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 149 [2018-01-25 02:55:13,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:55:13,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:13,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:13,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2018-01-25 02:55:13,852 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 48 treesize of output 37 [2018-01-25 02:55:13,858 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:13,859 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:13,860 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:13,861 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:13,862 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:13,863 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:13,864 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:13,865 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:13,866 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:13,867 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:13,868 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:13,869 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:13,870 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:13,871 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:13,872 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:13,873 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:13,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 206 [2018-01-25 02:55:13,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:55:13,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:13,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:13,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2018-01-25 02:55:13,991 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 57 treesize of output 44 [2018-01-25 02:55:13,995 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:13,997 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:13,998 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:13,999 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:13,999 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,000 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,001 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,002 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,003 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,004 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,005 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,006 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,007 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,008 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,009 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,010 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,011 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,012 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,013 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,014 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,015 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 253 [2018-01-25 02:55:14,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:55:14,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:14,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:14,069 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:61 [2018-01-25 02:55:14,142 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 66 treesize of output 51 [2018-01-25 02:55:14,145 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,146 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,146 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,147 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,148 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,149 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,149 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,150 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,151 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,151 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,152 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,153 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,153 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,154 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,155 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,155 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,156 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,157 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,157 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,158 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,159 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,160 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,160 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,161 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,162 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,163 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,163 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 27 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 308 [2018-01-25 02:55:14,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:55:14,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:14,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:14,218 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:74, output treesize:70 [2018-01-25 02:55:14,598 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 57 treesize of output 41 [2018-01-25 02:55:14,602 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,603 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,604 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,605 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,606 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,607 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:14,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 27 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2018-01-25 02:55:14,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:55:14,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:14,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 02:55:14,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:25 [2018-01-25 02:55:14,739 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-25 02:55:14,739 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:55:15,377 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-25 02:55:15,379 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 02:55:15,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 10, 17, 10] total 54 [2018-01-25 02:55:15,380 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 02:55:15,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-25 02:55:15,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-25 02:55:15,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=2520, Unknown=1, NotChecked=0, Total=2862 [2018-01-25 02:55:15,382 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 30 states. [2018-01-25 02:55:16,787 WARN L146 SmtUtils]: Spent 243ms on a formula simplification. DAG size of input: 85 DAG size of output 73 [2018-01-25 02:55:16,959 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 87 DAG size of output 80 [2018-01-25 02:55:18,178 WARN L146 SmtUtils]: Spent 364ms on a formula simplification. DAG size of input: 90 DAG size of output 75 [2018-01-25 02:55:18,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:55:18,321 INFO L93 Difference]: Finished difference Result 113 states and 126 transitions. [2018-01-25 02:55:18,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-25 02:55:18,321 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 49 [2018-01-25 02:55:18,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:55:18,322 INFO L225 Difference]: With dead ends: 113 [2018-01-25 02:55:18,323 INFO L226 Difference]: Without dead ends: 77 [2018-01-25 02:55:18,324 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 136 SyntacticMatches, 28 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2186 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=795, Invalid=4460, Unknown=1, NotChecked=0, Total=5256 [2018-01-25 02:55:18,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-25 02:55:18,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-01-25 02:55:18,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-25 02:55:18,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2018-01-25 02:55:18,332 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 49 [2018-01-25 02:55:18,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:55:18,333 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2018-01-25 02:55:18,333 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-25 02:55:18,333 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-01-25 02:55:18,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-25 02:55:18,334 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:55:18,334 INFO L322 BasicCegarLoop]: trace histogram [4, 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-25 02:55:18,334 INFO L371 AbstractCegarLoop]: === Iteration 13 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 02:55:18,335 INFO L82 PathProgramCache]: Analyzing trace with hash 2106198684, now seen corresponding path program 1 times [2018-01-25 02:55:18,335 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:55:18,335 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:55:18,336 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 02:55:18,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:55:18,336 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:55:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:55:18,348 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:55:18,396 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-25 02:55:18,397 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:55:18,397 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:55:18,397 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:55:18,397 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:55:18,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:55:18,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:55:18,398 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 5 states. [2018-01-25 02:55:18,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:55:18,424 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2018-01-25 02:55:18,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:55:18,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-01-25 02:55:18,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:55:18,425 INFO L225 Difference]: With dead ends: 86 [2018-01-25 02:55:18,426 INFO L226 Difference]: Without dead ends: 83 [2018-01-25 02:55:18,426 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:55:18,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-25 02:55:18,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-01-25 02:55:18,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-25 02:55:18,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2018-01-25 02:55:18,435 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 52 [2018-01-25 02:55:18,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:55:18,435 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2018-01-25 02:55:18,435 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:55:18,435 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2018-01-25 02:55:18,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-25 02:55:18,437 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:55:18,437 INFO L322 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:55:18,437 INFO L371 AbstractCegarLoop]: === Iteration 14 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 02:55:18,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1604645521, now seen corresponding path program 1 times [2018-01-25 02:55:18,437 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:55:18,438 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:55:18,438 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:55:18,438 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:55:18,438 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:55:18,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:55:18,456 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:55:18,784 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-25 02:55:18,785 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:55:18,785 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:55:18,785 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 53 with the following transitions: [2018-01-25 02:55:18,785 INFO L201 CegarAbsIntRunner]: [0], [4], [5], [12], [13], [15], [16], [18], [24], [25], [29], [31], [32], [34], [38], [39], [44], [46], [47], [50], [52], [56], [57], [58], [59], [63], [64], [67], [70], [73], [76], [79], [82], [91], [105], [106], [110], [111], [112], [113], [116], [120], [121], [122] [2018-01-25 02:55:18,787 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:55:18,787 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 02:55:21,624 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 02:55:21,624 INFO L268 AbstractInterpreter]: Visited 44 different actions 70 times. Merged at 20 different actions 23 times. Never widened. Found 6 fixpoints after 5 different actions. Largest state had 20 variables. [2018-01-25 02:55:21,630 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 02:55:21,630 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:55:21,630 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 02:55:21,639 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:55:21,640 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:55:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:55:21,670 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:55:21,759 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-25 02:55:21,759 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:55:21,899 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-25 02:55:21,934 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:55:21,934 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 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 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 02:55:21,938 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:55:21,938 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:55:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:55:21,997 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:55:22,002 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-25 02:55:22,003 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:55:22,043 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-25 02:55:22,045 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 02:55:22,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8, 8, 8] total 25 [2018-01-25 02:55:22,046 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 02:55:22,046 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-25 02:55:22,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-25 02:55:22,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2018-01-25 02:55:22,047 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 19 states. [2018-01-25 02:55:22,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:55:22,553 INFO L93 Difference]: Finished difference Result 151 states and 166 transitions. [2018-01-25 02:55:22,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-25 02:55:22,553 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 52 [2018-01-25 02:55:22,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:55:22,555 INFO L225 Difference]: With dead ends: 151 [2018-01-25 02:55:22,555 INFO L226 Difference]: Without dead ends: 84 [2018-01-25 02:55:22,556 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 194 SyntacticMatches, 8 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=174, Invalid=882, Unknown=0, NotChecked=0, Total=1056 [2018-01-25 02:55:22,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-25 02:55:22,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2018-01-25 02:55:22,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-25 02:55:22,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-01-25 02:55:22,563 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 52 [2018-01-25 02:55:22,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:55:22,563 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-01-25 02:55:22,564 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-25 02:55:22,564 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-01-25 02:55:22,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-25 02:55:22,564 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:55:22,565 INFO L322 BasicCegarLoop]: trace histogram [5, 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, 1, 1, 1] [2018-01-25 02:55:22,565 INFO L371 AbstractCegarLoop]: === Iteration 15 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 02:55:22,565 INFO L82 PathProgramCache]: Analyzing trace with hash -544800124, now seen corresponding path program 1 times [2018-01-25 02:55:22,565 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:55:22,566 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:55:22,566 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:55:22,566 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:55:22,566 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:55:22,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:55:22,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:55:22,717 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-25 02:55:22,717 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:55:22,717 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:55:22,718 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 57 with the following transitions: [2018-01-25 02:55:22,718 INFO L201 CegarAbsIntRunner]: [0], [4], [5], [10], [22], [23], [24], [25], [29], [31], [32], [33], [34], [38], [39], [44], [46], [47], [50], [52], [56], [57], [58], [59], [63], [64], [67], [70], [73], [76], [79], [82], [91], [94], [97], [102], [104], [105], [106], [110], [111], [112], [113], [116], [117], [118], [119], [120], [121], [122] [2018-01-25 02:55:22,719 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:55:22,719 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 02:55:25,118 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 02:55:25,118 INFO L268 AbstractInterpreter]: Visited 50 different actions 69 times. Merged at 13 different actions 16 times. Never widened. Found 5 fixpoints after 4 different actions. Largest state had 20 variables. [2018-01-25 02:55:25,124 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 02:55:25,124 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:55:25,124 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 02:55:25,138 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:55:25,139 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:55:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:55:25,170 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:55:25,279 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-25 02:55:25,280 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:55:25,427 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-25 02:55:25,448 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:55:25,448 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 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 14 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 02:55:25,451 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:55:25,451 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:55:25,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:55:25,499 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:55:25,503 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-25 02:55:25,504 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:55:25,533 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-25 02:55:25,535 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 02:55:25,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9] total 23 [2018-01-25 02:55:25,535 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 02:55:25,535 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-25 02:55:25,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-25 02:55:25,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2018-01-25 02:55:25,536 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 16 states. [2018-01-25 02:55:25,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:55:25,764 INFO L93 Difference]: Finished difference Result 148 states and 162 transitions. [2018-01-25 02:55:25,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 02:55:25,764 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2018-01-25 02:55:25,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:55:25,765 INFO L225 Difference]: With dead ends: 148 [2018-01-25 02:55:25,765 INFO L226 Difference]: Without dead ends: 80 [2018-01-25 02:55:25,766 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 208 SyntacticMatches, 10 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2018-01-25 02:55:25,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-25 02:55:25,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-01-25 02:55:25,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-25 02:55:25,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-01-25 02:55:25,774 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 56 [2018-01-25 02:55:25,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:55:25,775 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-01-25 02:55:25,775 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-25 02:55:25,775 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-01-25 02:55:25,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-25 02:55:25,776 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:55:25,776 INFO L322 BasicCegarLoop]: trace histogram [6, 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, 1, 1] [2018-01-25 02:55:25,776 INFO L371 AbstractCegarLoop]: === Iteration 16 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 02:55:25,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1454707584, now seen corresponding path program 1 times [2018-01-25 02:55:25,776 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:55:25,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:55:25,777 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:55:25,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:55:25,777 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:55:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:55:25,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:55:26,131 WARN L146 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 23 DAG size of output 19 [2018-01-25 02:55:26,182 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-25 02:55:26,183 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:55:26,183 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:55:26,183 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-01-25 02:55:26,183 INFO L201 CegarAbsIntRunner]: [0], [4], [5], [10], [12], [13], [16], [18], [22], [23], [24], [25], [29], [31], [32], [34], [38], [39], [44], [46], [47], [50], [52], [56], [57], [58], [59], [63], [64], [67], [70], [73], [76], [79], [82], [91], [94], [100], [102], [104], [105], [106], [110], [111], [112], [113], [116], [117], [120], [121], [122] [2018-01-25 02:55:26,185 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:55:26,185 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 02:55:28,605 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 02:55:28,606 INFO L268 AbstractInterpreter]: Visited 51 different actions 82 times. Merged at 24 different actions 27 times. Never widened. Found 6 fixpoints after 5 different actions. Largest state had 20 variables. [2018-01-25 02:55:28,610 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 02:55:28,610 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:55:28,610 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 02:55:28,616 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:55:28,616 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:55:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:55:28,637 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:55:28,696 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-25 02:55:28,696 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:55:28,832 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-25 02:55:28,852 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:55:28,853 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 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 16 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 02:55:28,856 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:55:28,856 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:55:28,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:55:28,902 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:55:28,906 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-25 02:55:28,906 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:55:28,935 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-25 02:55:28,937 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 02:55:28,937 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10, 10, 10] total 25 [2018-01-25 02:55:28,937 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 02:55:28,937 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-25 02:55:28,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-25 02:55:28,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2018-01-25 02:55:28,938 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 17 states. [2018-01-25 02:55:29,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:55:29,146 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2018-01-25 02:55:29,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-25 02:55:29,147 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 60 [2018-01-25 02:55:29,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:55:29,148 INFO L225 Difference]: With dead ends: 150 [2018-01-25 02:55:29,148 INFO L226 Difference]: Without dead ends: 87 [2018-01-25 02:55:29,149 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 222 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=621, Unknown=0, NotChecked=0, Total=812 [2018-01-25 02:55:29,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-25 02:55:29,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2018-01-25 02:55:29,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-25 02:55:29,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2018-01-25 02:55:29,156 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 60 [2018-01-25 02:55:29,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:55:29,156 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2018-01-25 02:55:29,156 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-25 02:55:29,157 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2018-01-25 02:55:29,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-25 02:55:29,157 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:55:29,157 INFO L322 BasicCegarLoop]: trace histogram [7, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:55:29,157 INFO L371 AbstractCegarLoop]: === Iteration 17 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 02:55:29,157 INFO L82 PathProgramCache]: Analyzing trace with hash -374403177, now seen corresponding path program 2 times [2018-01-25 02:55:29,157 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:55:29,158 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:55:29,158 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:55:29,158 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:55:29,158 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:55:29,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:55:29,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:55:29,443 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-01-25 02:55:29,443 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:55:29,444 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:55:29,444 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 02:55:29,444 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 02:55:29,444 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:55:29,444 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 02:55:29,452 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 02:55:29,452 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 02:55:29,472 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 02:55:29,485 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 02:55:29,487 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 02:55:29,490 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:55:29,735 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-25 02:55:29,735 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:55:30,204 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-25 02:55:30,226 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:55:30,226 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 18 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 18 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 02:55:30,229 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 02:55:30,229 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 02:55:30,252 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 02:55:30,302 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 02:55:30,328 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 02:55:30,335 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:55:30,342 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-25 02:55:30,343 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:55:30,450 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-25 02:55:30,452 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 02:55:30,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11, 11, 11] total 28 [2018-01-25 02:55:30,453 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 02:55:30,453 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-25 02:55:30,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-25 02:55:30,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2018-01-25 02:55:30,454 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 19 states. [2018-01-25 02:55:30,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:55:30,822 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2018-01-25 02:55:30,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-25 02:55:30,823 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2018-01-25 02:55:30,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:55:30,823 INFO L225 Difference]: With dead ends: 154 [2018-01-25 02:55:30,823 INFO L226 Difference]: Without dead ends: 85 [2018-01-25 02:55:30,824 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 250 SyntacticMatches, 8 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=229, Invalid=763, Unknown=0, NotChecked=0, Total=992 [2018-01-25 02:55:30,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-25 02:55:30,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-25 02:55:30,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-25 02:55:30,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-01-25 02:55:30,830 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 67 [2018-01-25 02:55:30,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:55:30,830 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-01-25 02:55:30,830 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-25 02:55:30,831 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-01-25 02:55:30,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-25 02:55:30,831 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:55:30,832 INFO L322 BasicCegarLoop]: trace histogram [8, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:55:30,832 INFO L371 AbstractCegarLoop]: === Iteration 18 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 02:55:30,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1696068192, now seen corresponding path program 3 times [2018-01-25 02:55:30,832 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:55:30,833 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:55:30,833 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 02:55:30,833 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:55:30,833 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:55:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:55:30,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:55:31,112 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-01-25 02:55:31,113 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:55:31,113 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:55:31,113 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 02:55:31,113 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 02:55:31,113 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:55:31,113 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 02:55:31,118 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-25 02:55:31,119 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-25 02:55:31,134 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 02:55:31,147 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 02:55:31,159 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 02:55:31,161 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 02:55:31,164 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:55:31,183 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-25 02:55:31,185 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-25 02:55:31,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:55:31,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:31,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:31,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-25 02:55:31,202 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 21 treesize of output 16 [2018-01-25 02:55:31,204 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,204 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,205 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 16 treesize of output 31 [2018-01-25 02:55:31,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:55:31,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:31,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:31,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-25 02:55:31,229 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-25 02:55:31,231 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,232 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,232 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,233 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,234 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,234 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 78 [2018-01-25 02:55:31,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:55:31,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:31,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:31,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-01-25 02:55:31,268 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-25 02:55:31,270 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,271 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,272 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,273 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,273 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,275 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,276 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,276 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,277 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,277 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,278 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,279 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 149 [2018-01-25 02:55:31,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:55:31,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:31,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:31,320 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-01-25 02:55:31,344 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 48 treesize of output 37 [2018-01-25 02:55:31,347 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,348 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,348 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,349 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,349 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,350 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,350 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,351 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,352 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,352 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,353 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,353 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,354 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,355 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,355 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,356 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 206 [2018-01-25 02:55:31,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:55:31,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:31,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:31,393 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-01-25 02:55:31,418 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 57 treesize of output 44 [2018-01-25 02:55:31,420 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,421 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,422 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,422 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,423 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,423 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,424 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,424 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,425 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,425 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,426 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,426 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,427 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,427 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,428 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,428 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,429 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,430 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,430 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,431 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,431 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 253 [2018-01-25 02:55:31,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:55:31,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:31,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:31,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-01-25 02:55:31,500 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 66 treesize of output 51 [2018-01-25 02:55:31,505 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,506 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,506 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,507 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,508 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,508 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,509 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,509 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,510 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,511 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,511 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,512 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,512 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,513 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,513 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,514 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,514 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,515 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,516 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,516 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,517 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,517 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,518 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,519 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,519 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,520 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,520 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:31,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 27 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 308 [2018-01-25 02:55:31,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:55:31,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:31,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:31,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2018-01-25 02:55:31,846 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-25 02:55:31,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:55:31,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:31,847 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:121, output treesize:1 [2018-01-25 02:55:31,864 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-01-25 02:55:31,865 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:55:32,107 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-01-25 02:55:32,140 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:55:32,140 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 20 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 20 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 02:55:32,144 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-25 02:55:32,144 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-25 02:55:32,171 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 02:55:32,220 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 02:55:32,362 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 02:55:32,412 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 02:55:32,420 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:55:32,431 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-25 02:55:32,433 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-25 02:55:32,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:55:32,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:32,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:32,443 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-25 02:55:32,447 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 21 treesize of output 16 [2018-01-25 02:55:32,450 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,450 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,451 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 16 treesize of output 31 [2018-01-25 02:55:32,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:55:32,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:32,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:32,467 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-25 02:55:32,471 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-25 02:55:32,476 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,480 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,486 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,489 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,496 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,504 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,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, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 78 [2018-01-25 02:55:32,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:55:32,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:32,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:32,583 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-01-25 02:55:32,586 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-25 02:55:32,593 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,594 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,595 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,596 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,596 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,597 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,598 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,602 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,604 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,605 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,606 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,607 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 149 [2018-01-25 02:55:32,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:55:32,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:32,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:32,677 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-01-25 02:55:32,681 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 48 treesize of output 37 [2018-01-25 02:55:32,685 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,686 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,687 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,687 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,688 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,692 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,693 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,694 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,695 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,695 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,696 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,697 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,698 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,698 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,699 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,702 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 206 [2018-01-25 02:55:32,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:55:32,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:32,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:32,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-01-25 02:55:32,795 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 57 treesize of output 44 [2018-01-25 02:55:32,807 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,811 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,815 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,819 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,820 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,821 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,821 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,822 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,823 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,824 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,825 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,825 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,826 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,827 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,828 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,828 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,829 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,830 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,831 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,832 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,833 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 253 [2018-01-25 02:55:32,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:55:32,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:32,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:32,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-01-25 02:55:32,958 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 66 treesize of output 51 [2018-01-25 02:55:32,966 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,974 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,982 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,983 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,984 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,984 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,987 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,988 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,989 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,989 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,990 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,991 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,992 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:32,993 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:33,001 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:33,003 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:33,004 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:33,004 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:33,005 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:33,006 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:33,006 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:33,007 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:33,008 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:33,009 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:33,010 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:33,010 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:33,011 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 02:55:33,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 27 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 308 [2018-01-25 02:55:33,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:55:33,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:33,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:55:33,126 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2018-01-25 02:55:33,691 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-01-25 02:55:33,691 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:55:33,973 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-01-25 02:55:33,975 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 02:55:33,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 8, 17, 8] total 42 [2018-01-25 02:55:33,975 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 02:55:33,975 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-25 02:55:33,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-25 02:55:33,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1509, Unknown=0, NotChecked=0, Total=1722 [2018-01-25 02:55:33,976 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 28 states. [2018-01-25 02:55:35,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:55:35,120 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-01-25 02:55:35,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-25 02:55:35,121 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 74 [2018-01-25 02:55:35,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:55:35,121 INFO L225 Difference]: With dead ends: 130 [2018-01-25 02:55:35,122 INFO L226 Difference]: Without dead ends: 94 [2018-01-25 02:55:35,123 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 248 SyntacticMatches, 28 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1458 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=476, Invalid=3556, Unknown=0, NotChecked=0, Total=4032 [2018-01-25 02:55:35,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-25 02:55:35,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-01-25 02:55:35,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-25 02:55:35,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-01-25 02:55:35,132 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 74 [2018-01-25 02:55:35,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:55:35,133 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-01-25 02:55:35,133 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-25 02:55:35,133 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-01-25 02:55:35,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-01-25 02:55:35,134 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:55:35,134 INFO L322 BasicCegarLoop]: trace histogram [8, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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-25 02:55:35,134 INFO L371 AbstractCegarLoop]: === Iteration 19 === [Sum2Err2RequiresViolation, Sum2Err0RequiresViolation, Sum2Err1RequiresViolation, Sum2Err3RequiresViolation, SumErr2RequiresViolation, SumErr3RequiresViolation, SumErr1RequiresViolation, SumErr0RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr16EnsuresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 02:55:35,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1151371872, now seen corresponding path program 4 times [2018-01-25 02:55:35,134 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:55:35,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:55:35,135 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 02:55:35,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:55:35,135 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:55:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:55:35,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:55:35,592 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-25 02:55:35,592 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:55:35,592 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:55:35,592 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 02:55:35,593 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 02:55:35,593 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:55:35,593 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 02:55:35,610 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-25 02:55:35,610 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-25 02:55:35,674 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 02:55:35,678 INFO L270 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2018-01-25 02:55:35,761 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 02:55:35,761 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 02:55:35,766 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 02:55:35,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 02:55:35 BoogieIcfgContainer [2018-01-25 02:55:35,767 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 02:55:35,768 INFO L168 Benchmark]: Toolchain (without parser) took 45668.76 ms. Allocated memory was 308.3 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 265.6 MB in the beginning and 533.1 MB in the end (delta: -267.5 MB). Peak memory consumption was 880.7 MB. Max. memory is 5.3 GB. [2018-01-25 02:55:35,769 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 308.3 MB. Free memory is still 271.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 02:55:35,769 INFO L168 Benchmark]: CACSL2BoogieTranslator took 231.48 ms. Allocated memory is still 308.3 MB. Free memory was 265.6 MB in the beginning and 253.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:55:35,769 INFO L168 Benchmark]: Boogie Preprocessor took 33.48 ms. Allocated memory is still 308.3 MB. Free memory was 253.6 MB in the beginning and 251.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:55:35,769 INFO L168 Benchmark]: RCFGBuilder took 502.26 ms. Allocated memory is still 308.3 MB. Free memory was 251.6 MB in the beginning and 229.1 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. [2018-01-25 02:55:35,770 INFO L168 Benchmark]: TraceAbstraction took 44890.99 ms. Allocated memory was 308.3 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 229.1 MB in the beginning and 533.1 MB in the end (delta: -304.0 MB). Peak memory consumption was 844.2 MB. Max. memory is 5.3 GB. [2018-01-25 02:55:35,772 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.21 ms. Allocated memory is still 308.3 MB. Free memory is still 271.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 231.48 ms. Allocated memory is still 308.3 MB. Free memory was 265.6 MB in the beginning and 253.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.48 ms. Allocated memory is still 308.3 MB. Free memory was 253.6 MB in the beginning and 251.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 502.26 ms. Allocated memory is still 308.3 MB. Free memory was 251.6 MB in the beginning and 229.1 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 44890.99 ms. Allocated memory was 308.3 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 229.1 MB in the beginning and 533.1 MB in the end (delta: -304.0 MB). Peak memory consumption was 844.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 29 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 258 LocStat_NO_SUPPORTING_DISEQUALITIES : 53 LocStat_NO_DISJUNCTIONS : -58 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 38 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 62 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 39 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.314600 RENAME_VARIABLES(MILLISECONDS) : 0.377000 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.253384 PROJECTAWAY(MILLISECONDS) : 0.302887 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.887516 DISJOIN(MILLISECONDS) : 2.425058 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.413054 ADD_EQUALITY(MILLISECONDS) : 0.043711 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.040693 #CONJOIN_DISJUNCTIVE : 59 #RENAME_VARIABLES : 90 #UNFREEZE : 0 #CONJOIN : 115 #PROJECTAWAY : 87 #ADD_WEAK_EQUALITY : 17 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 88 #ADD_EQUALITY : 69 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 29 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 261 LocStat_NO_SUPPORTING_DISEQUALITIES : 53 LocStat_NO_DISJUNCTIONS : -58 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 39 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 64 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 40 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.023656 RENAME_VARIABLES(MILLISECONDS) : 0.246466 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.968428 PROJECTAWAY(MILLISECONDS) : 0.227906 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.041620 DISJOIN(MILLISECONDS) : 0.464979 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.265768 ADD_EQUALITY(MILLISECONDS) : 0.043547 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011549 #CONJOIN_DISJUNCTIVE : 77 #RENAME_VARIABLES : 136 #UNFREEZE : 0 #CONJOIN : 151 #PROJECTAWAY : 121 #ADD_WEAK_EQUALITY : 19 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 134 #ADD_EQUALITY : 72 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 39 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 366 LocStat_NO_SUPPORTING_DISEQUALITIES : 73 LocStat_NO_DISJUNCTIONS : -78 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 51 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 76 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 52 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.831285 RENAME_VARIABLES(MILLISECONDS) : 0.192043 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.787005 PROJECTAWAY(MILLISECONDS) : 0.207256 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.028357 DISJOIN(MILLISECONDS) : 0.346486 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.222867 ADD_EQUALITY(MILLISECONDS) : 0.011791 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007494 #CONJOIN_DISJUNCTIVE : 94 #RENAME_VARIABLES : 171 #UNFREEZE : 0 #CONJOIN : 181 #PROJECTAWAY : 155 #ADD_WEAK_EQUALITY : 19 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 170 #ADD_EQUALITY : 84 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 41 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 383 LocStat_NO_SUPPORTING_DISEQUALITIES : 77 LocStat_NO_DISJUNCTIONS : -82 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 54 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 80 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 55 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.440771 RENAME_VARIABLES(MILLISECONDS) : 0.148194 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.413998 PROJECTAWAY(MILLISECONDS) : 0.134750 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.037209 DISJOIN(MILLISECONDS) : 0.251471 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.166985 ADD_EQUALITY(MILLISECONDS) : 0.016408 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006785 #CONJOIN_DISJUNCTIVE : 105 #RENAME_VARIABLES : 192 #UNFREEZE : 0 #CONJOIN : 195 #PROJECTAWAY : 169 #ADD_WEAK_EQUALITY : 19 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 190 #ADD_EQUALITY : 88 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 48 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 437 LocStat_NO_SUPPORTING_DISEQUALITIES : 90 LocStat_NO_DISJUNCTIONS : -96 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 62 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 80 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 62 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.313636 RENAME_VARIABLES(MILLISECONDS) : 0.095247 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.278526 PROJECTAWAY(MILLISECONDS) : 0.062831 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.029212 DISJOIN(MILLISECONDS) : 0.195317 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.120469 ADD_EQUALITY(MILLISECONDS) : 0.013325 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009621 #CONJOIN_DISJUNCTIVE : 105 #RENAME_VARIABLES : 196 #UNFREEZE : 0 #CONJOIN : 202 #PROJECTAWAY : 181 #ADD_WEAK_EQUALITY : 19 #DISJOIN : 3 #RENAME_VARIABLES_DISJUNCTIVE : 196 #ADD_EQUALITY : 88 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 48 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 447 LocStat_NO_SUPPORTING_DISEQUALITIES : 92 LocStat_NO_DISJUNCTIONS : -96 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 61 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 85 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 61 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.292917 RENAME_VARIABLES(MILLISECONDS) : 0.101613 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.266452 PROJECTAWAY(MILLISECONDS) : 0.052800 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.036164 DISJOIN(MILLISECONDS) : 0.185010 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.124633 ADD_EQUALITY(MILLISECONDS) : 0.010381 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009833 #CONJOIN_DISJUNCTIVE : 119 #RENAME_VARIABLES : 220 #UNFREEZE : 0 #CONJOIN : 216 #PROJECTAWAY : 192 #ADD_WEAK_EQUALITY : 19 #DISJOIN : 3 #RENAME_VARIABLES_DISJUNCTIVE : 220 #ADD_EQUALITY : 93 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 678). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 670]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 670). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 676). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 676). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 679). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 678). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 679). Cancelled while BasicCegarLoop was analyzing trace of length 87 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 18 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 80 locations, 25 error locations. TIMEOUT Result, 44.7s OverallTime, 19 OverallIterations, 8 TraceHistogramMax, 8.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 857 SDtfs, 754 SDslu, 4697 SDs, 0 SdLazy, 3450 SolverSat, 419 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2247 GetRequests, 1778 SyntacticMatches, 114 SemanticMatches, 355 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4241 ImplicationChecksByTransitivity, 13.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 18.2s AbstIntTime, 6 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 33 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 15.4s InterpolantComputationTime, 1729 NumberOfCodeBlocks, 1693 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 2662 ConstructedInterpolants, 143 QuantifiedInterpolants, 970091 SizeOfPredicates, 45 NumberOfNonLiveVariables, 3696 ConjunctsInSsa, 217 ConjunctsInUnsatCore, 56 InterpolantComputations, 10 PerfectInterpolantSequences, 725/1217 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/20051113-1.c_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_02-55-35-788.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_02-55-35-788.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_02-55-35-788.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_02-55-35-788.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_02-55-35-788.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-25_02-55-35-788.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-25_02-55-35-788.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-25_02-55-35-788.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-25_02-55-35-788.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-4-2018-01-25_02-55-35-788.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-4-2018-01-25_02-55-35-788.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-5-2018-01-25_02-55-35-788.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-5-2018-01-25_02-55-35-788.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_02-55-35-788.csv Completed graceful shutdown