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_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 08:26:34,130 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:26:34,132 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:26:34,149 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:26:34,149 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:26:34,150 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:26:34,151 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:26:34,157 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:26:34,161 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:26:34,161 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:26:34,162 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:26:34,163 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:26:34,164 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:26:34,167 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:26:34,168 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:26:34,181 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:26:34,183 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:26:34,185 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:26:34,186 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:26:34,187 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:26:34,190 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:26:34,195 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:26:34,195 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:26:34,196 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:26:34,197 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:26:34,198 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:26:34,199 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:26:34,199 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:26:34,199 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:26:34,200 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:26:34,203 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:26:34,203 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 08:26:34,213 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:26:34,213 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:26:34,214 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:26:34,214 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:26:34,215 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:26:34,215 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:26:34,215 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:26:34,215 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:26:34,216 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:26:34,216 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 08:26:34,216 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:26:34,216 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:26:34,216 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:26:34,216 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 08:26:34,217 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 08:26:34,217 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 08:26:34,217 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:26:34,217 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:26:34,217 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:26:34,218 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:26:34,218 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:26:34,218 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:26:34,218 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:26:34,218 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:26:34,218 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:26:34,219 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:26:34,219 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:26:34,219 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:26:34,219 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:26:34,219 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:26:34,220 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:26:34,220 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:26:34,220 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:26:34,221 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:26:34,254 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:26:34,270 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:26:34,275 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:26:34,276 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:26:34,276 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:26:34,281 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i [2018-01-31 08:26:34,470 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:26:34,477 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:26:34,478 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:26:34,478 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:26:34,485 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:26:34,487 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:26:34" (1/1) ... [2018-01-31 08:26:34,491 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1abbe019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:26:34, skipping insertion in model container [2018-01-31 08:26:34,492 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:26:34" (1/1) ... [2018-01-31 08:26:34,511 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:26:34,574 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:26:34,742 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:26:34,769 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:26:34,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:26:34 WrapperNode [2018-01-31 08:26:34,777 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:26:34,778 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:26:34,778 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:26:34,779 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:26:34,789 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:26:34" (1/1) ... [2018-01-31 08:26:34,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:26:34" (1/1) ... [2018-01-31 08:26:34,799 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:26:34" (1/1) ... [2018-01-31 08:26:34,799 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:26:34" (1/1) ... [2018-01-31 08:26:34,803 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:26:34" (1/1) ... [2018-01-31 08:26:34,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:26:34" (1/1) ... [2018-01-31 08:26:34,808 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:26:34" (1/1) ... [2018-01-31 08:26:34,810 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:26:34,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:26:34,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:26:34,811 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:26:34,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:26:34" (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-31 08:26:34,878 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:26:34,878 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:26:34,878 INFO L136 BoogieDeclarations]: Found implementation of procedure sort [2018-01-31 08:26:34,878 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:26:34,878 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 08:26:34,879 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 08:26:34,879 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:26:34,882 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:26:34,882 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:26:34,883 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 08:26:34,883 INFO L128 BoogieDeclarations]: Found specification of procedure sort [2018-01-31 08:26:34,883 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:26:34,883 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:26:34,883 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:26:35,383 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:26:35,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:26:35 BoogieIcfgContainer [2018-01-31 08:26:35,404 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:26:35,405 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:26:35,405 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:26:35,408 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:26:35,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:26:34" (1/3) ... [2018-01-31 08:26:35,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@663b8bea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:26:35, skipping insertion in model container [2018-01-31 08:26:35,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:26:34" (2/3) ... [2018-01-31 08:26:35,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@663b8bea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:26:35, skipping insertion in model container [2018-01-31 08:26:35,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:26:35" (3/3) ... [2018-01-31 08:26:35,411 INFO L107 eAbstractionObserver]: Analyzing ICFG java_BubbleSort-alloca_true-valid-memsafety_true-termination.i [2018-01-31 08:26:35,420 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:26:35,429 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-31 08:26:35,480 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:26:35,480 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:26:35,480 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:26:35,480 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:26:35,481 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:26:35,481 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:26:35,481 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:26:35,481 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:26:35,482 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:26:35,502 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-31 08:26:35,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-31 08:26:35,511 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:26:35,512 INFO L351 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] [2018-01-31 08:26:35,513 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, sortErr7RequiresViolation, sortErr11RequiresViolation, sortErr0RequiresViolation, sortErr3RequiresViolation, sortErr9RequiresViolation, sortErr1RequiresViolation, sortErr2RequiresViolation, sortErr8RequiresViolation, sortErr10RequiresViolation, sortErr6RequiresViolation, sortErr4RequiresViolation, sortErr5RequiresViolation]=== [2018-01-31 08:26:35,518 INFO L82 PathProgramCache]: Analyzing trace with hash -757864556, now seen corresponding path program 1 times [2018-01-31 08:26:35,520 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:26:35,521 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:26:35,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:26:35,577 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:26:35,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:26:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:26:35,661 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:26:35,957 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-31 08:26:35,962 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:26:35,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:26:35,964 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:26:35,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:26:35,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:26:35,981 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 6 states. [2018-01-31 08:26:36,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:26:36,607 INFO L93 Difference]: Finished difference Result 107 states and 122 transitions. [2018-01-31 08:26:36,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:26:36,609 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-31 08:26:36,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:26:36,619 INFO L225 Difference]: With dead ends: 107 [2018-01-31 08:26:36,620 INFO L226 Difference]: Without dead ends: 57 [2018-01-31 08:26:36,624 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:26:36,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-31 08:26:36,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-31 08:26:36,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-31 08:26:36,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-01-31 08:26:36,659 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 24 [2018-01-31 08:26:36,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:26:36,660 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-01-31 08:26:36,660 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:26:36,660 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-01-31 08:26:36,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-31 08:26:36,661 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:26:36,661 INFO L351 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] [2018-01-31 08:26:36,662 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, sortErr7RequiresViolation, sortErr11RequiresViolation, sortErr0RequiresViolation, sortErr3RequiresViolation, sortErr9RequiresViolation, sortErr1RequiresViolation, sortErr2RequiresViolation, sortErr8RequiresViolation, sortErr10RequiresViolation, sortErr6RequiresViolation, sortErr4RequiresViolation, sortErr5RequiresViolation]=== [2018-01-31 08:26:36,662 INFO L82 PathProgramCache]: Analyzing trace with hash -757864555, now seen corresponding path program 1 times [2018-01-31 08:26:36,662 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:26:36,662 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:26:36,663 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:26:36,663 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:26:36,663 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:26:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:26:36,683 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:26:37,128 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-31 08:26:37,128 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:26:37,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 08:26:37,130 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:26:37,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:26:37,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:26:37,131 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 8 states. [2018-01-31 08:26:37,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:26:37,546 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2018-01-31 08:26:37,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:26:37,547 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-01-31 08:26:37,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:26:37,551 INFO L225 Difference]: With dead ends: 89 [2018-01-31 08:26:37,552 INFO L226 Difference]: Without dead ends: 86 [2018-01-31 08:26:37,553 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:26:37,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-31 08:26:37,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 69. [2018-01-31 08:26:37,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-31 08:26:37,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2018-01-31 08:26:37,563 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 24 [2018-01-31 08:26:37,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:26:37,563 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2018-01-31 08:26:37,563 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:26:37,563 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2018-01-31 08:26:37,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-31 08:26:37,564 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:26:37,564 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:26:37,564 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, sortErr7RequiresViolation, sortErr11RequiresViolation, sortErr0RequiresViolation, sortErr3RequiresViolation, sortErr9RequiresViolation, sortErr1RequiresViolation, sortErr2RequiresViolation, sortErr8RequiresViolation, sortErr10RequiresViolation, sortErr6RequiresViolation, sortErr4RequiresViolation, sortErr5RequiresViolation]=== [2018-01-31 08:26:37,565 INFO L82 PathProgramCache]: Analyzing trace with hash -2018964734, now seen corresponding path program 1 times [2018-01-31 08:26:37,565 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:26:37,565 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:26:37,566 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:26:37,566 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:26:37,566 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:26:37,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:26:37,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:26:37,978 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-31 08:26:37,978 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:26:37,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-31 08:26:37,979 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 08:26:37,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 08:26:37,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:26:37,980 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand 10 states. [2018-01-31 08:26:38,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:26:38,441 INFO L93 Difference]: Finished difference Result 112 states and 129 transitions. [2018-01-31 08:26:38,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-31 08:26:38,441 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-01-31 08:26:38,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:26:38,443 INFO L225 Difference]: With dead ends: 112 [2018-01-31 08:26:38,443 INFO L226 Difference]: Without dead ends: 107 [2018-01-31 08:26:38,443 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-01-31 08:26:38,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-31 08:26:38,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 87. [2018-01-31 08:26:38,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-31 08:26:38,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2018-01-31 08:26:38,464 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 25 [2018-01-31 08:26:38,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:26:38,464 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2018-01-31 08:26:38,464 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 08:26:38,464 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2018-01-31 08:26:38,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-31 08:26:38,465 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:26:38,465 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:26:38,466 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, sortErr7RequiresViolation, sortErr11RequiresViolation, sortErr0RequiresViolation, sortErr3RequiresViolation, sortErr9RequiresViolation, sortErr1RequiresViolation, sortErr2RequiresViolation, sortErr8RequiresViolation, sortErr10RequiresViolation, sortErr6RequiresViolation, sortErr4RequiresViolation, sortErr5RequiresViolation]=== [2018-01-31 08:26:38,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1628871957, now seen corresponding path program 1 times [2018-01-31 08:26:38,466 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:26:38,466 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:26:38,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:26:38,467 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:26:38,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:26:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:26:38,482 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:26:38,577 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-31 08:26:38,577 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:26:38,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:26:38,577 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:26:38,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:26:38,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:26:38,578 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand 4 states. [2018-01-31 08:26:38,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:26:38,731 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2018-01-31 08:26:38,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 08:26:38,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-01-31 08:26:38,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:26:38,734 INFO L225 Difference]: With dead ends: 87 [2018-01-31 08:26:38,734 INFO L226 Difference]: Without dead ends: 80 [2018-01-31 08:26:38,734 INFO L554 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-31 08:26:38,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-31 08:26:38,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-31 08:26:38,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-31 08:26:38,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-01-31 08:26:38,748 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 26 [2018-01-31 08:26:38,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:26:38,748 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-01-31 08:26:38,748 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:26:38,748 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-01-31 08:26:38,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-31 08:26:38,749 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:26:38,750 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:26:38,750 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, sortErr7RequiresViolation, sortErr11RequiresViolation, sortErr0RequiresViolation, sortErr3RequiresViolation, sortErr9RequiresViolation, sortErr1RequiresViolation, sortErr2RequiresViolation, sortErr8RequiresViolation, sortErr10RequiresViolation, sortErr6RequiresViolation, sortErr4RequiresViolation, sortErr5RequiresViolation]=== [2018-01-31 08:26:38,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1429827120, now seen corresponding path program 1 times [2018-01-31 08:26:38,750 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:26:38,750 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:26:38,751 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:26:38,752 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:26:38,752 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:26:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:26:38,767 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:26:38,857 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:26:38,857 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:26:38,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:26:38,858 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:26:38,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:26:38,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:26:38,859 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 4 states. [2018-01-31 08:26:38,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:26:38,939 INFO L93 Difference]: Finished difference Result 142 states and 157 transitions. [2018-01-31 08:26:38,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:26:38,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-01-31 08:26:38,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:26:38,941 INFO L225 Difference]: With dead ends: 142 [2018-01-31 08:26:38,941 INFO L226 Difference]: Without dead ends: 106 [2018-01-31 08:26:38,942 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-31 08:26:38,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-31 08:26:38,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 80. [2018-01-31 08:26:38,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-31 08:26:38,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2018-01-31 08:26:38,953 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 33 [2018-01-31 08:26:38,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:26:38,953 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2018-01-31 08:26:38,953 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:26:38,953 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2018-01-31 08:26:38,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-31 08:26:38,954 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:26:38,955 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:26:38,955 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, sortErr7RequiresViolation, sortErr11RequiresViolation, sortErr0RequiresViolation, sortErr3RequiresViolation, sortErr9RequiresViolation, sortErr1RequiresViolation, sortErr2RequiresViolation, sortErr8RequiresViolation, sortErr10RequiresViolation, sortErr6RequiresViolation, sortErr4RequiresViolation, sortErr5RequiresViolation]=== [2018-01-31 08:26:38,955 INFO L82 PathProgramCache]: Analyzing trace with hash -371939831, now seen corresponding path program 1 times [2018-01-31 08:26:38,955 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:26:38,955 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:26:38,956 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:26:38,956 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:26:38,956 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:26:38,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:26:38,970 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:26:39,365 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-31 08:26:39,365 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:26:39,366 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-31 08:26:39,372 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:26:39,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:26:39,397 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:26:39,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:26:39,601 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:26:39,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 17 [2018-01-31 08:26:39,602 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-31 08:26:39,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-31 08:26:39,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-01-31 08:26:39,602 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand 18 states. [2018-01-31 08:26:40,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:26:40,082 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2018-01-31 08:26:40,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-31 08:26:40,083 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-01-31 08:26:40,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:26:40,084 INFO L225 Difference]: With dead ends: 108 [2018-01-31 08:26:40,084 INFO L226 Difference]: Without dead ends: 105 [2018-01-31 08:26:40,085 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2018-01-31 08:26:40,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-31 08:26:40,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 73. [2018-01-31 08:26:40,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-31 08:26:40,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2018-01-31 08:26:40,104 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 34 [2018-01-31 08:26:40,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:26:40,104 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2018-01-31 08:26:40,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-31 08:26:40,104 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2018-01-31 08:26:40,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-31 08:26:40,106 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:26:40,106 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:26:40,106 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, sortErr7RequiresViolation, sortErr11RequiresViolation, sortErr0RequiresViolation, sortErr3RequiresViolation, sortErr9RequiresViolation, sortErr1RequiresViolation, sortErr2RequiresViolation, sortErr8RequiresViolation, sortErr10RequiresViolation, sortErr6RequiresViolation, sortErr4RequiresViolation, sortErr5RequiresViolation]=== [2018-01-31 08:26:40,106 INFO L82 PathProgramCache]: Analyzing trace with hash 939033032, now seen corresponding path program 1 times [2018-01-31 08:26:40,107 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:26:40,107 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:26:40,113 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:26:40,113 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:26:40,113 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:26:40,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:26:40,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:26:40,486 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-31 08:26:40,487 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:26:40,487 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-31 08:26:40,501 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:26:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:26:40,526 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:26:40,635 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-31 08:26:40,654 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:26:40,655 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 18 [2018-01-31 08:26:40,655 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-31 08:26:40,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-31 08:26:40,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-01-31 08:26:40,656 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 18 states. [2018-01-31 08:26:42,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:26:42,377 INFO L93 Difference]: Finished difference Result 248 states and 268 transitions. [2018-01-31 08:26:42,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-31 08:26:42,378 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 53 [2018-01-31 08:26:42,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:26:42,380 INFO L225 Difference]: With dead ends: 248 [2018-01-31 08:26:42,380 INFO L226 Difference]: Without dead ends: 206 [2018-01-31 08:26:42,382 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=500, Invalid=2256, Unknown=0, NotChecked=0, Total=2756 [2018-01-31 08:26:42,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-01-31 08:26:42,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 155. [2018-01-31 08:26:42,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-01-31 08:26:42,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 165 transitions. [2018-01-31 08:26:42,419 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 165 transitions. Word has length 53 [2018-01-31 08:26:42,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:26:42,420 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 165 transitions. [2018-01-31 08:26:42,420 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-31 08:26:42,420 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 165 transitions. [2018-01-31 08:26:42,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-01-31 08:26:42,423 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:26:42,424 INFO L351 BasicCegarLoop]: trace histogram [8, 6, 6, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:26:42,424 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, sortErr7RequiresViolation, sortErr11RequiresViolation, sortErr0RequiresViolation, sortErr3RequiresViolation, sortErr9RequiresViolation, sortErr1RequiresViolation, sortErr2RequiresViolation, sortErr8RequiresViolation, sortErr10RequiresViolation, sortErr6RequiresViolation, sortErr4RequiresViolation, sortErr5RequiresViolation]=== [2018-01-31 08:26:42,424 INFO L82 PathProgramCache]: Analyzing trace with hash -830656614, now seen corresponding path program 2 times [2018-01-31 08:26:42,424 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:26:42,424 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:26:42,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:26:42,425 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:26:42,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:26:42,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:26:42,471 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:26:42,655 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 42 proven. 78 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-01-31 08:26:42,655 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:26:42,655 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-31 08:26:42,662 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:26:42,679 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:26:42,701 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:26:42,703 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:26:42,707 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:26:42,836 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 98 proven. 42 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-31 08:26:42,856 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:26:42,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 21 [2018-01-31 08:26:42,856 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-31 08:26:42,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-31 08:26:42,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2018-01-31 08:26:42,857 INFO L87 Difference]: Start difference. First operand 155 states and 165 transitions. Second operand 21 states. [2018-01-31 08:26:43,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:26:43,721 INFO L93 Difference]: Finished difference Result 397 states and 424 transitions. [2018-01-31 08:26:43,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-31 08:26:43,721 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 91 [2018-01-31 08:26:43,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:26:43,723 INFO L225 Difference]: With dead ends: 397 [2018-01-31 08:26:43,723 INFO L226 Difference]: Without dead ends: 277 [2018-01-31 08:26:43,726 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=453, Invalid=1899, Unknown=0, NotChecked=0, Total=2352 [2018-01-31 08:26:43,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-01-31 08:26:43,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 212. [2018-01-31 08:26:43,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-01-31 08:26:43,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 225 transitions. [2018-01-31 08:26:43,745 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 225 transitions. Word has length 91 [2018-01-31 08:26:43,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:26:43,746 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 225 transitions. [2018-01-31 08:26:43,746 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-31 08:26:43,746 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 225 transitions. [2018-01-31 08:26:43,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-01-31 08:26:43,749 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:26:43,749 INFO L351 BasicCegarLoop]: trace histogram [11, 9, 9, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:26:43,749 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, sortErr7RequiresViolation, sortErr11RequiresViolation, sortErr0RequiresViolation, sortErr3RequiresViolation, sortErr9RequiresViolation, sortErr1RequiresViolation, sortErr2RequiresViolation, sortErr8RequiresViolation, sortErr10RequiresViolation, sortErr6RequiresViolation, sortErr4RequiresViolation, sortErr5RequiresViolation]=== [2018-01-31 08:26:43,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1911396034, now seen corresponding path program 3 times [2018-01-31 08:26:43,750 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:26:43,750 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:26:43,751 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:26:43,751 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:26:43,751 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:26:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:26:43,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:26:44,144 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 56 proven. 238 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-01-31 08:26:44,145 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:26:44,145 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-31 08:26:44,150 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:26:44,166 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:26:44,182 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:26:44,199 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:26:44,213 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:26:44,219 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:26:45,325 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 191 proven. 22 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-01-31 08:26:45,345 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:26:45,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 19 [2018-01-31 08:26:45,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-31 08:26:45,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-31 08:26:45,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2018-01-31 08:26:45,346 INFO L87 Difference]: Start difference. First operand 212 states and 225 transitions. Second operand 20 states. [2018-01-31 08:26:47,399 WARN L146 SmtUtils]: Spent 281ms on a formula simplification. DAG size of input: 32 DAG size of output 29 [2018-01-31 08:26:47,532 WARN L146 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 30 DAG size of output 27 [2018-01-31 08:26:48,301 WARN L146 SmtUtils]: Spent 315ms on a formula simplification. DAG size of input: 35 DAG size of output 32 [2018-01-31 08:26:48,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:26:48,667 INFO L93 Difference]: Finished difference Result 220 states and 233 transitions. [2018-01-31 08:26:48,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-01-31 08:26:48,668 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 121 [2018-01-31 08:26:48,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:26:48,668 INFO L225 Difference]: With dead ends: 220 [2018-01-31 08:26:48,669 INFO L226 Difference]: Without dead ends: 0 [2018-01-31 08:26:48,670 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=536, Invalid=2434, Unknown=0, NotChecked=0, Total=2970 [2018-01-31 08:26:48,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-31 08:26:48,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-31 08:26:48,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-31 08:26:48,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-31 08:26:48,671 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 121 [2018-01-31 08:26:48,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:26:48,671 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-31 08:26:48,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-31 08:26:48,671 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-31 08:26:48,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-31 08:26:48,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-31 08:26:48,704 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-31 08:26:48,718 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-31 08:26:48,912 WARN L143 SmtUtils]: Spent 101ms on a formula simplification that was a NOOP. DAG size: 28 [2018-01-31 08:26:49,413 WARN L146 SmtUtils]: Spent 497ms on a formula simplification. DAG size of input: 78 DAG size of output 60 [2018-01-31 08:26:49,753 WARN L146 SmtUtils]: Spent 339ms on a formula simplification. DAG size of input: 86 DAG size of output 55 [2018-01-31 08:26:49,760 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 557) no Hoare annotation was computed. [2018-01-31 08:26:49,760 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 557) no Hoare annotation was computed. [2018-01-31 08:26:49,760 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 557) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-31 08:26:49,760 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 557) no Hoare annotation was computed. [2018-01-31 08:26:49,760 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 557) the Hoare annotation is: true [2018-01-31 08:26:49,760 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 557) no Hoare annotation was computed. [2018-01-31 08:26:49,760 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 557) the Hoare annotation is: true [2018-01-31 08:26:49,760 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 557) no Hoare annotation was computed. [2018-01-31 08:26:49,761 INFO L399 ceAbstractionStarter]: For program point L550'(line 550) no Hoare annotation was computed. [2018-01-31 08:26:49,761 INFO L399 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-31 08:26:49,761 INFO L399 ceAbstractionStarter]: For program point L551(lines 551 553) no Hoare annotation was computed. [2018-01-31 08:26:49,761 INFO L399 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-01-31 08:26:49,761 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 549 557) no Hoare annotation was computed. [2018-01-31 08:26:49,761 INFO L395 ceAbstractionStarter]: At program point L555(line 555) the Hoare annotation is: (let ((.cse0 (* 4 main_~array_size~6))) (and (= .cse0 (select |#length| |main_#t~malloc9.base|)) (= 0 |main_#t~malloc9.offset|) (= 0 main_~numbers~6.offset) (<= 1 main_~array_size~6) (= 1 (select |#valid| |main_#t~malloc9.base|)) (= 1 (select |#valid| main_~numbers~6.base)) (= .cse0 (select |#length| main_~numbers~6.base)) (= |old(#valid)| (store |#valid| |main_#t~malloc9.base| (select (store |#valid| |main_#t~malloc9.base| 0) |main_#t~malloc9.base|))))) [2018-01-31 08:26:49,761 INFO L399 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-01-31 08:26:49,761 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 549 557) no Hoare annotation was computed. [2018-01-31 08:26:49,762 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 549 557) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-31 08:26:49,762 INFO L399 ceAbstractionStarter]: For program point L551''(lines 551 553) no Hoare annotation was computed. [2018-01-31 08:26:49,762 INFO L399 ceAbstractionStarter]: For program point L554'(line 554) no Hoare annotation was computed. [2018-01-31 08:26:49,762 INFO L399 ceAbstractionStarter]: For program point L555'(line 555) no Hoare annotation was computed. [2018-01-31 08:26:49,762 INFO L399 ceAbstractionStarter]: For program point L554''(line 554) no Hoare annotation was computed. [2018-01-31 08:26:49,762 INFO L399 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 549 557) no Hoare annotation was computed. [2018-01-31 08:26:49,762 INFO L399 ceAbstractionStarter]: For program point sortErr8RequiresViolation(lines 1 557) no Hoare annotation was computed. [2018-01-31 08:26:49,762 INFO L399 ceAbstractionStarter]: For program point L546''''''(line 546) no Hoare annotation was computed. [2018-01-31 08:26:49,762 INFO L399 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-01-31 08:26:49,763 INFO L399 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-01-31 08:26:49,763 INFO L399 ceAbstractionStarter]: For program point L540(lines 540 548) no Hoare annotation was computed. [2018-01-31 08:26:49,763 INFO L399 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-31 08:26:49,763 INFO L399 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-31 08:26:49,763 INFO L399 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-31 08:26:49,763 INFO L399 ceAbstractionStarter]: For program point L543(line 543) no Hoare annotation was computed. [2018-01-31 08:26:49,763 INFO L399 ceAbstractionStarter]: For program point L546'''''(line 546) no Hoare annotation was computed. [2018-01-31 08:26:49,764 INFO L395 ceAbstractionStarter]: At program point L543''''''(lines 543 547) the Hoare annotation is: (let ((.cse6 (* 4 |sort_#in~n|)) (.cse4 (select |#length| sort_~x.base))) (let ((.cse5 (select |#length| |sort_#in~x.base|)) (.cse7 (<= (+ (* 4 sort_~i~2) 4) .cse4)) (.cse1 (<= .cse6 .cse4)) (.cse3 (<= (* 4 sort_~n) .cse4)) (.cse0 (= sort_~x.offset 0)) (.cse8 (<= 1 sort_~i~2)) (.cse2 (= 1 (select |#valid| sort_~x.base)))) (or (and .cse0 (= sort_~pass~2 1) .cse1 .cse2 .cse3 (<= 4 .cse4)) (< .cse5 4) (< .cse5 .cse6) (and .cse1 .cse3 (<= 2 sort_~i~2) .cse0 (exists ((v_prenex_1 Int)) (and (<= (+ (* 4 v_prenex_1) sort_~x.offset 8) (select |#length| sort_~x.base)) (<= sort_~n (+ sort_~pass~2 v_prenex_1)))) .cse7 .cse2) (not (= (select |#valid| |sort_#in~x.base|) 1)) (and .cse1 .cse3 (<= sort_~n sort_~pass~2) .cse0 .cse8 .cse7 .cse2) (not (= 0 |sort_#in~x.offset|)) (and (<= sort_~n (+ sort_~pass~2 1)) .cse1 .cse3 (<= (+ sort_~x.offset 12) .cse4) .cse0 .cse8 .cse2 (<= sort_~i~2 2))))) [2018-01-31 08:26:49,764 INFO L399 ceAbstractionStarter]: For program point sortErr7RequiresViolation(lines 1 557) no Hoare annotation was computed. [2018-01-31 08:26:49,764 INFO L399 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-31 08:26:49,764 INFO L399 ceAbstractionStarter]: For program point L546''''(line 546) no Hoare annotation was computed. [2018-01-31 08:26:49,764 INFO L399 ceAbstractionStarter]: For program point L545'''''(line 545) no Hoare annotation was computed. [2018-01-31 08:26:49,764 INFO L399 ceAbstractionStarter]: For program point L543'''(lines 543 547) no Hoare annotation was computed. [2018-01-31 08:26:49,764 INFO L395 ceAbstractionStarter]: At program point L544''''''(lines 544 547) the Hoare annotation is: (let ((.cse1 (* 4 |sort_#in~n|)) (.cse11 (select |#length| sort_~x.base))) (let ((.cse0 (select |#length| |sort_#in~x.base|)) (.cse3 (= sort_~pass~2 1)) (.cse10 (* 4 sort_~i~2)) (.cse9 (<= 1 sort_~i~2)) (.cse2 (<= (+ sort_~pass~2 1) sort_~n)) (.cse4 (<= .cse1 .cse11)) (.cse5 (= 0 sort_~i~2)) (.cse6 (<= (* 4 sort_~n) .cse11)) (.cse7 (= sort_~x.offset 0)) (.cse12 (exists ((v_prenex_1 Int)) (and (<= (+ (* 4 v_prenex_1) sort_~x.offset 8) (select |#length| sort_~x.base)) (<= sort_~n (+ sort_~pass~2 v_prenex_1))))) (.cse8 (= 1 (select |#valid| sort_~x.base)))) (or (< .cse0 4) (< .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (not (= (select |#valid| |sort_#in~x.base|) 1)) (and .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 (<= (+ .cse10 4) .cse11) .cse8) (and (<= (+ .cse10 sort_~x.offset 8) .cse11) .cse2 .cse4 .cse6 .cse7 .cse12 .cse9 .cse8) (not (= 0 |sort_#in~x.offset|)) (and .cse2 .cse4 .cse5 .cse6 .cse7 .cse12 .cse8)))) [2018-01-31 08:26:49,764 INFO L399 ceAbstractionStarter]: For program point L543'(lines 543 547) no Hoare annotation was computed. [2018-01-31 08:26:49,765 INFO L399 ceAbstractionStarter]: For program point sortErr0RequiresViolation(lines 1 557) no Hoare annotation was computed. [2018-01-31 08:26:49,765 INFO L399 ceAbstractionStarter]: For program point L545''(line 545) no Hoare annotation was computed. [2018-01-31 08:26:49,765 INFO L399 ceAbstractionStarter]: For program point sortErr5RequiresViolation(lines 1 557) no Hoare annotation was computed. [2018-01-31 08:26:49,765 INFO L399 ceAbstractionStarter]: For program point sortEXIT(lines 540 548) no Hoare annotation was computed. [2018-01-31 08:26:49,765 INFO L402 ceAbstractionStarter]: At program point sortENTRY(lines 540 548) the Hoare annotation is: true [2018-01-31 08:26:49,765 INFO L399 ceAbstractionStarter]: For program point sortErr10RequiresViolation(lines 1 557) no Hoare annotation was computed. [2018-01-31 08:26:49,765 INFO L399 ceAbstractionStarter]: For program point L544'''(lines 544 547) no Hoare annotation was computed. [2018-01-31 08:26:49,765 INFO L399 ceAbstractionStarter]: For program point sortErr3RequiresViolation(lines 1 557) no Hoare annotation was computed. [2018-01-31 08:26:49,765 INFO L399 ceAbstractionStarter]: For program point L544''''(line 544) no Hoare annotation was computed. [2018-01-31 08:26:49,765 INFO L399 ceAbstractionStarter]: For program point L543''''(line 543) no Hoare annotation was computed. [2018-01-31 08:26:49,765 INFO L399 ceAbstractionStarter]: For program point L543'''''(line 543) no Hoare annotation was computed. [2018-01-31 08:26:49,765 INFO L399 ceAbstractionStarter]: For program point sortErr11RequiresViolation(lines 1 557) no Hoare annotation was computed. [2018-01-31 08:26:49,765 INFO L399 ceAbstractionStarter]: For program point L545''''(line 545) no Hoare annotation was computed. [2018-01-31 08:26:49,765 INFO L399 ceAbstractionStarter]: For program point sortErr2RequiresViolation(lines 1 557) no Hoare annotation was computed. [2018-01-31 08:26:49,766 INFO L399 ceAbstractionStarter]: For program point L544'(lines 544 547) no Hoare annotation was computed. [2018-01-31 08:26:49,766 INFO L399 ceAbstractionStarter]: For program point L545'''(line 545) no Hoare annotation was computed. [2018-01-31 08:26:49,766 INFO L399 ceAbstractionStarter]: For program point sortErr1RequiresViolation(lines 1 557) no Hoare annotation was computed. [2018-01-31 08:26:49,766 INFO L399 ceAbstractionStarter]: For program point sortErr6RequiresViolation(lines 1 557) no Hoare annotation was computed. [2018-01-31 08:26:49,766 INFO L399 ceAbstractionStarter]: For program point L543'''''''(lines 543 547) no Hoare annotation was computed. [2018-01-31 08:26:49,766 INFO L399 ceAbstractionStarter]: For program point L545''''''(line 545) no Hoare annotation was computed. [2018-01-31 08:26:49,766 INFO L399 ceAbstractionStarter]: For program point sortErr4RequiresViolation(lines 1 557) no Hoare annotation was computed. [2018-01-31 08:26:49,766 INFO L399 ceAbstractionStarter]: For program point L546''(line 546) no Hoare annotation was computed. [2018-01-31 08:26:49,766 INFO L399 ceAbstractionStarter]: For program point L544'''''(line 544) no Hoare annotation was computed. [2018-01-31 08:26:49,766 INFO L399 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-31 08:26:49,767 INFO L399 ceAbstractionStarter]: For program point L546'''(line 546) no Hoare annotation was computed. [2018-01-31 08:26:49,767 INFO L399 ceAbstractionStarter]: For program point sortErr9RequiresViolation(lines 1 557) no Hoare annotation was computed. [2018-01-31 08:26:49,775 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:26:49,776 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:26:49,777 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:26:49,777 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:26:49,779 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,779 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,780 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,780 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,780 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,780 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,781 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,781 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,781 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,781 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,782 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,782 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,782 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,782 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,797 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:26:49,797 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:26:49,798 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:26:49,798 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:26:49,798 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,798 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,799 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,799 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,799 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,799 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,800 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,800 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,800 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,800 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,800 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,801 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,801 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,801 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,811 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:26:49,811 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:26:49,812 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,812 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,812 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,812 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,813 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,813 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,813 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,813 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,814 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,814 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,814 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,814 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,815 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,815 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,824 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,826 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:26:49,827 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:26:49,827 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,827 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,827 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,828 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,828 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,828 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,828 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,828 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,828 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,828 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,829 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,829 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,829 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,829 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,829 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:26:49 BoogieIcfgContainer [2018-01-31 08:26:49,831 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 08:26:49,832 INFO L168 Benchmark]: Toolchain (without parser) took 15361.47 ms. Allocated memory was 303.6 MB in the beginning and 556.8 MB in the end (delta: 253.2 MB). Free memory was 263.3 MB in the beginning and 428.8 MB in the end (delta: -165.5 MB). Peak memory consumption was 205.1 MB. Max. memory is 5.3 GB. [2018-01-31 08:26:49,834 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 303.6 MB. Free memory is still 269.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:26:49,834 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.24 ms. Allocated memory is still 303.6 MB. Free memory was 262.3 MB in the beginning and 252.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:26:49,834 INFO L168 Benchmark]: Boogie Preprocessor took 31.62 ms. Allocated memory is still 303.6 MB. Free memory was 252.3 MB in the beginning and 250.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:26:49,835 INFO L168 Benchmark]: RCFGBuilder took 593.99 ms. Allocated memory is still 303.6 MB. Free memory was 250.3 MB in the beginning and 231.3 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:26:49,835 INFO L168 Benchmark]: TraceAbstraction took 14426.04 ms. Allocated memory was 303.6 MB in the beginning and 556.8 MB in the end (delta: 253.2 MB). Free memory was 230.3 MB in the beginning and 428.8 MB in the end (delta: -198.5 MB). Peak memory consumption was 172.2 MB. Max. memory is 5.3 GB. [2018-01-31 08:26:49,837 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.24 ms. Allocated memory is still 303.6 MB. Free memory is still 269.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 300.24 ms. Allocated memory is still 303.6 MB. Free memory was 262.3 MB in the beginning and 252.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.62 ms. Allocated memory is still 303.6 MB. Free memory was 252.3 MB in the beginning and 250.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 593.99 ms. Allocated memory is still 303.6 MB. Free memory was 250.3 MB in the beginning and 231.3 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 14426.04 ms. Allocated memory was 303.6 MB in the beginning and 556.8 MB in the end (delta: 253.2 MB). Free memory was 230.3 MB in the beginning and 428.8 MB in the end (delta: -198.5 MB). Peak memory consumption was 172.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 549]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold - InvariantResult [Line: 544]: Loop Invariant [2018-01-31 08:26:49,846 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:26:49,846 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:26:49,847 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:26:49,847 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:26:49,847 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,847 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,848 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,848 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,848 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,848 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,848 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,849 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,849 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,849 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,849 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,849 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,849 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,850 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,852 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:26:49,852 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:26:49,853 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:26:49,853 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:26:49,853 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,853 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,853 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,854 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,854 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,854 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,854 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,854 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,855 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,855 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,855 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,855 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,855 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,856 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((unknown-#length-unknown[x] < 4 || unknown-#length-unknown[x] < 4 * \old(n)) || ((((((pass + 1 <= n && pass == 1) && 4 * \old(n) <= unknown-#length-unknown[x]) && 0 == i) && 4 * n <= unknown-#length-unknown[x]) && x == 0) && 1 == \valid[x])) || !(\valid[x] == 1)) || (((((((pass + 1 <= n && pass == 1) && 4 * \old(n) <= unknown-#length-unknown[x]) && 4 * n <= unknown-#length-unknown[x]) && x == 0) && 1 <= i) && 4 * i + 4 <= unknown-#length-unknown[x]) && 1 == \valid[x])) || (((((((4 * i + x + 8 <= unknown-#length-unknown[x] && pass + 1 <= n) && 4 * \old(n) <= unknown-#length-unknown[x]) && 4 * n <= unknown-#length-unknown[x]) && x == 0) && (\exists v_prenex_1 : int :: 4 * v_prenex_1 + x + 8 <= unknown-#length-unknown[x] && n <= pass + v_prenex_1)) && 1 <= i) && 1 == \valid[x])) || !(0 == x)) || ((((((pass + 1 <= n && 4 * \old(n) <= unknown-#length-unknown[x]) && 0 == i) && 4 * n <= unknown-#length-unknown[x]) && x == 0) && (\exists v_prenex_1 : int :: 4 * v_prenex_1 + x + 8 <= unknown-#length-unknown[x] && n <= pass + v_prenex_1)) && 1 == \valid[x]) - InvariantResult [Line: 543]: Loop Invariant [2018-01-31 08:26:49,858 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:26:49,862 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:26:49,862 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,863 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,863 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,863 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,863 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,864 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,864 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,864 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,864 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,864 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,865 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,865 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,865 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,865 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,865 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,869 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:26:49,869 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:26:49,870 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,870 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,870 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,870 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,870 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,871 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,871 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,871 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,871 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,871 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,872 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,872 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,872 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,872 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:26:49,872 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((x == 0 && pass == 1) && 4 * \old(n) <= unknown-#length-unknown[x]) && 1 == \valid[x]) && 4 * n <= unknown-#length-unknown[x]) && 4 <= unknown-#length-unknown[x]) || unknown-#length-unknown[x] < 4) || unknown-#length-unknown[x] < 4 * \old(n)) || ((((((4 * \old(n) <= unknown-#length-unknown[x] && 4 * n <= unknown-#length-unknown[x]) && 2 <= i) && x == 0) && (\exists v_prenex_1 : int :: 4 * v_prenex_1 + x + 8 <= unknown-#length-unknown[x] && n <= pass + v_prenex_1)) && 4 * i + 4 <= unknown-#length-unknown[x]) && 1 == \valid[x])) || !(\valid[x] == 1)) || ((((((4 * \old(n) <= unknown-#length-unknown[x] && 4 * n <= unknown-#length-unknown[x]) && n <= pass) && x == 0) && 1 <= i) && 4 * i + 4 <= unknown-#length-unknown[x]) && 1 == \valid[x])) || !(0 == x)) || (((((((n <= pass + 1 && 4 * \old(n) <= unknown-#length-unknown[x]) && 4 * n <= unknown-#length-unknown[x]) && x + 12 <= unknown-#length-unknown[x]) && x == 0) && 1 <= i) && 1 == \valid[x]) && i <= 2) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 66 locations, 13 error locations. SAFE Result, 14.3s OverallTime, 9 OverallIterations, 11 TraceHistogramMax, 8.1s AutomataDifference, 0.0s DeadEndRemovalTime, 1.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 468 SDtfs, 2174 SDslu, 2779 SDs, 0 SdLazy, 2187 SolverSat, 124 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 501 GetRequests, 286 SyntacticMatches, 2 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1955 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=212occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 211 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 31 NumberOfFragments, 449 HoareAnnotationTreeSize, 8 FomulaSimplifications, 1224 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 1007 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 730 NumberOfCodeBlocks, 680 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 717 ConstructedInterpolants, 32 QuantifiedInterpolants, 302267 SizeOfPredicates, 30 NumberOfNonLiveVariables, 595 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 13 InterpolantComputations, 6 PerfectInterpolantSequences, 697/1105 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_08-26-49-878.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_08-26-49-878.csv Received shutdown request...