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/list_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 20:43:37,618 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 20:43:37,619 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 20:43:37,634 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 20:43:37,634 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 20:43:37,634 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 20:43:37,636 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 20:43:37,638 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 20:43:37,641 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 20:43:37,642 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 20:43:37,646 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 20:43:37,647 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 20:43:37,648 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 20:43:37,649 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 20:43:37,650 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 20:43:37,652 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 20:43:37,653 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 20:43:37,655 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 20:43:37,656 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 20:43:37,658 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 20:43:37,659 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 20:43:37,660 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 20:43:37,660 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 20:43:37,661 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 20:43:37,661 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 20:43:37,663 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 20:43:37,663 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 20:43:37,663 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 20:43:37,663 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 20:43:37,664 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 20:43:37,664 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 20:43:37,664 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-02 20:43:37,674 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 20:43:37,674 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 20:43:37,675 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 20:43:37,675 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 20:43:37,676 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 20:43:37,676 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 20:43:37,676 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 20:43:37,676 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 20:43:37,676 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 20:43:37,677 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 20:43:37,677 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 20:43:37,677 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 20:43:37,677 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 20:43:37,678 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 20:43:37,678 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 20:43:37,678 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 20:43:37,678 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 20:43:37,678 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 20:43:37,678 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 20:43:37,678 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 20:43:37,678 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:43:37,679 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 20:43:37,679 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 20:43:37,707 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 20:43:37,717 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 20:43:37,720 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 20:43:37,721 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 20:43:37,722 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 20:43:37,722 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/list_true-unreach-call_false-valid-memtrack.i [2018-02-02 20:43:37,853 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 20:43:37,856 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 20:43:37,858 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 20:43:37,858 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 20:43:37,865 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 20:43:37,866 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:43:37" (1/1) ... [2018-02-02 20:43:37,868 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1482aa0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:43:37, skipping insertion in model container [2018-02-02 20:43:37,869 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:43:37" (1/1) ... [2018-02-02 20:43:37,881 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:43:37,910 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:43:38,009 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:43:38,025 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:43:38,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:43:38 WrapperNode [2018-02-02 20:43:38,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 20:43:38,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 20:43:38,032 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 20:43:38,032 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 20:43:38,044 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:43:38" (1/1) ... [2018-02-02 20:43:38,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:43:38" (1/1) ... [2018-02-02 20:43:38,051 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:43:38" (1/1) ... [2018-02-02 20:43:38,051 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:43:38" (1/1) ... [2018-02-02 20:43:38,054 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:43:38" (1/1) ... [2018-02-02 20:43:38,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:43:38" (1/1) ... [2018-02-02 20:43:38,058 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:43:38" (1/1) ... [2018-02-02 20:43:38,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 20:43:38,060 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 20:43:38,060 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 20:43:38,060 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 20:43:38,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:43:38" (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-02 20:43:38,099 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 20:43:38,099 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 20:43:38,100 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-02-02 20:43:38,100 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 20:43:38,100 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 20:43:38,100 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 20:43:38,100 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 20:43:38,100 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 20:43:38,101 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 20:43:38,101 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 20:43:38,101 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 20:43:38,101 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 20:43:38,101 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 20:43:38,101 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 20:43:38,101 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-02-02 20:43:38,101 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 20:43:38,102 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 20:43:38,102 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 20:43:38,352 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 20:43:38,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:43:38 BoogieIcfgContainer [2018-02-02 20:43:38,353 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 20:43:38,353 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 20:43:38,353 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 20:43:38,355 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 20:43:38,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:43:37" (1/3) ... [2018-02-02 20:43:38,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dee27ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:43:38, skipping insertion in model container [2018-02-02 20:43:38,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:43:38" (2/3) ... [2018-02-02 20:43:38,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dee27ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:43:38, skipping insertion in model container [2018-02-02 20:43:38,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:43:38" (3/3) ... [2018-02-02 20:43:38,357 INFO L107 eAbstractionObserver]: Analyzing ICFG list_true-unreach-call_false-valid-memtrack.i [2018-02-02 20:43:38,362 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 20:43:38,366 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 25 error locations. [2018-02-02 20:43:38,399 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 20:43:38,399 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 20:43:38,399 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 20:43:38,399 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 20:43:38,399 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 20:43:38,400 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 20:43:38,400 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 20:43:38,400 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 20:43:38,401 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 20:43:38,410 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2018-02-02 20:43:38,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 20:43:38,418 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:43:38,419 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:43:38,419 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:43:38,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1577909781, now seen corresponding path program 1 times [2018-02-02 20:43:38,454 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:43:38,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:43:38,484 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:43:38,511 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-02 20:43:38,513 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:43:38,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 20:43:38,514 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:43:38,515 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-02 20:43:38,515 INFO L182 omatonBuilderFactory]: Interpolants [82#true, 83#false] [2018-02-02 20:43:38,515 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-02 20:43:38,516 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-02 20:43:38,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-02 20:43:38,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 20:43:38,525 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 2 states. [2018-02-02 20:43:38,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:43:38,541 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2018-02-02 20:43:38,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-02 20:43:38,542 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-02-02 20:43:38,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:43:38,548 INFO L225 Difference]: With dead ends: 79 [2018-02-02 20:43:38,548 INFO L226 Difference]: Without dead ends: 70 [2018-02-02 20:43:38,603 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-02 20:43:38,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-02 20:43:38,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-02-02 20:43:38,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-02 20:43:38,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-02-02 20:43:38,633 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 12 [2018-02-02 20:43:38,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:43:38,633 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2018-02-02 20:43:38,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-02 20:43:38,634 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-02-02 20:43:38,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 20:43:38,634 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:43:38,634 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:43:38,634 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:43:38,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1669671355, now seen corresponding path program 1 times [2018-02-02 20:43:38,636 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:43:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:43:38,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:43:38,703 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-02 20:43:38,704 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:43:38,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:43:38,704 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:43:38,704 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-02 20:43:38,704 INFO L182 omatonBuilderFactory]: Interpolants [233#true, 234#false, 235#(= 1 (select |#valid| |main_#t~malloc0.base|)), 236#(= 1 (select |#valid| main_~a~0.base)), 237#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 20:43:38,705 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-02 20:43:38,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:43:38,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:43:38,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:43:38,706 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 5 states. [2018-02-02 20:43:38,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:43:38,842 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-02-02 20:43:38,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:43:38,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-02-02 20:43:38,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:43:38,844 INFO L225 Difference]: With dead ends: 81 [2018-02-02 20:43:38,844 INFO L226 Difference]: Without dead ends: 81 [2018-02-02 20:43:38,845 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-02 20:43:38,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-02 20:43:38,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2018-02-02 20:43:38,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-02 20:43:38,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2018-02-02 20:43:38,851 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 13 [2018-02-02 20:43:38,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:43:38,851 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2018-02-02 20:43:38,851 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:43:38,851 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2018-02-02 20:43:38,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 20:43:38,852 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:43:38,852 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:43:38,852 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:43:38,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1669671356, now seen corresponding path program 1 times [2018-02-02 20:43:38,853 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:43:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:43:38,866 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:43:38,924 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-02 20:43:38,924 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:43:38,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:43:38,925 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:43:38,925 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-02 20:43:38,925 INFO L182 omatonBuilderFactory]: Interpolants [400#false, 401#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 402#(and (= 8 (select |#length| main_~a~0.base)) (= 0 main_~a~0.offset)), 403#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0)), 399#true] [2018-02-02 20:43:38,925 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-02 20:43:38,925 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:43:38,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:43:38,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:43:38,926 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 5 states. [2018-02-02 20:43:39,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:43:39,064 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2018-02-02 20:43:39,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:43:39,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-02-02 20:43:39,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:43:39,067 INFO L225 Difference]: With dead ends: 102 [2018-02-02 20:43:39,067 INFO L226 Difference]: Without dead ends: 102 [2018-02-02 20:43:39,067 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-02 20:43:39,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-02 20:43:39,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 93. [2018-02-02 20:43:39,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-02 20:43:39,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2018-02-02 20:43:39,073 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 13 [2018-02-02 20:43:39,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:43:39,073 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2018-02-02 20:43:39,073 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:43:39,073 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2018-02-02 20:43:39,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 20:43:39,074 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:43:39,074 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:43:39,074 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:43:39,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1462598724, now seen corresponding path program 1 times [2018-02-02 20:43:39,075 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:43:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:43:39,088 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:43:39,131 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:43:39,131 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:43:39,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:43:39,132 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:43:39,132 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-02 20:43:39,132 INFO L182 omatonBuilderFactory]: Interpolants [608#(= 1 (select |#valid| |main_#t~mem5.base|)), 609#(= 1 (select |#valid| main_~p~0.base)), 603#true, 604#false, 605#(= 1 (select |#valid| |main_#t~malloc3.base|)), 606#(= 1 (select |#valid| main_~t~0.base)), 607#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))] [2018-02-02 20:43:39,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:43:39,132 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:43:39,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:43:39,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:43:39,133 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand 7 states. [2018-02-02 20:43:39,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:43:39,421 INFO L93 Difference]: Finished difference Result 189 states and 204 transitions. [2018-02-02 20:43:39,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:43:39,421 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-02 20:43:39,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:43:39,422 INFO L225 Difference]: With dead ends: 189 [2018-02-02 20:43:39,422 INFO L226 Difference]: Without dead ends: 189 [2018-02-02 20:43:39,423 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-02 20:43:39,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-02-02 20:43:39,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 97. [2018-02-02 20:43:39,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-02 20:43:39,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2018-02-02 20:43:39,428 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 23 [2018-02-02 20:43:39,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:43:39,429 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2018-02-02 20:43:39,429 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:43:39,429 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2018-02-02 20:43:39,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 20:43:39,430 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:43:39,430 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:43:39,430 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:43:39,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1462598725, now seen corresponding path program 1 times [2018-02-02 20:43:39,431 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:43:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:43:39,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:43:39,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:43:39,510 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:43:39,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:43:39,511 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:43:39,511 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-02 20:43:39,511 INFO L182 omatonBuilderFactory]: Interpolants [912#(and (= 8 (select |#length| |main_#t~mem5.base|)) (= 0 |main_#t~mem5.offset|)), 913#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0)), 907#true, 908#false, 909#(and (= 8 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 910#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset)), 911#(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))))] [2018-02-02 20:43:39,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:43:39,511 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:43:39,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:43:39,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:43:39,512 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand 7 states. [2018-02-02 20:43:39,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:43:39,790 INFO L93 Difference]: Finished difference Result 186 states and 204 transitions. [2018-02-02 20:43:39,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:43:39,790 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-02 20:43:39,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:43:39,791 INFO L225 Difference]: With dead ends: 186 [2018-02-02 20:43:39,791 INFO L226 Difference]: Without dead ends: 186 [2018-02-02 20:43:39,791 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:43:39,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-02-02 20:43:39,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 80. [2018-02-02 20:43:39,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-02 20:43:39,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2018-02-02 20:43:39,796 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 23 [2018-02-02 20:43:39,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:43:39,796 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2018-02-02 20:43:39,797 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:43:39,797 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2018-02-02 20:43:39,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 20:43:39,797 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:43:39,797 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] [2018-02-02 20:43:39,797 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:43:39,798 INFO L82 PathProgramCache]: Analyzing trace with hash 919312261, now seen corresponding path program 1 times [2018-02-02 20:43:39,798 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:43:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:43:39,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:43:39,834 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-02 20:43:39,834 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:43:39,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:43:39,835 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:43:39,835 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-02 20:43:39,835 INFO L182 omatonBuilderFactory]: Interpolants [1200#(= |main_#t~mem12| 3), 1195#true, 1196#false, 1197#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 1198#(= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3), 1199#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)] [2018-02-02 20:43:39,835 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-02 20:43:39,835 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:43:39,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:43:39,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:43:39,836 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 6 states. [2018-02-02 20:43:39,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:43:39,930 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2018-02-02 20:43:39,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:43:39,931 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-02 20:43:39,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:43:39,931 INFO L225 Difference]: With dead ends: 135 [2018-02-02 20:43:39,931 INFO L226 Difference]: Without dead ends: 135 [2018-02-02 20:43:39,932 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:43:39,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-02 20:43:39,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 91. [2018-02-02 20:43:39,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-02 20:43:39,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2018-02-02 20:43:39,937 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 24 [2018-02-02 20:43:39,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:43:39,937 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2018-02-02 20:43:39,937 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:43:39,937 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2018-02-02 20:43:39,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 20:43:39,938 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:43:39,938 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, 1, 1] [2018-02-02 20:43:39,938 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:43:39,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1842256062, now seen corresponding path program 1 times [2018-02-02 20:43:39,939 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:43:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:43:39,948 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:43:40,026 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-02 20:43:40,026 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:43:40,026 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:43:40,026 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:43:40,027 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-02 20:43:40,027 INFO L182 omatonBuilderFactory]: Interpolants [1431#true, 1432#false, 1433#(= 1 (select |#valid| |main_#t~malloc8.base|)), 1434#(= 1 (select |#valid| main_~t~0.base)), 1435#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))), 1436#(= 1 (select |#valid| |main_#t~mem10.base|)), 1437#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 20:43:40,027 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-02 20:43:40,027 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:43:40,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:43:40,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:43:40,028 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand 7 states. [2018-02-02 20:43:40,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:43:40,141 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2018-02-02 20:43:40,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:43:40,141 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-02-02 20:43:40,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:43:40,142 INFO L225 Difference]: With dead ends: 125 [2018-02-02 20:43:40,142 INFO L226 Difference]: Without dead ends: 125 [2018-02-02 20:43:40,142 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-02 20:43:40,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-02 20:43:40,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 89. [2018-02-02 20:43:40,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-02 20:43:40,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2018-02-02 20:43:40,146 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 26 [2018-02-02 20:43:40,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:43:40,146 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2018-02-02 20:43:40,146 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:43:40,146 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2018-02-02 20:43:40,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 20:43:40,147 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:43:40,147 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, 1, 1] [2018-02-02 20:43:40,147 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:43:40,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1842256063, now seen corresponding path program 1 times [2018-02-02 20:43:40,148 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:43:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:43:40,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:43:40,212 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-02 20:43:40,212 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:43:40,212 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:43:40,212 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:43:40,213 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-02 20:43:40,213 INFO L182 omatonBuilderFactory]: Interpolants [1664#false, 1665#(and (= 8 (select |#length| |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|)), 1666#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset)), 1667#(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)))), 1668#(and (= 8 (select |#length| |main_#t~mem10.base|)) (= 0 |main_#t~mem10.offset|)), 1669#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0)), 1663#true] [2018-02-02 20:43:40,213 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-02 20:43:40,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:43:40,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:43:40,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:43:40,213 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand 7 states. [2018-02-02 20:43:40,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:43:40,407 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2018-02-02 20:43:40,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:43:40,408 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-02-02 20:43:40,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:43:40,408 INFO L225 Difference]: With dead ends: 120 [2018-02-02 20:43:40,408 INFO L226 Difference]: Without dead ends: 120 [2018-02-02 20:43:40,408 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-02 20:43:40,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-02 20:43:40,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 75. [2018-02-02 20:43:40,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-02 20:43:40,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2018-02-02 20:43:40,410 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 26 [2018-02-02 20:43:40,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:43:40,410 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2018-02-02 20:43:40,411 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:43:40,411 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2018-02-02 20:43:40,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 20:43:40,411 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:43:40,411 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-02 20:43:40,411 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 20:43:40,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1313779944, now seen corresponding path program 1 times [2018-02-02 20:43:40,412 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:43:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 20:43:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 20:43:40,439 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-02 20:43:40,448 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-02 20:43:40,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:43:40 BoogieIcfgContainer [2018-02-02 20:43:40,456 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 20:43:40,457 INFO L168 Benchmark]: Toolchain (without parser) took 2603.80 ms. Allocated memory was 407.4 MB in the beginning and 633.3 MB in the end (delta: 226.0 MB). Free memory was 364.2 MB in the beginning and 432.5 MB in the end (delta: -68.3 MB). Peak memory consumption was 157.7 MB. Max. memory is 5.3 GB. [2018-02-02 20:43:40,458 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 407.4 MB. Free memory is still 370.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:43:40,458 INFO L168 Benchmark]: CACSL2BoogieTranslator took 173.57 ms. Allocated memory is still 407.4 MB. Free memory was 364.2 MB in the beginning and 353.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. [2018-02-02 20:43:40,458 INFO L168 Benchmark]: Boogie Preprocessor took 28.17 ms. Allocated memory is still 407.4 MB. Free memory was 353.5 MB in the beginning and 352.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 20:43:40,458 INFO L168 Benchmark]: RCFGBuilder took 292.79 ms. Allocated memory is still 407.4 MB. Free memory was 352.2 MB in the beginning and 326.2 MB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 5.3 GB. [2018-02-02 20:43:40,459 INFO L168 Benchmark]: TraceAbstraction took 2103.23 ms. Allocated memory was 407.4 MB in the beginning and 633.3 MB in the end (delta: 226.0 MB). Free memory was 326.2 MB in the beginning and 432.5 MB in the end (delta: -106.3 MB). Peak memory consumption was 119.7 MB. Max. memory is 5.3 GB. [2018-02-02 20:43:40,460 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.13 ms. Allocated memory is still 407.4 MB. Free memory is still 370.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 173.57 ms. Allocated memory is still 407.4 MB. Free memory was 364.2 MB in the beginning and 353.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.17 ms. Allocated memory is still 407.4 MB. Free memory was 353.5 MB in the beginning and 352.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 292.79 ms. Allocated memory is still 407.4 MB. Free memory was 352.2 MB in the beginning and 326.2 MB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2103.23 ms. Allocated memory was 407.4 MB in the beginning and 633.3 MB in the end (delta: 226.0 MB). Free memory was 326.2 MB in the beginning and 432.5 MB in the end (delta: -106.3 MB). Peak memory consumption was 119.7 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: - UnprovableResult [Line: 626]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 626. Possible 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] COND FALSE !(__VERIFIER_nondet_int()) [L645] FCALL p->h = 3 VAL [a={11:0}, malloc(sizeof(struct node))={11:0}, p={11:0}] [L646] p = a VAL [a={11:0}, malloc(sizeof(struct node))={11:0}, p={11:0}] [L647] EXPR, FCALL p->h VAL [a={11:0}, malloc(sizeof(struct node))={11:0}, p={11:0}, p->h=3] [L647] COND FALSE !(p->h == 1) [L649] EXPR, FCALL p->h VAL [a={11:0}, malloc(sizeof(struct node))={11:0}, p={11:0}, p->h=3] [L649] COND FALSE !(p->h == 2) [L651] EXPR, FCALL p->h VAL [a={11:0}, malloc(sizeof(struct node))={11:0}, p={11:0}, p->h=3] [L651] COND FALSE !(p->h != 3) [L653] return 0; VAL [\result=0, a={11:0}, malloc(sizeof(struct node))={11:0}, p={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 81 locations, 25 error locations. UNSAFE Result, 2.0s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 464 SDtfs, 984 SDslu, 997 SDs, 0 SdLazy, 1156 SolverSat, 107 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 16/16 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 337 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 152 ConstructedInterpolants, 0 QuantifiedInterpolants, 11512 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 16/16 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_20-43-40-464.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_20-43-40-464.csv Received shutdown request...