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/test-0158_1_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 15:54:17,641 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 15:54:17,643 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 15:54:17,656 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 15:54:17,656 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 15:54:17,657 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 15:54:17,657 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 15:54:17,659 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 15:54:17,660 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 15:54:17,661 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 15:54:17,662 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 15:54:17,662 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 15:54:17,663 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 15:54:17,664 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 15:54:17,664 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 15:54:17,666 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 15:54:17,668 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 15:54:17,669 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 15:54:17,670 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 15:54:17,671 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 15:54:17,672 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 15:54:17,673 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 15:54:17,673 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 15:54:17,674 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 15:54:17,674 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 15:54:17,675 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 15:54:17,675 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 15:54:17,676 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 15:54:17,676 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 15:54:17,676 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 15:54:17,677 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 15:54:17,677 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:17,686 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 15:54:17,686 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 15:54:17,687 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 15:54:17,687 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 15:54:17,688 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 15:54:17,688 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 15:54:17,688 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 15:54:17,688 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 15:54:17,688 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 15:54:17,688 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 15:54:17,688 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 15:54:17,689 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 15:54:17,689 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 15:54:17,689 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 15:54:17,689 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 15:54:17,689 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 15:54:17,689 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 15:54:17,689 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 15:54:17,689 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 15:54:17,690 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 15:54:17,690 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 15:54:17,690 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 15:54:17,721 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 15:54:17,732 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 15:54:17,736 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 15:54:17,737 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 15:54:17,738 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 15:54:17,739 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0158_1_false-valid-free.i [2018-02-04 15:54:17,870 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 15:54:17,871 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 15:54:17,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 15:54:17,872 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 15:54:17,878 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 15:54:17,879 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:54:17" (1/1) ... [2018-02-04 15:54:17,882 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 03:54:17, skipping insertion in model container [2018-02-04 15:54:17,882 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:54:17" (1/1) ... [2018-02-04 15:54:17,895 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 15:54:17,921 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 15:54:18,005 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 15:54:18,015 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 15:54:18,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:54:18 WrapperNode [2018-02-04 15:54:18,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 15:54:18,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 15:54:18,023 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 15:54:18,023 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 15:54:18,031 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:18" (1/1) ... [2018-02-04 15:54:18,031 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:18" (1/1) ... [2018-02-04 15:54:18,037 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:18" (1/1) ... [2018-02-04 15:54:18,038 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:18" (1/1) ... [2018-02-04 15:54:18,040 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:18" (1/1) ... [2018-02-04 15:54:18,041 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:18" (1/1) ... [2018-02-04 15:54:18,042 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:18" (1/1) ... [2018-02-04 15:54:18,043 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 15:54:18,044 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 15:54:18,044 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 15:54:18,044 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 15:54:18,045 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:54:18" (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:18,080 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 15:54:18,080 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 15:54:18,080 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 15:54:18,080 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 15:54:18,080 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 15:54:18,080 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 15:54:18,080 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 15:54:18,080 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 15:54:18,080 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 15:54:18,080 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 15:54:18,081 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 15:54:18,081 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 15:54:18,081 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 15:54:18,081 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 15:54:18,081 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 15:54:18,081 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 15:54:18,220 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 15:54:18,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:54:18 BoogieIcfgContainer [2018-02-04 15:54:18,221 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 15:54:18,221 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 15:54:18,221 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 15:54:18,223 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 15:54:18,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 03:54:17" (1/3) ... [2018-02-04 15:54:18,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fbcb7ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:54:18, skipping insertion in model container [2018-02-04 15:54:18,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:54:18" (2/3) ... [2018-02-04 15:54:18,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fbcb7ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:54:18, skipping insertion in model container [2018-02-04 15:54:18,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:54:18" (3/3) ... [2018-02-04 15:54:18,226 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0158_1_false-valid-free.i [2018-02-04 15:54:18,231 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 15:54:18,235 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-02-04 15:54:18,268 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 15:54:18,268 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 15:54:18,268 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 15:54:18,268 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 15:54:18,268 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 15:54:18,268 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 15:54:18,269 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 15:54:18,269 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 15:54:18,269 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 15:54:18,281 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-04 15:54:18,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 15:54:18,290 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:18,290 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:54:18,291 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 15:54:18,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1472020876, now seen corresponding path program 1 times [2018-02-04 15:54:18,341 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:18,380 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:18,460 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:18,463 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:18,463 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 15:54:18,464 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:18,465 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:18,465 INFO L182 omatonBuilderFactory]: Interpolants [49#true, 50#false, 51#(= (select |#valid| |main_~#data~0.base|) 1)] [2018-02-04 15:54:18,465 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:18,466 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 15:54:18,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 15:54:18,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 15:54:18,476 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-02-04 15:54:18,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:18,553 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-02-04 15:54:18,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 15:54:18,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-02-04 15:54:18,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:18,611 INFO L225 Difference]: With dead ends: 39 [2018-02-04 15:54:18,611 INFO L226 Difference]: Without dead ends: 36 [2018-02-04 15:54:18,613 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 15:54:18,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-04 15:54:18,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-04 15:54:18,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 15:54:18,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-02-04 15:54:18,642 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 8 [2018-02-04 15:54:18,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:18,643 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-02-04 15:54:18,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 15:54:18,643 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-02-04 15:54:18,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 15:54:18,643 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:18,644 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:54:18,644 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 15:54:18,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1472020877, now seen corresponding path program 1 times [2018-02-04 15:54:18,645 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:18,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:18,660 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:18,701 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:18,701 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:18,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 15:54:18,702 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:18,702 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:18,702 INFO L182 omatonBuilderFactory]: Interpolants [128#false, 129#(and (= |main_~#data~0.offset| 0) (= (select |#valid| |main_~#data~0.base|) 1) (= 10 (select |#length| |main_~#data~0.base|))), 130#(and (= |main_~#data~0.offset| 0) (= (select |#length| |main_~#data~0.base|) 10)), 127#true] [2018-02-04 15:54:18,702 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:18,704 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 15:54:18,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 15:54:18,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 15:54:18,704 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 4 states. [2018-02-04 15:54:18,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:18,739 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-02-04 15:54:18,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 15:54:18,739 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-04 15:54:18,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:18,739 INFO L225 Difference]: With dead ends: 29 [2018-02-04 15:54:18,740 INFO L226 Difference]: Without dead ends: 29 [2018-02-04 15:54:18,740 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 15:54:18,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-02-04 15:54:18,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-02-04 15:54:18,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-02-04 15:54:18,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-02-04 15:54:18,742 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 8 [2018-02-04 15:54:18,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:18,743 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-02-04 15:54:18,743 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 15:54:18,743 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-02-04 15:54:18,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 15:54:18,743 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:18,744 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:54:18,744 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 15:54:18,744 INFO L82 PathProgramCache]: Analyzing trace with hash -151822659, now seen corresponding path program 1 times [2018-02-04 15:54:18,745 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:18,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:18,760 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:18,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:18,807 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:18,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 15:54:18,807 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:18,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:18,808 INFO L182 omatonBuilderFactory]: Interpolants [192#(= 0 (select (select |#memory_$Pointer$.offset| |main_~#data~0.base|) |main_~#data~0.offset|)), 193#(= |main_#t~mem8.offset| 0), 189#true, 190#false, 191#(= 0 |main_#t~malloc0.offset|)] [2018-02-04 15:54:18,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:18,808 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 15:54:18,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 15:54:18,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 15:54:18,809 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 5 states. [2018-02-04 15:54:18,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:18,850 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-02-04 15:54:18,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 15:54:18,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-04 15:54:18,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:18,851 INFO L225 Difference]: With dead ends: 28 [2018-02-04 15:54:18,851 INFO L226 Difference]: Without dead ends: 28 [2018-02-04 15:54:18,852 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:18,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-02-04 15:54:18,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-02-04 15:54:18,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-02-04 15:54:18,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-02-04 15:54:18,854 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 16 [2018-02-04 15:54:18,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:18,855 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-02-04 15:54:18,855 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 15:54:18,855 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-02-04 15:54:18,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 15:54:18,855 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:18,856 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:54:18,856 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 15:54:18,856 INFO L82 PathProgramCache]: Analyzing trace with hash -151822658, now seen corresponding path program 1 times [2018-02-04 15:54:18,857 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:18,868 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:18,904 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:18,905 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:18,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 15:54:18,905 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:18,905 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:18,905 INFO L182 omatonBuilderFactory]: Interpolants [256#(= 1 (select |#valid| |main_#t~malloc0.base|)), 257#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) |main_~#data~0.offset|))), 258#(= 1 (select |#valid| |main_#t~mem8.base|)), 254#true, 255#false] [2018-02-04 15:54:18,905 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:18,905 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 15:54:18,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 15:54:18,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 15:54:18,906 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 5 states. [2018-02-04 15:54:18,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:18,947 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-02-04 15:54:18,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 15:54:18,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-04 15:54:18,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:18,948 INFO L225 Difference]: With dead ends: 27 [2018-02-04 15:54:18,948 INFO L226 Difference]: Without dead ends: 27 [2018-02-04 15:54:18,948 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:18,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-02-04 15:54:18,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-02-04 15:54:18,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-02-04 15:54:18,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-02-04 15:54:18,950 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 16 [2018-02-04 15:54:18,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:18,950 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-02-04 15:54:18,950 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 15:54:18,950 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-02-04 15:54:18,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 15:54:18,951 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:18,951 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:54:18,951 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 15:54:18,951 INFO L82 PathProgramCache]: Analyzing trace with hash 127313054, now seen corresponding path program 1 times [2018-02-04 15:54:18,951 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:18,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:19,022 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:19,023 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:19,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 15:54:19,023 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:19,023 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:19,023 INFO L182 omatonBuilderFactory]: Interpolants [320#(= 0 (select (select |#memory_$Pointer$.offset| |main_~#data~0.base|) |main_~#data~0.offset|)), 321#(and (= |main_#t~mem2.offset| (select (select |#memory_$Pointer$.offset| |main_~#data~0.base|) |main_~#data~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#data~0.base|) |main_~#data~0.offset|))), 322#(and (= main_~ptr~0.offset (select (select |#memory_$Pointer$.offset| |main_~#data~0.base|) |main_~#data~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#data~0.base|) |main_~#data~0.offset|))), 323#(= 0 main_~ptr~0.offset), 317#true, 318#false, 319#(= 0 |main_#t~malloc0.offset|)] [2018-02-04 15:54:19,023 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:19,023 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 15:54:19,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 15:54:19,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-04 15:54:19,024 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 7 states. [2018-02-04 15:54:19,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:19,075 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-02-04 15:54:19,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 15:54:19,075 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-02-04 15:54:19,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:19,075 INFO L225 Difference]: With dead ends: 26 [2018-02-04 15:54:19,075 INFO L226 Difference]: Without dead ends: 26 [2018-02-04 15:54:19,076 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-02-04 15:54:19,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-02-04 15:54:19,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-02-04 15:54:19,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-02-04 15:54:19,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-02-04 15:54:19,077 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 18 [2018-02-04 15:54:19,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:19,078 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-02-04 15:54:19,078 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 15:54:19,078 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-02-04 15:54:19,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 15:54:19,078 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:19,078 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:54:19,078 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 15:54:19,078 INFO L82 PathProgramCache]: Analyzing trace with hash 127313055, now seen corresponding path program 1 times [2018-02-04 15:54:19,079 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 15:54:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 15:54:19,116 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 15:54:19,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 03:54:19 BoogieIcfgContainer [2018-02-04 15:54:19,132 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 15:54:19,132 INFO L168 Benchmark]: Toolchain (without parser) took 1261.88 ms. Allocated memory was 405.8 MB in the beginning and 610.3 MB in the end (delta: 204.5 MB). Free memory was 362.5 MB in the beginning and 503.6 MB in the end (delta: -141.1 MB). Peak memory consumption was 63.4 MB. Max. memory is 5.3 GB. [2018-02-04 15:54:19,133 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 405.8 MB. Free memory is still 369.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 15:54:19,133 INFO L168 Benchmark]: CACSL2BoogieTranslator took 150.61 ms. Allocated memory is still 405.8 MB. Free memory was 362.5 MB in the beginning and 351.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. [2018-02-04 15:54:19,133 INFO L168 Benchmark]: Boogie Preprocessor took 21.01 ms. Allocated memory is still 405.8 MB. Free memory was 351.8 MB in the beginning and 350.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 15:54:19,134 INFO L168 Benchmark]: RCFGBuilder took 176.95 ms. Allocated memory is still 405.8 MB. Free memory was 350.5 MB in the beginning and 330.6 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 5.3 GB. [2018-02-04 15:54:19,134 INFO L168 Benchmark]: TraceAbstraction took 910.64 ms. Allocated memory was 405.8 MB in the beginning and 610.3 MB in the end (delta: 204.5 MB). Free memory was 330.6 MB in the beginning and 503.6 MB in the end (delta: -173.0 MB). Peak memory consumption was 31.5 MB. Max. memory is 5.3 GB. [2018-02-04 15:54:19,135 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.20 ms. Allocated memory is still 405.8 MB. Free memory is still 369.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 150.61 ms. Allocated memory is still 405.8 MB. Free memory was 362.5 MB in the beginning and 351.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 21.01 ms. Allocated memory is still 405.8 MB. Free memory was 351.8 MB in the beginning and 350.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 176.95 ms. Allocated memory is still 405.8 MB. Free memory was 350.5 MB in the beginning and 330.6 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 910.64 ms. Allocated memory was 405.8 MB in the beginning and 610.3 MB in the end (delta: 204.5 MB). Free memory was 330.6 MB in the beginning and 503.6 MB in the end (delta: -173.0 MB). Peak memory consumption was 31.5 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: [L622-L629] FCALL union { void *p0; struct { char c[2]; int p1; int p2; } str; } data; VAL [data={41:0}] [L630] EXPR, FCALL malloc(37U) VAL [data={41:0}, malloc(37U)={42:0}] [L630] FCALL data.p0 = malloc(37U) VAL [data={41:0}, malloc(37U)={42:0}] [L631] EXPR, FCALL data.p0 VAL [data={41:0}, data.p0={42:0}, malloc(37U)={42:0}] [L631] void *ptr = data.p0; [L632] COND FALSE !(__VERIFIER_nondet_int()) [L635] FCALL data.str.p2 = 30 VAL [data={41:0}, malloc(37U)={42:0}, ptr={42:0}] [L637] EXPR, FCALL data.str.p2 VAL [data={41:0}, data.str.p2=30, malloc(37U)={42:0}, ptr={42:0}] [L637] COND FALSE !(25 > data.str.p2) [L640] EXPR, FCALL data.p0 VAL [data={41:0}, data.p0={42:0}, malloc(37U)={42:0}, ptr={42:0}] [L640] FCALL free(data.p0) VAL [data={41:0}, data.p0={42:0}, malloc(37U)={42:0}, ptr={42:0}] [L641] FCALL free(ptr) VAL [data={41:0}, malloc(37U)={42:0}, ptr={42:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 46 locations, 19 error locations. UNSAFE Result, 0.8s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 99 SDtfs, 128 SDslu, 108 SDs, 0 SdLazy, 127 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 3744 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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/test-0158_1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_15-54-19-141.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0158_1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_15-54-19-141.csv Received shutdown request...