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-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 15:54:13,051 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 15:54:13,052 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 15:54:13,064 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 15:54:13,064 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 15:54:13,065 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 15:54:13,066 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 15:54:13,068 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 15:54:13,069 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 15:54:13,070 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 15:54:13,071 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 15:54:13,071 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 15:54:13,072 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 15:54:13,073 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 15:54:13,073 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 15:54:13,075 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 15:54:13,077 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 15:54:13,079 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 15:54:13,079 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 15:54:13,080 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 15:54:13,082 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 15:54:13,082 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 15:54:13,082 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 15:54:13,083 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 15:54:13,084 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 15:54:13,085 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 15:54:13,085 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 15:54:13,086 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 15:54:13,086 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 15:54:13,086 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 15:54:13,086 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 15:54:13,086 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 15:54:13,095 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 15:54:13,095 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 15:54:13,096 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 15:54:13,096 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 15:54:13,097 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 15:54:13,097 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 15:54:13,097 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 15:54:13,097 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 15:54:13,097 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 15:54:13,097 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 15:54:13,098 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 15:54:13,098 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 15:54:13,098 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 15:54:13,098 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 15:54:13,098 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 15:54:13,098 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 15:54:13,098 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 15:54:13,098 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 15:54:13,099 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 15:54:13,099 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 15:54:13,099 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 15:54:13,099 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 15:54:13,126 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 15:54:13,134 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 15:54:13,136 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 15:54:13,137 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 15:54:13,137 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 15:54:13,138 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-free.i [2018-02-04 15:54:13,263 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 15:54:13,264 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 15:54:13,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 15:54:13,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 15:54:13,268 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 15:54:13,269 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:54:13" (1/1) ... [2018-02-04 15:54:13,271 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73440f64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:54:13, skipping insertion in model container [2018-02-04 15:54:13,271 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:54:13" (1/1) ... [2018-02-04 15:54:13,282 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 15:54:13,309 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 15:54:13,394 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 15:54:13,408 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 15:54:13,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:54:13 WrapperNode [2018-02-04 15:54:13,413 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 15:54:13,413 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 15:54:13,414 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 15:54:13,414 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 15:54:13,422 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:54:13" (1/1) ... [2018-02-04 15:54:13,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:54:13" (1/1) ... [2018-02-04 15:54:13,428 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:54:13" (1/1) ... [2018-02-04 15:54:13,428 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:54:13" (1/1) ... [2018-02-04 15:54:13,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:54:13" (1/1) ... [2018-02-04 15:54:13,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:54:13" (1/1) ... [2018-02-04 15:54:13,435 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:54:13" (1/1) ... [2018-02-04 15:54:13,436 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 15:54:13,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 15:54:13,437 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 15:54:13,437 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 15:54:13,437 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:54:13" (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 15:54:13,470 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 15:54:13,470 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 15:54:13,470 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-04 15:54:13,470 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 15:54:13,470 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 15:54:13,470 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 15:54:13,470 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 15:54:13,470 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 15:54:13,471 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 15:54:13,471 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 15:54:13,471 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 15:54:13,471 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 15:54:13,471 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-04 15:54:13,471 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 15:54:13,471 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 15:54:13,471 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 15:54:13,616 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 15:54:13,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:54:13 BoogieIcfgContainer [2018-02-04 15:54:13,617 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 15:54:13,617 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 15:54:13,617 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 15:54:13,619 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 15:54:13,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 03:54:13" (1/3) ... [2018-02-04 15:54:13,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@684771ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:54:13, skipping insertion in model container [2018-02-04 15:54:13,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:54:13" (2/3) ... [2018-02-04 15:54:13,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@684771ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:54:13, skipping insertion in model container [2018-02-04 15:54:13,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:54:13" (3/3) ... [2018-02-04 15:54:13,621 INFO L107 eAbstractionObserver]: Analyzing ICFG 960521-1_1_false-valid-free.i [2018-02-04 15:54:13,626 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 15:54:13,630 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-02-04 15:54:13,663 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 15:54:13,664 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 15:54:13,664 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 15:54:13,664 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 15:54:13,664 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 15:54:13,664 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 15:54:13,664 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 15:54:13,664 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 15:54:13,665 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 15:54:13,676 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-02-04 15:54:13,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 15:54:13,685 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:13,685 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:54:13,686 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 15:54:13,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1352732268, now seen corresponding path program 1 times [2018-02-04 15:54:13,736 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:13,778 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:13,805 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 15:54:13,807 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:13,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 15:54:13,808 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:13,808 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 15:54:13,809 INFO L182 omatonBuilderFactory]: Interpolants [59#true, 60#false] [2018-02-04 15:54:13,809 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 15:54:13,810 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 15:54:13,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 15:54:13,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 15:54:13,823 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 2 states. [2018-02-04 15:54:13,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:13,839 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2018-02-04 15:54:13,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 15:54:13,840 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-02-04 15:54:13,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:13,846 INFO L225 Difference]: With dead ends: 56 [2018-02-04 15:54:13,846 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 15:54:13,847 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 15:54:13,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 15:54:13,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-04 15:54:13,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 15:54:13,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-02-04 15:54:13,935 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 12 [2018-02-04 15:54:13,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:13,935 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-02-04 15:54:13,935 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 15:54:13,936 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-02-04 15:54:13,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 15:54:13,936 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:13,936 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:54:13,936 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 15:54:13,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1000920166, now seen corresponding path program 1 times [2018-02-04 15:54:13,937 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:13,958 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:13,998 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 15:54:13,999 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:13,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 15:54:13,999 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:13,999 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 15:54:13,999 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 15:54:14,000 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 15:54:14,001 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 15:54:14,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 15:54:14,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 15:54:14,001 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 4 states. [2018-02-04 15:54:14,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:14,073 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-02-04 15:54:14,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 15:54:14,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 15:54:14,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:14,074 INFO L225 Difference]: With dead ends: 52 [2018-02-04 15:54:14,075 INFO L226 Difference]: Without dead ends: 52 [2018-02-04 15:54:14,075 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 15:54:14,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-04 15:54:14,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-04 15:54:14,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 15:54:14,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-02-04 15:54:14,080 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 14 [2018-02-04 15:54:14,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:14,080 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-02-04 15:54:14,080 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 15:54:14,080 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-02-04 15:54:14,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 15:54:14,081 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:14,081 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:54:14,081 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 15:54:14,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1000920165, now seen corresponding path program 1 times [2018-02-04 15:54:14,082 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:14,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:14,158 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 15:54:14,158 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:14,158 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 15:54:14,159 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:14,159 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 15:54:14,159 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 15:54:14,159 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 15:54:14,159 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 15:54:14,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 15:54:14,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 15:54:14,160 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 5 states. [2018-02-04 15:54:14,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:14,209 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-02-04 15:54:14,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 15:54:14,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 15:54:14,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:14,210 INFO L225 Difference]: With dead ends: 51 [2018-02-04 15:54:14,211 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 15:54:14,211 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 15:54:14,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 15:54:14,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-04 15:54:14,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 15:54:14,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-02-04 15:54:14,213 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 14 [2018-02-04 15:54:14,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:14,214 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-02-04 15:54:14,214 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 15:54:14,214 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-02-04 15:54:14,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 15:54:14,214 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:14,214 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 15:54:14,214 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 15:54:14,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1559748963, now seen corresponding path program 1 times [2018-02-04 15:54:14,215 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:14,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:14,230 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:14,282 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 15:54:14,282 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:14,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 15:54:14,283 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:14,283 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 15:54:14,283 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 15:54:14,284 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 15:54:14,284 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 15:54:14,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 15:54:14,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 15:54:14,285 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 6 states. [2018-02-04 15:54:14,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:14,344 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2018-02-04 15:54:14,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 15:54:14,345 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-02-04 15:54:14,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:14,346 INFO L225 Difference]: With dead ends: 48 [2018-02-04 15:54:14,346 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 15:54:14,346 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 15:54:14,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 15:54:14,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-04 15:54:14,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 15:54:14,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-02-04 15:54:14,350 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 20 [2018-02-04 15:54:14,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:14,350 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-02-04 15:54:14,351 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 15:54:14,351 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2018-02-04 15:54:14,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 15:54:14,351 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:14,351 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 15:54:14,351 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 15:54:14,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1559748962, now seen corresponding path program 1 times [2018-02-04 15:54:14,352 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:14,367 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:14,471 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 15:54:14,472 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:14,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 15:54:14,472 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:14,473 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 15:54:14,473 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 15:54:14,473 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 15:54:14,473 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 15:54:14,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 15:54:14,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-02-04 15:54:14,474 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 7 states. [2018-02-04 15:54:14,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:14,613 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-02-04 15:54:14,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 15:54:14,614 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-02-04 15:54:14,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:14,616 INFO L225 Difference]: With dead ends: 58 [2018-02-04 15:54:14,616 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 15:54:14,617 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 15:54:14,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 15:54:14,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2018-02-04 15:54:14,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 15:54:14,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-02-04 15:54:14,620 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 20 [2018-02-04 15:54:14,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:14,621 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-02-04 15:54:14,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 15:54:14,621 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-02-04 15:54:14,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 15:54:14,621 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:14,622 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 15:54:14,622 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 15:54:14,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1905865099, now seen corresponding path program 1 times [2018-02-04 15:54:14,623 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:14,633 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:14,683 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 15:54:14,683 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:54:14,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 15:54:14,683 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:14,684 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 15:54:14,684 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 15:54:14,684 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 15:54:14,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 15:54:14,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 15:54:14,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-04 15:54:14,684 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 7 states. [2018-02-04 15:54:14,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:14,769 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2018-02-04 15:54:14,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 15:54:14,770 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-02-04 15:54:14,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:14,770 INFO L225 Difference]: With dead ends: 86 [2018-02-04 15:54:14,770 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 15:54:14,771 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 15:54:14,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 15:54:14,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 71. [2018-02-04 15:54:14,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-04 15:54:14,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-02-04 15:54:14,774 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 24 [2018-02-04 15:54:14,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:14,774 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-02-04 15:54:14,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 15:54:14,774 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-02-04 15:54:14,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 15:54:14,775 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:14,775 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 15:54:14,775 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 15:54:14,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1500155222, now seen corresponding path program 1 times [2018-02-04 15:54:14,776 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:14,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:14,784 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:14,945 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 15:54:14,945 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:54:14,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 15:54:14,946 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:14,946 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 15:54:14,946 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 15:54:14,946 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 15:54:14,946 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 15:54:14,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 15:54:14,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-04 15:54:14,947 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 9 states. [2018-02-04 15:54:15,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:15,065 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-02-04 15:54:15,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 15:54:15,066 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-02-04 15:54:15,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:15,067 INFO L225 Difference]: With dead ends: 105 [2018-02-04 15:54:15,067 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 15:54:15,068 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 15:54:15,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 15:54:15,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 77. [2018-02-04 15:54:15,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 15:54:15,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-02-04 15:54:15,072 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 27 [2018-02-04 15:54:15,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:15,073 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-02-04 15:54:15,073 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 15:54:15,073 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-02-04 15:54:15,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 15:54:15,073 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:15,073 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 15:54:15,073 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 15:54:15,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1897964650, now seen corresponding path program 1 times [2018-02-04 15:54:15,074 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:15,082 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:15,108 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 15:54:15,108 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:15,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 15:54:15,109 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:15,109 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 15:54:15,109 INFO L182 omatonBuilderFactory]: Interpolants [976#(= |main_#t~post8.base| ~b.base), 977#(= 1 (select |#valid| ~b.base)), 974#true, 975#false] [2018-02-04 15:54:15,109 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 15:54:15,109 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 15:54:15,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 15:54:15,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 15:54:15,110 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 4 states. [2018-02-04 15:54:15,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:15,140 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-02-04 15:54:15,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 15:54:15,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-02-04 15:54:15,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:15,141 INFO L225 Difference]: With dead ends: 75 [2018-02-04 15:54:15,141 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 15:54:15,142 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 15:54:15,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 15:54:15,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-02-04 15:54:15,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 15:54:15,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-02-04 15:54:15,146 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 29 [2018-02-04 15:54:15,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:15,147 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-02-04 15:54:15,147 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 15:54:15,147 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-02-04 15:54:15,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 15:54:15,148 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:15,148 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 15:54:15,148 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 15:54:15,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1897964651, now seen corresponding path program 1 times [2018-02-04 15:54:15,149 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:15,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:15,157 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:15,230 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 15:54:15,230 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:15,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 15:54:15,230 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:15,231 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 15:54:15,231 INFO L182 omatonBuilderFactory]: Interpolants [1136#(and (<= 4 ~b.offset) (<= ~b.offset (select |#length| ~b.base))), 1130#true, 1131#false, 1132#(<= 1 ~n), 1133#(and (= 0 |main_#t~malloc7.offset|) (<= 1 ~n) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|))), 1134#(and (= |main_#t~post8.offset| 0) (<= (+ |main_#t~post8.offset| 4) ~b.offset) (= (* 4 ~n) (select |#length| ~b.base)) (<= ~b.offset (+ (* 4 ~n) |main_#t~post8.offset|))), 1135#(and (<= 4 ~b.offset) (= (* 4 ~n) (select |#length| ~b.base)) (<= ~b.offset (* 4 ~n)))] [2018-02-04 15:54:15,231 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 15:54:15,231 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 15:54:15,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 15:54:15,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 15:54:15,231 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 7 states. [2018-02-04 15:54:15,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:15,323 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2018-02-04 15:54:15,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 15:54:15,323 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-02-04 15:54:15,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:15,324 INFO L225 Difference]: With dead ends: 71 [2018-02-04 15:54:15,324 INFO L226 Difference]: Without dead ends: 71 [2018-02-04 15:54:15,324 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-02-04 15:54:15,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-04 15:54:15,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-02-04 15:54:15,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-04 15:54:15,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2018-02-04 15:54:15,328 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 29 [2018-02-04 15:54:15,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:15,329 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2018-02-04 15:54:15,329 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 15:54:15,329 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2018-02-04 15:54:15,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 15:54:15,329 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:15,330 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:54:15,330 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:54:15,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1546437503, now seen corresponding path program 2 times [2018-02-04 15:54:15,331 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:15,342 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:15,423 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:15,423 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:54:15,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 15:54:15,423 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:15,424 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 15:54:15,424 INFO L182 omatonBuilderFactory]: Interpolants [1283#true, 1284#false, 1285#(<= ~n 1), 1286#(<= ~n 2), 1287#(and (= 0 |main_#t~malloc6.offset|) (<= ~n 2)), 1288#(and (= ~a.offset 0) (<= ~n 2)), 1289#(and (= ~a.offset 0) (<= (* 4 ~n) (+ (* 4 foo_~i~0) ~a.offset 8))), 1290#(and (= ~a.offset 0) (<= (* 4 ~n) (+ (* 4 foo_~i~0) ~a.offset 4))), 1291#(and (= ~a.offset 0) (<= (* 4 ~n) (+ (* 4 foo_~i~0) ~a.offset)))] [2018-02-04 15:54:15,424 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:15,424 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 15:54:15,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 15:54:15,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 15:54:15,425 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 9 states. [2018-02-04 15:54:15,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:15,590 INFO L93 Difference]: Finished difference Result 122 states and 124 transitions. [2018-02-04 15:54:15,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 15:54:15,590 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-02-04 15:54:15,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:15,591 INFO L225 Difference]: With dead ends: 122 [2018-02-04 15:54:15,591 INFO L226 Difference]: Without dead ends: 122 [2018-02-04 15:54:15,591 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2018-02-04 15:54:15,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-04 15:54:15,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 101. [2018-02-04 15:54:15,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-04 15:54:15,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2018-02-04 15:54:15,595 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 31 [2018-02-04 15:54:15,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:15,596 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2018-02-04 15:54:15,596 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 15:54:15,596 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-02-04 15:54:15,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 15:54:15,596 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:15,596 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, 1, 1, 1] [2018-02-04 15:54:15,596 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:54:15,596 INFO L82 PathProgramCache]: Analyzing trace with hash -979522942, now seen corresponding path program 1 times [2018-02-04 15:54:15,597 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:15,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:54:15,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:15,807 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:54:15,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 15:54:15,807 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:15,807 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 15:54:15,807 INFO L182 omatonBuilderFactory]: Interpolants [1536#(and (= (select |#valid| ~a.base) 1) (<= ~n 1)), 1537#(and (not (= ~a.base |main_#t~malloc7.base|)) (= (* 4 ~n) (select |#length| |main_#t~malloc7.base|)) (<= ~n 1) (= |main_#t~malloc7.offset| 0)), 1538#(and (or (and (= ~b.base |main_#t~post8.base|) (= ~b.offset (+ |main_#t~post8.offset| 4)) (not (= |main_#t~post8.base| ~a.base))) (not (= ~b.offset 4))) (= (* 4 ~n) (select |#length| ~b.base)) (or (<= ~n 1) (<= ~b.offset 4))), 1539#(and (or (not (= ~b.offset 4)) (and (not (= ~a.base ~b.base)) (= 0 (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))))) (= (* 4 ~n) (select |#length| ~b.base)) (or (<= ~n 1) (<= ~b.offset 4))), 1540#(= |#memory_int| |old(#memory_int)|), 1541#(= (store |old(#memory_int)| ~a.base (select |#memory_int| ~a.base)) |#memory_int|), 1542#(and (or (= 0 (select (select |#memory_int| ~b.base) (+ ~b.offset (- 4)))) (not (= ~b.offset 4))) (or (<= (select |#length| ~b.base) 4) (<= ~b.offset 4))), 1543#(and (= 0 |main_#t~mem10|) (= ~b.offset 4)), 1532#true, 1533#false, 1534#(<= ~n 1), 1535#(and (<= ~n 1) (= (select |#valid| |main_#t~malloc6.base|) 1))] [2018-02-04 15:54:15,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:15,808 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 15:54:15,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 15:54:15,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-02-04 15:54:15,808 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 12 states. [2018-02-04 15:54:16,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:16,208 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-02-04 15:54:16,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 15:54:16,208 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-02-04 15:54:16,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:16,209 INFO L225 Difference]: With dead ends: 109 [2018-02-04 15:54:16,209 INFO L226 Difference]: Without dead ends: 109 [2018-02-04 15:54:16,210 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2018-02-04 15:54:16,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-04 15:54:16,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2018-02-04 15:54:16,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-04 15:54:16,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 108 transitions. [2018-02-04 15:54:16,217 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 108 transitions. Word has length 32 [2018-02-04 15:54:16,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:16,218 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 108 transitions. [2018-02-04 15:54:16,218 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 15:54:16,218 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2018-02-04 15:54:16,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 15:54:16,219 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:16,219 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, 1, 1, 1] [2018-02-04 15:54:16,219 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 15:54:16,219 INFO L82 PathProgramCache]: Analyzing trace with hash -979514998, now seen corresponding path program 1 times [2018-02-04 15:54:16,220 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:16,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 15:54:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 15:54:16,260 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 15:54:16,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 03:54:16 BoogieIcfgContainer [2018-02-04 15:54:16,287 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 15:54:16,288 INFO L168 Benchmark]: Toolchain (without parser) took 3025.03 ms. Allocated memory was 405.3 MB in the beginning and 660.1 MB in the end (delta: 254.8 MB). Free memory was 362.0 MB in the beginning and 523.1 MB in the end (delta: -161.2 MB). Peak memory consumption was 93.6 MB. Max. memory is 5.3 GB. [2018-02-04 15:54:16,289 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 405.3 MB. Free memory is still 367.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 15:54:16,289 INFO L168 Benchmark]: CACSL2BoogieTranslator took 149.18 ms. Allocated memory is still 405.3 MB. Free memory was 362.0 MB in the beginning and 351.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 15:54:16,289 INFO L168 Benchmark]: Boogie Preprocessor took 22.72 ms. Allocated memory is still 405.3 MB. Free memory was 351.4 MB in the beginning and 348.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 15:54:16,289 INFO L168 Benchmark]: RCFGBuilder took 180.56 ms. Allocated memory is still 405.3 MB. Free memory was 348.7 MB in the beginning and 328.9 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. [2018-02-04 15:54:16,289 INFO L168 Benchmark]: TraceAbstraction took 2670.17 ms. Allocated memory was 405.3 MB in the beginning and 660.1 MB in the end (delta: 254.8 MB). Free memory was 328.9 MB in the beginning and 523.1 MB in the end (delta: -194.2 MB). Peak memory consumption was 60.6 MB. Max. memory is 5.3 GB. [2018-02-04 15:54:16,290 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 405.3 MB. Free memory is still 367.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 149.18 ms. Allocated memory is still 405.3 MB. Free memory was 362.0 MB in the beginning and 351.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 22.72 ms. Allocated memory is still 405.3 MB. Free memory was 351.4 MB in the beginning and 348.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 180.56 ms. Allocated memory is still 405.3 MB. Free memory was 348.7 MB in the beginning and 328.9 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2670.17 ms. Allocated memory was 405.3 MB in the beginning and 660.1 MB in the end (delta: 254.8 MB). Free memory was 328.9 MB in the beginning and 523.1 MB in the end (delta: -194.2 MB). Peak memory consumption was 60.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: free of unallocated memory possible free of unallocated memory possible 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] = -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] [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[-1] VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, b[-1]=0, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={13:0}, n=1] [L640] COND FALSE !(b[-1]) [L643] FCALL free(a) 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] [L643] FCALL free(b) 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, 2.6s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 424 SDtfs, 819 SDslu, 747 SDs, 0 SdLazy, 844 SolverSat, 162 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 15 SyntacticMatches, 6 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 13/28 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 79 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 284 NumberOfCodeBlocks, 284 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 241 ConstructedInterpolants, 0 QuantifiedInterpolants, 33194 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 13/28 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-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_15-54-16-296.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_15-54-16-296.csv Received shutdown request...