java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-memsafety/array03-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:44:44,198 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:44:44,200 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:44:44,213 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:44:44,213 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:44:44,214 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:44:44,215 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:44:44,217 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:44:44,219 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:44:44,220 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:44:44,221 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:44:44,221 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:44:44,221 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:44:44,222 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:44:44,223 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:44:44,226 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:44:44,228 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:44:44,230 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:44:44,231 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:44:44,232 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:44:44,234 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:44:44,235 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:44:44,235 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:44:44,236 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:44:44,237 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:44:44,238 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:44:44,238 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:44:44,239 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:44:44,239 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:44:44,239 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:44:44,240 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:44:44,240 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 12:44:44,250 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:44:44,250 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:44:44,251 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:44:44,251 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:44:44,252 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:44:44,252 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:44:44,252 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:44:44,253 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:44:44,253 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:44:44,253 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:44:44,253 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:44:44,253 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:44:44,254 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:44:44,254 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:44:44,254 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:44:44,254 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:44:44,254 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:44:44,255 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:44:44,255 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:44:44,255 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:44:44,255 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:44:44,255 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:44:44,256 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:44:44,256 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:44:44,256 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:44:44,256 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:44:44,257 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:44:44,257 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:44:44,257 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 12:44:44,257 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:44:44,257 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:44:44,257 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:44:44,258 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:44:44,258 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:44:44,295 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:44:44,308 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:44:44,312 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:44:44,314 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:44:44,314 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:44:44,315 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/array03-alloca_true-valid-memsafety_true-termination.i [2018-01-24 12:44:44,496 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:44:44,501 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:44:44,502 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:44:44,502 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:44:44,507 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:44:44,508 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:44:44" (1/1) ... [2018-01-24 12:44:44,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aad67c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:44, skipping insertion in model container [2018-01-24 12:44:44,511 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:44:44" (1/1) ... [2018-01-24 12:44:44,525 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:44:44,563 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:44:44,677 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:44:44,698 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:44:44,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:44 WrapperNode [2018-01-24 12:44:44,706 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:44:44,707 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:44:44,707 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:44:44,707 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:44:44,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:44" (1/1) ... [2018-01-24 12:44:44,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:44" (1/1) ... [2018-01-24 12:44:44,728 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:44" (1/1) ... [2018-01-24 12:44:44,729 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:44" (1/1) ... [2018-01-24 12:44:44,733 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:44" (1/1) ... [2018-01-24 12:44:44,737 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:44" (1/1) ... [2018-01-24 12:44:44,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:44" (1/1) ... [2018-01-24 12:44:44,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:44:44,741 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:44:44,741 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:44:44,741 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:44:44,742 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:44" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:44:44,794 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:44:44,794 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:44:44,794 INFO L136 BoogieDeclarations]: Found implementation of procedure test_fun [2018-01-24 12:44:44,794 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:44:44,794 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:44:44,794 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:44:44,794 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:44:44,794 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:44:44,795 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:44:44,795 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:44:44,795 INFO L128 BoogieDeclarations]: Found specification of procedure test_fun [2018-01-24 12:44:44,795 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:44:44,795 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:44:44,795 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:44:45,002 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:44:45,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:44:45 BoogieIcfgContainer [2018-01-24 12:44:45,003 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:44:45,003 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:44:45,003 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:44:45,005 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:44:45,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:44:44" (1/3) ... [2018-01-24 12:44:45,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4949d26c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:44:45, skipping insertion in model container [2018-01-24 12:44:45,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:44" (2/3) ... [2018-01-24 12:44:45,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4949d26c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:44:45, skipping insertion in model container [2018-01-24 12:44:45,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:44:45" (3/3) ... [2018-01-24 12:44:45,008 INFO L105 eAbstractionObserver]: Analyzing ICFG array03-alloca_true-valid-memsafety_true-termination.i [2018-01-24 12:44:45,014 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:44:45,019 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-24 12:44:45,061 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:44:45,061 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:44:45,061 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:44:45,061 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:44:45,061 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:44:45,062 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:44:45,062 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:44:45,062 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:44:45,063 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:44:45,083 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-01-24 12:44:45,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:44:45,089 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:44:45,090 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:44:45,090 INFO L371 AbstractCegarLoop]: === Iteration 1 === [test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr9RequiresViolation, test_funErr2RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:44:45,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1616393893, now seen corresponding path program 1 times [2018-01-24 12:44:45,096 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:44:45,137 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:45,137 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:45,137 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:45,137 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:44:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:45,198 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:44:45,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:44:45,348 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:44:45,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:44:45,348 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:44:45,351 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:44:45,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:44:45,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:44:45,369 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 6 states. [2018-01-24 12:44:45,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:44:45,627 INFO L93 Difference]: Finished difference Result 84 states and 102 transitions. [2018-01-24 12:44:45,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:44:45,629 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-01-24 12:44:45,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:44:45,640 INFO L225 Difference]: With dead ends: 84 [2018-01-24 12:44:45,640 INFO L226 Difference]: Without dead ends: 41 [2018-01-24 12:44:45,643 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:44:45,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-24 12:44:45,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-24 12:44:45,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 12:44:45,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-01-24 12:44:45,671 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 14 [2018-01-24 12:44:45,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:44:45,671 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-01-24 12:44:45,672 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:44:45,672 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-01-24 12:44:45,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:44:45,672 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:44:45,672 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:44:45,672 INFO L371 AbstractCegarLoop]: === Iteration 2 === [test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr9RequiresViolation, test_funErr2RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:44:45,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1616393894, now seen corresponding path program 1 times [2018-01-24 12:44:45,673 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:44:45,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:45,674 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:45,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:45,674 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:44:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:45,691 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:44:45,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:44:45,816 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:44:45,817 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:44:45,817 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:44:45,819 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:44:45,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:44:45,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:44:45,820 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 7 states. [2018-01-24 12:44:46,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:44:46,035 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2018-01-24 12:44:46,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:44:46,036 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-01-24 12:44:46,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:44:46,039 INFO L225 Difference]: With dead ends: 67 [2018-01-24 12:44:46,039 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 12:44:46,040 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:44:46,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 12:44:46,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-01-24 12:44:46,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-24 12:44:46,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2018-01-24 12:44:46,049 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 14 [2018-01-24 12:44:46,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:44:46,049 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2018-01-24 12:44:46,050 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:44:46,050 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2018-01-24 12:44:46,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 12:44:46,051 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:44:46,051 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:44:46,051 INFO L371 AbstractCegarLoop]: === Iteration 3 === [test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr9RequiresViolation, test_funErr2RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:44:46,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1978668179, now seen corresponding path program 1 times [2018-01-24 12:44:46,051 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:44:46,053 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:46,053 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:46,053 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:46,053 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:44:46,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:46,065 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:44:46,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:44:46,115 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:44:46,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:44:46,115 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:44:46,116 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:44:46,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:44:46,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:44:46,116 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand 5 states. [2018-01-24 12:44:46,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:44:46,185 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-01-24 12:44:46,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:44:46,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 12:44:46,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:44:46,187 INFO L225 Difference]: With dead ends: 64 [2018-01-24 12:44:46,187 INFO L226 Difference]: Without dead ends: 58 [2018-01-24 12:44:46,187 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:44:46,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-24 12:44:46,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-01-24 12:44:46,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-24 12:44:46,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2018-01-24 12:44:46,195 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 18 [2018-01-24 12:44:46,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:44:46,196 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-01-24 12:44:46,196 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:44:46,196 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-01-24 12:44:46,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 12:44:46,197 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:44:46,197 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:44:46,197 INFO L371 AbstractCegarLoop]: === Iteration 4 === [test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr9RequiresViolation, test_funErr2RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:44:46,198 INFO L82 PathProgramCache]: Analyzing trace with hash 35069262, now seen corresponding path program 1 times [2018-01-24 12:44:46,198 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:44:46,199 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:46,199 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:46,199 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:46,199 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:44:46,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:46,217 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:44:46,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:44:46,346 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:44:46,346 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:44:46,355 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:46,356 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:44:46,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:46,393 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:44:46,447 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:44:46,447 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:44:46,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:44:46,519 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:44:46,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [9] total 14 [2018-01-24 12:44:46,519 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:44:46,519 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:44:46,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:44:46,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:44:46,520 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 6 states. [2018-01-24 12:44:46,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:44:46,681 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2018-01-24 12:44:46,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:44:46,682 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-24 12:44:46,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:44:46,683 INFO L225 Difference]: With dead ends: 116 [2018-01-24 12:44:46,683 INFO L226 Difference]: Without dead ends: 86 [2018-01-24 12:44:46,684 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-01-24 12:44:46,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-24 12:44:46,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2018-01-24 12:44:46,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-24 12:44:46,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-01-24 12:44:46,696 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 23 [2018-01-24 12:44:46,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:44:46,696 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-01-24 12:44:46,697 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:44:46,697 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-01-24 12:44:46,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 12:44:46,698 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:44:46,698 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:44:46,698 INFO L371 AbstractCegarLoop]: === Iteration 5 === [test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr9RequiresViolation, test_funErr2RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:44:46,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1553278640, now seen corresponding path program 1 times [2018-01-24 12:44:46,699 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:44:46,700 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:46,700 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:46,700 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:46,700 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:44:46,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:46,717 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:44:46,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:44:46,937 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:44:46,937 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:44:46,945 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:46,945 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:44:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:46,970 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:44:46,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 12:44:46,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:44:46,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:44:46,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-24 12:44:47,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:44:47,124 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:44:47,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:44:47,424 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:44:47,425 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 12:44:47,430 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:47,430 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:44:47,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:47,459 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:44:47,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 12:44:47,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:44:47,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:44:47,471 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-24 12:44:47,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:44:47,505 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:44:47,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:44:47,585 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:44:47,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7, 7, 7] total 18 [2018-01-24 12:44:47,586 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:44:47,586 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 12:44:47,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 12:44:47,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2018-01-24 12:44:47,587 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 13 states. [2018-01-24 12:44:47,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:44:47,842 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2018-01-24 12:44:47,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:44:47,843 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-01-24 12:44:47,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:44:47,844 INFO L225 Difference]: With dead ends: 83 [2018-01-24 12:44:47,846 INFO L226 Difference]: Without dead ends: 76 [2018-01-24 12:44:47,847 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2018-01-24 12:44:47,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-24 12:44:47,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 61. [2018-01-24 12:44:47,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-24 12:44:47,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2018-01-24 12:44:47,858 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 23 [2018-01-24 12:44:47,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:44:47,858 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2018-01-24 12:44:47,858 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 12:44:47,859 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-01-24 12:44:47,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 12:44:47,860 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:44:47,860 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:44:47,860 INFO L371 AbstractCegarLoop]: === Iteration 6 === [test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr9RequiresViolation, test_funErr2RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:44:47,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1156880581, now seen corresponding path program 1 times [2018-01-24 12:44:47,860 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:44:47,861 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:47,861 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:47,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:47,862 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:44:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:47,878 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:44:47,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:44:47,949 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:44:47,950 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:44:47,950 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:44:47,950 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:44:47,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:44:47,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:44:47,951 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand 4 states. [2018-01-24 12:44:47,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:44:47,994 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2018-01-24 12:44:47,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:44:47,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-24 12:44:47,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:44:47,995 INFO L225 Difference]: With dead ends: 61 [2018-01-24 12:44:47,996 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 12:44:47,996 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:44:47,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 12:44:47,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 12:44:47,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 12:44:47,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 12:44:47,997 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-01-24 12:44:47,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:44:47,998 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 12:44:47,998 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:44:47,998 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 12:44:47,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 12:44:48,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 12:44:48,345 WARN L146 SmtUtils]: Spent 209ms on a formula simplification. DAG size of input: 54 DAG size of output 47 [2018-01-24 12:44:48,427 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 565) no Hoare annotation was computed. [2018-01-24 12:44:48,427 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 565) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:44:48,427 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 565) no Hoare annotation was computed. [2018-01-24 12:44:48,428 INFO L401 ceAbstractionStarter]: For program point test_funErr6RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-24 12:44:48,428 INFO L401 ceAbstractionStarter]: For program point test_funErr12RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-24 12:44:48,428 INFO L401 ceAbstractionStarter]: For program point L553'(line 553) no Hoare annotation was computed. [2018-01-24 12:44:48,428 INFO L401 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-24 12:44:48,428 INFO L401 ceAbstractionStarter]: For program point L544(lines 544 556) no Hoare annotation was computed. [2018-01-24 12:44:48,428 INFO L401 ceAbstractionStarter]: For program point test_funErr5RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-24 12:44:48,428 INFO L401 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-24 12:44:48,428 INFO L401 ceAbstractionStarter]: For program point test_funErr7RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-24 12:44:48,429 INFO L401 ceAbstractionStarter]: For program point test_funErr11RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-24 12:44:48,429 INFO L401 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-24 12:44:48,429 INFO L401 ceAbstractionStarter]: For program point test_funErr8RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-24 12:44:48,429 INFO L401 ceAbstractionStarter]: For program point test_funEXIT(lines 540 557) no Hoare annotation was computed. [2018-01-24 12:44:48,429 INFO L401 ceAbstractionStarter]: For program point test_funErr3RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-24 12:44:48,429 INFO L401 ceAbstractionStarter]: For program point L551'''(lines 551 554) no Hoare annotation was computed. [2018-01-24 12:44:48,429 INFO L404 ceAbstractionStarter]: At program point test_funENTRY(lines 540 557) the Hoare annotation is: true [2018-01-24 12:44:48,429 INFO L401 ceAbstractionStarter]: For program point L551''''(lines 551 554) no Hoare annotation was computed. [2018-01-24 12:44:48,429 INFO L401 ceAbstractionStarter]: For program point test_funErr0RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-24 12:44:48,430 INFO L401 ceAbstractionStarter]: For program point L544'''(lines 544 556) no Hoare annotation was computed. [2018-01-24 12:44:48,430 INFO L401 ceAbstractionStarter]: For program point L551'(line 551) no Hoare annotation was computed. [2018-01-24 12:44:48,430 INFO L401 ceAbstractionStarter]: For program point test_funErr1RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-24 12:44:48,430 INFO L401 ceAbstractionStarter]: For program point test_funErr2RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-24 12:44:48,430 INFO L401 ceAbstractionStarter]: For program point L553''(line 553) no Hoare annotation was computed. [2018-01-24 12:44:48,430 INFO L401 ceAbstractionStarter]: For program point L548'(line 548) no Hoare annotation was computed. [2018-01-24 12:44:48,430 INFO L401 ceAbstractionStarter]: For program point test_funErr10RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-24 12:44:48,430 INFO L401 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-01-24 12:44:48,430 INFO L401 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-24 12:44:48,431 INFO L401 ceAbstractionStarter]: For program point L551(lines 551 554) no Hoare annotation was computed. [2018-01-24 12:44:48,431 INFO L401 ceAbstractionStarter]: For program point L552'(line 552) no Hoare annotation was computed. [2018-01-24 12:44:48,431 INFO L401 ceAbstractionStarter]: For program point L555(line 555) no Hoare annotation was computed. [2018-01-24 12:44:48,431 INFO L401 ceAbstractionStarter]: For program point L553'''(line 553) no Hoare annotation was computed. [2018-01-24 12:44:48,431 INFO L401 ceAbstractionStarter]: For program point test_funErr9RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-24 12:44:48,431 INFO L401 ceAbstractionStarter]: For program point test_funErr4RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-24 12:44:48,431 INFO L397 ceAbstractionStarter]: At program point L544''(lines 544 556) the Hoare annotation is: (let ((.cse0 (not (= (select |#valid| |test_fun_#in~a.base|) 1))) (.cse1 (not (= 0 |test_fun_#in~a.offset|))) (.cse2 (not (exists ((v_main_~array_size~7_BEFORE_CALL_2 Int)) (and (= (select |#length| |test_fun_#in~a.base|) (* 4 v_main_~array_size~7_BEFORE_CALL_2)) (<= |test_fun_#in~N| v_main_~array_size~7_BEFORE_CALL_2))))) (.cse3 (< (select |#length| |test_fun_#in~a.base|) 4))) (and (or .cse0 (<= test_fun_~N 1) .cse1 (< 1 |test_fun_#in~N|) .cse2 .cse3) (let ((.cse4 (= test_fun_~a.offset 0)) (.cse5 (= 1 (select |#valid| test_fun_~a.base))) (.cse6 (exists ((v_main_~array_size~7_BEFORE_CALL_2 Int)) (and (<= test_fun_~N v_main_~array_size~7_BEFORE_CALL_2) (= (* 4 v_main_~array_size~7_BEFORE_CALL_2) (select |#length| test_fun_~a.base)))))) (or .cse0 .cse1 (and (<= 4 (select |#length| test_fun_~a.base)) .cse4 .cse5 (<= |test_fun_#in~N| test_fun_~N) .cse6 (<= 0 test_fun_~i~2)) (and .cse4 .cse5 (<= 1 test_fun_~i~2) .cse6) .cse2 .cse3)))) [2018-01-24 12:44:48,431 INFO L401 ceAbstractionStarter]: For program point test_funErr13RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-24 12:44:48,432 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 565) the Hoare annotation is: true [2018-01-24 12:44:48,432 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 565) no Hoare annotation was computed. [2018-01-24 12:44:48,432 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 565) the Hoare annotation is: true [2018-01-24 12:44:48,432 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 565) no Hoare annotation was computed. [2018-01-24 12:44:48,432 INFO L401 ceAbstractionStarter]: For program point L560(lines 560 562) no Hoare annotation was computed. [2018-01-24 12:44:48,432 INFO L397 ceAbstractionStarter]: At program point L564(line 564) the Hoare annotation is: (let ((.cse0 (* 4 main_~array_size~7))) (and (= 0 |main_#t~malloc9.offset|) (= .cse0 (select |#length| main_~numbers~7.base)) (= 0 main_~numbers~7.offset) (= .cse0 (select |#length| |main_#t~malloc9.base|)) (= 1 (select |#valid| |main_#t~malloc9.base|)) (<= 1 main_~array_size~7) (= (store |#valid| |main_#t~malloc9.base| 0) |old(#valid)|) (= 1 (select |#valid| main_~numbers~7.base)))) [2018-01-24 12:44:48,432 INFO L401 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-01-24 12:44:48,433 INFO L401 ceAbstractionStarter]: For program point L563'(line 563) no Hoare annotation was computed. [2018-01-24 12:44:48,433 INFO L401 ceAbstractionStarter]: For program point L564'(line 564) no Hoare annotation was computed. [2018-01-24 12:44:48,433 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 558 565) no Hoare annotation was computed. [2018-01-24 12:44:48,433 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 558 565) no Hoare annotation was computed. [2018-01-24 12:44:48,433 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 558 565) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:44:48,433 INFO L401 ceAbstractionStarter]: For program point L560''(lines 560 562) no Hoare annotation was computed. [2018-01-24 12:44:48,433 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 558 565) no Hoare annotation was computed. [2018-01-24 12:44:48,439 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:48,440 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:48,441 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:48,441 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:48,441 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:48,442 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:48,442 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:48,442 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:48,444 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:48,445 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:48,445 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:48,445 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:48,445 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:48,446 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:48,446 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:48,451 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:48,451 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:48,452 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:48,452 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:48,452 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:48,453 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:48,453 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:48,453 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:48,453 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:48,454 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:48,454 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:48,454 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:48,454 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:48,455 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:48,455 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:48,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:44:48 BoogieIcfgContainer [2018-01-24 12:44:48,458 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:44:48,459 INFO L168 Benchmark]: Toolchain (without parser) took 3962.25 ms. Allocated memory was 306.2 MB in the beginning and 511.2 MB in the end (delta: 205.0 MB). Free memory was 266.1 MB in the beginning and 449.4 MB in the end (delta: -183.3 MB). Peak memory consumption was 135.9 MB. Max. memory is 5.3 GB. [2018-01-24 12:44:48,460 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 306.2 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:44:48,461 INFO L168 Benchmark]: CACSL2BoogieTranslator took 204.72 ms. Allocated memory is still 306.2 MB. Free memory was 265.1 MB in the beginning and 254.9 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-24 12:44:48,461 INFO L168 Benchmark]: Boogie Preprocessor took 33.67 ms. Allocated memory is still 306.2 MB. Free memory was 254.9 MB in the beginning and 252.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:44:48,462 INFO L168 Benchmark]: RCFGBuilder took 262.09 ms. Allocated memory is still 306.2 MB. Free memory was 252.9 MB in the beginning and 234.8 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 5.3 GB. [2018-01-24 12:44:48,462 INFO L168 Benchmark]: TraceAbstraction took 3454.45 ms. Allocated memory was 306.2 MB in the beginning and 511.2 MB in the end (delta: 205.0 MB). Free memory was 234.8 MB in the beginning and 449.4 MB in the end (delta: -214.5 MB). Peak memory consumption was 104.6 MB. Max. memory is 5.3 GB. [2018-01-24 12:44:48,464 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 306.2 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 204.72 ms. Allocated memory is still 306.2 MB. Free memory was 265.1 MB in the beginning and 254.9 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.67 ms. Allocated memory is still 306.2 MB. Free memory was 254.9 MB in the beginning and 252.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 262.09 ms. Allocated memory is still 306.2 MB. Free memory was 252.9 MB in the beginning and 234.8 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3454.45 ms. Allocated memory was 306.2 MB in the beginning and 511.2 MB in the end (delta: 205.0 MB). Free memory was 234.8 MB in the beginning and 449.4 MB in the end (delta: -214.5 MB). Peak memory consumption was 104.6 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_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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 - 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: 558]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - InvariantResult [Line: 544]: Loop Invariant [2018-01-24 12:44:48,471 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:48,471 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:48,472 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:48,472 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:48,472 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:48,472 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:48,473 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:48,473 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:48,473 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:48,473 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:48,474 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:48,474 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:48,474 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:48,474 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:48,474 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:48,477 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:48,477 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:48,477 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:48,478 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:48,478 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:48,478 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:48,478 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:48,478 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~7_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 12:44:48,479 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:48,479 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:48,479 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:48,479 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:48,480 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:48,480 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:44:48,480 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((!(\valid[a] == 1) || N <= 1) || !(0 == a)) || 1 < \old(N)) || !(\exists v_main_~array_size~7_BEFORE_CALL_2 : int :: unknown-#length-unknown[a] == 4 * v_main_~array_size~7_BEFORE_CALL_2 && \old(N) <= v_main_~array_size~7_BEFORE_CALL_2)) || unknown-#length-unknown[a] < 4) && (((((!(\valid[a] == 1) || !(0 == a)) || (((((4 <= unknown-#length-unknown[a] && a == 0) && 1 == \valid[a]) && \old(N) <= N) && (\exists v_main_~array_size~7_BEFORE_CALL_2 : int :: N <= v_main_~array_size~7_BEFORE_CALL_2 && 4 * v_main_~array_size~7_BEFORE_CALL_2 == unknown-#length-unknown[a])) && 0 <= i)) || (((a == 0 && 1 == \valid[a]) && 1 <= i) && (\exists v_main_~array_size~7_BEFORE_CALL_2 : int :: N <= v_main_~array_size~7_BEFORE_CALL_2 && 4 * v_main_~array_size~7_BEFORE_CALL_2 == unknown-#length-unknown[a]))) || !(\exists v_main_~array_size~7_BEFORE_CALL_2 : int :: unknown-#length-unknown[a] == 4 * v_main_~array_size~7_BEFORE_CALL_2 && \old(N) <= v_main_~array_size~7_BEFORE_CALL_2)) || unknown-#length-unknown[a] < 4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 51 locations, 15 error locations. SAFE Result, 3.3s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 181 SDtfs, 366 SDslu, 474 SDs, 0 SdLazy, 448 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 184 GetRequests, 124 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=4, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 23 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 14 NumberOfFragments, 173 HoareAnnotationTreeSize, 9 FomulaSimplifications, 44 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 342 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 188 NumberOfCodeBlocks, 188 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 245 ConstructedInterpolants, 50 QuantifiedInterpolants, 51166 SizeOfPredicates, 19 NumberOfNonLiveVariables, 283 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 15/26 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: 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/array03-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-44-48-486.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array03-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-44-48-486.csv Received shutdown request...