java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 15:02:41,257 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 15:02:41,258 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 15:02:41,271 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 15:02:41,271 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 15:02:41,272 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 15:02:41,272 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 15:02:41,274 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 15:02:41,275 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 15:02:41,276 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 15:02:41,277 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 15:02:41,277 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 15:02:41,278 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 15:02:41,279 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 15:02:41,280 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 15:02:41,281 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 15:02:41,283 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 15:02:41,284 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 15:02:41,285 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 15:02:41,286 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 15:02:41,288 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 15:02:41,289 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 15:02:41,289 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 15:02:41,290 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 15:02:41,290 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 15:02:41,291 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 15:02:41,291 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 15:02:41,292 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 15:02:41,292 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 15:02:41,292 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 15:02:41,292 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 15:02:41,293 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 15:02:41,302 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 15:02:41,302 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 15:02:41,303 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 15:02:41,303 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 15:02:41,303 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 15:02:41,303 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 15:02:41,303 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 15:02:41,303 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 15:02:41,303 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 15:02:41,304 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 15:02:41,304 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 15:02:41,304 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 15:02:41,304 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 15:02:41,304 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 15:02:41,304 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 15:02:41,304 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 15:02:41,304 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 15:02:41,304 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 15:02:41,304 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 15:02:41,305 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 15:02:41,305 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 15:02:41,305 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 15:02:41,330 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 15:02:41,338 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 15:02:41,340 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 15:02:41,341 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 15:02:41,342 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 15:02:41,342 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.i [2018-02-04 15:02:41,466 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 15:02:41,467 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 15:02:41,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 15:02:41,468 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 15:02:41,471 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 15:02:41,472 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:02:41" (1/1) ... [2018-02-04 15:02:41,474 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3db90158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:02:41, skipping insertion in model container [2018-02-04 15:02:41,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:02:41" (1/1) ... [2018-02-04 15:02:41,484 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 15:02:41,511 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 15:02:41,599 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 15:02:41,611 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 15:02:41,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:02:41 WrapperNode [2018-02-04 15:02:41,616 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 15:02:41,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 15:02:41,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 15:02:41,617 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 15:02:41,625 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:02:41" (1/1) ... [2018-02-04 15:02:41,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:02:41" (1/1) ... [2018-02-04 15:02:41,631 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:02:41" (1/1) ... [2018-02-04 15:02:41,632 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:02:41" (1/1) ... [2018-02-04 15:02:41,634 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:02:41" (1/1) ... [2018-02-04 15:02:41,636 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:02:41" (1/1) ... [2018-02-04 15:02:41,637 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:02:41" (1/1) ... [2018-02-04 15:02:41,639 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 15:02:41,639 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 15:02:41,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 15:02:41,640 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 15:02:41,640 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:02:41" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 15:02:41,676 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 15:02:41,676 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 15:02:41,676 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlen [2018-02-04 15:02:41,676 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 15:02:41,676 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 15:02:41,676 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 15:02:41,676 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 15:02:41,677 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 15:02:41,677 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 15:02:41,677 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 15:02:41,677 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlen [2018-02-04 15:02:41,677 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 15:02:41,677 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 15:02:41,677 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 15:02:41,784 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 15:02:41,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:02:41 BoogieIcfgContainer [2018-02-04 15:02:41,785 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 15:02:41,785 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 15:02:41,785 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 15:02:41,787 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 15:02:41,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 03:02:41" (1/3) ... [2018-02-04 15:02:41,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@264bd39c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:02:41, skipping insertion in model container [2018-02-04 15:02:41,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:02:41" (2/3) ... [2018-02-04 15:02:41,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@264bd39c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:02:41, skipping insertion in model container [2018-02-04 15:02:41,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:02:41" (3/3) ... [2018-02-04 15:02:41,790 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.i [2018-02-04 15:02:41,795 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 15:02:41,801 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-02-04 15:02:41,826 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 15:02:41,826 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 15:02:41,827 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 15:02:41,827 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 15:02:41,827 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 15:02:41,827 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 15:02:41,827 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 15:02:41,827 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 15:02:41,828 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 15:02:41,839 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-02-04 15:02:41,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 15:02:41,847 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:02:41,848 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:02:41,849 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 15:02:41,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1793434931, now seen corresponding path program 1 times [2018-02-04 15:02:41,897 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:02:41,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:02:41,935 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:02:41,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:02:41,984 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:02:41,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 15:02:41,985 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:02:41,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:02:41,986 INFO L182 omatonBuilderFactory]: Interpolants [34#true, 35#false, 36#(= 1 (select |#valid| |main_#t~malloc3.base|)), 37#(= 1 (select |#valid| main_~nondetString1~0.base))] [2018-02-04 15:02:41,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:02:41,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 15:02:41,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 15:02:41,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 15:02:42,000 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 4 states. [2018-02-04 15:02:42,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:02:42,075 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-02-04 15:02:42,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 15:02:42,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-02-04 15:02:42,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:02:42,084 INFO L225 Difference]: With dead ends: 30 [2018-02-04 15:02:42,084 INFO L226 Difference]: Without dead ends: 27 [2018-02-04 15:02:42,085 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-04 15:02:42,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-02-04 15:02:42,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-02-04 15:02:42,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-02-04 15:02:42,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-02-04 15:02:42,154 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 10 [2018-02-04 15:02:42,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:02:42,155 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-02-04 15:02:42,155 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 15:02:42,155 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-02-04 15:02:42,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 15:02:42,156 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:02:42,156 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:02:42,156 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 15:02:42,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1793434932, now seen corresponding path program 1 times [2018-02-04 15:02:42,157 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:02:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:02:42,167 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:02:42,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:02:42,247 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:02:42,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 15:02:42,247 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:02:42,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:02:42,247 INFO L182 omatonBuilderFactory]: Interpolants [97#true, 98#false, 99#(<= 1 main_~length1~0), 100#(and (= main_~length1~0 (select |#length| |main_#t~malloc3.base|)) (<= 1 main_~length1~0) (= 0 |main_#t~malloc3.offset|)), 101#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0))] [2018-02-04 15:02:42,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:02:42,249 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 15:02:42,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 15:02:42,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 15:02:42,250 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 5 states. [2018-02-04 15:02:42,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:02:42,299 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-02-04 15:02:42,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 15:02:42,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-02-04 15:02:42,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:02:42,299 INFO L225 Difference]: With dead ends: 26 [2018-02-04 15:02:42,300 INFO L226 Difference]: Without dead ends: 26 [2018-02-04 15:02:42,300 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-04 15:02:42,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-02-04 15:02:42,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-02-04 15:02:42,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-02-04 15:02:42,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-02-04 15:02:42,302 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 10 [2018-02-04 15:02:42,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:02:42,302 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-02-04 15:02:42,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 15:02:42,303 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-02-04 15:02:42,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 15:02:42,303 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:02:42,303 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:02:42,303 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 15:02:42,303 INFO L82 PathProgramCache]: Analyzing trace with hash -2006900249, now seen corresponding path program 1 times [2018-02-04 15:02:42,304 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:02:42,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:02:42,311 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:02:42,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:02:42,340 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:02:42,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 15:02:42,341 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:02:42,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:02:42,341 INFO L182 omatonBuilderFactory]: Interpolants [160#(= 1 (select |#valid| cstrlen_~s~0.base)), 156#true, 157#false, 158#(= 1 (select |#valid| main_~nondetString1~0.base)), 159#(= 1 (select |#valid| |cstrlen_#in~str.base|))] [2018-02-04 15:02:42,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:02:42,341 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 15:02:42,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 15:02:42,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 15:02:42,342 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 5 states. [2018-02-04 15:02:42,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:02:42,388 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-02-04 15:02:42,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 15:02:42,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 15:02:42,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:02:42,389 INFO L225 Difference]: With dead ends: 25 [2018-02-04 15:02:42,389 INFO L226 Difference]: Without dead ends: 25 [2018-02-04 15:02:42,389 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-04 15:02:42,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-02-04 15:02:42,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-02-04 15:02:42,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-02-04 15:02:42,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-02-04 15:02:42,393 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 14 [2018-02-04 15:02:42,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:02:42,393 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-02-04 15:02:42,393 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 15:02:42,393 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-02-04 15:02:42,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 15:02:42,394 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:02:42,394 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:02:42,394 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 15:02:42,394 INFO L82 PathProgramCache]: Analyzing trace with hash -2006900248, now seen corresponding path program 1 times [2018-02-04 15:02:42,395 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:02:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:02:42,407 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:02:42,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-04 15:02:42,472 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:02:42,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 15:02:42,472 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:02:42,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-04 15:02:42,472 INFO L182 omatonBuilderFactory]: Interpolants [213#true, 214#false, 215#(<= 1 main_~length1~0), 216#(and (= main_~length1~0 (select |#length| |main_#t~malloc3.base|)) (<= 1 main_~length1~0) (= 0 |main_#t~malloc3.offset|)), 217#(and (= 0 main_~nondetString1~0.offset) (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (<= 1 main_~length1~0)), 218#(and (= 0 main_~nondetString1~0.offset) (<= 1 (select |#length| main_~nondetString1~0.base))), 219#(and (= 0 |cstrlen_#in~str.offset|) (<= 1 (select |#length| |cstrlen_#in~str.base|))), 220#(and (= cstrlen_~s~0.offset 0) (<= 1 (select |#length| cstrlen_~s~0.base)))] [2018-02-04 15:02:42,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-04 15:02:42,473 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 15:02:42,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 15:02:42,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 15:02:42,473 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 8 states. [2018-02-04 15:02:42,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:02:42,536 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-02-04 15:02:42,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 15:02:42,537 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-02-04 15:02:42,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:02:42,539 INFO L225 Difference]: With dead ends: 32 [2018-02-04 15:02:42,539 INFO L226 Difference]: Without dead ends: 32 [2018-02-04 15:02:42,540 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-04 15:02:42,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-02-04 15:02:42,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2018-02-04 15:02:42,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-02-04 15:02:42,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-02-04 15:02:42,543 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 14 [2018-02-04 15:02:42,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:02:42,543 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-02-04 15:02:42,543 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 15:02:42,544 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-02-04 15:02:42,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 15:02:42,544 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:02:42,544 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:02:42,544 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 15:02:42,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1301829867, now seen corresponding path program 1 times [2018-02-04 15:02:42,545 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:02:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:02:42,557 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:02:42,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:02:42,654 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:02:42,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 15:02:42,654 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:02:42,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:02:42,655 INFO L182 omatonBuilderFactory]: Interpolants [288#(and (<= 1 main_~length1~0) (<= main_~length1~0 1) (= main_~nondetString1~0.offset 0)), 289#(and (= 0 (select (select |#memory_int| main_~nondetString1~0.base) main_~nondetString1~0.offset)) (= main_~nondetString1~0.offset 0)), 290#(= 0 (select (select |#memory_int| |cstrlen_#in~str.base|) |cstrlen_#in~str.offset|)), 291#(= 0 (select (select |#memory_int| cstrlen_~s~0.base) cstrlen_~s~0.offset)), 292#(= |cstrlen_#t~mem1| 0), 284#true, 285#false, 286#(and (<= 1 main_~length1~0) (<= main_~length1~0 1)), 287#(and (<= 1 main_~length1~0) (= 0 |main_#t~malloc3.offset|) (<= main_~length1~0 1))] [2018-02-04 15:02:42,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:02:42,655 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 15:02:42,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 15:02:42,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 15:02:42,655 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2018-02-04 15:02:42,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:02:42,741 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-02-04 15:02:42,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 15:02:42,742 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-02-04 15:02:42,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:02:42,742 INFO L225 Difference]: With dead ends: 43 [2018-02-04 15:02:42,742 INFO L226 Difference]: Without dead ends: 43 [2018-02-04 15:02:42,743 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-02-04 15:02:42,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-04 15:02:42,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2018-02-04 15:02:42,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-04 15:02:42,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-02-04 15:02:42,746 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 18 [2018-02-04 15:02:42,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:02:42,746 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-02-04 15:02:42,746 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 15:02:42,746 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-02-04 15:02:42,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 15:02:42,747 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:02:42,747 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:02:42,747 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 15:02:42,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1559995305, now seen corresponding path program 1 times [2018-02-04 15:02:42,748 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:02:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:02:42,760 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:02:42,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:02:42,893 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:02:42,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 15:02:42,893 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:02:42,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:02:42,894 INFO L182 omatonBuilderFactory]: Interpolants [384#true, 385#false, 386#(<= 1 main_~length1~0), 387#(and (= main_~length1~0 (select |#length| |main_#t~malloc3.base|)) (<= 1 main_~length1~0) (= 0 |main_#t~malloc3.offset|)), 388#(and (<= 1 main_~length1~0) (or (= (+ main_~nondetString1~0.offset main_~length1~0) 1) (= main_~length1~0 (select |#length| main_~nondetString1~0.base))) (= main_~nondetString1~0.offset 0)), 389#(and (or (<= 2 (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base))) (= 0 (select (select |#memory_int| main_~nondetString1~0.base) main_~nondetString1~0.offset))) (= main_~nondetString1~0.offset 0)), 390#(and (= 0 |cstrlen_#in~str.offset|) (or (= 0 (select (select |#memory_int| |cstrlen_#in~str.base|) |cstrlen_#in~str.offset|)) (<= 2 (select |#length| |cstrlen_#in~str.base|)))), 391#(and (or (= 0 (select (select |#memory_int| cstrlen_~s~0.base) cstrlen_~s~0.offset)) (<= 2 (select |#length| cstrlen_~s~0.base))) (= cstrlen_~s~0.offset 0)), 392#(and (or (<= 2 (select |#length| cstrlen_~s~0.base)) (= |cstrlen_#t~mem1| 0)) (= cstrlen_~s~0.offset 0)), 393#(and (= cstrlen_~s~0.offset 0) (<= 2 (select |#length| cstrlen_~s~0.base))), 394#(and (<= 1 cstrlen_~s~0.offset) (<= (+ cstrlen_~s~0.offset 1) (select |#length| cstrlen_~s~0.base)))] [2018-02-04 15:02:42,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:02:42,894 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 15:02:42,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 15:02:42,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 15:02:42,895 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 11 states. [2018-02-04 15:02:43,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:02:43,085 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-02-04 15:02:43,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 15:02:43,086 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-02-04 15:02:43,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:02:43,086 INFO L225 Difference]: With dead ends: 50 [2018-02-04 15:02:43,086 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 15:02:43,087 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-02-04 15:02:43,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 15:02:43,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2018-02-04 15:02:43,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 15:02:43,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-02-04 15:02:43,090 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 18 [2018-02-04 15:02:43,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:02:43,091 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-02-04 15:02:43,091 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 15:02:43,091 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-02-04 15:02:43,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 15:02:43,092 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:02:43,092 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] [2018-02-04 15:02:43,092 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 15:02:43,092 INFO L82 PathProgramCache]: Analyzing trace with hash -968711636, now seen corresponding path program 1 times [2018-02-04 15:02:43,093 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:02:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:02:43,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:02:43,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:02:43,141 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:02:43,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 15:02:43,141 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:02:43,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:02:43,141 INFO L182 omatonBuilderFactory]: Interpolants [501#true, 502#false, 503#(= |#valid| |old(#valid)|), 504#(= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0))] [2018-02-04 15:02:43,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:02:43,141 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 15:02:43,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 15:02:43,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 15:02:43,142 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 4 states. [2018-02-04 15:02:43,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:02:43,167 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-02-04 15:02:43,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 15:02:43,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-02-04 15:02:43,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:02:43,168 INFO L225 Difference]: With dead ends: 41 [2018-02-04 15:02:43,168 INFO L226 Difference]: Without dead ends: 23 [2018-02-04 15:02:43,168 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-04 15:02:43,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-02-04 15:02:43,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-02-04 15:02:43,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-02-04 15:02:43,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-02-04 15:02:43,169 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 22 [2018-02-04 15:02:43,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:02:43,170 INFO L432 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-02-04 15:02:43,170 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 15:02:43,170 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-02-04 15:02:43,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 15:02:43,170 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:02:43,170 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:02:43,170 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 15:02:43,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1772753452, now seen corresponding path program 2 times [2018-02-04 15:02:43,171 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:02:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:02:43,183 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:02:43,368 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:02:43,369 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:02:43,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 15:02:43,369 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:02:43,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:02:43,369 INFO L182 omatonBuilderFactory]: Interpolants [576#(and (= 0 |cstrlen_#in~str.offset|) (or (= 0 (select (select |#memory_int| |cstrlen_#in~str.base|) 1)) (<= (select |#length| |cstrlen_#in~str.base|) 1) (<= 3 (select |#length| |cstrlen_#in~str.base|)))), 577#(and (or (<= 3 (select |#length| cstrlen_~s~0.base)) (<= (select |#length| cstrlen_~s~0.base) 1) (= 0 (select (select |#memory_int| cstrlen_~s~0.base) 1))) (= cstrlen_~s~0.offset 0)), 578#(and (<= 1 cstrlen_~s~0.offset) (or (<= (select |#length| cstrlen_~s~0.base) cstrlen_~s~0.offset) (<= (+ cstrlen_~s~0.offset 2) (select |#length| cstrlen_~s~0.base)) (and (= 0 (select (select |#memory_int| cstrlen_~s~0.base) cstrlen_~s~0.offset)) (= 1 cstrlen_~s~0.offset)))), 579#(and (<= 1 cstrlen_~s~0.offset) (or (<= (+ cstrlen_~s~0.offset 2) (select |#length| cstrlen_~s~0.base)) (and (= 1 cstrlen_~s~0.offset) (= |cstrlen_#t~mem1| 0)))), 580#(and (<= 1 cstrlen_~s~0.offset) (<= (+ cstrlen_~s~0.offset 2) (select |#length| cstrlen_~s~0.base))), 581#(and (<= 2 cstrlen_~s~0.offset) (<= (+ cstrlen_~s~0.offset 1) (select |#length| cstrlen_~s~0.base))), 571#true, 572#false, 573#(and (= main_~length1~0 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 574#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 575#(and (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)) (= main_~nondetString1~0.offset 0))] [2018-02-04 15:02:43,370 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:02:43,370 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 15:02:43,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 15:02:43,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-02-04 15:02:43,371 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 11 states. [2018-02-04 15:02:43,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:02:43,517 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-02-04 15:02:43,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 15:02:43,518 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-02-04 15:02:43,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:02:43,519 INFO L225 Difference]: With dead ends: 29 [2018-02-04 15:02:43,519 INFO L226 Difference]: Without dead ends: 29 [2018-02-04 15:02:43,519 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2018-02-04 15:02:43,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-02-04 15:02:43,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-02-04 15:02:43,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-02-04 15:02:43,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-02-04 15:02:43,522 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 22 [2018-02-04 15:02:43,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:02:43,522 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-02-04 15:02:43,522 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 15:02:43,522 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-02-04 15:02:43,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 15:02:43,524 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:02:43,524 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:02:43,524 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 15:02:43,524 INFO L82 PathProgramCache]: Analyzing trace with hash -2069395665, now seen corresponding path program 3 times [2018-02-04 15:02:43,525 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:02:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:02:43,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:02:43,640 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:02:43,640 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:02:43,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 15:02:43,641 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:02:43,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:02:43,641 INFO L182 omatonBuilderFactory]: Interpolants [656#(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)), 657#(= 0 (select (select |#memory_int| |cstrlen_#in~str.base|) (+ (select |#length| |cstrlen_#in~str.base|) (- 1)))), 658#(= 0 (select (select |#memory_int| cstrlen_~s~0.base) (+ (select |#length| cstrlen_~s~0.base) (- 1)))), 659#(or (= 0 (select (select |#memory_int| cstrlen_~s~0.base) cstrlen_~s~0.offset)) (<= (select |#length| cstrlen_~s~0.base) cstrlen_~s~0.offset) (<= (+ cstrlen_~s~0.offset 2) (select |#length| cstrlen_~s~0.base))), 660#(or (= |cstrlen_#t~mem1| 0) (and (<= (+ cstrlen_~s~0.offset 2) (select |#length| cstrlen_~s~0.base)) (<= 0 cstrlen_~s~0.offset))), 661#(and (<= (+ cstrlen_~s~0.offset 2) (select |#length| cstrlen_~s~0.base)) (<= 0 cstrlen_~s~0.offset)), 662#(and (<= 1 cstrlen_~s~0.offset) (<= (+ cstrlen_~s~0.offset 1) (select |#length| cstrlen_~s~0.base))), 652#true, 653#false, 654#(and (= main_~length1~0 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 655#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0))] [2018-02-04 15:02:43,641 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 15:02:43,641 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 15:02:43,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 15:02:43,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 15:02:43,641 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 11 states. [2018-02-04 15:02:43,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:02:43,744 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-02-04 15:02:43,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 15:02:43,744 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-02-04 15:02:43,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:02:43,744 INFO L225 Difference]: With dead ends: 26 [2018-02-04 15:02:43,744 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 15:02:43,745 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-02-04 15:02:43,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 15:02:43,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 15:02:43,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 15:02:43,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 15:02:43,745 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-02-04 15:02:43,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:02:43,745 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 15:02:43,745 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 15:02:43,745 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 15:02:43,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 15:02:43,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 03:02:43 BoogieIcfgContainer [2018-02-04 15:02:43,749 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 15:02:43,749 INFO L168 Benchmark]: Toolchain (without parser) took 2282.70 ms. Allocated memory was 405.3 MB in the beginning and 626.5 MB in the end (delta: 221.2 MB). Free memory was 363.5 MB in the beginning and 427.7 MB in the end (delta: -64.2 MB). Peak memory consumption was 157.0 MB. Max. memory is 5.3 GB. [2018-02-04 15:02:43,750 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 405.3 MB. Free memory is still 368.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 15:02:43,750 INFO L168 Benchmark]: CACSL2BoogieTranslator took 148.96 ms. Allocated memory is still 405.3 MB. Free memory was 362.1 MB in the beginning and 352.9 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. [2018-02-04 15:02:43,751 INFO L168 Benchmark]: Boogie Preprocessor took 22.30 ms. Allocated memory is still 405.3 MB. Free memory was 352.9 MB in the beginning and 350.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 15:02:43,751 INFO L168 Benchmark]: RCFGBuilder took 145.52 ms. Allocated memory is still 405.3 MB. Free memory was 350.3 MB in the beginning and 336.1 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 5.3 GB. [2018-02-04 15:02:43,751 INFO L168 Benchmark]: TraceAbstraction took 1963.58 ms. Allocated memory was 405.3 MB in the beginning and 626.5 MB in the end (delta: 221.2 MB). Free memory was 334.8 MB in the beginning and 427.7 MB in the end (delta: -92.9 MB). Peak memory consumption was 128.3 MB. Max. memory is 5.3 GB. [2018-02-04 15:02:43,753 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 405.3 MB. Free memory is still 368.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 148.96 ms. Allocated memory is still 405.3 MB. Free memory was 362.1 MB in the beginning and 352.9 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 22.30 ms. Allocated memory is still 405.3 MB. Free memory was 352.9 MB in the beginning and 350.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 145.52 ms. Allocated memory is still 405.3 MB. Free memory was 350.3 MB in the beginning and 336.1 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1963.58 ms. Allocated memory was 405.3 MB in the beginning and 626.5 MB in the end (delta: 221.2 MB). Free memory was 334.8 MB in the beginning and 427.7 MB in the end (delta: -92.9 MB). Peak memory consumption was 128.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, 31 locations, 5 error locations. SAFE Result, 1.9s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 166 SDtfs, 182 SDslu, 471 SDs, 0 SdLazy, 452 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 6/30 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, 9 MinimizatonAttempts, 20 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 145 ConstructedInterpolants, 0 QuantifiedInterpolants, 18082 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 6/30 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_cstrlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_15-02-43-760.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_15-02-43-760.csv Received shutdown request...