java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 13:07:22,008 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 13:07:22,010 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 13:07:22,023 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 13:07:22,023 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 13:07:22,024 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 13:07:22,025 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 13:07:22,027 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 13:07:22,029 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 13:07:22,030 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 13:07:22,031 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 13:07:22,032 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 13:07:22,032 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 13:07:22,033 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 13:07:22,034 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 13:07:22,036 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 13:07:22,038 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 13:07:22,041 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 13:07:22,042 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 13:07:22,043 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 13:07:22,045 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 13:07:22,046 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 13:07:22,046 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 13:07:22,047 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 13:07:22,048 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 13:07:22,049 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 13:07:22,049 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 13:07:22,050 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 13:07:22,050 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 13:07:22,050 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 13:07:22,051 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 13:07:22,051 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 13:07:22,062 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 13:07:22,062 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 13:07:22,063 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 13:07:22,063 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 13:07:22,063 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 13:07:22,064 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 13:07:22,064 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 13:07:22,064 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 13:07:22,065 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 13:07:22,065 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 13:07:22,065 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 13:07:22,065 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 13:07:22,065 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 13:07:22,066 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 13:07:22,066 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 13:07:22,066 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 13:07:22,066 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 13:07:22,066 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 13:07:22,067 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 13:07:22,067 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 13:07:22,067 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 13:07:22,067 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 13:07:22,067 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 13:07:22,068 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:07:22,068 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 13:07:22,068 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 13:07:22,068 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 13:07:22,068 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 13:07:22,069 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 13:07:22,069 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 13:07:22,069 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 13:07:22,069 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 13:07:22,070 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 13:07:22,070 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 13:07:22,106 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 13:07:22,116 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 13:07:22,119 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 13:07:22,120 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 13:07:22,121 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 13:07:22,121 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-01-24 13:07:22,286 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 13:07:22,292 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 13:07:22,294 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 13:07:22,294 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 13:07:22,302 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 13:07:22,303 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:07:22" (1/1) ... [2018-01-24 13:07:22,305 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aad67c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:07:22, skipping insertion in model container [2018-01-24 13:07:22,305 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:07:22" (1/1) ... [2018-01-24 13:07:22,325 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:07:22,370 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:07:22,488 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:07:22,503 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:07:22,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:07:22 WrapperNode [2018-01-24 13:07:22,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 13:07:22,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 13:07:22,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 13:07:22,515 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 13:07:22,529 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:07:22" (1/1) ... [2018-01-24 13:07:22,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:07:22" (1/1) ... [2018-01-24 13:07:22,541 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:07:22" (1/1) ... [2018-01-24 13:07:22,541 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:07:22" (1/1) ... [2018-01-24 13:07:22,546 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:07:22" (1/1) ... [2018-01-24 13:07:22,549 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:07:22" (1/1) ... [2018-01-24 13:07:22,550 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:07:22" (1/1) ... [2018-01-24 13:07:22,552 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 13:07:22,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 13:07:22,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 13:07:22,552 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 13:07:22,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:07:22" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:07:22,602 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 13:07:22,602 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 13:07:22,602 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-24 13:07:22,602 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 13:07:22,602 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 13:07:22,603 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 13:07:22,603 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 13:07:22,603 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 13:07:22,603 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 13:07:22,603 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 13:07:22,603 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 13:07:22,604 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-01-24 13:07:22,604 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-01-24 13:07:22,604 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 13:07:22,604 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 13:07:22,604 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-01-24 13:07:22,604 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-24 13:07:22,605 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 13:07:22,605 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 13:07:22,605 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 13:07:22,752 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-24 13:07:22,876 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 13:07:22,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:07:22 BoogieIcfgContainer [2018-01-24 13:07:22,877 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 13:07:22,878 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 13:07:22,878 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 13:07:22,880 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 13:07:22,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 01:07:22" (1/3) ... [2018-01-24 13:07:22,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@95e4054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:07:22, skipping insertion in model container [2018-01-24 13:07:22,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:07:22" (2/3) ... [2018-01-24 13:07:22,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@95e4054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:07:22, skipping insertion in model container [2018-01-24 13:07:22,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:07:22" (3/3) ... [2018-01-24 13:07:22,883 INFO L105 eAbstractionObserver]: Analyzing ICFG test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-01-24 13:07:22,890 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 13:07:22,896 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-01-24 13:07:22,941 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 13:07:22,942 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 13:07:22,942 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 13:07:22,942 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 13:07:22,942 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 13:07:22,942 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 13:07:22,942 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 13:07:22,943 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 13:07:22,944 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 13:07:22,966 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-01-24 13:07:22,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-24 13:07:22,972 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:07:22,973 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-24 13:07:22,973 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 13:07:22,978 INFO L82 PathProgramCache]: Analyzing trace with hash 2931467, now seen corresponding path program 1 times [2018-01-24 13:07:22,982 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:07:23,033 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:23,033 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:07:23,033 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:23,033 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:07:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:23,077 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:07:23,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:07:23,128 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:07:23,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 13:07:23,129 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:07:23,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:07:23,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:07:23,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:07:23,148 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. [2018-01-24 13:07:23,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:07:23,295 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2018-01-24 13:07:23,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:07:23,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-24 13:07:23,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:07:23,385 INFO L225 Difference]: With dead ends: 65 [2018-01-24 13:07:23,385 INFO L226 Difference]: Without dead ends: 57 [2018-01-24 13:07:23,387 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:07:23,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-24 13:07:23,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-24 13:07:23,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-24 13:07:23,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-01-24 13:07:23,417 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 4 [2018-01-24 13:07:23,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:07:23,417 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-01-24 13:07:23,418 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:07:23,418 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-01-24 13:07:23,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-24 13:07:23,418 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:07:23,418 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-24 13:07:23,418 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 13:07:23,418 INFO L82 PathProgramCache]: Analyzing trace with hash 2931468, now seen corresponding path program 1 times [2018-01-24 13:07:23,419 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:07:23,419 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:23,419 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:07:23,420 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:23,420 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:07:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:23,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:07:23,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:07:23,489 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:07:23,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 13:07:23,490 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:07:23,492 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:07:23,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:07:23,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:07:23,495 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 3 states. [2018-01-24 13:07:23,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:07:23,595 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-01-24 13:07:23,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:07:23,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-24 13:07:23,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:07:23,597 INFO L225 Difference]: With dead ends: 57 [2018-01-24 13:07:23,598 INFO L226 Difference]: Without dead ends: 53 [2018-01-24 13:07:23,599 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:07:23,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-24 13:07:23,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-24 13:07:23,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 13:07:23,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-01-24 13:07:23,607 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 4 [2018-01-24 13:07:23,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:07:23,608 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-01-24 13:07:23,608 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:07:23,608 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-01-24 13:07:23,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 13:07:23,609 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:07:23,609 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:07:23,609 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 13:07:23,609 INFO L82 PathProgramCache]: Analyzing trace with hash -240006955, now seen corresponding path program 1 times [2018-01-24 13:07:23,610 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:07:23,611 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:23,611 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:07:23,611 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:23,611 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:07:23,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:23,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:07:23,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:07:23,731 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:07:23,731 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 13:07:23,731 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:07:23,731 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:07:23,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:07:23,732 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:07:23,732 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 3 states. [2018-01-24 13:07:23,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:07:23,798 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-01-24 13:07:23,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:07:23,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-01-24 13:07:23,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:07:23,800 INFO L225 Difference]: With dead ends: 53 [2018-01-24 13:07:23,800 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 13:07:23,800 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:07:23,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 13:07:23,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-24 13:07:23,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 13:07:23,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-01-24 13:07:23,809 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 14 [2018-01-24 13:07:23,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:07:23,809 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-01-24 13:07:23,809 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:07:23,809 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-01-24 13:07:23,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 13:07:23,810 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:07:23,810 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:07:23,811 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 13:07:23,811 INFO L82 PathProgramCache]: Analyzing trace with hash -240006954, now seen corresponding path program 1 times [2018-01-24 13:07:23,811 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:07:23,812 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:23,812 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:07:23,812 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:23,812 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:07:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:23,839 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:07:23,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:07:23,915 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:07:23,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:07:23,915 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:07:23,915 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:07:23,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:07:23,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:07:23,916 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 4 states. [2018-01-24 13:07:23,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:07:23,995 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-01-24 13:07:23,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:07:23,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 13:07:23,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:07:23,997 INFO L225 Difference]: With dead ends: 51 [2018-01-24 13:07:23,997 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 13:07:23,997 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:07:23,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 13:07:24,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-24 13:07:24,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 13:07:24,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-01-24 13:07:24,005 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 14 [2018-01-24 13:07:24,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:07:24,005 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-01-24 13:07:24,005 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:07:24,005 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-01-24 13:07:24,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 13:07:24,006 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:07:24,006 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:07:24,006 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 13:07:24,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1149718964, now seen corresponding path program 1 times [2018-01-24 13:07:24,007 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:07:24,007 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:24,008 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:07:24,008 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:24,008 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:07:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:24,034 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:07:24,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:07:24,243 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:07:24,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 13:07:24,243 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:07:24,243 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 13:07:24,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 13:07:24,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:07:24,244 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 8 states. [2018-01-24 13:07:24,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:07:24,383 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-01-24 13:07:24,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:07:24,383 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-01-24 13:07:24,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:07:24,384 INFO L225 Difference]: With dead ends: 49 [2018-01-24 13:07:24,385 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 13:07:24,385 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-01-24 13:07:24,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 13:07:24,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-24 13:07:24,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 13:07:24,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-01-24 13:07:24,393 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 15 [2018-01-24 13:07:24,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:07:24,394 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-01-24 13:07:24,394 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 13:07:24,394 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-01-24 13:07:24,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 13:07:24,395 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:07:24,395 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-24 13:07:24,396 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 13:07:24,396 INFO L82 PathProgramCache]: Analyzing trace with hash 536104684, now seen corresponding path program 1 times [2018-01-24 13:07:24,396 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:07:24,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:24,397 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:07:24,398 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:24,398 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:07:24,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:24,421 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:07:24,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:07:24,463 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:07:24,463 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 13:07:24,463 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:07:24,464 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:07:24,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:07:24,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:07:24,464 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 3 states. [2018-01-24 13:07:24,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:07:24,553 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-01-24 13:07:24,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:07:24,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-01-24 13:07:24,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:07:24,555 INFO L225 Difference]: With dead ends: 46 [2018-01-24 13:07:24,555 INFO L226 Difference]: Without dead ends: 44 [2018-01-24 13:07:24,555 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:07:24,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-24 13:07:24,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-01-24 13:07:24,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-24 13:07:24,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-01-24 13:07:24,562 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 27 [2018-01-24 13:07:24,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:07:24,562 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-01-24 13:07:24,562 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:07:24,563 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-01-24 13:07:24,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 13:07:24,564 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:07:24,564 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-24 13:07:24,564 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 13:07:24,564 INFO L82 PathProgramCache]: Analyzing trace with hash 536104686, now seen corresponding path program 1 times [2018-01-24 13:07:24,564 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:07:24,565 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:24,565 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:07:24,565 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:24,565 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:07:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:24,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:07:24,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:07:24,638 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:07:24,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:07:24,638 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:07:24,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:07:24,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:07:24,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:07:24,639 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 4 states. [2018-01-24 13:07:24,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:07:24,695 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-01-24 13:07:24,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:07:24,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-24 13:07:24,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:07:24,697 INFO L225 Difference]: With dead ends: 74 [2018-01-24 13:07:24,697 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 13:07:24,698 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:07:24,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 13:07:24,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-24 13:07:24,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 13:07:24,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-01-24 13:07:24,704 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 27 [2018-01-24 13:07:24,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:07:24,704 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-01-24 13:07:24,704 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:07:24,704 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-01-24 13:07:24,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 13:07:24,705 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:07:24,705 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:07:24,705 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 13:07:24,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1523422321, now seen corresponding path program 1 times [2018-01-24 13:07:24,706 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:07:24,706 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:24,706 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:07:24,707 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:24,707 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:07:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:24,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:07:24,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:07:24,822 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:07:24,822 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:07:24,831 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:07:24,831 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:07:24,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:24,870 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:07:24,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:07:24,906 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:07:24,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:07:25,021 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:07:25,021 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:07:25,025 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:07:25,025 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:07:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:25,085 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:07:25,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:07:25,090 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:07:25,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:07:25,143 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:07:25,143 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5] total 11 [2018-01-24 13:07:25,143 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:07:25,144 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 13:07:25,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 13:07:25,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-01-24 13:07:25,144 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 8 states. [2018-01-24 13:07:25,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:07:25,201 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2018-01-24 13:07:25,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:07:25,202 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-01-24 13:07:25,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:07:25,203 INFO L225 Difference]: With dead ends: 77 [2018-01-24 13:07:25,203 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 13:07:25,204 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 104 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-01-24 13:07:25,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 13:07:25,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-24 13:07:25,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 13:07:25,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-01-24 13:07:25,210 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 28 [2018-01-24 13:07:25,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:07:25,210 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-01-24 13:07:25,211 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 13:07:25,211 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-01-24 13:07:25,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 13:07:25,212 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:07:25,212 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:07:25,212 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 13:07:25,212 INFO L82 PathProgramCache]: Analyzing trace with hash -944250098, now seen corresponding path program 2 times [2018-01-24 13:07:25,213 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:07:25,214 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:25,214 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:07:25,214 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:25,214 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:07:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:25,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:07:25,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:07:25,309 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:07:25,309 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:07:25,321 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 13:07:25,321 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 13:07:25,349 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:07:25,353 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:07:25,357 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:07:25,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 13:07:25,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:25,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:07:25,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 13:07:25,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 13:07:25,433 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:07:25,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 13:07:25,480 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 13:07:25,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [6] total 8 [2018-01-24 13:07:25,481 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:07:25,481 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:07:25,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:07:25,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:07:25,482 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 3 states. [2018-01-24 13:07:25,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:07:25,501 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-01-24 13:07:25,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:07:25,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-01-24 13:07:25,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:07:25,503 INFO L225 Difference]: With dead ends: 48 [2018-01-24 13:07:25,503 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 13:07:25,504 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:07:25,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 13:07:25,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-24 13:07:25,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 13:07:25,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-01-24 13:07:25,511 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 29 [2018-01-24 13:07:25,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:07:25,511 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-01-24 13:07:25,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:07:25,511 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-01-24 13:07:25,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-24 13:07:25,512 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:07:25,513 INFO L322 BasicCegarLoop]: trace histogram [4, 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] [2018-01-24 13:07:25,513 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 13:07:25,513 INFO L82 PathProgramCache]: Analyzing trace with hash -2111815019, now seen corresponding path program 1 times [2018-01-24 13:07:25,513 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:07:25,514 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:25,514 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 13:07:25,515 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:25,515 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:07:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:25,548 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:07:25,613 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-24 13:07:25,613 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:07:25,614 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-24 13:07:25,624 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:07:25,624 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:07:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:25,668 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:07:25,729 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 13:07:25,729 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:07:25,998 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-24 13:07:26,019 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:07:26,019 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-24 13:07:26,024 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:07:26,025 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:07:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:26,093 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:07:26,101 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 13:07:26,101 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:07:26,201 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-24 13:07:26,202 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:07:26,202 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6] total 14 [2018-01-24 13:07:26,203 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:07:26,203 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 13:07:26,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 13:07:26,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2018-01-24 13:07:26,204 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 10 states. [2018-01-24 13:07:26,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:07:26,244 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-01-24 13:07:26,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:07:26,244 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-01-24 13:07:26,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:07:26,245 INFO L225 Difference]: With dead ends: 76 [2018-01-24 13:07:26,245 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 13:07:26,246 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 146 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2018-01-24 13:07:26,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 13:07:26,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-24 13:07:26,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 13:07:26,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-01-24 13:07:26,253 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 39 [2018-01-24 13:07:26,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:07:26,253 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-01-24 13:07:26,253 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 13:07:26,253 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-01-24 13:07:26,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 13:07:26,255 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:07:26,255 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] [2018-01-24 13:07:26,255 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 13:07:26,255 INFO L82 PathProgramCache]: Analyzing trace with hash 304342049, now seen corresponding path program 2 times [2018-01-24 13:07:26,255 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:07:26,256 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:26,256 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:07:26,256 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:26,257 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:07:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:26,287 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:07:26,355 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-24 13:07:26,355 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:07:26,355 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-24 13:07:26,361 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 13:07:26,361 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 13:07:26,381 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:07:26,399 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:07:26,401 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:07:26,404 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:07:26,428 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-24 13:07:26,428 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:07:26,491 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-24 13:07:26,512 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:07:26,512 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-24 13:07:26,517 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 13:07:26,517 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 13:07:26,547 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:07:26,718 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:07:26,741 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:07:26,747 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:07:26,752 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-24 13:07:26,752 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:07:26,792 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-24 13:07:26,794 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:07:26,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 16 [2018-01-24 13:07:26,794 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:07:26,795 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 13:07:26,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 13:07:26,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2018-01-24 13:07:26,795 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 12 states. [2018-01-24 13:07:26,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:07:26,831 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2018-01-24 13:07:26,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 13:07:26,831 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-01-24 13:07:26,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:07:26,832 INFO L225 Difference]: With dead ends: 79 [2018-01-24 13:07:26,832 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 13:07:26,833 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 151 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2018-01-24 13:07:26,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 13:07:26,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-24 13:07:26,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 13:07:26,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-01-24 13:07:26,840 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 41 [2018-01-24 13:07:26,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:07:26,841 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-01-24 13:07:26,841 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 13:07:26,841 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-01-24 13:07:26,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-24 13:07:26,842 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:07:26,842 INFO L322 BasicCegarLoop]: trace histogram [8, 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] [2018-01-24 13:07:26,842 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 13:07:26,842 INFO L82 PathProgramCache]: Analyzing trace with hash 747384917, now seen corresponding path program 3 times [2018-01-24 13:07:26,842 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:07:26,843 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:26,843 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 13:07:26,844 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:07:26,844 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:07:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:07:26,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:07:27,991 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 3 proven. 38 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-24 13:07:27,991 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:07:27,992 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-24 13:07:27,999 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 13:07:27,999 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-24 13:07:28,026 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 13:07:28,051 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 13:07:28,077 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 13:07:28,217 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 13:07:28,219 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:07:28,225 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:07:28,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 13:07:28,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 13:07:28,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:28,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:07:28,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:07:28,285 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-01-24 13:07:28,743 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 92 DAG size of output 31 [2018-01-24 13:07:28,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 54 [2018-01-24 13:07:28,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 57 [2018-01-24 13:07:28,771 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:28,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 58 [2018-01-24 13:07:28,779 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:28,780 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:28,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 78 [2018-01-24 13:07:28,793 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:28,794 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:28,795 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:28,797 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:28,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 109 [2018-01-24 13:07:28,805 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:28,823 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:07:28,830 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:07:28,839 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:07:28,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:07:28,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 13:07:28,873 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:179, output treesize:71 [2018-01-24 13:07:28,928 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 7 treesize of output 5 [2018-01-24 13:07:28,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:28,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:07:28,932 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-01-24 13:07:29,597 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 89 DAG size of output 28 [2018-01-24 13:07:29,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 54 [2018-01-24 13:07:29,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2018-01-24 13:07:29,628 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:29,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 50 [2018-01-24 13:07:29,634 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:29,634 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:29,635 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:29,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 66 [2018-01-24 13:07:29,650 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:29,658 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:29,659 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:29,673 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:29,677 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:29,677 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:29,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 93 [2018-01-24 13:07:29,684 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:29,695 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:07:29,702 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:07:29,710 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:07:29,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:07:29,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:07:29,744 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:176, output treesize:64 [2018-01-24 13:07:29,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 53 [2018-01-24 13:07:29,846 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:29,847 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:29,848 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:29,849 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:29,850 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:29,851 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:29,852 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:07:29,852 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:29,853 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:29,854 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:29,855 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:29,856 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:07:29,862 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:29,863 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:29,864 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:07:29,870 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:07:29,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 12 disjoint index pairs (out of 28 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 94 [2018-01-24 13:07:29,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:29,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:07:29,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:07:29,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:7 [2018-01-24 13:07:29,958 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 5 proven. 37 refuted. 6 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-24 13:07:29,958 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:07:30,961 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 13:07:30,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:30,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:07:30,963 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:5950, output treesize:1 [2018-01-24 13:07:32,273 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 6258 treesize of output 3388 [2018-01-24 13:07:32,419 WARN L146 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 370 DAG size of output 89 [2018-01-24 13:07:32,425 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 9 treesize of output 8 [2018-01-24 13:07:32,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:32,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 759 treesize of output 464 [2018-01-24 13:07:33,283 WARN L146 SmtUtils]: Spent 771ms on a formula simplification. DAG size of input: 771 DAG size of output 309 [2018-01-24 13:07:33,288 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:33,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 474 treesize of output 229 [2018-01-24 13:07:33,322 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:07:33,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 84 [2018-01-24 13:07:33,326 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:07:33,326 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:07:33,327 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:07:33,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 88 [2018-01-24 13:07:33,348 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:07:33,349 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:07:33,349 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:07:33,349 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:07:33,350 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:07:33,350 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:07:33,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 106 [2018-01-24 13:07:33,357 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:33,359 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 13:07:33,359 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:33,374 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:07:33,383 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:07:33,401 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:07:33,402 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:07:33,410 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:33,424 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimArr_10 term size 64 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:270) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:328) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-24 13:07:33,427 INFO L168 Benchmark]: Toolchain (without parser) took 11140.92 ms. Allocated memory was 302.5 MB in the beginning and 589.3 MB in the end (delta: 286.8 MB). Free memory was 262.4 MB in the beginning and 312.2 MB in the end (delta: -49.8 MB). Peak memory consumption was 237.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:07:33,429 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 302.5 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 13:07:33,429 INFO L168 Benchmark]: CACSL2BoogieTranslator took 221.11 ms. Allocated memory is still 302.5 MB. Free memory was 261.4 MB in the beginning and 250.5 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:07:33,430 INFO L168 Benchmark]: Boogie Preprocessor took 36.77 ms. Allocated memory is still 302.5 MB. Free memory was 250.5 MB in the beginning and 248.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:07:33,430 INFO L168 Benchmark]: RCFGBuilder took 324.68 ms. Allocated memory is still 302.5 MB. Free memory was 248.5 MB in the beginning and 227.5 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:07:33,431 INFO L168 Benchmark]: TraceAbstraction took 10548.81 ms. Allocated memory was 302.5 MB in the beginning and 589.3 MB in the end (delta: 286.8 MB). Free memory was 227.5 MB in the beginning and 312.2 MB in the end (delta: -84.7 MB). Peak memory consumption was 202.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:07:33,433 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 302.5 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 221.11 ms. Allocated memory is still 302.5 MB. Free memory was 261.4 MB in the beginning and 250.5 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.77 ms. Allocated memory is still 302.5 MB. Free memory was 250.5 MB in the beginning and 248.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 324.68 ms. Allocated memory is still 302.5 MB. Free memory was 248.5 MB in the beginning and 227.5 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 10548.81 ms. Allocated memory was 302.5 MB in the beginning and 589.3 MB in the end (delta: 286.8 MB). Free memory was 227.5 MB in the beginning and 312.2 MB in the end (delta: -84.7 MB). Peak memory consumption was 202.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_10 term size 64 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimArr_10 term size 64: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-memleak_nexttime_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_13-07-33-442.csv Received shutdown request...