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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 02:39:59,352 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 02:39:59,354 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 02:39:59,364 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 02:39:59,364 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 02:39:59,365 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 02:39:59,366 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 02:39:59,368 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 02:39:59,370 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 02:39:59,370 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 02:39:59,372 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 02:39:59,372 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 02:39:59,373 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 02:39:59,374 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 02:39:59,375 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 02:39:59,377 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 02:39:59,378 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 02:39:59,380 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 02:39:59,381 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 02:39:59,382 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 02:39:59,384 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 02:39:59,384 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 02:39:59,384 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 02:39:59,385 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 02:39:59,386 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 02:39:59,387 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 02:39:59,387 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 02:39:59,388 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 02:39:59,388 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 02:39:59,388 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 02:39:59,388 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 02:39:59,389 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 02:39:59,398 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 02:39:59,398 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 02:39:59,399 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 02:39:59,399 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 02:39:59,400 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 02:39:59,400 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 02:39:59,400 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 02:39:59,400 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 02:39:59,400 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 02:39:59,401 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 02:39:59,401 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 02:39:59,401 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 02:39:59,401 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 02:39:59,401 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 02:39:59,401 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 02:39:59,401 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 02:39:59,402 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 02:39:59,402 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 02:39:59,402 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 02:39:59,402 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 02:39:59,402 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 02:39:59,402 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 02:39:59,403 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 02:39:59,430 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 02:39:59,438 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 02:39:59,441 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 02:39:59,442 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 02:39:59,442 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 02:39:59,443 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_false-valid-deref.i [2018-02-04 02:39:59,586 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 02:39:59,588 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 02:39:59,588 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 02:39:59,588 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 02:39:59,593 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 02:39:59,594 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:39:59" (1/1) ... [2018-02-04 02:39:59,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fa21b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:39:59, skipping insertion in model container [2018-02-04 02:39:59,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:39:59" (1/1) ... [2018-02-04 02:39:59,607 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 02:39:59,640 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 02:39:59,722 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 02:39:59,734 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 02:39:59,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:39:59 WrapperNode [2018-02-04 02:39:59,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 02:39:59,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 02:39:59,740 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 02:39:59,740 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 02:39:59,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:39:59" (1/1) ... [2018-02-04 02:39:59,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:39:59" (1/1) ... [2018-02-04 02:39:59,757 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:39:59" (1/1) ... [2018-02-04 02:39:59,757 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:39:59" (1/1) ... [2018-02-04 02:39:59,759 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:39:59" (1/1) ... [2018-02-04 02:39:59,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:39:59" (1/1) ... [2018-02-04 02:39:59,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:39:59" (1/1) ... [2018-02-04 02:39:59,763 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 02:39:59,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 02:39:59,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 02:39:59,763 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 02:39:59,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:39:59" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-04 02:39:59,800 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 02:39:59,800 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 02:39:59,801 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-04 02:39:59,801 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 02:39:59,801 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 02:39:59,801 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 02:39:59,801 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 02:39:59,801 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 02:39:59,801 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 02:39:59,802 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 02:39:59,802 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 02:39:59,802 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 02:39:59,802 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-04 02:39:59,802 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 02:39:59,802 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 02:39:59,802 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 02:39:59,969 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 02:39:59,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:39:59 BoogieIcfgContainer [2018-02-04 02:39:59,970 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 02:39:59,970 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 02:39:59,970 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 02:39:59,972 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 02:39:59,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 02:39:59" (1/3) ... [2018-02-04 02:39:59,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42568675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:39:59, skipping insertion in model container [2018-02-04 02:39:59,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:39:59" (2/3) ... [2018-02-04 02:39:59,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42568675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:39:59, skipping insertion in model container [2018-02-04 02:39:59,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:39:59" (3/3) ... [2018-02-04 02:39:59,975 INFO L107 eAbstractionObserver]: Analyzing ICFG 960521-1_1_false-valid-deref.i [2018-02-04 02:39:59,980 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 02:39:59,985 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-02-04 02:40:00,022 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 02:40:00,022 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 02:40:00,022 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 02:40:00,022 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 02:40:00,022 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 02:40:00,022 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 02:40:00,022 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 02:40:00,022 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 02:40:00,023 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 02:40:00,031 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-02-04 02:40:00,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 02:40:00,039 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:00,040 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:00,040 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:40:00,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1352732268, now seen corresponding path program 1 times [2018-02-04 02:40:00,079 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:00,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:00,112 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:00,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:00,141 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:40:00,142 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 02:40:00,142 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:00,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:00,143 INFO L182 omatonBuilderFactory]: Interpolants [59#true, 60#false] [2018-02-04 02:40:00,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:00,143 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 02:40:00,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 02:40:00,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 02:40:00,153 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 2 states. [2018-02-04 02:40:00,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:00,165 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2018-02-04 02:40:00,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 02:40:00,166 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-02-04 02:40:00,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:00,172 INFO L225 Difference]: With dead ends: 56 [2018-02-04 02:40:00,172 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 02:40:00,173 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 02:40:00,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 02:40:00,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-04 02:40:00,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 02:40:00,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-02-04 02:40:00,247 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 12 [2018-02-04 02:40:00,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:00,247 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-02-04 02:40:00,247 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 02:40:00,247 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-02-04 02:40:00,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 02:40:00,247 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:00,247 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:00,247 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:40:00,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1000920166, now seen corresponding path program 1 times [2018-02-04 02:40:00,248 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:00,272 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:00,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:00,323 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:40:00,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:40:00,324 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:00,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:00,324 INFO L182 omatonBuilderFactory]: Interpolants [170#true, 171#false, 172#(= 1 (select |#valid| |main_#t~malloc7.base|)), 173#(= 1 (select |#valid| |main_#t~post8.base|))] [2018-02-04 02:40:00,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:00,326 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:40:00,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:40:00,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:40:00,326 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 4 states. [2018-02-04 02:40:00,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:00,405 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-02-04 02:40:00,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 02:40:00,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 02:40:00,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:00,407 INFO L225 Difference]: With dead ends: 52 [2018-02-04 02:40:00,407 INFO L226 Difference]: Without dead ends: 52 [2018-02-04 02:40:00,408 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:40:00,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-04 02:40:00,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-04 02:40:00,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 02:40:00,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-02-04 02:40:00,413 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 14 [2018-02-04 02:40:00,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:00,413 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-02-04 02:40:00,413 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:40:00,413 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-02-04 02:40:00,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 02:40:00,414 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:00,414 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:00,414 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:40:00,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1000920165, now seen corresponding path program 1 times [2018-02-04 02:40:00,415 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:00,429 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:00,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:00,486 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:40:00,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 02:40:00,486 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:00,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:00,487 INFO L182 omatonBuilderFactory]: Interpolants [280#true, 281#false, 282#(<= 1 ~n), 283#(and (= 0 |main_#t~malloc7.offset|) (<= 4 (select |#length| |main_#t~malloc7.base|))), 284#(and (= |main_#t~post8.offset| 0) (<= 4 (select |#length| |main_#t~post8.base|)))] [2018-02-04 02:40:00,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:00,487 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:40:00,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:40:00,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:40:00,488 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 5 states. [2018-02-04 02:40:00,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:00,542 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-02-04 02:40:00,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:40:00,543 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 02:40:00,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:00,543 INFO L225 Difference]: With dead ends: 51 [2018-02-04 02:40:00,544 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 02:40:00,544 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:40:00,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 02:40:00,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-04 02:40:00,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 02:40:00,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-02-04 02:40:00,548 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 14 [2018-02-04 02:40:00,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:00,548 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-02-04 02:40:00,548 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:40:00,549 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-02-04 02:40:00,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 02:40:00,549 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:00,549 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] [2018-02-04 02:40:00,549 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:40:00,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1559748963, now seen corresponding path program 1 times [2018-02-04 02:40:00,550 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:00,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:00,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:00,624 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:40:00,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 02:40:00,624 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:00,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:00,625 INFO L182 omatonBuilderFactory]: Interpolants [391#true, 392#false, 393#(= 1 (select |#valid| |main_#t~malloc6.base|)), 394#(= 1 (select |#valid| ~a.base)), 395#(or (= ~a.base |main_#t~malloc7.base|) (= 1 (select |#valid| ~a.base))), 396#(or (= 1 (select |#valid| ~a.base)) (= ~a.base |main_#t~post8.base|))] [2018-02-04 02:40:00,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:00,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 02:40:00,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 02:40:00,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:40:00,626 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 6 states. [2018-02-04 02:40:00,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:00,699 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2018-02-04 02:40:00,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:40:00,700 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-02-04 02:40:00,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:00,700 INFO L225 Difference]: With dead ends: 48 [2018-02-04 02:40:00,700 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 02:40:00,701 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:40:00,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 02:40:00,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-04 02:40:00,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 02:40:00,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-02-04 02:40:00,703 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 20 [2018-02-04 02:40:00,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:00,703 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-02-04 02:40:00,703 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 02:40:00,704 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2018-02-04 02:40:00,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 02:40:00,704 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:00,704 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] [2018-02-04 02:40:00,704 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:40:00,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1559748962, now seen corresponding path program 1 times [2018-02-04 02:40:00,705 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:00,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:00,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:00,818 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:40:00,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 02:40:00,818 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:00,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:00,819 INFO L182 omatonBuilderFactory]: Interpolants [496#false, 497#(<= 1 ~n), 498#(and (= 0 |main_#t~malloc6.offset|) (<= 1 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc6.base|))), 499#(and (<= 1 ~n) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base))), 500#(and (= foo_~i~0 0) (<= 1 ~n) (= ~a.offset 0) (= (select |#length| ~a.base) (* 4 ~n))), 501#(and (= foo_~i~0 0) (= ~a.offset 0) (<= 4 (select |#length| ~a.base))), 495#true] [2018-02-04 02:40:00,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:00,819 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 02:40:00,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 02:40:00,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:40:00,819 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 7 states. [2018-02-04 02:40:00,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:00,946 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-02-04 02:40:00,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 02:40:00,947 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-02-04 02:40:00,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:00,949 INFO L225 Difference]: With dead ends: 58 [2018-02-04 02:40:00,950 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 02:40:00,950 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:40:00,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 02:40:00,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2018-02-04 02:40:00,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 02:40:00,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-02-04 02:40:00,954 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 20 [2018-02-04 02:40:00,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:00,954 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-02-04 02:40:00,954 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 02:40:00,954 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-02-04 02:40:00,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 02:40:00,955 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:00,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] [2018-02-04 02:40:00,955 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:40:00,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1905865099, now seen corresponding path program 1 times [2018-02-04 02:40:00,956 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:00,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:00,966 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:01,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:01,016 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:40:01,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 02:40:01,016 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:01,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:01,017 INFO L182 omatonBuilderFactory]: Interpolants [611#true, 612#false, 613#(<= ~n 1), 614#(and (= 0 |main_#t~malloc6.offset|) (<= ~n 1)), 615#(and (= ~a.offset 0) (<= ~n 1)), 616#(and (= ~a.offset 0) (<= (* 4 ~n) (+ (* 4 foo_~i~0) ~a.offset 4))), 617#(and (= ~a.offset 0) (<= (* 4 ~n) (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 02:40:01,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:01,017 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 02:40:01,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 02:40:01,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:40:01,018 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 7 states. [2018-02-04 02:40:01,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:01,122 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2018-02-04 02:40:01,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:40:01,122 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-02-04 02:40:01,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:01,123 INFO L225 Difference]: With dead ends: 86 [2018-02-04 02:40:01,123 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 02:40:01,124 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:40:01,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 02:40:01,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 71. [2018-02-04 02:40:01,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-04 02:40:01,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-02-04 02:40:01,132 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 24 [2018-02-04 02:40:01,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:01,132 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-02-04 02:40:01,132 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 02:40:01,133 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-02-04 02:40:01,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 02:40:01,133 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:01,134 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] [2018-02-04 02:40:01,134 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:40:01,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1500155222, now seen corresponding path program 1 times [2018-02-04 02:40:01,135 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:01,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:01,290 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:01,291 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:40:01,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 02:40:01,291 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:01,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:01,291 INFO L182 omatonBuilderFactory]: Interpolants [784#(<= 2 ~n), 785#(and (= 0 |main_#t~malloc6.offset|) (= (* 4 ~n) (select |#length| |main_#t~malloc6.base|)) (<= 2 ~n)), 786#(and (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 2 ~n)), 787#(and (= foo_~i~0 0) (= ~a.offset 0) (= (* 4 ~n) (select |#length| ~a.base)) (<= 2 ~n)), 788#(and (= ~a.offset 0) (<= (+ foo_~i~0 1) ~n) (= (* 4 ~n) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 789#(and (= ~a.offset 0) (<= (+ (* 4 foo_~i~0) 4) (select |#length| ~a.base)) (<= 4 (+ (* 4 foo_~i~0) ~a.offset))), 781#true, 782#false, 783#(<= 1 ~n)] [2018-02-04 02:40:01,291 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:01,292 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:40:01,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:40:01,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:40:01,292 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 9 states. [2018-02-04 02:40:01,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:01,495 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-02-04 02:40:01,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 02:40:01,496 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-02-04 02:40:01,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:01,497 INFO L225 Difference]: With dead ends: 105 [2018-02-04 02:40:01,497 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 02:40:01,498 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:40:01,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 02:40:01,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 77. [2018-02-04 02:40:01,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 02:40:01,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-02-04 02:40:01,502 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 27 [2018-02-04 02:40:01,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:01,503 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-02-04 02:40:01,503 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:40:01,503 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-02-04 02:40:01,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 02:40:01,504 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:01,504 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:01,504 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:40:01,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1897964650, now seen corresponding path program 1 times [2018-02-04 02:40:01,505 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:01,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:40:01,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:40:01,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 02:40:01,561 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:40:01,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:40:01,561 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:40:01,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:40:01,562 INFO L182 omatonBuilderFactory]: Interpolants [976#(= |main_#t~post8.base| ~b.base), 977#(= 1 (select |#valid| ~b.base)), 974#true, 975#false] [2018-02-04 02:40:01,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 02:40:01,562 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:40:01,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:40:01,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:40:01,563 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 4 states. [2018-02-04 02:40:01,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:40:01,665 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-02-04 02:40:01,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:40:01,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-02-04 02:40:01,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:40:01,666 INFO L225 Difference]: With dead ends: 75 [2018-02-04 02:40:01,666 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 02:40:01,666 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:40:01,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 02:40:01,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-02-04 02:40:01,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 02:40:01,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-02-04 02:40:01,671 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 29 [2018-02-04 02:40:01,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:40:01,671 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-02-04 02:40:01,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:40:01,671 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-02-04 02:40:01,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 02:40:01,672 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:40:01,672 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:40:01,672 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 02:40:01,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1897964651, now seen corresponding path program 1 times [2018-02-04 02:40:01,673 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:40:01,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 02:40:01,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 02:40:01,715 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 02:40:01,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 02:40:01 BoogieIcfgContainer [2018-02-04 02:40:01,745 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 02:40:01,745 INFO L168 Benchmark]: Toolchain (without parser) took 2158.42 ms. Allocated memory was 402.7 MB in the beginning and 627.0 MB in the end (delta: 224.4 MB). Free memory was 359.3 MB in the beginning and 556.8 MB in the end (delta: -197.5 MB). Peak memory consumption was 26.9 MB. Max. memory is 5.3 GB. [2018-02-04 02:40:01,746 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 402.7 MB. Free memory is still 365.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 02:40:01,746 INFO L168 Benchmark]: CACSL2BoogieTranslator took 151.25 ms. Allocated memory is still 402.7 MB. Free memory was 359.3 MB in the beginning and 348.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. [2018-02-04 02:40:01,746 INFO L168 Benchmark]: Boogie Preprocessor took 23.41 ms. Allocated memory is still 402.7 MB. Free memory was 348.7 MB in the beginning and 347.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 02:40:01,747 INFO L168 Benchmark]: RCFGBuilder took 206.60 ms. Allocated memory is still 402.7 MB. Free memory was 347.3 MB in the beginning and 327.4 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. [2018-02-04 02:40:01,747 INFO L168 Benchmark]: TraceAbstraction took 1774.60 ms. Allocated memory was 402.7 MB in the beginning and 627.0 MB in the end (delta: 224.4 MB). Free memory was 327.4 MB in the beginning and 556.8 MB in the end (delta: -229.4 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 02:40:01,747 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.10 ms. Allocated memory is still 402.7 MB. Free memory is still 365.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 151.25 ms. Allocated memory is still 402.7 MB. Free memory was 359.3 MB in the beginning and 348.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 23.41 ms. Allocated memory is still 402.7 MB. Free memory was 348.7 MB in the beginning and 347.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 206.60 ms. Allocated memory is still 402.7 MB. Free memory was 347.3 MB in the beginning and 327.4 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1774.60 ms. Allocated memory was 402.7 MB in the beginning and 627.0 MB in the end (delta: 224.4 MB). Free memory was 327.4 MB in the beginning and 556.8 MB in the end (delta: -229.4 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L619] int *a, *b; [L620] int n; VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={0:0}, b={0:0}, n=0] [L632] n = 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={0:0}, b={0:0}, n=1] [L633] COND FALSE !(__VERIFIER_nondet_int() && n < 30) [L636] EXPR, FCALL malloc(n * sizeof(*a)) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={0:0}, b={0:0}, malloc(n * sizeof(*a))={7:0}, n=1] [L636] a = malloc(n * sizeof(*a)) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={0:0}, malloc(n * sizeof(*a))={7:0}, n=1] [L637] EXPR, FCALL malloc(n * sizeof(*b)) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={0:0}, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={13:0}, n=1] [L637] b = malloc(n * sizeof(*b)) [L638] EXPR b++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, b++={13:0}, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={13:0}, n=1] [L638] FCALL *b++ = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, b++={13:0}, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={13:0}, n=1] [L639] CALL foo() VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, n=1] [L624] int i; [L625] i = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L625] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L626] FCALL a[i] = n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L625] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=1, n=1] [L625] COND FALSE !(i < n) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=1, n=1] [L627] i = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L627] COND FALSE, RET !(i < n - 1) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L639] foo() VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={13:0}, n=1] [L640] FCALL b[-2] VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={13:0}, n=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 56 locations, 17 error locations. UNSAFE Result, 1.7s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 348 SDtfs, 516 SDslu, 469 SDs, 0 SdLazy, 478 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 6/11 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 52 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 189 NumberOfCodeBlocks, 189 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 152 ConstructedInterpolants, 0 QuantifiedInterpolants, 16087 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 6/11 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_02-40-01-752.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_02-40-01-752.csv Received shutdown request...