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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/memory-alloca/c.03-alloca_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:10:28,704 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:10:28,706 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:10:28,715 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:10:28,715 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:10:28,716 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:10:28,717 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:10:28,719 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:10:28,720 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:10:28,721 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:10:28,722 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:10:28,722 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:10:28,723 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:10:28,724 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:10:28,724 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:10:28,726 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:10:28,728 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:10:28,729 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:10:28,730 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:10:28,731 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:10:28,733 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:10:28,733 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:10:28,733 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:10:28,734 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:10:28,735 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:10:28,736 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:10:28,736 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:10:28,736 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:10:28,736 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:10:28,737 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:10:28,737 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:10:28,737 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 10:10:28,747 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:10:28,747 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:10:28,748 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:10:28,749 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:10:28,749 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:10:28,749 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:10:28,749 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:10:28,749 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:10:28,749 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:10:28,750 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:10:28,750 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:10:28,750 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:10:28,750 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:10:28,750 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:10:28,750 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:10:28,751 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:10:28,751 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:10:28,751 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:10:28,751 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:10:28,751 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:10:28,751 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:10:28,752 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:10:28,752 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:10:28,782 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:10:28,794 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:10:28,797 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:10:28,800 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:10:28,801 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:10:28,801 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memory-alloca/c.03-alloca_true-valid-memsafety.i [2018-02-02 10:10:28,991 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:10:28,992 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:10:28,993 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:10:28,993 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:10:28,998 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:10:28,998 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:10:28" (1/1) ... [2018-02-02 10:10:29,000 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2916f51d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:10:28, skipping insertion in model container [2018-02-02 10:10:29,000 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:10:28" (1/1) ... [2018-02-02 10:10:29,014 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:10:29,041 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:10:29,126 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:10:29,137 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:10:29,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:10:29 WrapperNode [2018-02-02 10:10:29,142 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:10:29,143 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:10:29,143 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:10:29,143 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:10:29,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:10:29" (1/1) ... [2018-02-02 10:10:29,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:10:29" (1/1) ... [2018-02-02 10:10:29,164 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:10:29" (1/1) ... [2018-02-02 10:10:29,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:10:29" (1/1) ... [2018-02-02 10:10:29,166 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:10:29" (1/1) ... [2018-02-02 10:10:29,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:10:29" (1/1) ... [2018-02-02 10:10:29,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:10:29" (1/1) ... [2018-02-02 10:10:29,169 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:10:29,169 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:10:29,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:10:29,170 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:10:29,170 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:10:29" (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 10:10:29,205 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:10:29,205 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:10:29,206 INFO L136 BoogieDeclarations]: Found implementation of procedure test_fun [2018-02-02 10:10:29,206 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:10:29,206 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:10:29,206 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:10:29,206 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:10:29,206 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:10:29,206 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:10:29,206 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:10:29,206 INFO L128 BoogieDeclarations]: Found specification of procedure test_fun [2018-02-02 10:10:29,206 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:10:29,206 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:10:29,206 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:10:29,405 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:10:29,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:10:29 BoogieIcfgContainer [2018-02-02 10:10:29,405 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:10:29,406 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:10:29,406 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:10:29,407 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:10:29,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:10:28" (1/3) ... [2018-02-02 10:10:29,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38fb4416 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:10:29, skipping insertion in model container [2018-02-02 10:10:29,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:10:29" (2/3) ... [2018-02-02 10:10:29,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38fb4416 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:10:29, skipping insertion in model container [2018-02-02 10:10:29,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:10:29" (3/3) ... [2018-02-02 10:10:29,409 INFO L107 eAbstractionObserver]: Analyzing ICFG c.03-alloca_true-valid-memsafety.i [2018-02-02 10:10:29,414 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:10:29,419 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2018-02-02 10:10:29,442 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:10:29,442 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:10:29,442 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:10:29,442 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:10:29,443 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:10:29,443 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:10:29,443 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:10:29,443 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:10:29,443 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:10:29,453 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-02-02 10:10:29,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:10:29,459 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:29,460 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:29,461 INFO L371 AbstractCegarLoop]: === Iteration 1 === [test_funErr27RequiresViolation, test_funErr17RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr9RequiresViolation, test_funErr14RequiresViolation, test_funErr22RequiresViolation, test_funErr2RequiresViolation, test_funErr19RequiresViolation, test_funErr6RequiresViolation, test_funErr20RequiresViolation, test_funErr29RequiresViolation, test_funErr16RequiresViolation, test_funErr3RequiresViolation, test_funErr26RequiresViolation, test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr23RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr11RequiresViolation, test_funErr24RequiresViolation, test_funErr15RequiresViolation, test_funErr25RequiresViolation, test_funErr28RequiresViolation, test_funErr1RequiresViolation, test_funErr18RequiresViolation, test_funErr21RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:10:29,464 INFO L82 PathProgramCache]: Analyzing trace with hash 2127926480, now seen corresponding path program 1 times [2018-02-02 10:10:29,496 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:29,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:29,544 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:29,662 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 10:10:29,664 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:10:29,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:10:29,665 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:29,666 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 10:10:29,666 INFO L182 omatonBuilderFactory]: Interpolants [87#true, 88#false, 89#(= (select |#valid| |test_fun_#t~malloc0.base|) 1), 90#(= (select |#valid| test_fun_~x_ref~0.base) 1)] [2018-02-02 10:10:29,666 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 10:10:29,667 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:10:29,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:10:29,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:10:29,677 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 4 states. [2018-02-02 10:10:29,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:29,843 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2018-02-02 10:10:29,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:10:29,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-02 10:10:29,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:29,852 INFO L225 Difference]: With dead ends: 79 [2018-02-02 10:10:29,853 INFO L226 Difference]: Without dead ends: 76 [2018-02-02 10:10:29,854 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:10:29,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-02 10:10:29,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-02-02 10:10:29,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-02 10:10:29,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2018-02-02 10:10:29,885 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 17 [2018-02-02 10:10:29,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:29,885 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2018-02-02 10:10:29,885 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:10:29,885 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-02-02 10:10:29,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:10:29,886 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:29,886 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:29,886 INFO L371 AbstractCegarLoop]: === Iteration 2 === [test_funErr27RequiresViolation, test_funErr17RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr9RequiresViolation, test_funErr14RequiresViolation, test_funErr22RequiresViolation, test_funErr2RequiresViolation, test_funErr19RequiresViolation, test_funErr6RequiresViolation, test_funErr20RequiresViolation, test_funErr29RequiresViolation, test_funErr16RequiresViolation, test_funErr3RequiresViolation, test_funErr26RequiresViolation, test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr23RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr11RequiresViolation, test_funErr24RequiresViolation, test_funErr15RequiresViolation, test_funErr25RequiresViolation, test_funErr28RequiresViolation, test_funErr1RequiresViolation, test_funErr18RequiresViolation, test_funErr21RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:10:29,886 INFO L82 PathProgramCache]: Analyzing trace with hash 2127926481, now seen corresponding path program 1 times [2018-02-02 10:10:29,887 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:29,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:29,906 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:29,990 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 10:10:29,991 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:10:29,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:10:29,991 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:29,991 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 10:10:29,991 INFO L182 omatonBuilderFactory]: Interpolants [248#true, 249#false, 250#(and (= 4 (select |#length| |test_fun_#t~malloc0.base|)) (= (select |#valid| |test_fun_#t~malloc0.base|) 1) (= 0 |test_fun_#t~malloc0.offset|)), 251#(and (= test_fun_~x_ref~0.offset 0) (= (select |#valid| test_fun_~x_ref~0.base) 1) (= 4 (select |#length| test_fun_~x_ref~0.base))), 252#(and (= test_fun_~x_ref~0.offset 0) (= 4 (select |#length| test_fun_~x_ref~0.base)))] [2018-02-02 10:10:29,991 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 10:10:29,993 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:10:29,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:10:29,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:10:29,993 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 5 states. [2018-02-02 10:10:30,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:30,091 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2018-02-02 10:10:30,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:10:30,091 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 10:10:30,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:30,093 INFO L225 Difference]: With dead ends: 71 [2018-02-02 10:10:30,093 INFO L226 Difference]: Without dead ends: 71 [2018-02-02 10:10:30,093 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:10:30,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-02 10:10:30,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-02-02 10:10:30,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-02 10:10:30,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-02-02 10:10:30,099 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 17 [2018-02-02 10:10:30,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:30,099 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-02-02 10:10:30,099 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:10:30,099 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-02-02 10:10:30,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:10:30,100 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:30,100 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:30,100 INFO L371 AbstractCegarLoop]: === Iteration 3 === [test_funErr27RequiresViolation, test_funErr17RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr9RequiresViolation, test_funErr14RequiresViolation, test_funErr22RequiresViolation, test_funErr2RequiresViolation, test_funErr19RequiresViolation, test_funErr6RequiresViolation, test_funErr20RequiresViolation, test_funErr29RequiresViolation, test_funErr16RequiresViolation, test_funErr3RequiresViolation, test_funErr26RequiresViolation, test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr23RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr11RequiresViolation, test_funErr24RequiresViolation, test_funErr15RequiresViolation, test_funErr25RequiresViolation, test_funErr28RequiresViolation, test_funErr1RequiresViolation, test_funErr18RequiresViolation, test_funErr21RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:10:30,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1541211425, now seen corresponding path program 1 times [2018-02-02 10:10:30,101 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:30,114 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:30,170 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 10:10:30,170 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:10:30,170 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:10:30,171 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:30,171 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 10:10:30,171 INFO L182 omatonBuilderFactory]: Interpolants [400#(and (= (select |#valid| test_fun_~y_ref~0.base) 1) (= 4 (select |#length| test_fun_~y_ref~0.base)) (= test_fun_~y_ref~0.offset 0)), 401#(and (= 4 (select |#length| test_fun_~y_ref~0.base)) (= test_fun_~y_ref~0.offset 0)), 397#true, 398#false, 399#(and (= 4 (select |#length| |test_fun_#t~malloc1.base|)) (= (select |#valid| |test_fun_#t~malloc1.base|) 1) (= 0 |test_fun_#t~malloc1.offset|))] [2018-02-02 10:10:30,171 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 10:10:30,171 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:10:30,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:10:30,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:10:30,172 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 5 states. [2018-02-02 10:10:30,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:30,237 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-02-02 10:10:30,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:10:30,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-02 10:10:30,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:30,239 INFO L225 Difference]: With dead ends: 67 [2018-02-02 10:10:30,239 INFO L226 Difference]: Without dead ends: 67 [2018-02-02 10:10:30,239 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:10:30,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-02 10:10:30,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-02-02 10:10:30,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-02 10:10:30,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-02-02 10:10:30,242 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 18 [2018-02-02 10:10:30,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:30,242 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-02-02 10:10:30,242 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:10:30,242 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-02-02 10:10:30,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:10:30,242 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:30,243 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-02 10:10:30,243 INFO L371 AbstractCegarLoop]: === Iteration 4 === [test_funErr27RequiresViolation, test_funErr17RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr9RequiresViolation, test_funErr14RequiresViolation, test_funErr22RequiresViolation, test_funErr2RequiresViolation, test_funErr19RequiresViolation, test_funErr6RequiresViolation, test_funErr20RequiresViolation, test_funErr29RequiresViolation, test_funErr16RequiresViolation, test_funErr3RequiresViolation, test_funErr26RequiresViolation, test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr23RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr11RequiresViolation, test_funErr24RequiresViolation, test_funErr15RequiresViolation, test_funErr25RequiresViolation, test_funErr28RequiresViolation, test_funErr1RequiresViolation, test_funErr18RequiresViolation, test_funErr21RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:10:30,243 INFO L82 PathProgramCache]: Analyzing trace with hash 532913875, now seen corresponding path program 1 times [2018-02-02 10:10:30,243 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:30,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:30,288 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 10:10:30,289 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:10:30,289 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:10:30,289 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:30,289 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 10:10:30,290 INFO L182 omatonBuilderFactory]: Interpolants [538#true, 539#false, 540#(= 1 (select |#valid| |test_fun_#t~malloc2.base|)), 541#(= 1 (select |#valid| test_fun_~z_ref~0.base))] [2018-02-02 10:10:30,290 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 10:10:30,290 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:10:30,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:10:30,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:10:30,291 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 4 states. [2018-02-02 10:10:30,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:30,328 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2018-02-02 10:10:30,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:10:30,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-02-02 10:10:30,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:30,329 INFO L225 Difference]: With dead ends: 63 [2018-02-02 10:10:30,329 INFO L226 Difference]: Without dead ends: 63 [2018-02-02 10:10:30,329 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:10:30,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-02 10:10:30,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-02-02 10:10:30,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-02 10:10:30,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-02-02 10:10:30,332 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 19 [2018-02-02 10:10:30,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:30,332 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-02-02 10:10:30,333 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:10:30,333 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-02-02 10:10:30,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:10:30,333 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:30,333 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-02 10:10:30,333 INFO L371 AbstractCegarLoop]: === Iteration 5 === [test_funErr27RequiresViolation, test_funErr17RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr9RequiresViolation, test_funErr14RequiresViolation, test_funErr22RequiresViolation, test_funErr2RequiresViolation, test_funErr19RequiresViolation, test_funErr6RequiresViolation, test_funErr20RequiresViolation, test_funErr29RequiresViolation, test_funErr16RequiresViolation, test_funErr3RequiresViolation, test_funErr26RequiresViolation, test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr23RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr11RequiresViolation, test_funErr24RequiresViolation, test_funErr15RequiresViolation, test_funErr25RequiresViolation, test_funErr28RequiresViolation, test_funErr1RequiresViolation, test_funErr18RequiresViolation, test_funErr21RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:10:30,333 INFO L82 PathProgramCache]: Analyzing trace with hash 532913876, now seen corresponding path program 1 times [2018-02-02 10:10:30,334 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:30,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:30,472 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 10:10:30,473 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:10:30,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:10:30,473 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:30,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:30,473 INFO L182 omatonBuilderFactory]: Interpolants [672#(and (= 4 (select |#length| |test_fun_#t~malloc1.base|)) (= (select |#valid| |test_fun_#t~malloc1.base|) 1) (= 0 |test_fun_#t~malloc1.offset|)), 673#(and (= (select |#valid| test_fun_~y_ref~0.base) 1) (= 4 (select |#length| test_fun_~y_ref~0.base)) (= test_fun_~y_ref~0.offset 0)), 674#(and (= 0 |test_fun_#t~malloc2.offset|) (= 4 (select |#length| test_fun_~y_ref~0.base)) (= test_fun_~y_ref~0.offset 0) (= (select |#length| |test_fun_#t~malloc2.base|) (select |#length| test_fun_~y_ref~0.base))), 675#(and (= 4 (select |#length| test_fun_~y_ref~0.base)) (= (select |#length| test_fun_~z_ref~0.base) (select |#length| test_fun_~y_ref~0.base)) (= test_fun_~y_ref~0.offset 0) (= test_fun_~z_ref~0.offset 0)), 676#(and (= test_fun_~y_ref~0.offset 0) (= (select |#length| test_fun_~y_ref~0.base) (select |#length| test_fun_~z_ref~0.base)) (= test_fun_~z_ref~0.offset 0)), 677#(and (<= 4 (select |#length| test_fun_~z_ref~0.base)) (= test_fun_~z_ref~0.offset 0)), 670#true, 671#false] [2018-02-02 10:10:30,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:10:30,474 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:10:30,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:10:30,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:10:30,474 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 8 states. [2018-02-02 10:10:30,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:30,602 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-02-02 10:10:30,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:10:30,603 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-02-02 10:10:30,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:30,603 INFO L225 Difference]: With dead ends: 59 [2018-02-02 10:10:30,603 INFO L226 Difference]: Without dead ends: 59 [2018-02-02 10:10:30,603 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:10:30,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-02 10:10:30,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-02-02 10:10:30,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-02 10:10:30,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-02-02 10:10:30,606 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 19 [2018-02-02 10:10:30,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:30,606 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-02-02 10:10:30,606 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:10:30,606 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-02-02 10:10:30,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:10:30,607 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:30,607 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:30,607 INFO L371 AbstractCegarLoop]: === Iteration 6 === [test_funErr27RequiresViolation, test_funErr17RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr9RequiresViolation, test_funErr14RequiresViolation, test_funErr22RequiresViolation, test_funErr2RequiresViolation, test_funErr19RequiresViolation, test_funErr6RequiresViolation, test_funErr20RequiresViolation, test_funErr29RequiresViolation, test_funErr16RequiresViolation, test_funErr3RequiresViolation, test_funErr26RequiresViolation, test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr23RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr11RequiresViolation, test_funErr24RequiresViolation, test_funErr15RequiresViolation, test_funErr25RequiresViolation, test_funErr28RequiresViolation, test_funErr1RequiresViolation, test_funErr18RequiresViolation, test_funErr21RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:10:30,607 INFO L82 PathProgramCache]: Analyzing trace with hash -659539069, now seen corresponding path program 1 times [2018-02-02 10:10:30,608 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:30,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:30,644 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 10:10:30,645 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:10:30,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:10:30,645 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:30,645 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 10:10:30,646 INFO L182 omatonBuilderFactory]: Interpolants [804#true, 805#false, 806#(= 1 (select |#valid| |test_fun_#t~malloc3.base|)), 807#(= 1 (select |#valid| test_fun_~c~0.base))] [2018-02-02 10:10:30,646 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 10:10:30,646 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:10:30,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:10:30,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:10:30,646 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 4 states. [2018-02-02 10:10:30,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:30,683 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-02-02 10:10:30,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:10:30,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-02-02 10:10:30,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:30,684 INFO L225 Difference]: With dead ends: 55 [2018-02-02 10:10:30,684 INFO L226 Difference]: Without dead ends: 55 [2018-02-02 10:10:30,684 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:10:30,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-02 10:10:30,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-02-02 10:10:30,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-02 10:10:30,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-02-02 10:10:30,687 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 20 [2018-02-02 10:10:30,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:30,687 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-02-02 10:10:30,688 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:10:30,688 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-02-02 10:10:30,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:10:30,688 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:30,688 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:30,688 INFO L371 AbstractCegarLoop]: === Iteration 7 === [test_funErr27RequiresViolation, test_funErr17RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr9RequiresViolation, test_funErr14RequiresViolation, test_funErr22RequiresViolation, test_funErr2RequiresViolation, test_funErr19RequiresViolation, test_funErr6RequiresViolation, test_funErr20RequiresViolation, test_funErr29RequiresViolation, test_funErr16RequiresViolation, test_funErr3RequiresViolation, test_funErr26RequiresViolation, test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr23RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr11RequiresViolation, test_funErr24RequiresViolation, test_funErr15RequiresViolation, test_funErr25RequiresViolation, test_funErr28RequiresViolation, test_funErr1RequiresViolation, test_funErr18RequiresViolation, test_funErr21RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:10:30,689 INFO L82 PathProgramCache]: Analyzing trace with hash -659539068, now seen corresponding path program 1 times [2018-02-02 10:10:30,689 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:30,699 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:30,822 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 10:10:30,822 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:10:30,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:10:30,822 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:30,822 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 10:10:30,822 INFO L182 omatonBuilderFactory]: Interpolants [920#true, 921#false, 922#(and (= 0 |test_fun_#t~malloc3.offset|) (= 4 (select |#length| |test_fun_#t~malloc3.base|))), 923#(and (= (select |#length| test_fun_~c~0.base) 4) (= test_fun_~c~0.offset 0))] [2018-02-02 10:10:30,822 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 10:10:30,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:10:30,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:10:30,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:10:30,823 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 4 states. [2018-02-02 10:10:30,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:30,850 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-02-02 10:10:30,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:10:30,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-02-02 10:10:30,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:30,851 INFO L225 Difference]: With dead ends: 51 [2018-02-02 10:10:30,851 INFO L226 Difference]: Without dead ends: 51 [2018-02-02 10:10:30,851 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:10:30,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-02 10:10:30,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-02 10:10:30,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-02 10:10:30,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-02-02 10:10:30,854 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 20 [2018-02-02 10:10:30,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:30,854 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-02-02 10:10:30,854 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:10:30,854 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-02-02 10:10:30,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:10:30,855 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:10:30,855 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:10:30,856 INFO L371 AbstractCegarLoop]: === Iteration 8 === [test_funErr27RequiresViolation, test_funErr17RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr9RequiresViolation, test_funErr14RequiresViolation, test_funErr22RequiresViolation, test_funErr2RequiresViolation, test_funErr19RequiresViolation, test_funErr6RequiresViolation, test_funErr20RequiresViolation, test_funErr29RequiresViolation, test_funErr16RequiresViolation, test_funErr3RequiresViolation, test_funErr26RequiresViolation, test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr23RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr11RequiresViolation, test_funErr24RequiresViolation, test_funErr15RequiresViolation, test_funErr25RequiresViolation, test_funErr28RequiresViolation, test_funErr1RequiresViolation, test_funErr18RequiresViolation, test_funErr21RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:10:30,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1501734176, now seen corresponding path program 1 times [2018-02-02 10:10:30,856 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:10:30,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:10:30,872 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:10:31,289 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 10:10:31,289 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:10:31,289 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:10:31,290 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:10:31,290 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 10:10:31,290 INFO L182 omatonBuilderFactory]: Interpolants [1028#true, 1029#false, 1030#(= |#valid| |old(#valid)|), 1031#(and (= (select |#valid| |test_fun_#t~malloc0.base|) 1) (= |#valid| (store |old(#valid)| |test_fun_#t~malloc0.base| (select |#valid| |test_fun_#t~malloc0.base|))) (= (select |old(#valid)| |test_fun_#t~malloc0.base|) 0)), 1032#(and (= (select |old(#valid)| |test_fun_#t~malloc1.base|) 0) (= |#valid| (store (store |old(#valid)| |test_fun_#t~malloc1.base| (select |#valid| |test_fun_#t~malloc1.base|)) |test_fun_#t~malloc0.base| (select |#valid| |test_fun_#t~malloc0.base|))) (= (select |#valid| |test_fun_#t~malloc1.base|) 1) (not (= |test_fun_#t~malloc0.base| |test_fun_#t~malloc1.base|)) (= (select |#valid| |test_fun_#t~malloc0.base|) 1) (= (select |old(#valid)| |test_fun_#t~malloc0.base|) 0)), 1033#(and (= (select |old(#valid)| |test_fun_#t~malloc1.base|) 0) (= (select |#valid| |test_fun_#t~malloc2.base|) 1) (not (= |test_fun_#t~malloc1.base| |test_fun_#t~malloc2.base|)) (= (select |old(#valid)| |test_fun_#t~malloc2.base|) 0) (= (select |#valid| |test_fun_#t~malloc1.base|) 1) (not (= |test_fun_#t~malloc0.base| |test_fun_#t~malloc1.base|)) (not (= |test_fun_#t~malloc0.base| |test_fun_#t~malloc2.base|)) (= |#valid| (store (store (store |old(#valid)| |test_fun_#t~malloc0.base| (select |#valid| |test_fun_#t~malloc0.base|)) |test_fun_#t~malloc1.base| (select |#valid| |test_fun_#t~malloc1.base|)) |test_fun_#t~malloc2.base| (select |#valid| |test_fun_#t~malloc2.base|))) (= (select |#valid| |test_fun_#t~malloc0.base|) 1) (= (select |old(#valid)| |test_fun_#t~malloc0.base|) 0)), 1034#(and (= (select |old(#valid)| |test_fun_#t~malloc1.base|) 0) (not (= |test_fun_#t~malloc1.base| |test_fun_#t~malloc2.base|)) (not (= |test_fun_#t~malloc1.base| |test_fun_#t~malloc3.base|)) (= (select |old(#valid)| |test_fun_#t~malloc2.base|) 0) (not (= |test_fun_#t~malloc0.base| |test_fun_#t~malloc1.base|)) (= (select |old(#valid)| |test_fun_#t~malloc0.base|) (select (store |#valid| |test_fun_#t~malloc0.base| 0) |test_fun_#t~malloc0.base|)) (= (store |#valid| |test_fun_#t~malloc0.base| 0) (store (store (store (store |old(#valid)| |test_fun_#t~malloc0.base| (select (store |#valid| |test_fun_#t~malloc0.base| 0) |test_fun_#t~malloc0.base|)) |test_fun_#t~malloc1.base| (select (store |#valid| |test_fun_#t~malloc0.base| 0) |test_fun_#t~malloc1.base|)) |test_fun_#t~malloc3.base| (select (store |#valid| |test_fun_#t~malloc0.base| 0) |test_fun_#t~malloc3.base|)) |test_fun_#t~malloc2.base| (select (store |#valid| |test_fun_#t~malloc0.base| 0) |test_fun_#t~malloc2.base|))) (not (= |test_fun_#t~malloc0.base| |test_fun_#t~malloc2.base|)) (= (select |old(#valid)| |test_fun_#t~malloc3.base|) 0) (not (= |test_fun_#t~malloc0.base| |test_fun_#t~malloc3.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|))), 1035#(and (= (select |old(#valid)| |test_fun_#t~malloc1.base|) (select (store |#valid| |test_fun_#t~malloc1.base| 0) |test_fun_#t~malloc1.base|)) (not (= |test_fun_#t~malloc1.base| |test_fun_#t~malloc2.base|)) (not (= |test_fun_#t~malloc1.base| |test_fun_#t~malloc3.base|)) (= (select |old(#valid)| |test_fun_#t~malloc2.base|) 0) (= (select |old(#valid)| |test_fun_#t~malloc3.base|) 0) (= (store (store (store |old(#valid)| |test_fun_#t~malloc1.base| (select (store |#valid| |test_fun_#t~malloc1.base| 0) |test_fun_#t~malloc1.base|)) |test_fun_#t~malloc3.base| (select (store |#valid| |test_fun_#t~malloc1.base| 0) |test_fun_#t~malloc3.base|)) |test_fun_#t~malloc2.base| (select (store |#valid| |test_fun_#t~malloc1.base| 0) |test_fun_#t~malloc2.base|)) (store |#valid| |test_fun_#t~malloc1.base| 0)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|))), 1036#(and (= (store |#valid| |test_fun_#t~malloc2.base| 0) (store (store |old(#valid)| |test_fun_#t~malloc3.base| (select (store |#valid| |test_fun_#t~malloc2.base| 0) |test_fun_#t~malloc3.base|)) |test_fun_#t~malloc2.base| (select (store |#valid| |test_fun_#t~malloc2.base| 0) |test_fun_#t~malloc2.base|))) (= (select |old(#valid)| |test_fun_#t~malloc3.base|) 0) (= (select |old(#valid)| |test_fun_#t~malloc2.base|) (select (store |#valid| |test_fun_#t~malloc2.base| 0) |test_fun_#t~malloc2.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|))), 1037#(and (= (select |old(#valid)| |test_fun_#t~malloc3.base|) (select (store |#valid| |test_fun_#t~malloc3.base| 0) |test_fun_#t~malloc3.base|)) (= (store |#valid| |test_fun_#t~malloc3.base| 0) (store |old(#valid)| |test_fun_#t~malloc3.base| (select (store |#valid| |test_fun_#t~malloc3.base| 0) |test_fun_#t~malloc3.base|))))] [2018-02-02 10:10:31,290 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 10:10:31,290 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:10:31,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:10:31,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:10:31,291 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 10 states. [2018-02-02 10:10:31,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:10:31,571 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2018-02-02 10:10:31,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:10:31,572 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-02-02 10:10:31,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:10:31,572 INFO L225 Difference]: With dead ends: 50 [2018-02-02 10:10:31,572 INFO L226 Difference]: Without dead ends: 0 [2018-02-02 10:10:31,573 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:10:31,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-02 10:10:31,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-02 10:10:31,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-02 10:10:31,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-02 10:10:31,573 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2018-02-02 10:10:31,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:10:31,574 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-02 10:10:31,574 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:10:31,574 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-02 10:10:31,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-02 10:10:31,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:10:31 BoogieIcfgContainer [2018-02-02 10:10:31,579 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:10:31,580 INFO L168 Benchmark]: Toolchain (without parser) took 2588.72 ms. Allocated memory was 407.9 MB in the beginning and 659.6 MB in the end (delta: 251.7 MB). Free memory was 366.1 MB in the beginning and 552.6 MB in the end (delta: -186.5 MB). Peak memory consumption was 65.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:10:31,581 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 407.9 MB. Free memory is still 371.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:10:31,582 INFO L168 Benchmark]: CACSL2BoogieTranslator took 149.33 ms. Allocated memory is still 407.9 MB. Free memory was 364.8 MB in the beginning and 354.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:10:31,582 INFO L168 Benchmark]: Boogie Preprocessor took 26.62 ms. Allocated memory is still 407.9 MB. Free memory was 354.2 MB in the beginning and 352.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:10:31,582 INFO L168 Benchmark]: RCFGBuilder took 235.74 ms. Allocated memory is still 407.9 MB. Free memory was 352.9 MB in the beginning and 329.6 MB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:10:31,582 INFO L168 Benchmark]: TraceAbstraction took 2173.82 ms. Allocated memory was 407.9 MB in the beginning and 659.6 MB in the end (delta: 251.7 MB). Free memory was 328.3 MB in the beginning and 552.6 MB in the end (delta: -224.3 MB). Peak memory consumption was 27.4 MB. Max. memory is 5.3 GB. [2018-02-02 10:10:31,584 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.21 ms. Allocated memory is still 407.9 MB. Free memory is still 371.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 149.33 ms. Allocated memory is still 407.9 MB. Free memory was 364.8 MB in the beginning and 354.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.62 ms. Allocated memory is still 407.9 MB. Free memory was 354.2 MB in the beginning and 352.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 235.74 ms. Allocated memory is still 407.9 MB. Free memory was 352.9 MB in the beginning and 329.6 MB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2173.82 ms. Allocated memory was 407.9 MB in the beginning and 659.6 MB in the end (delta: 251.7 MB). Free memory was 328.3 MB in the beginning and 552.6 MB in the end (delta: -224.3 MB). Peak memory consumption was 27.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 31 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 84 locations, 31 error locations. SAFE Result, 2.1s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 271 SDtfs, 648 SDslu, 388 SDs, 0 SdLazy, 610 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 13 SyntacticMatches, 8 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 160 ConstructedInterpolants, 0 QuantifiedInterpolants, 67094 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/c.03-alloca_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-10-31-591.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/c.03-alloca_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-10-31-591.csv Received shutdown request...