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-properties/simple_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 16:42:33,533 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 16:42:33,535 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 16:42:33,545 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 16:42:33,546 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 16:42:33,546 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 16:42:33,547 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 16:42:33,548 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 16:42:33,549 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 16:42:33,550 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 16:42:33,551 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 16:42:33,551 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 16:42:33,552 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 16:42:33,553 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 16:42:33,554 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 16:42:33,556 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 16:42:33,557 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 16:42:33,559 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 16:42:33,560 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 16:42:33,561 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 16:42:33,563 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 16:42:33,563 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 16:42:33,563 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 16:42:33,564 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 16:42:33,565 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 16:42:33,566 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 16:42:33,566 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 16:42:33,567 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 16:42:33,567 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 16:42:33,567 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 16:42:33,568 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 16:42:33,568 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 16:42:33,578 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 16:42:33,578 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 16:42:33,579 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 16:42:33,579 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 16:42:33,579 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 16:42:33,579 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 16:42:33,579 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 16:42:33,580 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 16:42:33,580 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 16:42:33,580 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 16:42:33,580 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 16:42:33,580 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 16:42:33,580 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 16:42:33,580 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 16:42:33,581 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 16:42:33,581 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 16:42:33,581 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 16:42:33,581 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 16:42:33,581 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 16:42:33,581 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 16:42:33,581 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 16:42:33,582 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 16:42:33,611 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 16:42:33,621 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 16:42:33,625 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 16:42:33,627 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 16:42:33,627 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 16:42:33,628 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/simple_true-unreach-call_false-valid-memtrack.i [2018-02-04 16:42:33,766 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 16:42:33,767 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 16:42:33,767 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 16:42:33,767 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 16:42:33,772 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 16:42:33,773 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:42:33" (1/1) ... [2018-02-04 16:42:33,774 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dfe84f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:42:33, skipping insertion in model container [2018-02-04 16:42:33,775 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:42:33" (1/1) ... [2018-02-04 16:42:33,788 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 16:42:33,818 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 16:42:33,907 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 16:42:33,918 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 16:42:33,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:42:33 WrapperNode [2018-02-04 16:42:33,923 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 16:42:33,924 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 16:42:33,924 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 16:42:33,924 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 16:42:33,936 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:42:33" (1/1) ... [2018-02-04 16:42:33,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:42:33" (1/1) ... [2018-02-04 16:42:33,945 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:42:33" (1/1) ... [2018-02-04 16:42:33,945 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:42:33" (1/1) ... [2018-02-04 16:42:33,947 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:42:33" (1/1) ... [2018-02-04 16:42:33,949 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:42:33" (1/1) ... [2018-02-04 16:42:33,950 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:42:33" (1/1) ... [2018-02-04 16:42:33,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 16:42:33,951 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 16:42:33,951 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 16:42:33,951 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 16:42:33,952 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:42:33" (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 16:42:33,987 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 16:42:33,987 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 16:42:33,987 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-02-04 16:42:33,987 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 16:42:33,987 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 16:42:33,987 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 16:42:33,987 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 16:42:33,988 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 16:42:33,988 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 16:42:33,988 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 16:42:33,988 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 16:42:33,988 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-04 16:42:33,988 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 16:42:33,988 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 16:42:33,988 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-02-04 16:42:33,988 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 16:42:33,988 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 16:42:33,988 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 16:42:34,135 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 16:42:34,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:42:34 BoogieIcfgContainer [2018-02-04 16:42:34,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 16:42:34,136 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 16:42:34,136 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 16:42:34,138 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 16:42:34,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:42:33" (1/3) ... [2018-02-04 16:42:34,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1056bf42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:42:34, skipping insertion in model container [2018-02-04 16:42:34,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:42:33" (2/3) ... [2018-02-04 16:42:34,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1056bf42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:42:34, skipping insertion in model container [2018-02-04 16:42:34,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:42:34" (3/3) ... [2018-02-04 16:42:34,140 INFO L107 eAbstractionObserver]: Analyzing ICFG simple_true-unreach-call_false-valid-memtrack.i [2018-02-04 16:42:34,145 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 16:42:34,149 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-04 16:42:34,172 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 16:42:34,172 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 16:42:34,172 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 16:42:34,172 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 16:42:34,172 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 16:42:34,172 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 16:42:34,172 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 16:42:34,172 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 16:42:34,173 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 16:42:34,180 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-02-04 16:42:34,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 16:42:34,188 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:42:34,188 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:42:34,189 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 16:42:34,192 INFO L82 PathProgramCache]: Analyzing trace with hash 33713669, now seen corresponding path program 1 times [2018-02-04 16:42:34,225 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:42:34,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:42:34,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:42:34,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:42:34,283 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:42:34,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 16:42:34,284 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:42:34,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:42:34,285 INFO L182 omatonBuilderFactory]: Interpolants [56#true, 57#false] [2018-02-04 16:42:34,285 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 16:42:34,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 16:42:34,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 16:42:34,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 16:42:34,295 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 2 states. [2018-02-04 16:42:34,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:42:34,309 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-02-04 16:42:34,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 16:42:34,310 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-02-04 16:42:34,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:42:34,315 INFO L225 Difference]: With dead ends: 53 [2018-02-04 16:42:34,315 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 16:42:34,316 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 16:42:34,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 16:42:34,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-04 16:42:34,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-04 16:42:34,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-02-04 16:42:34,414 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 11 [2018-02-04 16:42:34,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:42:34,414 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-02-04 16:42:34,414 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 16:42:34,414 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-02-04 16:42:34,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 16:42:34,415 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:42:34,415 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:42:34,415 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 16:42:34,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1961763874, now seen corresponding path program 1 times [2018-02-04 16:42:34,416 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:42:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:42:34,429 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:42:34,475 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 16:42:34,476 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:42:34,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 16:42:34,476 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:42:34,476 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 16:42:34,476 INFO L182 omatonBuilderFactory]: Interpolants [160#(= 1 (select |#valid| main_~p~0.base)), 156#true, 157#false, 158#(= 1 (select |#valid| |main_#t~malloc0.base|)), 159#(= 1 (select |#valid| main_~a~0.base))] [2018-02-04 16:42:34,476 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 16:42:34,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 16:42:34,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 16:42:34,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 16:42:34,478 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 5 states. [2018-02-04 16:42:34,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:42:34,585 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-02-04 16:42:34,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 16:42:34,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-02-04 16:42:34,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:42:34,586 INFO L225 Difference]: With dead ends: 55 [2018-02-04 16:42:34,586 INFO L226 Difference]: Without dead ends: 55 [2018-02-04 16:42:34,586 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 16:42:34,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-04 16:42:34,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2018-02-04 16:42:34,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 16:42:34,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-02-04 16:42:34,590 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 13 [2018-02-04 16:42:34,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:42:34,590 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-02-04 16:42:34,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 16:42:34,590 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-02-04 16:42:34,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 16:42:34,590 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:42:34,590 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:42:34,590 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 16:42:34,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1961763873, now seen corresponding path program 1 times [2018-02-04 16:42:34,591 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:42:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:42:34,602 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:42:34,663 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 16:42:34,663 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:42:34,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 16:42:34,663 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:42:34,663 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 16:42:34,663 INFO L182 omatonBuilderFactory]: Interpolants [272#(and (= 8 (select |#length| main_~a~0.base)) (= 0 main_~a~0.offset)), 273#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0)), 269#true, 270#false, 271#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|))] [2018-02-04 16:42:34,664 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 16:42:34,664 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 16:42:34,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 16:42:34,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 16:42:34,664 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 5 states. [2018-02-04 16:42:34,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:42:34,785 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-02-04 16:42:34,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 16:42:34,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-02-04 16:42:34,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:42:34,788 INFO L225 Difference]: With dead ends: 63 [2018-02-04 16:42:34,788 INFO L226 Difference]: Without dead ends: 63 [2018-02-04 16:42:34,788 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 16:42:34,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-04 16:42:34,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2018-02-04 16:42:34,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 16:42:34,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-02-04 16:42:34,793 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 13 [2018-02-04 16:42:34,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:42:34,793 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-02-04 16:42:34,793 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 16:42:34,794 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-02-04 16:42:34,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 16:42:34,794 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:42:34,794 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:42:34,794 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 16:42:34,795 INFO L82 PathProgramCache]: Analyzing trace with hash 722281926, now seen corresponding path program 1 times [2018-02-04 16:42:34,796 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:42:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:42:34,808 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:42:34,837 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 16:42:34,838 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:42:34,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 16:42:34,838 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:42:34,838 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 16:42:34,838 INFO L182 omatonBuilderFactory]: Interpolants [400#(not (= 0 |main_#t~malloc0.base|)), 401#(not (= 0 main_~a~0.base)), 402#(not (= 0 main_~p~0.base)), 398#true, 399#false] [2018-02-04 16:42:34,839 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 16:42:34,839 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 16:42:34,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 16:42:34,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 16:42:34,839 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 5 states. [2018-02-04 16:42:34,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:42:34,888 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-02-04 16:42:34,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 16:42:34,888 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-02-04 16:42:34,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:42:34,889 INFO L225 Difference]: With dead ends: 60 [2018-02-04 16:42:34,889 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 16:42:34,889 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 16:42:34,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 16:42:34,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-02-04 16:42:34,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 16:42:34,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-02-04 16:42:34,892 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 19 [2018-02-04 16:42:34,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:42:34,892 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-02-04 16:42:34,892 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 16:42:34,892 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-02-04 16:42:34,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 16:42:34,892 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:42:34,892 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:42:34,893 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 16:42:34,893 INFO L82 PathProgramCache]: Analyzing trace with hash 587467943, now seen corresponding path program 1 times [2018-02-04 16:42:34,893 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:42:34,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:42:34,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:42:34,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:42:34,963 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:42:34,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 16:42:34,963 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:42:34,963 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 16:42:34,964 INFO L182 omatonBuilderFactory]: Interpolants [528#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))), 529#(= 1 (select |#valid| |main_#t~mem5.base|)), 530#(= 1 (select |#valid| main_~p~0.base)), 524#true, 525#false, 526#(= 1 (select |#valid| |main_#t~malloc3.base|)), 527#(= 1 (select |#valid| main_~t~0.base))] [2018-02-04 16:42:34,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:42:34,964 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 16:42:34,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 16:42:34,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 16:42:34,964 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 7 states. [2018-02-04 16:42:35,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:42:35,137 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2018-02-04 16:42:35,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 16:42:35,137 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-04 16:42:35,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:42:35,138 INFO L225 Difference]: With dead ends: 73 [2018-02-04 16:42:35,138 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 16:42:35,138 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-02-04 16:42:35,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 16:42:35,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 55. [2018-02-04 16:42:35,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 16:42:35,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-02-04 16:42:35,140 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 23 [2018-02-04 16:42:35,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:42:35,141 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-02-04 16:42:35,141 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 16:42:35,141 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-02-04 16:42:35,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 16:42:35,141 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:42:35,141 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:42:35,141 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 16:42:35,141 INFO L82 PathProgramCache]: Analyzing trace with hash 587467944, now seen corresponding path program 1 times [2018-02-04 16:42:35,142 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:42:35,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:42:35,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:42:35,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:42:35,237 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:42:35,237 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 16:42:35,237 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:42:35,237 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 16:42:35,238 INFO L182 omatonBuilderFactory]: Interpolants [672#(and (= 8 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 673#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset)), 674#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 675#(and (= 8 (select |#length| |main_#t~mem5.base|)) (= 0 |main_#t~mem5.offset|)), 676#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0)), 670#true, 671#false] [2018-02-04 16:42:35,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:42:35,238 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 16:42:35,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 16:42:35,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 16:42:35,239 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 7 states. [2018-02-04 16:42:35,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:42:35,432 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2018-02-04 16:42:35,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 16:42:35,432 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-04 16:42:35,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:42:35,433 INFO L225 Difference]: With dead ends: 69 [2018-02-04 16:42:35,433 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 16:42:35,433 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-02-04 16:42:35,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 16:42:35,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 39. [2018-02-04 16:42:35,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-04 16:42:35,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-02-04 16:42:35,439 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 23 [2018-02-04 16:42:35,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:42:35,439 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-02-04 16:42:35,439 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 16:42:35,439 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-02-04 16:42:35,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 16:42:35,439 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:42:35,439 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:42:35,439 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 16:42:35,440 INFO L82 PathProgramCache]: Analyzing trace with hash 857300197, now seen corresponding path program 1 times [2018-02-04 16:42:35,440 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:42:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:42:35,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:42:35,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:42:35,589 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:42:35,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 16:42:35,589 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:42:35,589 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 16:42:35,590 INFO L182 omatonBuilderFactory]: Interpolants [800#(= 0 |main_#t~malloc0.offset|), 801#(= 0 main_~a~0.offset), 802#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 803#(and (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 804#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 805#(and (= 0 |main_#t~mem9.offset|) (= 0 |main_#t~mem9.base|)), 806#(and (= main_~p~0.base 0) (= main_~p~0.offset 0)), 798#true, 799#false] [2018-02-04 16:42:35,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:42:35,590 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 16:42:35,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 16:42:35,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 16:42:35,590 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 9 states. [2018-02-04 16:42:35,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:42:35,747 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-02-04 16:42:35,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 16:42:35,748 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-02-04 16:42:35,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:42:35,748 INFO L225 Difference]: With dead ends: 64 [2018-02-04 16:42:35,748 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 16:42:35,749 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2018-02-04 16:42:35,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 16:42:35,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2018-02-04 16:42:35,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 16:42:35,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-02-04 16:42:35,751 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 24 [2018-02-04 16:42:35,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:42:35,752 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-02-04 16:42:35,752 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 16:42:35,752 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-02-04 16:42:35,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 16:42:35,752 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:42:35,752 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] [2018-02-04 16:42:35,752 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-02-04 16:42:35,752 INFO L82 PathProgramCache]: Analyzing trace with hash 806501016, now seen corresponding path program 1 times [2018-02-04 16:42:35,753 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:42:35,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 16:42:35,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 16:42:35,784 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 16:42:35,793 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 16:42:35,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 04:42:35 BoogieIcfgContainer [2018-02-04 16:42:35,802 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 16:42:35,803 INFO L168 Benchmark]: Toolchain (without parser) took 2036.57 ms. Allocated memory was 404.2 MB in the beginning and 636.0 MB in the end (delta: 231.7 MB). Free memory was 362.4 MB in the beginning and 547.7 MB in the end (delta: -185.2 MB). Peak memory consumption was 46.5 MB. Max. memory is 5.3 GB. [2018-02-04 16:42:35,803 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 404.2 MB. Free memory is still 367.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 16:42:35,804 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.59 ms. Allocated memory is still 404.2 MB. Free memory was 361.1 MB in the beginning and 350.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. [2018-02-04 16:42:35,804 INFO L168 Benchmark]: Boogie Preprocessor took 26.70 ms. Allocated memory is still 404.2 MB. Free memory was 350.4 MB in the beginning and 349.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 16:42:35,804 INFO L168 Benchmark]: RCFGBuilder took 184.37 ms. Allocated memory is still 404.2 MB. Free memory was 349.1 MB in the beginning and 328.4 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. [2018-02-04 16:42:35,804 INFO L168 Benchmark]: TraceAbstraction took 1666.56 ms. Allocated memory was 404.2 MB in the beginning and 636.0 MB in the end (delta: 231.7 MB). Free memory was 328.4 MB in the beginning and 547.7 MB in the end (delta: -219.2 MB). Peak memory consumption was 12.5 MB. Max. memory is 5.3 GB. [2018-02-04 16:42:35,805 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.16 ms. Allocated memory is still 404.2 MB. Free memory is still 367.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 156.59 ms. Allocated memory is still 404.2 MB. Free memory was 361.1 MB in the beginning and 350.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.70 ms. Allocated memory is still 404.2 MB. Free memory was 350.4 MB in the beginning and 349.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 184.37 ms. Allocated memory is still 404.2 MB. Free memory was 349.1 MB in the beginning and 328.4 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1666.56 ms. Allocated memory was 404.2 MB in the beginning and 636.0 MB in the end (delta: 231.7 MB). Free memory was 328.4 MB in the beginning and 547.7 MB in the end (delta: -219.2 MB). Peak memory consumption was 12.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 626]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L627] EXPR, FCALL malloc(sizeof(struct node)) VAL [malloc(sizeof(struct node))={11:0}] [L627] List a = (List) malloc(sizeof(struct node)); VAL [a={11:0}, malloc(sizeof(struct node))={11:0}] [L628] COND FALSE !(a == 0) VAL [a={11:0}, malloc(sizeof(struct node))={11:0}] [L629] List t; [L630] List p = a; VAL [a={11:0}, malloc(sizeof(struct node))={11:0}, p={11:0}] [L631] COND FALSE !(__VERIFIER_nondet_int()) [L638] FCALL p->h = 1 VAL [a={11:0}, malloc(sizeof(struct node))={11:0}, p={11:0}] [L639] FCALL p->n = 0 VAL [a={11:0}, malloc(sizeof(struct node))={11:0}, p={11:0}] [L640] p = a VAL [a={11:0}, malloc(sizeof(struct node))={11:0}, p={11:0}] [L641] COND TRUE p!=0 VAL [a={11:0}, malloc(sizeof(struct node))={11:0}, p={11:0}] [L642] EXPR, FCALL p->h VAL [a={11:0}, malloc(sizeof(struct node))={11:0}, p={11:0}, p->h=1] [L642] COND FALSE !(p->h != 1) [L645] EXPR, FCALL p->n VAL [a={11:0}, malloc(sizeof(struct node))={11:0}, p={11:0}, p->n={0:0}] [L645] p = p->n [L641] COND FALSE !(p!=0) VAL [a={11:0}, malloc(sizeof(struct node))={11:0}, p={0:0}] [L647] return 0; VAL [\result=0, a={11:0}, malloc(sizeof(struct node))={11:0}, p={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 55 locations, 15 error locations. UNSAFE Result, 1.6s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 226 SDtfs, 629 SDslu, 384 SDs, 0 SdLazy, 471 SolverSat, 60 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 7/9 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, 7 MinimizatonAttempts, 74 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 151 NumberOfCodeBlocks, 151 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 119 ConstructedInterpolants, 0 QuantifiedInterpolants, 11068 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 7/9 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/simple_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_16-42-35-812.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_16-42-35-812.csv Received shutdown request...