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/cstrchr-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 14:58:24,478 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 14:58:24,479 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 14:58:24,491 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 14:58:24,491 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 14:58:24,492 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 14:58:24,492 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 14:58:24,494 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 14:58:24,495 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 14:58:24,496 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 14:58:24,497 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 14:58:24,497 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 14:58:24,498 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 14:58:24,498 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 14:58:24,499 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 14:58:24,501 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 14:58:24,503 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 14:58:24,504 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 14:58:24,505 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 14:58:24,506 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 14:58:24,508 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 14:58:24,508 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 14:58:24,508 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 14:58:24,509 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 14:58:24,510 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 14:58:24,510 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 14:58:24,511 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 14:58:24,511 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 14:58:24,511 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 14:58:24,511 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 14:58:24,512 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 14:58:24,512 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 14:58:24,521 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 14:58:24,521 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 14:58:24,522 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 14:58:24,522 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 14:58:24,522 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 14:58:24,523 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 14:58:24,523 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 14:58:24,523 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 14:58:24,523 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 14:58:24,523 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 14:58:24,523 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 14:58:24,523 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 14:58:24,524 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 14:58:24,524 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 14:58:24,524 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 14:58:24,524 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 14:58:24,524 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 14:58:24,524 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 14:58:24,524 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 14:58:24,525 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 14:58:24,525 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 14:58:24,525 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 14:58:24,554 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 14:58:24,562 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 14:58:24,564 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 14:58:24,565 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 14:58:24,566 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 14:58:24,566 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrchr-alloca_true-valid-memsafety_true-termination.i [2018-02-04 14:58:24,685 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 14:58:24,686 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 14:58:24,686 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 14:58:24,686 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 14:58:24,690 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 14:58:24,691 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:58:24" (1/1) ... [2018-02-04 14:58:24,693 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dfe84f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:24, skipping insertion in model container [2018-02-04 14:58:24,694 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:58:24" (1/1) ... [2018-02-04 14:58:24,703 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 14:58:24,731 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 14:58:24,820 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 14:58:24,832 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 14:58:24,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:24 WrapperNode [2018-02-04 14:58:24,838 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 14:58:24,838 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 14:58:24,838 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 14:58:24,839 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 14:58:24,847 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:24" (1/1) ... [2018-02-04 14:58:24,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:24" (1/1) ... [2018-02-04 14:58:24,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:24" (1/1) ... [2018-02-04 14:58:24,853 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:24" (1/1) ... [2018-02-04 14:58:24,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:24" (1/1) ... [2018-02-04 14:58:24,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:24" (1/1) ... [2018-02-04 14:58:24,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:24" (1/1) ... [2018-02-04 14:58:24,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 14:58:24,861 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 14:58:24,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 14:58:24,862 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 14:58:24,862 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58: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-04 14:58:24,894 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 14:58:24,894 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 14:58:24,894 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrchr [2018-02-04 14:58:24,894 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 14:58:24,894 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 14:58:24,894 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 14:58:24,895 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 14:58:24,895 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 14:58:24,895 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 14:58:24,895 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 14:58:24,895 INFO L128 BoogieDeclarations]: Found specification of procedure cstrchr [2018-02-04 14:58:24,895 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 14:58:24,895 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 14:58:24,895 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 14:58:25,036 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 14:58:25,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:58:25 BoogieIcfgContainer [2018-02-04 14:58:25,037 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 14:58:25,038 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 14:58:25,038 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 14:58:25,040 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 14:58:25,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 02:58:24" (1/3) ... [2018-02-04 14:58:25,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5659b65a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:58:25, skipping insertion in model container [2018-02-04 14:58:25,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:24" (2/3) ... [2018-02-04 14:58:25,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5659b65a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:58:25, skipping insertion in model container [2018-02-04 14:58:25,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:58:25" (3/3) ... [2018-02-04 14:58:25,043 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrchr-alloca_true-valid-memsafety_true-termination.i [2018-02-04 14:58:25,051 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 14:58:25,057 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 14:58:25,090 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 14:58:25,090 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 14:58:25,090 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 14:58:25,091 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 14:58:25,091 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 14:58:25,091 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 14:58:25,091 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 14:58:25,091 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 14:58:25,092 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 14:58:25,104 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-02-04 14:58:25,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 14:58:25,112 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:25,113 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:25,113 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:25,117 INFO L82 PathProgramCache]: Analyzing trace with hash 797989968, now seen corresponding path program 1 times [2018-02-04 14:58:25,157 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:25,193 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:25,245 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 14:58:25,246 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:25,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 14:58:25,247 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:25,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 14:58:25,248 INFO L182 omatonBuilderFactory]: Interpolants [44#true, 45#false, 46#(= 1 (select |#valid| |main_#t~malloc7.base|)), 47#(= 1 (select |#valid| main_~nondetString~0.base))] [2018-02-04 14:58:25,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 14:58:25,248 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 14:58:25,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 14:58:25,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 14:58:25,258 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 4 states. [2018-02-04 14:58:25,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:25,327 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-02-04 14:58:25,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 14:58:25,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-02-04 14:58:25,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:25,334 INFO L225 Difference]: With dead ends: 40 [2018-02-04 14:58:25,335 INFO L226 Difference]: Without dead ends: 37 [2018-02-04 14:58:25,336 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 14:58:25,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-02-04 14:58:25,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-02-04 14:58:25,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-04 14:58:25,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-02-04 14:58:25,397 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 10 [2018-02-04 14:58:25,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:25,397 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-02-04 14:58:25,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 14:58:25,397 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-02-04 14:58:25,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 14:58:25,397 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:25,397 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:25,398 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:25,398 INFO L82 PathProgramCache]: Analyzing trace with hash 797989969, now seen corresponding path program 1 times [2018-02-04 14:58:25,398 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:25,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:25,481 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 14:58:25,482 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:25,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 14:58:25,482 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:25,482 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 14:58:25,482 INFO L182 omatonBuilderFactory]: Interpolants [128#false, 129#(<= 1 main_~length~0), 130#(and (= 0 |main_#t~malloc7.offset|) (= main_~length~0 (select |#length| |main_#t~malloc7.base|)) (<= 1 main_~length~0)), 131#(and (= main_~length~0 (select |#length| main_~nondetString~0.base)) (= main_~nondetString~0.offset 0) (<= 1 main_~length~0)), 127#true] [2018-02-04 14:58:25,483 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 14:58:25,484 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 14:58:25,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 14:58:25,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:58:25,484 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 5 states. [2018-02-04 14:58:25,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:25,512 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-02-04 14:58:25,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:58:25,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-02-04 14:58:25,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:25,514 INFO L225 Difference]: With dead ends: 36 [2018-02-04 14:58:25,514 INFO L226 Difference]: Without dead ends: 36 [2018-02-04 14:58:25,515 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 14:58:25,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-04 14:58:25,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-04 14:58:25,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 14:58:25,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-02-04 14:58:25,519 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 10 [2018-02-04 14:58:25,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:25,520 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-02-04 14:58:25,520 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 14:58:25,520 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-02-04 14:58:25,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 14:58:25,520 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:25,521 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:25,521 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:25,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1840539991, now seen corresponding path program 1 times [2018-02-04 14:58:25,522 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:25,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:25,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:25,564 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 14:58:25,565 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:25,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 14:58:25,565 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:25,565 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 14:58:25,565 INFO L182 omatonBuilderFactory]: Interpolants [208#(= 1 (select |#valid| main_~nondetString~0.base)), 209#(= 1 (select |#valid| |cstrchr_#in~s.base|)), 210#(= 1 (select |#valid| cstrchr_~s.base)), 206#true, 207#false] [2018-02-04 14:58:25,566 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 14:58:25,566 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 14:58:25,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 14:58:25,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:58:25,566 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 5 states. [2018-02-04 14:58:25,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:25,639 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-02-04 14:58:25,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 14:58:25,639 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-04 14:58:25,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:25,640 INFO L225 Difference]: With dead ends: 33 [2018-02-04 14:58:25,640 INFO L226 Difference]: Without dead ends: 33 [2018-02-04 14:58:25,640 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 14:58:25,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-02-04 14:58:25,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-02-04 14:58:25,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-02-04 14:58:25,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-02-04 14:58:25,643 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 15 [2018-02-04 14:58:25,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:25,643 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-02-04 14:58:25,644 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 14:58:25,644 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-02-04 14:58:25,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 14:58:25,644 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:25,644 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:25,644 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:25,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1840539990, now seen corresponding path program 1 times [2018-02-04 14:58:25,645 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:25,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:25,726 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 14:58:25,726 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:25,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 14:58:25,727 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:25,727 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 14:58:25,727 INFO L182 omatonBuilderFactory]: Interpolants [279#true, 280#false, 281#(<= 1 main_~length~0), 282#(and (= 0 |main_#t~malloc7.offset|) (= main_~length~0 (select |#length| |main_#t~malloc7.base|)) (<= 1 main_~length~0)), 283#(and (= main_~length~0 (select |#length| main_~nondetString~0.base)) (= 0 main_~nondetString~0.offset) (<= 1 main_~length~0)), 284#(and (<= 1 (select |#length| main_~nondetString~0.base)) (= 0 main_~nondetString~0.offset)), 285#(and (= 0 |cstrchr_#in~s.offset|) (<= 1 (select |#length| |cstrchr_#in~s.base|))), 286#(and (<= 1 (select |#length| cstrchr_~s.base)) (= cstrchr_~s.offset 0))] [2018-02-04 14:58:25,727 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 14:58:25,728 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 14:58:25,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 14:58:25,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 14:58:25,728 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 8 states. [2018-02-04 14:58:25,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:25,813 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-02-04 14:58:25,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 14:58:25,814 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-02-04 14:58:25,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:25,817 INFO L225 Difference]: With dead ends: 45 [2018-02-04 14:58:25,817 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 14:58:25,817 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 14:58:25,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 14:58:25,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2018-02-04 14:58:25,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 14:58:25,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-02-04 14:58:25,821 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 15 [2018-02-04 14:58:25,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:25,821 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-02-04 14:58:25,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 14:58:25,821 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-02-04 14:58:25,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 14:58:25,822 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:25,822 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-04 14:58:25,822 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:25,822 INFO L82 PathProgramCache]: Analyzing trace with hash 985116459, now seen corresponding path program 1 times [2018-02-04 14:58:25,823 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:25,834 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:25,851 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 14:58:25,852 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:25,852 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 14:58:25,852 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:25,852 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 14:58:25,852 INFO L182 omatonBuilderFactory]: Interpolants [377#true, 378#false, 379#(not |cstrchr_#t~short2|)] [2018-02-04 14:58:25,852 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 14:58:25,853 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 14:58:25,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 14:58:25,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 14:58:25,853 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 3 states. [2018-02-04 14:58:25,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:25,860 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-02-04 14:58:25,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 14:58:25,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-02-04 14:58:25,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:25,861 INFO L225 Difference]: With dead ends: 43 [2018-02-04 14:58:25,861 INFO L226 Difference]: Without dead ends: 43 [2018-02-04 14:58:25,861 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-04 14:58:25,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-04 14:58:25,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-02-04 14:58:25,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-04 14:58:25,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-02-04 14:58:25,865 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 20 [2018-02-04 14:58:25,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:25,865 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-02-04 14:58:25,865 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 14:58:25,865 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-02-04 14:58:25,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 14:58:25,866 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:25,866 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:25,866 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:25,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1622551342, now seen corresponding path program 1 times [2018-02-04 14:58:25,867 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:25,882 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:26,054 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 14:58:26,054 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:58:26,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 14:58:26,054 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:26,055 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 14:58:26,055 INFO L182 omatonBuilderFactory]: Interpolants [466#true, 467#false, 468#(<= 1 main_~length~0), 469#(and (= 0 |main_#t~malloc7.offset|) (= main_~length~0 (select |#length| |main_#t~malloc7.base|)) (<= 1 main_~length~0)), 470#(and (or (and (= main_~length~0 (select |#length| main_~nondetString~0.base)) (<= 1 main_~length~0)) (= (+ main_~nondetString~0.offset main_~length~0) 1)) (= main_~nondetString~0.offset 0)), 471#(and (or (<= 2 (+ main_~nondetString~0.offset (select |#length| main_~nondetString~0.base))) (= 0 (select (select |#memory_int| main_~nondetString~0.base) main_~nondetString~0.offset))) (= main_~nondetString~0.offset 0)), 472#(and (or (= 0 (select (select |#memory_int| |cstrchr_#in~s.base|) |cstrchr_#in~s.offset|)) (<= 2 (select |#length| |cstrchr_#in~s.base|))) (= 0 |cstrchr_#in~s.offset|)), 473#(and (or (<= 2 (select |#length| cstrchr_~s.base)) (= 0 (select (select |#memory_int| cstrchr_~s.base) cstrchr_~s.offset))) (= cstrchr_~s.offset 0)), 474#(and (or (<= 2 (select |#length| cstrchr_~s.base)) (and (= |cstrchr_#t~mem0| (select (select |#memory_int| cstrchr_~s.base) cstrchr_~s.offset)) (= 0 (select (select |#memory_int| cstrchr_~s.base) cstrchr_~s.offset)))) (= cstrchr_~s.offset 0)), 475#(and (or (not |cstrchr_#t~short2|) (<= 2 (select |#length| cstrchr_~s.base))) (= cstrchr_~s.offset 0)), 476#(and (<= 2 (select |#length| cstrchr_~s.base)) (= cstrchr_~s.offset 0)), 477#(and (<= 1 cstrchr_~s.offset) (<= (+ cstrchr_~s.offset 1) (select |#length| cstrchr_~s.base)))] [2018-02-04 14:58:26,055 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 14:58:26,055 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 14:58:26,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 14:58:26,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-04 14:58:26,056 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 12 states. [2018-02-04 14:58:26,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:26,325 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2018-02-04 14:58:26,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 14:58:26,325 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-02-04 14:58:26,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:26,326 INFO L225 Difference]: With dead ends: 65 [2018-02-04 14:58:26,326 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 14:58:26,327 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2018-02-04 14:58:26,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 14:58:26,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 50. [2018-02-04 14:58:26,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 14:58:26,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-02-04 14:58:26,329 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 22 [2018-02-04 14:58:26,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:26,329 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-02-04 14:58:26,329 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 14:58:26,329 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-02-04 14:58:26,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 14:58:26,330 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:26,330 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:26,330 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:26,330 INFO L82 PathProgramCache]: Analyzing trace with hash 112532188, now seen corresponding path program 1 times [2018-02-04 14:58:26,331 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:26,340 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:26,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 14:58:26,369 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:26,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 14:58:26,370 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:26,370 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 14:58:26,370 INFO L182 omatonBuilderFactory]: Interpolants [609#true, 610#false, 611#(= |#valid| |old(#valid)|), 612#(= (store |#valid| |main_#t~malloc7.base| 0) |old(#valid)|)] [2018-02-04 14:58:26,370 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 14:58:26,371 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 14:58:26,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 14:58:26,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 14:58:26,371 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 4 states. [2018-02-04 14:58:26,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:26,403 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-02-04 14:58:26,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 14:58:26,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-02-04 14:58:26,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:26,404 INFO L225 Difference]: With dead ends: 49 [2018-02-04 14:58:26,404 INFO L226 Difference]: Without dead ends: 39 [2018-02-04 14:58:26,404 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 14:58:26,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-02-04 14:58:26,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-02-04 14:58:26,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-04 14:58:26,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-02-04 14:58:26,406 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 27 [2018-02-04 14:58:26,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:26,406 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-02-04 14:58:26,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 14:58:26,406 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-02-04 14:58:26,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 14:58:26,407 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:26,407 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:26,407 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:26,407 INFO L82 PathProgramCache]: Analyzing trace with hash 622344746, now seen corresponding path program 2 times [2018-02-04 14:58:26,408 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:26,421 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:26,688 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:26,688 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:58:26,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 14:58:26,688 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:26,688 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 14:58:26,688 INFO L182 omatonBuilderFactory]: Interpolants [704#false, 705#(and (= 0 |main_#t~malloc7.offset|) (= main_~length~0 (select |#length| |main_#t~malloc7.base|))), 706#(and (or (= main_~length~0 (select |#length| main_~nondetString~0.base)) (= (+ main_~nondetString~0.offset main_~length~0) 2)) (= 0 main_~nondetString~0.offset)), 707#(and (or (<= (+ main_~nondetString~0.offset (select |#length| main_~nondetString~0.base)) 1) (= 0 (select (select |#memory_int| main_~nondetString~0.base) 1)) (<= 3 (+ main_~nondetString~0.offset (select |#length| main_~nondetString~0.base)))) (= 0 main_~nondetString~0.offset)), 708#(and (or (<= (select |#length| |cstrchr_#in~s.base|) 1) (= 0 (select (select |#memory_int| |cstrchr_#in~s.base|) 1)) (<= 3 (select |#length| |cstrchr_#in~s.base|))) (= 0 |cstrchr_#in~s.offset|)), 709#(and (or (= 0 (select (select |#memory_int| cstrchr_~s.base) 1)) (<= (select |#length| cstrchr_~s.base) 1) (<= 3 (select |#length| cstrchr_~s.base))) (= cstrchr_~s.offset 0)), 710#(or (and (<= 1 cstrchr_~s.offset) (or (<= (+ cstrchr_~s.offset 2) (select |#length| cstrchr_~s.base)) (<= (select |#length| cstrchr_~s.base) cstrchr_~s.offset))) (and (= 1 cstrchr_~s.offset) (= 0 (select (select |#memory_int| cstrchr_~s.base) cstrchr_~s.offset)))), 711#(or (and (<= 1 cstrchr_~s.offset) (<= (+ cstrchr_~s.offset 2) (select |#length| cstrchr_~s.base))) (and (= 1 cstrchr_~s.offset) (= |cstrchr_#t~mem0| (select (select |#memory_int| cstrchr_~s.base) cstrchr_~s.offset)) (= 0 (select (select |#memory_int| cstrchr_~s.base) cstrchr_~s.offset)))), 712#(or (and (not |cstrchr_#t~short2|) (= 1 cstrchr_~s.offset)) (and (<= 1 cstrchr_~s.offset) (<= (+ cstrchr_~s.offset 2) (select |#length| cstrchr_~s.base)))), 713#(and (<= 1 cstrchr_~s.offset) (<= (+ cstrchr_~s.offset 2) (select |#length| cstrchr_~s.base))), 714#(and (<= (+ cstrchr_~s.offset 1) (select |#length| cstrchr_~s.base)) (<= 2 cstrchr_~s.offset)), 703#true] [2018-02-04 14:58:26,688 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:26,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 14:58:26,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 14:58:26,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-04 14:58:26,689 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 12 states. [2018-02-04 14:58:26,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:26,895 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2018-02-04 14:58:26,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 14:58:26,896 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-02-04 14:58:26,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:26,896 INFO L225 Difference]: With dead ends: 48 [2018-02-04 14:58:26,896 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 14:58:26,897 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-02-04 14:58:26,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 14:58:26,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-04 14:58:26,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 14:58:26,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-02-04 14:58:26,899 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 29 [2018-02-04 14:58:26,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:26,899 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-02-04 14:58:26,900 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 14:58:26,900 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-02-04 14:58:26,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 14:58:26,900 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:26,900 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:26,900 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:26,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1601005650, now seen corresponding path program 3 times [2018-02-04 14:58:26,901 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:26,913 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:27,040 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 14:58:27,041 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:58:27,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 14:58:27,041 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:27,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-04 14:58:27,041 INFO L182 omatonBuilderFactory]: Interpolants [832#(or (= 0 (select (select |#memory_int| cstrchr_~s.base) cstrchr_~s.offset)) (<= (+ cstrchr_~s.offset 2) (select |#length| cstrchr_~s.base)) (<= (select |#length| cstrchr_~s.base) cstrchr_~s.offset)), 833#(and (<= 0 cstrchr_~s.offset) (or (and (= |cstrchr_#t~mem0| (select (select |#memory_int| cstrchr_~s.base) cstrchr_~s.offset)) (= 0 (select (select |#memory_int| cstrchr_~s.base) cstrchr_~s.offset))) (<= (+ cstrchr_~s.offset 2) (select |#length| cstrchr_~s.base)))), 834#(and (<= 0 cstrchr_~s.offset) (or (not |cstrchr_#t~short2|) (<= (+ cstrchr_~s.offset 2) (select |#length| cstrchr_~s.base)))), 835#(and (<= 0 cstrchr_~s.offset) (<= (+ cstrchr_~s.offset 2) (select |#length| cstrchr_~s.base))), 836#(and (<= 1 cstrchr_~s.offset) (<= (+ cstrchr_~s.offset 1) (select |#length| cstrchr_~s.base))), 825#true, 826#false, 827#(and (= 0 |main_#t~malloc7.offset|) (= main_~length~0 (select |#length| |main_#t~malloc7.base|))), 828#(and (= main_~length~0 (select |#length| main_~nondetString~0.base)) (= main_~nondetString~0.offset 0)), 829#(and (= main_~nondetString~0.offset 0) (= 0 (select (select |#memory_int| main_~nondetString~0.base) (+ (select |#length| main_~nondetString~0.base) (+ main_~nondetString~0.offset (- 1)))))), 830#(= 0 (select (select |#memory_int| |cstrchr_#in~s.base|) (+ (select |#length| |cstrchr_#in~s.base|) (- 1)))), 831#(= 0 (select (select |#memory_int| cstrchr_~s.base) (+ (select |#length| cstrchr_~s.base) (- 1))))] [2018-02-04 14:58:27,041 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 14:58:27,041 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 14:58:27,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 14:58:27,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-02-04 14:58:27,042 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 12 states. [2018-02-04 14:58:27,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:27,210 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-02-04 14:58:27,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 14:58:27,210 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2018-02-04 14:58:27,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:27,210 INFO L225 Difference]: With dead ends: 44 [2018-02-04 14:58:27,210 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 14:58:27,210 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2018-02-04 14:58:27,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 14:58:27,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 14:58:27,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 14:58:27,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 14:58:27,211 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2018-02-04 14:58:27,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:27,211 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 14:58:27,211 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 14:58:27,211 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 14:58:27,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 14:58:27,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 02:58:27 BoogieIcfgContainer [2018-02-04 14:58:27,214 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 14:58:27,215 INFO L168 Benchmark]: Toolchain (without parser) took 2529.62 ms. Allocated memory was 401.6 MB in the beginning and 650.6 MB in the end (delta: 249.0 MB). Free memory was 359.6 MB in the beginning and 571.4 MB in the end (delta: -211.7 MB). Peak memory consumption was 37.3 MB. Max. memory is 5.3 GB. [2018-02-04 14:58:27,216 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 401.6 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 14:58:27,216 INFO L168 Benchmark]: CACSL2BoogieTranslator took 151.72 ms. Allocated memory is still 401.6 MB. Free memory was 358.3 MB in the beginning and 349.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. [2018-02-04 14:58:27,216 INFO L168 Benchmark]: Boogie Preprocessor took 22.86 ms. Allocated memory is still 401.6 MB. Free memory was 349.0 MB in the beginning and 346.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 14:58:27,216 INFO L168 Benchmark]: RCFGBuilder took 175.74 ms. Allocated memory is still 401.6 MB. Free memory was 346.4 MB in the beginning and 329.1 MB in the end (delta: 17.3 MB). Peak memory consumption was 17.3 MB. Max. memory is 5.3 GB. [2018-02-04 14:58:27,216 INFO L168 Benchmark]: TraceAbstraction took 2176.63 ms. Allocated memory was 401.6 MB in the beginning and 650.6 MB in the end (delta: 249.0 MB). Free memory was 329.1 MB in the beginning and 571.4 MB in the end (delta: -242.3 MB). Peak memory consumption was 6.8 MB. Max. memory is 5.3 GB. [2018-02-04 14:58:27,217 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.11 ms. Allocated memory is still 401.6 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 151.72 ms. Allocated memory is still 401.6 MB. Free memory was 358.3 MB in the beginning and 349.0 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.86 ms. Allocated memory is still 401.6 MB. Free memory was 349.0 MB in the beginning and 346.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 175.74 ms. Allocated memory is still 401.6 MB. Free memory was 346.4 MB in the beginning and 329.1 MB in the end (delta: 17.3 MB). Peak memory consumption was 17.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2176.63 ms. Allocated memory was 401.6 MB in the beginning and 650.6 MB in the end (delta: 249.0 MB). Free memory was 329.1 MB in the beginning and 571.4 MB in the end (delta: -242.3 MB). Peak memory consumption was 6.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: 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 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 41 locations, 9 error locations. SAFE Result, 2.1s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 252 SDtfs, 353 SDslu, 554 SDs, 0 SdLazy, 586 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 9/42 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, 19 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 184 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 175 ConstructedInterpolants, 0 QuantifiedInterpolants, 32989 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 9/42 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/cstrchr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_14-58-27-221.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrchr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_14-58-27-221.csv Received shutdown request...