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/list-ext_flag_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 15:54:09,728 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 15:54:09,729 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 15:54:09,741 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 15:54:09,741 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 15:54:09,742 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 15:54:09,742 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 15:54:09,744 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 15:54:09,745 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 15:54:09,746 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 15:54:09,747 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 15:54:09,747 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 15:54:09,748 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 15:54:09,749 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 15:54:09,749 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 15:54:09,751 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 15:54:09,753 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 15:54:09,754 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 15:54:09,755 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 15:54:09,756 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 15:54:09,758 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 15:54:09,758 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 15:54:09,758 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 15:54:09,759 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 15:54:09,760 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 15:54:09,761 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 15:54:09,761 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 15:54:09,761 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 15:54:09,761 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 15:54:09,762 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 15:54:09,762 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 15:54:09,762 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:09,771 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 15:54:09,771 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 15:54:09,772 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 15:54:09,772 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 15:54:09,772 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 15:54:09,773 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 15:54:09,773 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 15:54:09,773 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 15:54:09,773 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 15:54:09,773 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 15:54:09,773 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 15:54:09,773 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 15:54:09,773 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 15:54:09,773 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 15:54:09,774 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 15:54:09,774 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 15:54:09,774 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 15:54:09,774 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 15:54:09,774 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 15:54:09,774 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 15:54:09,774 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 15:54:09,774 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 15:54:09,800 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 15:54:09,808 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 15:54:09,810 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 15:54:09,811 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 15:54:09,812 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 15:54:09,812 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/list-ext_flag_false-unreach-call_false-valid-deref.i [2018-02-04 15:54:09,940 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 15:54:09,941 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 15:54:09,941 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 15:54:09,941 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 15:54:09,945 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 15:54:09,946 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:54:09" (1/1) ... [2018-02-04 15:54:09,948 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@637150ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:54:09, skipping insertion in model container [2018-02-04 15:54:09,948 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:54:09" (1/1) ... [2018-02-04 15:54:09,958 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 15:54:09,986 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 15:54:10,077 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 15:54:10,096 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 15:54:10,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:54:10 WrapperNode [2018-02-04 15:54:10,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 15:54:10,103 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 15:54:10,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 15:54:10,104 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 15:54:10,116 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:10" (1/1) ... [2018-02-04 15:54:10,116 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:10" (1/1) ... [2018-02-04 15:54:10,123 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:10" (1/1) ... [2018-02-04 15:54:10,123 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:10" (1/1) ... [2018-02-04 15:54:10,128 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:10" (1/1) ... [2018-02-04 15:54:10,131 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:10" (1/1) ... [2018-02-04 15:54:10,133 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:10" (1/1) ... [2018-02-04 15:54:10,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 15:54:10,135 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 15:54:10,135 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 15:54:10,135 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 15:54:10,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:54:10" (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:10,174 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 15:54:10,175 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 15:54:10,175 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-02-04 15:54:10,175 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 15:54:10,175 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 15:54:10,175 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 15:54:10,175 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 15:54:10,175 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 15:54:10,175 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 15:54:10,175 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 15:54:10,175 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 15:54:10,175 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-04 15:54:10,175 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 15:54:10,176 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 15:54:10,176 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 15:54:10,176 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-02-04 15:54:10,176 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 15:54:10,176 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 15:54:10,176 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 15:54:10,455 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 15:54:10,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:54:10 BoogieIcfgContainer [2018-02-04 15:54:10,455 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 15:54:10,456 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 15:54:10,456 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 15:54:10,458 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 15:54:10,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 03:54:09" (1/3) ... [2018-02-04 15:54:10,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6958cc67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:54:10, skipping insertion in model container [2018-02-04 15:54:10,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:54:10" (2/3) ... [2018-02-04 15:54:10,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6958cc67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:54:10, skipping insertion in model container [2018-02-04 15:54:10,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:54:10" (3/3) ... [2018-02-04 15:54:10,461 INFO L107 eAbstractionObserver]: Analyzing ICFG list-ext_flag_false-unreach-call_false-valid-deref.i [2018-02-04 15:54:10,466 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 15:54:10,471 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 35 error locations. [2018-02-04 15:54:10,494 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 15:54:10,494 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 15:54:10,494 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 15:54:10,494 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 15:54:10,494 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 15:54:10,495 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 15:54:10,495 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 15:54:10,495 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 15:54:10,496 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 15:54:10,505 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states. [2018-02-04 15:54:10,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 15:54:10,512 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:10,513 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:54:10,513 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 15:54:10,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1955450078, now seen corresponding path program 1 times [2018-02-04 15:54:10,549 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:10,583 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:10,605 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:10,607 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:10,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 15:54:10,608 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:10,608 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:10,608 INFO L182 omatonBuilderFactory]: Interpolants [97#true, 98#false] [2018-02-04 15:54:10,609 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:10,609 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 15:54:10,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 15:54:10,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 15:54:10,618 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 2 states. [2018-02-04 15:54:10,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:10,697 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2018-02-04 15:54:10,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 15:54:10,699 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-02-04 15:54:10,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:10,705 INFO L225 Difference]: With dead ends: 94 [2018-02-04 15:54:10,705 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 15:54:10,707 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:10,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 15:54:10,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-02-04 15:54:10,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 15:54:10,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-02-04 15:54:10,735 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 12 [2018-02-04 15:54:10,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:10,736 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-02-04 15:54:10,736 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 15:54:10,736 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-02-04 15:54:10,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 15:54:10,736 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:10,736 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:54:10,736 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 15:54:10,737 INFO L82 PathProgramCache]: Analyzing trace with hash 2124161760, now seen corresponding path program 1 times [2018-02-04 15:54:10,738 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:10,753 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:10,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:10,805 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:10,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 15:54:10,805 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:10,806 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:10,806 INFO L182 omatonBuilderFactory]: Interpolants [279#true, 280#false, 281#(= 1 (select |#valid| |main_#t~malloc0.base|)), 282#(= 1 (select |#valid| main_~a~0.base)), 283#(= 1 (select |#valid| main_~p~0.base))] [2018-02-04 15:54:10,806 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:10,807 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 15:54:10,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 15:54:10,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 15:54:10,808 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 5 states. [2018-02-04 15:54:10,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:10,965 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2018-02-04 15:54:10,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 15:54:10,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-04 15:54:10,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:10,967 INFO L225 Difference]: With dead ends: 95 [2018-02-04 15:54:10,967 INFO L226 Difference]: Without dead ends: 95 [2018-02-04 15:54:10,968 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:10,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-04 15:54:10,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2018-02-04 15:54:10,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 15:54:10,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2018-02-04 15:54:10,974 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 15 [2018-02-04 15:54:10,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:10,974 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2018-02-04 15:54:10,974 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 15:54:10,975 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2018-02-04 15:54:10,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 15:54:10,975 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:10,975 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:54:10,975 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 15:54:10,976 INFO L82 PathProgramCache]: Analyzing trace with hash 2124161761, now seen corresponding path program 1 times [2018-02-04 15:54:10,976 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:10,991 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:11,061 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:11,062 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:11,062 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 15:54:11,062 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:11,062 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:11,062 INFO L182 omatonBuilderFactory]: Interpolants [466#true, 467#false, 468#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 469#(and (= 0 main_~a~0.offset) (= 12 (select |#length| main_~a~0.base))), 470#(and (= main_~p~0.offset 0) (= (select |#length| main_~p~0.base) 12))] [2018-02-04 15:54:11,063 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:11,063 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 15:54:11,063 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 15:54:11,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 15:54:11,063 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand 5 states. [2018-02-04 15:54:11,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:11,192 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2018-02-04 15:54:11,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 15:54:11,192 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-04 15:54:11,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:11,193 INFO L225 Difference]: With dead ends: 115 [2018-02-04 15:54:11,193 INFO L226 Difference]: Without dead ends: 115 [2018-02-04 15:54:11,193 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:11,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-04 15:54:11,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 107. [2018-02-04 15:54:11,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-04 15:54:11,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2018-02-04 15:54:11,199 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 15 [2018-02-04 15:54:11,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:11,199 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2018-02-04 15:54:11,200 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 15:54:11,200 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2018-02-04 15:54:11,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 15:54:11,200 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:11,201 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:54:11,201 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 15:54:11,201 INFO L82 PathProgramCache]: Analyzing trace with hash -859332542, now seen corresponding path program 1 times [2018-02-04 15:54:11,202 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:11,219 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:11,299 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:11,299 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:11,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 15:54:11,300 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:11,300 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:11,300 INFO L182 omatonBuilderFactory]: Interpolants [697#true, 698#false, 699#(= |#valid| |old(#valid)|), 700#(and (= (store |#valid| |main_#t~malloc0.base| 0) |old(#valid)|) (not (= 0 |main_#t~malloc0.base|))), 701#(and (= (store |#valid| main_~a~0.base 0) |old(#valid)|) (not (= 0 main_~a~0.base))), 702#(and (= (store |#valid| main_~p~0.base 0) |old(#valid)|) (not (= 0 main_~p~0.base)))] [2018-02-04 15:54:11,300 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:11,300 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 15:54:11,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 15:54:11,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 15:54:11,301 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand 6 states. [2018-02-04 15:54:11,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:11,466 INFO L93 Difference]: Finished difference Result 163 states and 179 transitions. [2018-02-04 15:54:11,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 15:54:11,467 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-02-04 15:54:11,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:11,468 INFO L225 Difference]: With dead ends: 163 [2018-02-04 15:54:11,468 INFO L226 Difference]: Without dead ends: 160 [2018-02-04 15:54:11,468 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-04 15:54:11,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-02-04 15:54:11,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 135. [2018-02-04 15:54:11,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-04 15:54:11,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 157 transitions. [2018-02-04 15:54:11,475 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 157 transitions. Word has length 27 [2018-02-04 15:54:11,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:11,476 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 157 transitions. [2018-02-04 15:54:11,476 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 15:54:11,476 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 157 transitions. [2018-02-04 15:54:11,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 15:54:11,477 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:11,477 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] [2018-02-04 15:54:11,477 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 15:54:11,477 INFO L82 PathProgramCache]: Analyzing trace with hash -733968282, now seen corresponding path program 1 times [2018-02-04 15:54:11,478 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:54:11,488 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:11,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:11,521 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:54:11,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 15:54:11,521 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:54:11,521 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:11,521 INFO L182 omatonBuilderFactory]: Interpolants [1009#true, 1010#false, 1011#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 1012#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)), 1013#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)), 1014#(and (= |main_#t~mem13| (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))] [2018-02-04 15:54:11,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:54:11,522 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 15:54:11,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 15:54:11,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 15:54:11,522 INFO L87 Difference]: Start difference. First operand 135 states and 157 transitions. Second operand 6 states. [2018-02-04 15:54:11,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:54:11,667 INFO L93 Difference]: Finished difference Result 143 states and 153 transitions. [2018-02-04 15:54:11,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 15:54:11,667 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-02-04 15:54:11,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:54:11,668 INFO L225 Difference]: With dead ends: 143 [2018-02-04 15:54:11,668 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 15:54:11,669 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-04 15:54:11,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 15:54:11,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 116. [2018-02-04 15:54:11,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-04 15:54:11,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2018-02-04 15:54:11,683 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 27 [2018-02-04 15:54:11,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:54:11,684 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2018-02-04 15:54:11,684 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 15:54:11,684 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2018-02-04 15:54:11,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 15:54:11,684 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:54:11,685 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] [2018-02-04 15:54:11,685 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-04 15:54:11,685 INFO L82 PathProgramCache]: Analyzing trace with hash -920992417, now seen corresponding path program 1 times [2018-02-04 15:54:11,685 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:54:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 15:54:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 15:54:11,729 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 15:54:11,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 03:54:11 BoogieIcfgContainer [2018-02-04 15:54:11,748 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 15:54:11,749 INFO L168 Benchmark]: Toolchain (without parser) took 1808.60 ms. Allocated memory was 400.6 MB in the beginning and 630.2 MB in the end (delta: 229.6 MB). Free memory was 357.4 MB in the beginning and 596.5 MB in the end (delta: -239.0 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 15:54:11,749 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 400.6 MB. Free memory is still 362.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 15:54:11,749 INFO L168 Benchmark]: CACSL2BoogieTranslator took 162.07 ms. Allocated memory is still 400.6 MB. Free memory was 357.4 MB in the beginning and 346.9 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:11,749 INFO L168 Benchmark]: Boogie Preprocessor took 31.21 ms. Allocated memory is still 400.6 MB. Free memory was 346.9 MB in the beginning and 344.2 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:11,750 INFO L168 Benchmark]: RCFGBuilder took 320.48 ms. Allocated memory is still 400.6 MB. Free memory was 344.2 MB in the beginning and 316.7 MB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 5.3 GB. [2018-02-04 15:54:11,750 INFO L168 Benchmark]: TraceAbstraction took 1292.29 ms. Allocated memory was 400.6 MB in the beginning and 630.2 MB in the end (delta: 229.6 MB). Free memory was 314.0 MB in the beginning and 596.5 MB in the end (delta: -282.4 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 15:54:11,750 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.12 ms. Allocated memory is still 400.6 MB. Free memory is still 362.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 162.07 ms. Allocated memory is still 400.6 MB. Free memory was 357.4 MB in the beginning and 346.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.21 ms. Allocated memory is still 400.6 MB. Free memory was 346.9 MB in the beginning and 344.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 320.48 ms. Allocated memory is still 400.6 MB. Free memory was 344.2 MB in the beginning and 316.7 MB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1292.29 ms. Allocated memory was 400.6 MB in the beginning and 630.2 MB in the end (delta: 229.6 MB). Free memory was 314.0 MB in the beginning and 596.5 MB in the end (delta: -282.4 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L628] List p, a, t; [L629] EXPR, FCALL malloc(sizeof(struct node)) VAL [malloc(sizeof(struct node))={17:0}] [L629] a = (List) malloc(sizeof(struct node)) VAL [a={17:0}, malloc(sizeof(struct node))={17:0}] [L630] COND FALSE !(a == 0) VAL [a={17:0}, malloc(sizeof(struct node))={17:0}] [L631] p = a [L632] int i = 0; VAL [a={17:0}, i=0, malloc(sizeof(struct node))={17:0}, p={17:0}] [L633] i < 20 && __VERIFIER_nondet_int() [L633] i < 20 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={17:0}, i=0, i < 20 && __VERIFIER_nondet_int()=0, malloc(sizeof(struct node))={17:0}, p={17:0}] [L633] COND FALSE !(i < 20 && __VERIFIER_nondet_int()) [L646] FCALL p->h = 3 VAL [a={17:0}, i=0, malloc(sizeof(struct node))={17:0}, p={17:0}] [L647] p = a VAL [a={17:0}, i=0, malloc(sizeof(struct node))={17:0}, p={17:0}] [L648] EXPR, FCALL p->h VAL [a={17:0}, i=0, malloc(sizeof(struct node))={17:0}, p={17:0}, p->h=3] [L648] COND FALSE !(p->h != 3) [L659] EXPR, FCALL p->h VAL [a={17:0}, i=0, malloc(sizeof(struct node))={17:0}, p={17:0}, p->h=3] [L659] COND FALSE !(p->h != 3 || i > 20) [L661] p = a VAL [a={17:0}, i=0, malloc(sizeof(struct node))={17:0}, p={17:0}] [L662] EXPR, FCALL p->n VAL [a={17:0}, i=0, malloc(sizeof(struct node))={17:0}, p={17:0}, p->n={20:19}] [L662] COND TRUE p->n != 0 [L663] EXPR, FCALL p->n VAL [a={17:0}, i=0, malloc(sizeof(struct node))={17:0}, p={17:0}, p->n={20:19}] [L663] t = p->n [L664] FCALL free(p) VAL [a={17:0}, i=0, malloc(sizeof(struct node))={17:0}, p={17:0}, t={20:19}] [L665] p = t VAL [a={17:0}, i=0, malloc(sizeof(struct node))={17:0}, p={20:19}, t={20:19}] [L662] FCALL p->n VAL [a={17:0}, i=0, malloc(sizeof(struct node))={17:0}, p={20:19}, t={20:19}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 35 error locations. UNSAFE Result, 1.2s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 298 SDtfs, 720 SDslu, 374 SDs, 0 SdLazy, 472 SolverSat, 87 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 2/2 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, 72 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 91 ConstructedInterpolants, 0 QuantifiedInterpolants, 9709 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 2/2 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/list-ext_flag_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_15-54-11-756.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_flag_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_15-54-11-756.csv Received shutdown request...