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/array-memsafety/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 09:50:23,668 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 09:50:23,669 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 09:50:23,679 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 09:50:23,679 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 09:50:23,680 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 09:50:23,681 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 09:50:23,682 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 09:50:23,684 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 09:50:23,685 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 09:50:23,685 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 09:50:23,686 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 09:50:23,687 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 09:50:23,688 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 09:50:23,688 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 09:50:23,690 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 09:50:23,692 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 09:50:23,693 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 09:50:23,694 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 09:50:23,695 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 09:50:23,697 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 09:50:23,697 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 09:50:23,697 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 09:50:23,698 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 09:50:23,699 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 09:50:23,700 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 09:50:23,700 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 09:50:23,701 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 09:50:23,701 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 09:50:23,701 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 09:50:23,702 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 09:50:23,702 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 09:50:23,711 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 09:50:23,711 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 09:50:23,712 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 09:50:23,712 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 09:50:23,713 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 09:50:23,713 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 09:50:23,713 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 09:50:23,713 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 09:50:23,713 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 09:50:23,713 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 09:50:23,713 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 09:50:23,714 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 09:50:23,714 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 09:50:23,714 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 09:50:23,714 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 09:50:23,714 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 09:50:23,714 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 09:50:23,714 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 09:50:23,715 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 09:50:23,715 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 09:50:23,715 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:50:23,715 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 09:50:23,715 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 09:50:23,746 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 09:50:23,754 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 09:50:23,756 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 09:50:23,757 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 09:50:23,758 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 09:50:23,758 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i [2018-02-02 09:50:23,889 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 09:50:23,891 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 09:50:23,892 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 09:50:23,892 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 09:50:23,898 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 09:50:23,899 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:50:23" (1/1) ... [2018-02-02 09:50:23,902 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67bada75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:23, skipping insertion in model container [2018-02-02 09:50:23,902 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:50:23" (1/1) ... [2018-02-02 09:50:23,917 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:50:23,947 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:50:24,034 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:50:24,045 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:50:24,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:24 WrapperNode [2018-02-02 09:50:24,050 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 09:50:24,051 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 09:50:24,051 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 09:50:24,051 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 09:50:24,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:24" (1/1) ... [2018-02-02 09:50:24,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:24" (1/1) ... [2018-02-02 09:50:24,072 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:24" (1/1) ... [2018-02-02 09:50:24,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:24" (1/1) ... [2018-02-02 09:50:24,075 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:24" (1/1) ... [2018-02-02 09:50:24,077 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:24" (1/1) ... [2018-02-02 09:50:24,078 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:24" (1/1) ... [2018-02-02 09:50:24,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 09:50:24,079 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 09:50:24,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 09:50:24,080 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 09:50:24,080 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:24" (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 09:50:24,117 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 09:50:24,117 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 09:50:24,117 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrnlen [2018-02-02 09:50:24,117 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 09:50:24,117 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 09:50:24,117 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 09:50:24,117 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 09:50:24,117 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 09:50:24,117 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 09:50:24,117 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 09:50:24,117 INFO L128 BoogieDeclarations]: Found specification of procedure cstrnlen [2018-02-02 09:50:24,118 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 09:50:24,118 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 09:50:24,118 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 09:50:24,225 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 09:50:24,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:50:24 BoogieIcfgContainer [2018-02-02 09:50:24,226 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 09:50:24,226 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 09:50:24,226 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 09:50:24,228 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 09:50:24,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:50:23" (1/3) ... [2018-02-02 09:50:24,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@92c6fe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:50:24, skipping insertion in model container [2018-02-02 09:50:24,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:24" (2/3) ... [2018-02-02 09:50:24,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@92c6fe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:50:24, skipping insertion in model container [2018-02-02 09:50:24,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:50:24" (3/3) ... [2018-02-02 09:50:24,230 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i [2018-02-02 09:50:24,236 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 09:50:24,240 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-02-02 09:50:24,269 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 09:50:24,269 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 09:50:24,269 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 09:50:24,269 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 09:50:24,269 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 09:50:24,270 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 09:50:24,270 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 09:50:24,270 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 09:50:24,271 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 09:50:24,282 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-02-02 09:50:24,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-02 09:50:24,291 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:24,291 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:24,292 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:50:24,294 INFO L82 PathProgramCache]: Analyzing trace with hash -2082130590, now seen corresponding path program 1 times [2018-02-02 09:50:24,331 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:24,368 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:24,431 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 09:50:24,433 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:24,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:50:24,434 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:24,434 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 09:50:24,434 INFO L182 omatonBuilderFactory]: Interpolants [37#true, 38#false, 39#(= 1 (select |#valid| |main_#t~malloc6.base|)), 40#(= 1 (select |#valid| main_~nondetString1~0.base))] [2018-02-02 09:50:24,435 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 09:50:24,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:50:24,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:50:24,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:50:24,445 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 4 states. [2018-02-02 09:50:24,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:24,498 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-02-02 09:50:24,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:50:24,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-02-02 09:50:24,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:24,506 INFO L225 Difference]: With dead ends: 33 [2018-02-02 09:50:24,506 INFO L226 Difference]: Without dead ends: 30 [2018-02-02 09:50:24,507 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 09:50:24,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-02 09:50:24,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-02-02 09:50:24,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-02-02 09:50:24,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-02-02 09:50:24,577 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2018-02-02 09:50:24,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:24,578 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-02-02 09:50:24,578 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:50:24,578 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-02-02 09:50:24,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-02 09:50:24,578 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:24,578 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:24,578 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:50:24,578 INFO L82 PathProgramCache]: Analyzing trace with hash -2082130589, now seen corresponding path program 1 times [2018-02-02 09:50:24,579 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:24,592 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:24,672 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 09:50:24,673 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:24,673 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:50:24,673 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:24,673 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 09:50:24,674 INFO L182 omatonBuilderFactory]: Interpolants [106#true, 107#false, 108#(<= 1 main_~length1~0), 109#(and (= 0 |main_#t~malloc6.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc6.base|)) (<= 1 main_~length1~0)), 110#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0))] [2018-02-02 09:50:24,674 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 09:50:24,675 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:50:24,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:50:24,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:50:24,676 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 5 states. [2018-02-02 09:50:24,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:24,720 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-02-02 09:50:24,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:50:24,721 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-02-02 09:50:24,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:24,722 INFO L225 Difference]: With dead ends: 29 [2018-02-02 09:50:24,722 INFO L226 Difference]: Without dead ends: 29 [2018-02-02 09:50:24,723 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:50:24,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-02-02 09:50:24,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-02-02 09:50:24,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-02-02 09:50:24,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-02-02 09:50:24,726 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 11 [2018-02-02 09:50:24,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:24,726 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-02-02 09:50:24,726 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:50:24,726 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-02-02 09:50:24,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 09:50:24,727 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:24,727 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:24,727 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:50:24,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1021870561, now seen corresponding path program 1 times [2018-02-02 09:50:24,728 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:24,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:24,775 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 09:50:24,776 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:24,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:50:24,776 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:24,776 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 09:50:24,777 INFO L182 omatonBuilderFactory]: Interpolants [171#true, 172#false, 173#(= 1 (select |#valid| main_~nondetString1~0.base)), 174#(= 1 (select |#valid| |cstrnlen_#in~str.base|)), 175#(= 1 (select |#valid| cstrnlen_~cp~0.base))] [2018-02-02 09:50:24,777 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 09:50:24,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:50:24,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:50:24,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:50:24,778 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 5 states. [2018-02-02 09:50:24,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:24,819 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-02-02 09:50:24,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:50:24,820 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-02 09:50:24,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:24,820 INFO L225 Difference]: With dead ends: 28 [2018-02-02 09:50:24,821 INFO L226 Difference]: Without dead ends: 28 [2018-02-02 09:50:24,821 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:50:24,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-02-02 09:50:24,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-02-02 09:50:24,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-02-02 09:50:24,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-02-02 09:50:24,824 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 16 [2018-02-02 09:50:24,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:24,824 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-02-02 09:50:24,825 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:50:24,825 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-02-02 09:50:24,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 09:50:24,825 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:24,825 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:24,825 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:50:24,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1021870562, now seen corresponding path program 1 times [2018-02-02 09:50:24,827 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:24,839 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:24,931 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 09:50:24,931 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:24,932 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:50:24,932 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:24,932 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 09:50:24,932 INFO L182 omatonBuilderFactory]: Interpolants [240#(and (= 0 |cstrnlen_#in~str.offset|) (<= 1 (select |#length| |cstrnlen_#in~str.base|))), 241#(and (<= 1 (select |#length| cstrnlen_~cp~0.base)) (= cstrnlen_~cp~0.offset 0)), 234#true, 235#false, 236#(<= 1 main_~length1~0), 237#(and (= 0 |main_#t~malloc6.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc6.base|)) (<= 1 main_~length1~0)), 238#(and (= 0 main_~nondetString1~0.offset) (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (<= 1 main_~length1~0)), 239#(and (= 0 main_~nondetString1~0.offset) (<= 1 (select |#length| main_~nondetString1~0.base)))] [2018-02-02 09:50:24,932 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 09:50:24,932 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:50:24,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:50:24,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:50:24,933 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 8 states. [2018-02-02 09:50:25,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:25,000 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-02-02 09:50:25,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:50:25,001 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-02-02 09:50:25,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:25,004 INFO L225 Difference]: With dead ends: 37 [2018-02-02 09:50:25,004 INFO L226 Difference]: Without dead ends: 37 [2018-02-02 09:50:25,005 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:50:25,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-02-02 09:50:25,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2018-02-02 09:50:25,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-02 09:50:25,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-02-02 09:50:25,008 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 16 [2018-02-02 09:50:25,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:25,009 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-02-02 09:50:25,009 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:50:25,009 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-02-02 09:50:25,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 09:50:25,010 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:25,010 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:25,010 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:50:25,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1174981545, now seen corresponding path program 1 times [2018-02-02 09:50:25,011 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:25,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:25,022 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:25,040 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 09:50:25,041 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:25,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:50:25,041 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:25,041 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 09:50:25,041 INFO L182 omatonBuilderFactory]: Interpolants [314#true, 315#false, 316#(not |cstrnlen_#t~short3|)] [2018-02-02 09:50:25,042 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 09:50:25,042 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 09:50:25,042 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 09:50:25,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:50:25,042 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 3 states. [2018-02-02 09:50:25,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:25,049 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-02-02 09:50:25,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 09:50:25,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-02-02 09:50:25,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:25,050 INFO L225 Difference]: With dead ends: 32 [2018-02-02 09:50:25,050 INFO L226 Difference]: Without dead ends: 32 [2018-02-02 09:50:25,050 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:50:25,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-02-02 09:50:25,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-02-02 09:50:25,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-02-02 09:50:25,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-02-02 09:50:25,053 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 20 [2018-02-02 09:50:25,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:25,054 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-02-02 09:50:25,054 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 09:50:25,054 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-02-02 09:50:25,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 09:50:25,055 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:25,055 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] [2018-02-02 09:50:25,055 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:50:25,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1402540986, now seen corresponding path program 1 times [2018-02-02 09:50:25,056 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:25,075 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:25,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:25,141 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:25,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 09:50:25,141 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:25,142 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 09:50:25,142 INFO L182 omatonBuilderFactory]: Interpolants [384#(and (<= 1 |cstrnlen_#in~maxlen|) (<= |cstrnlen_#in~maxlen| 1)), 385#(and (<= 1 cstrnlen_~maxlen) (<= cstrnlen_~maxlen 1)), 386#(and (<= cstrnlen_~maxlen (* 4294967296 (div cstrnlen_~maxlen 4294967296))) (< 0 (+ (div cstrnlen_~maxlen 4294967296) 1))), 387#(not |cstrnlen_#t~short3|), 381#true, 382#false, 383#(and (<= 1 main_~n~0) (<= main_~n~0 1))] [2018-02-02 09:50:25,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:25,142 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:50:25,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:50:25,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:50:25,143 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 7 states. [2018-02-02 09:50:25,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:25,212 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-02-02 09:50:25,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 09:50:25,212 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-02-02 09:50:25,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:25,213 INFO L225 Difference]: With dead ends: 58 [2018-02-02 09:50:25,213 INFO L226 Difference]: Without dead ends: 58 [2018-02-02 09:50:25,213 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:50:25,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-02 09:50:25,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2018-02-02 09:50:25,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-02 09:50:25,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-02-02 09:50:25,217 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 22 [2018-02-02 09:50:25,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:25,218 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-02-02 09:50:25,218 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:50:25,218 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-02-02 09:50:25,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 09:50:25,219 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:25,219 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] [2018-02-02 09:50:25,219 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:50:25,219 INFO L82 PathProgramCache]: Analyzing trace with hash 122677308, now seen corresponding path program 1 times [2018-02-02 09:50:25,220 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:25,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:25,338 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 09:50:25,338 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:25,338 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 09:50:25,338 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:25,339 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 09:50:25,339 INFO L182 omatonBuilderFactory]: Interpolants [512#(not |cstrnlen_#t~short3|), 503#true, 504#false, 505#(and (<= 1 main_~length1~0) (<= main_~length1~0 1)), 506#(and (= 0 |main_#t~malloc6.offset|) (<= 1 main_~length1~0) (<= main_~length1~0 1)), 507#(and (<= 1 main_~length1~0) (<= main_~length1~0 1) (= main_~nondetString1~0.offset 0)), 508#(and (= 0 (select (select |#memory_int| main_~nondetString1~0.base) main_~nondetString1~0.offset)) (= main_~nondetString1~0.offset 0)), 509#(= 0 (select (select |#memory_int| |cstrnlen_#in~str.base|) |cstrnlen_#in~str.offset|)), 510#(= 0 (select (select |#memory_int| cstrnlen_~cp~0.base) cstrnlen_~cp~0.offset)), 511#(= 0 |cstrnlen_#t~mem2|)] [2018-02-02 09:50:25,339 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 09:50:25,339 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:50:25,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:50:25,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:50:25,340 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 10 states. [2018-02-02 09:50:25,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:25,439 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2018-02-02 09:50:25,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 09:50:25,439 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-02-02 09:50:25,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:25,440 INFO L225 Difference]: With dead ends: 83 [2018-02-02 09:50:25,440 INFO L226 Difference]: Without dead ends: 83 [2018-02-02 09:50:25,440 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-02-02 09:50:25,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-02 09:50:25,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 63. [2018-02-02 09:50:25,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-02 09:50:25,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2018-02-02 09:50:25,445 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 22 [2018-02-02 09:50:25,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:25,446 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2018-02-02 09:50:25,446 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:50:25,446 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2018-02-02 09:50:25,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 09:50:25,446 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:25,446 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] [2018-02-02 09:50:25,446 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:50:25,447 INFO L82 PathProgramCache]: Analyzing trace with hash -898391046, now seen corresponding path program 1 times [2018-02-02 09:50:25,448 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:25,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:25,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:25,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:25,611 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:25,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 09:50:25,612 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:25,612 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 09:50:25,612 INFO L182 omatonBuilderFactory]: Interpolants [673#true, 674#false, 675#(<= 1 main_~length1~0), 676#(and (= 0 |main_#t~malloc6.offset|) (<= 1 main_~length1~0)), 677#(and (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 678#(and (= 0 main_~nondetString1~0.offset) (or (= 0 (select (select |#memory_int| main_~nondetString1~0.base) main_~nondetString1~0.offset)) (<= 2 (select |#length| main_~nondetString1~0.base)))), 679#(and (= 0 |cstrnlen_#in~str.offset|) (or (= 0 (select (select |#memory_int| |cstrnlen_#in~str.base|) |cstrnlen_#in~str.offset|)) (<= 2 (select |#length| |cstrnlen_#in~str.base|)))), 680#(and (= cstrnlen_~cp~0.offset 0) (or (= 0 (select (select |#memory_int| cstrnlen_~cp~0.base) cstrnlen_~cp~0.offset)) (<= 2 (select |#length| cstrnlen_~cp~0.base)))), 681#(and (= cstrnlen_~cp~0.offset 0) (or (<= 2 (select |#length| cstrnlen_~cp~0.base)) (= 0 |cstrnlen_#t~mem2|))), 682#(and (= cstrnlen_~cp~0.offset 0) (or (not |cstrnlen_#t~short3|) (<= 2 (select |#length| cstrnlen_~cp~0.base)))), 683#(and (= cstrnlen_~cp~0.offset 0) (<= 2 (select |#length| cstrnlen_~cp~0.base))), 684#(and (<= 1 cstrnlen_~cp~0.offset) (<= (+ cstrnlen_~cp~0.offset 1) (select |#length| cstrnlen_~cp~0.base)))] [2018-02-02 09:50:25,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:25,613 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 09:50:25,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 09:50:25,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:50:25,613 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 12 states. [2018-02-02 09:50:25,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:25,838 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2018-02-02 09:50:25,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 09:50:25,838 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-02-02 09:50:25,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:25,839 INFO L225 Difference]: With dead ends: 85 [2018-02-02 09:50:25,839 INFO L226 Difference]: Without dead ends: 85 [2018-02-02 09:50:25,840 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2018-02-02 09:50:25,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-02 09:50:25,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 69. [2018-02-02 09:50:25,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-02 09:50:25,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2018-02-02 09:50:25,844 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 22 [2018-02-02 09:50:25,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:25,845 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2018-02-02 09:50:25,845 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 09:50:25,845 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2018-02-02 09:50:25,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 09:50:25,846 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:25,846 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] [2018-02-02 09:50:25,846 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:50:25,846 INFO L82 PathProgramCache]: Analyzing trace with hash 851727292, now seen corresponding path program 1 times [2018-02-02 09:50:25,847 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:25,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:25,854 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:25,898 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 09:50:25,898 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:25,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:50:25,899 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:25,899 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 09:50:25,899 INFO L182 omatonBuilderFactory]: Interpolants [857#true, 858#false, 859#(and (<= 1 main_~n~0) (<= main_~n~0 1)), 860#(and (or (<= (div cstrnlen_~maxlen 4294967296) 0) (<= cstrnlen_~maxlen |cstrnlen_#in~maxlen|)) (or (<= |cstrnlen_#in~maxlen| cstrnlen_~maxlen) (< 0 (div cstrnlen_~maxlen 4294967296)))), 861#(or (<= 4294967296 |cstrnlen_#in~maxlen|) |cstrnlen_#t~short3| (<= |cstrnlen_#in~maxlen| 0)), 862#(or (<= 4294967296 |cstrnlen_#in~maxlen|) (<= |cstrnlen_#in~maxlen| 0))] [2018-02-02 09:50:25,899 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 09:50:25,899 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:50:25,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:50:25,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:50:25,900 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand 6 states. [2018-02-02 09:50:25,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:25,947 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2018-02-02 09:50:25,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:50:25,947 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-02 09:50:25,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:25,948 INFO L225 Difference]: With dead ends: 96 [2018-02-02 09:50:25,948 INFO L226 Difference]: Without dead ends: 92 [2018-02-02 09:50:25,948 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:50:25,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-02 09:50:25,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2018-02-02 09:50:25,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 09:50:25,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2018-02-02 09:50:25,956 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 23 [2018-02-02 09:50:25,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:25,957 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2018-02-02 09:50:25,957 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:50:25,957 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2018-02-02 09:50:25,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 09:50:25,958 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:25,958 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] [2018-02-02 09:50:25,959 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:50:25,959 INFO L82 PathProgramCache]: Analyzing trace with hash -169341062, now seen corresponding path program 1 times [2018-02-02 09:50:25,959 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:25,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:25,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:25,997 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 09:50:25,997 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:25,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:50:25,998 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:25,998 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 09:50:25,998 INFO L182 omatonBuilderFactory]: Interpolants [1040#true, 1041#false, 1042#(= |#valid| |old(#valid)|), 1043#(= (store |#valid| |main_#t~malloc6.base| (select (store |#valid| |main_#t~malloc6.base| 0) |main_#t~malloc6.base|)) |old(#valid)|)] [2018-02-02 09:50:25,998 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 09:50:25,998 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:50:25,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:50:25,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:50:25,999 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 4 states. [2018-02-02 09:50:26,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:26,020 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2018-02-02 09:50:26,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:50:26,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-02-02 09:50:26,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:26,020 INFO L225 Difference]: With dead ends: 76 [2018-02-02 09:50:26,020 INFO L226 Difference]: Without dead ends: 29 [2018-02-02 09:50:26,020 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 09:50:26,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-02-02 09:50:26,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-02-02 09:50:26,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-02-02 09:50:26,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-02-02 09:50:26,022 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 23 [2018-02-02 09:50:26,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:26,022 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-02-02 09:50:26,022 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:50:26,022 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-02-02 09:50:26,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 09:50:26,023 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:26,023 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:26,023 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:50:26,023 INFO L82 PathProgramCache]: Analyzing trace with hash -698858542, now seen corresponding path program 2 times [2018-02-02 09:50:26,023 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:26,034 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:26,274 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:26,274 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:26,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 09:50:26,274 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:26,274 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 09:50:26,274 INFO L182 omatonBuilderFactory]: Interpolants [1152#false, 1153#(and (= 0 |main_#t~malloc6.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc6.base|))), 1154#(and (= 0 main_~nondetString1~0.offset) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2))), 1155#(and (= 0 main_~nondetString1~0.offset) (or (= 0 (select (select |#memory_int| main_~nondetString1~0.base) 1)) (<= 3 (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base))) (<= (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base)) 1))), 1156#(and (= 0 |cstrnlen_#in~str.offset|) (or (<= 3 (select |#length| |cstrnlen_#in~str.base|)) (= 0 (select (select |#memory_int| |cstrnlen_#in~str.base|) 1)) (<= (select |#length| |cstrnlen_#in~str.base|) 1))), 1157#(and (= cstrnlen_~cp~0.offset 0) (or (<= (select |#length| cstrnlen_~cp~0.base) 1) (= 0 (select (select |#memory_int| cstrnlen_~cp~0.base) 1)) (<= 3 (select |#length| cstrnlen_~cp~0.base)))), 1158#(or (and (= 0 (select (select |#memory_int| cstrnlen_~cp~0.base) cstrnlen_~cp~0.offset)) (= 1 cstrnlen_~cp~0.offset)) (and (<= 1 cstrnlen_~cp~0.offset) (or (<= (select |#length| cstrnlen_~cp~0.base) cstrnlen_~cp~0.offset) (<= (+ cstrnlen_~cp~0.offset 2) (select |#length| cstrnlen_~cp~0.base))))), 1159#(or (and (= 1 cstrnlen_~cp~0.offset) (= 0 |cstrnlen_#t~mem2|)) (and (<= 1 cstrnlen_~cp~0.offset) (<= (+ cstrnlen_~cp~0.offset 2) (select |#length| cstrnlen_~cp~0.base)))), 1160#(or (and (<= 1 cstrnlen_~cp~0.offset) (<= (+ cstrnlen_~cp~0.offset 2) (select |#length| cstrnlen_~cp~0.base))) (and (not |cstrnlen_#t~short3|) (= 1 cstrnlen_~cp~0.offset))), 1161#(and (<= 1 cstrnlen_~cp~0.offset) (<= (+ cstrnlen_~cp~0.offset 2) (select |#length| cstrnlen_~cp~0.base))), 1162#(and (<= 2 cstrnlen_~cp~0.offset) (<= (+ cstrnlen_~cp~0.offset 1) (select |#length| cstrnlen_~cp~0.base))), 1151#true] [2018-02-02 09:50:26,274 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:26,275 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 09:50:26,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 09:50:26,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:50:26,275 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 12 states. [2018-02-02 09:50:26,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:26,518 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-02-02 09:50:26,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:50:26,522 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-02-02 09:50:26,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:26,523 INFO L225 Difference]: With dead ends: 38 [2018-02-02 09:50:26,523 INFO L226 Difference]: Without dead ends: 38 [2018-02-02 09:50:26,523 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-02-02 09:50:26,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-02 09:50:26,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2018-02-02 09:50:26,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-02 09:50:26,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-02-02 09:50:26,525 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 28 [2018-02-02 09:50:26,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:26,525 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-02-02 09:50:26,525 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 09:50:26,525 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-02-02 09:50:26,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 09:50:26,525 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:26,525 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:26,525 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:50:26,525 INFO L82 PathProgramCache]: Analyzing trace with hash 139174314, now seen corresponding path program 3 times [2018-02-02 09:50:26,526 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:26,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:26,690 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 09:50:26,691 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:26,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 09:50:26,691 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:26,691 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 09:50:26,691 INFO L182 omatonBuilderFactory]: Interpolants [1252#true, 1253#false, 1254#(and (= 0 |main_#t~malloc6.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc6.base|))), 1255#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 1256#(and (= 0 (select (select |#memory_int| main_~nondetString1~0.base) (+ (select |#length| main_~nondetString1~0.base) (+ main_~nondetString1~0.offset (- 1))))) (= main_~nondetString1~0.offset 0)), 1257#(= 0 (select (select |#memory_int| |cstrnlen_#in~str.base|) (+ (select |#length| |cstrnlen_#in~str.base|) (- 1)))), 1258#(= 0 (select (select |#memory_int| cstrnlen_~cp~0.base) (+ (select |#length| cstrnlen_~cp~0.base) (- 1)))), 1259#(or (= 0 (select (select |#memory_int| cstrnlen_~cp~0.base) cstrnlen_~cp~0.offset)) (<= (select |#length| cstrnlen_~cp~0.base) cstrnlen_~cp~0.offset) (<= (+ cstrnlen_~cp~0.offset 2) (select |#length| cstrnlen_~cp~0.base))), 1260#(or (and (<= 0 cstrnlen_~cp~0.offset) (<= (+ cstrnlen_~cp~0.offset 2) (select |#length| cstrnlen_~cp~0.base))) (= 0 |cstrnlen_#t~mem2|)), 1261#(or (and (<= 0 cstrnlen_~cp~0.offset) (<= (+ cstrnlen_~cp~0.offset 2) (select |#length| cstrnlen_~cp~0.base))) (not |cstrnlen_#t~short3|)), 1262#(and (<= 0 cstrnlen_~cp~0.offset) (<= (+ cstrnlen_~cp~0.offset 2) (select |#length| cstrnlen_~cp~0.base))), 1263#(and (<= 1 cstrnlen_~cp~0.offset) (<= (+ cstrnlen_~cp~0.offset 1) (select |#length| cstrnlen_~cp~0.base)))] [2018-02-02 09:50:26,692 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 09:50:26,692 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 09:50:26,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 09:50:26,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:50:26,692 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 12 states. [2018-02-02 09:50:26,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:26,861 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-02-02 09:50:26,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 09:50:26,861 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2018-02-02 09:50:26,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:26,862 INFO L225 Difference]: With dead ends: 34 [2018-02-02 09:50:26,862 INFO L226 Difference]: Without dead ends: 0 [2018-02-02 09:50:26,862 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-02-02 09:50:26,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-02 09:50:26,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-02 09:50:26,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-02 09:50:26,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-02 09:50:26,863 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2018-02-02 09:50:26,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:26,863 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-02 09:50:26,863 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 09:50:26,863 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-02 09:50:26,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-02 09:50:26,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:50:26 BoogieIcfgContainer [2018-02-02 09:50:26,866 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 09:50:26,867 INFO L168 Benchmark]: Toolchain (without parser) took 2976.65 ms. Allocated memory was 407.4 MB in the beginning and 658.0 MB in the end (delta: 250.6 MB). Free memory was 361.4 MB in the beginning and 477.6 MB in the end (delta: -116.2 MB). Peak memory consumption was 134.4 MB. Max. memory is 5.3 GB. [2018-02-02 09:50:26,867 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 407.4 MB. Free memory is still 368.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 09:50:26,868 INFO L168 Benchmark]: CACSL2BoogieTranslator took 158.67 ms. Allocated memory is still 407.4 MB. Free memory was 361.4 MB in the beginning and 350.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 09:50:26,868 INFO L168 Benchmark]: Boogie Preprocessor took 28.50 ms. Allocated memory is still 407.4 MB. Free memory was 350.8 MB in the beginning and 349.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 09:50:26,868 INFO L168 Benchmark]: RCFGBuilder took 146.39 ms. Allocated memory is still 407.4 MB. Free memory was 349.5 MB in the beginning and 333.6 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 5.3 GB. [2018-02-02 09:50:26,868 INFO L168 Benchmark]: TraceAbstraction took 2639.96 ms. Allocated memory was 407.4 MB in the beginning and 658.0 MB in the end (delta: 250.6 MB). Free memory was 332.3 MB in the beginning and 477.6 MB in the end (delta: -145.3 MB). Peak memory consumption was 105.3 MB. Max. memory is 5.3 GB. [2018-02-02 09:50:26,869 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.15 ms. Allocated memory is still 407.4 MB. Free memory is still 368.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 158.67 ms. Allocated memory is still 407.4 MB. Free memory was 361.4 MB in the beginning and 350.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.50 ms. Allocated memory is still 407.4 MB. Free memory was 350.8 MB in the beginning and 349.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 146.39 ms. Allocated memory is still 407.4 MB. Free memory was 349.5 MB in the beginning and 333.6 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2639.96 ms. Allocated memory was 407.4 MB in the beginning and 658.0 MB in the end (delta: 250.6 MB). Free memory was 332.3 MB in the beginning and 477.6 MB in the end (delta: -145.3 MB). Peak memory consumption was 105.3 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: 548]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 34 locations, 5 error locations. SAFE Result, 2.6s OverallTime, 12 OverallIterations, 4 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 301 SDtfs, 294 SDslu, 905 SDs, 0 SdLazy, 635 SolverSat, 72 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 12/50 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, 12 MinimizatonAttempts, 69 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 248 NumberOfCodeBlocks, 248 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 236 ConstructedInterpolants, 0 QuantifiedInterpolants, 35113 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 12/50 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/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_09-50-26-873.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_09-50-26-873.csv Received shutdown request...