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_cstrcmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 01:47:49,494 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 01:47:49,495 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 01:47:49,507 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 01:47:49,507 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 01:47:49,508 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 01:47:49,509 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 01:47:49,510 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 01:47:49,512 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 01:47:49,512 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 01:47:49,513 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 01:47:49,513 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 01:47:49,514 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 01:47:49,515 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 01:47:49,516 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 01:47:49,517 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 01:47:49,519 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 01:47:49,520 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 01:47:49,521 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 01:47:49,522 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 01:47:49,524 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 01:47:49,524 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 01:47:49,524 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 01:47:49,525 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 01:47:49,526 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 01:47:49,526 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 01:47:49,527 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 01:47:49,527 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 01:47:49,527 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 01:47:49,527 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 01:47:49,528 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 01:47:49,528 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 01:47:49,537 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 01:47:49,537 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 01:47:49,538 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 01:47:49,538 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 01:47:49,538 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 01:47:49,538 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 01:47:49,539 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 01:47:49,539 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 01:47:49,539 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 01:47:49,539 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 01:47:49,539 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 01:47:49,539 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 01:47:49,539 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 01:47:49,539 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 01:47:49,539 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 01:47:49,539 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 01:47:49,539 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 01:47:49,540 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 01:47:49,540 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 01:47:49,540 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 01:47:49,540 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 01:47:49,540 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 01:47:49,540 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 01:47:49,567 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 01:47:49,575 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 01:47:49,577 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 01:47:49,578 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 01:47:49,578 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 01:47:49,579 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-02-04 01:47:49,701 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 01:47:49,702 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 01:47:49,702 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 01:47:49,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 01:47:49,707 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 01:47:49,707 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:47:49" (1/1) ... [2018-02-04 01:47:49,709 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3290021f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:47:49, skipping insertion in model container [2018-02-04 01:47:49,710 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:47:49" (1/1) ... [2018-02-04 01:47:49,719 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:47:49,746 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:47:49,838 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:47:49,850 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:47:49,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:47:49 WrapperNode [2018-02-04 01:47:49,856 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 01:47:49,856 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 01:47:49,856 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 01:47:49,857 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 01:47:49,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:47:49" (1/1) ... [2018-02-04 01:47:49,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:47:49" (1/1) ... [2018-02-04 01:47:49,878 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:47:49" (1/1) ... [2018-02-04 01:47:49,878 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:47:49" (1/1) ... [2018-02-04 01:47:49,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:47:49" (1/1) ... [2018-02-04 01:47:49,883 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:47:49" (1/1) ... [2018-02-04 01:47:49,884 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:47:49" (1/1) ... [2018-02-04 01:47:49,885 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 01:47:49,885 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 01:47:49,885 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 01:47:49,885 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 01:47:49,886 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:47:49" (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 01:47:49,920 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 01:47:49,920 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 01:47:49,921 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcmp [2018-02-04 01:47:49,921 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 01:47:49,921 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 01:47:49,921 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 01:47:49,921 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 01:47:49,921 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 01:47:49,921 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 01:47:49,921 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 01:47:49,921 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcmp [2018-02-04 01:47:49,921 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 01:47:49,921 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 01:47:49,921 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 01:47:50,090 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 01:47:50,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:47:50 BoogieIcfgContainer [2018-02-04 01:47:50,091 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 01:47:50,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 01:47:50,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 01:47:50,093 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 01:47:50,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:47:49" (1/3) ... [2018-02-04 01:47:50,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@301b1092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:47:50, skipping insertion in model container [2018-02-04 01:47:50,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:47:49" (2/3) ... [2018-02-04 01:47:50,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@301b1092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:47:50, skipping insertion in model container [2018-02-04 01:47:50,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:47:50" (3/3) ... [2018-02-04 01:47:50,095 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-02-04 01:47:50,100 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 01:47:50,105 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-04 01:47:50,140 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 01:47:50,140 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 01:47:50,140 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 01:47:50,140 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 01:47:50,140 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 01:47:50,140 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 01:47:50,141 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 01:47:50,141 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 01:47:50,141 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 01:47:50,152 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-02-04 01:47:50,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 01:47:50,160 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:47:50,161 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:47:50,162 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:47:50,166 INFO L82 PathProgramCache]: Analyzing trace with hash 955833556, now seen corresponding path program 1 times [2018-02-04 01:47:50,212 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:47:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:47:50,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:47:50,355 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 01:47:50,357 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:47:50,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:47:50,358 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:47:50,358 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 01:47:50,358 INFO L182 omatonBuilderFactory]: Interpolants [56#true, 57#false, 58#(= (select |#valid| |main_#t~malloc10.base|) 1), 59#(= 1 (select |#valid| main_~nondetString1~0.base))] [2018-02-04 01:47:50,358 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 01:47:50,359 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:47:50,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:47:50,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:47:50,372 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 4 states. [2018-02-04 01:47:50,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:47:50,504 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-02-04 01:47:50,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 01:47:50,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 01:47:50,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:47:50,514 INFO L225 Difference]: With dead ends: 52 [2018-02-04 01:47:50,514 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 01:47:50,516 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 01:47:50,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 01:47:50,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-04 01:47:50,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 01:47:50,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-02-04 01:47:50,545 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 13 [2018-02-04 01:47:50,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:47:50,545 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-02-04 01:47:50,545 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:47:50,545 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-02-04 01:47:50,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 01:47:50,545 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:47:50,545 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:47:50,546 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:47:50,546 INFO L82 PathProgramCache]: Analyzing trace with hash 955833557, now seen corresponding path program 1 times [2018-02-04 01:47:50,546 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:47:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:47:50,560 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:47:50,632 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 01:47:50,632 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:47:50,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:47:50,633 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:47:50,633 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 01:47:50,633 INFO L182 omatonBuilderFactory]: Interpolants [163#true, 164#false, 165#(<= 1 main_~length1~0), 166#(and (= 0 |main_#t~malloc10.offset|) (<= 1 main_~length1~0) (= main_~length1~0 (select |#length| |main_#t~malloc10.base|)) (= (select |#valid| |main_#t~malloc10.base|) 1)), 167#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 168#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0))] [2018-02-04 01:47:50,633 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 01:47:50,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:47:50,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:47:50,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:47:50,636 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 6 states. [2018-02-04 01:47:50,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:47:50,685 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2018-02-04 01:47:50,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:47:50,686 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-04 01:47:50,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:47:50,687 INFO L225 Difference]: With dead ends: 48 [2018-02-04 01:47:50,687 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 01:47:50,687 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-02-04 01:47:50,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 01:47:50,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-04 01:47:50,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 01:47:50,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-02-04 01:47:50,692 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 13 [2018-02-04 01:47:50,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:47:50,692 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-02-04 01:47:50,692 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:47:50,692 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2018-02-04 01:47:50,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 01:47:50,693 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:47:50,693 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:47:50,693 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:47:50,693 INFO L82 PathProgramCache]: Analyzing trace with hash -433930803, now seen corresponding path program 1 times [2018-02-04 01:47:50,694 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:47:50,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:47:50,706 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:47:50,758 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 01:47:50,758 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:47:50,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 01:47:50,758 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:47:50,759 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 01:47:50,759 INFO L182 omatonBuilderFactory]: Interpolants [267#true, 268#false, 269#(<= 1 main_~length2~0), 270#(and (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|)), 271#(and (= main_~nondetString2~0.offset 0) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base)))] [2018-02-04 01:47:50,759 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 01:47:50,759 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:47:50,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:47:50,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:47:50,760 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 5 states. [2018-02-04 01:47:50,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:47:50,793 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-02-04 01:47:50,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:47:50,793 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 01:47:50,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:47:50,794 INFO L225 Difference]: With dead ends: 47 [2018-02-04 01:47:50,794 INFO L226 Difference]: Without dead ends: 47 [2018-02-04 01:47:50,794 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 01:47:50,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-04 01:47:50,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-04 01:47:50,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-04 01:47:50,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-02-04 01:47:50,798 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 14 [2018-02-04 01:47:50,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:47:50,798 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-02-04 01:47:50,799 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:47:50,799 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-02-04 01:47:50,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 01:47:50,799 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:47:50,799 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:47:50,799 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:47:50,800 INFO L82 PathProgramCache]: Analyzing trace with hash -433930804, now seen corresponding path program 1 times [2018-02-04 01:47:50,800 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:47:50,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:47:50,811 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:47:50,830 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 01:47:50,830 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:47:50,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:47:50,831 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:47:50,831 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 01:47:50,831 INFO L182 omatonBuilderFactory]: Interpolants [368#true, 369#false, 370#(= 1 (select |#valid| |main_#t~malloc11.base|)), 371#(= 1 (select |#valid| main_~nondetString2~0.base))] [2018-02-04 01:47:50,831 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 01:47:50,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:47:50,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:47:50,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:47:50,832 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 4 states. [2018-02-04 01:47:50,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:47:50,909 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-02-04 01:47:50,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 01:47:50,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 01:47:50,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:47:50,915 INFO L225 Difference]: With dead ends: 46 [2018-02-04 01:47:50,916 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 01:47:50,916 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 01:47:50,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 01:47:50,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-04 01:47:50,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 01:47:50,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-02-04 01:47:50,920 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 14 [2018-02-04 01:47:50,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:47:50,920 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-02-04 01:47:50,920 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:47:50,920 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-02-04 01:47:50,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 01:47:50,920 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:47:50,920 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:47:50,920 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:47:50,921 INFO L82 PathProgramCache]: Analyzing trace with hash 2009852195, now seen corresponding path program 1 times [2018-02-04 01:47:50,921 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:47:50,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:47:50,932 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:47:50,969 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 01:47:50,969 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:47:50,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 01:47:50,970 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:47:50,970 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 01:47:50,970 INFO L182 omatonBuilderFactory]: Interpolants [466#true, 467#false, 468#(= 1 (select |#valid| main_~nondetString1~0.base)), 469#(= 1 (select |#valid| |cstrcmp_#in~s1.base|)), 470#(= 1 (select |#valid| cstrcmp_~s1.base))] [2018-02-04 01:47:50,970 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 01:47:50,970 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:47:50,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:47:50,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:47:50,971 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 5 states. [2018-02-04 01:47:51,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:47:51,010 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-02-04 01:47:51,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 01:47:51,010 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-04 01:47:51,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:47:51,010 INFO L225 Difference]: With dead ends: 44 [2018-02-04 01:47:51,010 INFO L226 Difference]: Without dead ends: 44 [2018-02-04 01:47:51,011 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 01:47:51,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-04 01:47:51,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-02-04 01:47:51,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-04 01:47:51,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-02-04 01:47:51,013 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 18 [2018-02-04 01:47:51,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:47:51,013 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2018-02-04 01:47:51,013 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:47:51,013 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-02-04 01:47:51,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 01:47:51,013 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:47:51,013 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:47:51,013 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:47:51,014 INFO L82 PathProgramCache]: Analyzing trace with hash 2009852196, now seen corresponding path program 1 times [2018-02-04 01:47:51,014 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:47:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:47:51,021 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:47:51,076 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 01:47:51,076 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:47:51,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 01:47:51,076 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:47:51,076 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 01:47:51,077 INFO L182 omatonBuilderFactory]: Interpolants [561#true, 562#false, 563#(<= 1 main_~length1~0), 564#(and (= 0 |main_#t~malloc10.offset|) (<= 1 main_~length1~0)), 565#(and (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 566#(and (<= (+ main_~nondetString1~0.offset 1) (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 567#(and (<= 1 (select |#length| |cstrcmp_#in~s1.base|)) (= 0 |cstrcmp_#in~s1.offset|)), 568#(and (<= 1 (select |#length| cstrcmp_~s1.base)) (= cstrcmp_~s1.offset 0))] [2018-02-04 01:47:51,077 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 01:47:51,077 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 01:47:51,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 01:47:51,077 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:47:51,078 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 8 states. [2018-02-04 01:47:51,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:47:51,160 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-02-04 01:47:51,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 01:47:51,161 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-02-04 01:47:51,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:47:51,164 INFO L225 Difference]: With dead ends: 59 [2018-02-04 01:47:51,164 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 01:47:51,164 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-02-04 01:47:51,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 01:47:51,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2018-02-04 01:47:51,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 01:47:51,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-02-04 01:47:51,168 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 18 [2018-02-04 01:47:51,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:47:51,168 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-02-04 01:47:51,168 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 01:47:51,168 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-02-04 01:47:51,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 01:47:51,169 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:47:51,169 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:47:51,169 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:47:51,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1267324412, now seen corresponding path program 1 times [2018-02-04 01:47:51,169 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:47:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:47:51,178 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:47:51,204 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 01:47:51,204 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:47:51,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:47:51,204 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:47:51,204 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 01:47:51,205 INFO L182 omatonBuilderFactory]: Interpolants [688#(= 1 (select |#valid| main_~nondetString2~0.base)), 689#(= 1 (select |#valid| |cstrcmp_#in~s2.base|)), 690#(= 1 (select |#valid| cstrcmp_~s2.base)), 691#(= 1 (select |#valid| |cstrcmp_#t~post0.base|)), 686#true, 687#false] [2018-02-04 01:47:51,205 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 01:47:51,205 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:47:51,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:47:51,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:47:51,205 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 6 states. [2018-02-04 01:47:51,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:47:51,258 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-02-04 01:47:51,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:47:51,258 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-02-04 01:47:51,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:47:51,259 INFO L225 Difference]: With dead ends: 49 [2018-02-04 01:47:51,259 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 01:47:51,259 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:47:51,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 01:47:51,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-04 01:47:51,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 01:47:51,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-02-04 01:47:51,262 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 20 [2018-02-04 01:47:51,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:47:51,262 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-02-04 01:47:51,263 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:47:51,263 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-02-04 01:47:51,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 01:47:51,263 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:47:51,263 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:47:51,263 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:47:51,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1267324411, now seen corresponding path program 1 times [2018-02-04 01:47:51,264 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:47:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:47:51,273 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:47:51,356 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 01:47:51,356 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:47:51,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 01:47:51,357 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:47:51,357 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 01:47:51,357 INFO L182 omatonBuilderFactory]: Interpolants [800#(and (<= 1 (select |#length| |cstrcmp_#in~s2.base|)) (= 0 |cstrcmp_#in~s2.offset|)), 801#(and (= 0 cstrcmp_~s2.offset) (<= 1 (select |#length| cstrcmp_~s2.base))), 802#(and (= |cstrcmp_#t~post0.offset| 0) (<= 1 (select |#length| |cstrcmp_#t~post0.base|))), 794#true, 795#false, 796#(<= 1 main_~length2~0), 797#(and (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|)), 798#(and (= 0 main_~nondetString2~0.offset) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 799#(and (= 0 main_~nondetString2~0.offset) (<= 1 (select |#length| main_~nondetString2~0.base)))] [2018-02-04 01:47:51,357 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 01:47:51,358 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 01:47:51,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 01:47:51,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 01:47:51,358 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 9 states. [2018-02-04 01:47:51,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:47:51,449 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-02-04 01:47:51,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 01:47:51,449 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-02-04 01:47:51,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:47:51,450 INFO L225 Difference]: With dead ends: 49 [2018-02-04 01:47:51,450 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 01:47:51,450 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-02-04 01:47:51,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 01:47:51,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-04 01:47:51,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 01:47:51,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-02-04 01:47:51,452 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 20 [2018-02-04 01:47:51,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:47:51,452 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-02-04 01:47:51,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 01:47:51,452 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-02-04 01:47:51,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 01:47:51,452 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:47:51,452 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 01:47:51,453 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:47:51,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1871951781, now seen corresponding path program 1 times [2018-02-04 01:47:51,453 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:47:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:47:51,459 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:47:51,477 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 01:47:51,477 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:47:51,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:47:51,477 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:47:51,477 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 01:47:51,478 INFO L182 omatonBuilderFactory]: Interpolants [912#(= 1 (select |#valid| |cstrcmp_#t~post3.base|)), 907#true, 908#false, 909#(= 1 (select |#valid| main_~nondetString1~0.base)), 910#(= 1 (select |#valid| |cstrcmp_#in~s1.base|)), 911#(= 1 (select |#valid| cstrcmp_~s1.base))] [2018-02-04 01:47:51,478 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 01:47:51,478 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:47:51,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:47:51,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:47:51,478 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 6 states. [2018-02-04 01:47:51,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:47:51,529 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-02-04 01:47:51,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:47:51,529 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-04 01:47:51,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:47:51,530 INFO L225 Difference]: With dead ends: 48 [2018-02-04 01:47:51,530 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 01:47:51,530 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:47:51,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 01:47:51,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-04 01:47:51,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 01:47:51,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-02-04 01:47:51,532 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 22 [2018-02-04 01:47:51,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:47:51,532 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-02-04 01:47:51,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:47:51,532 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-02-04 01:47:51,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 01:47:51,532 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:47:51,532 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 01:47:51,532 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:47:51,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1871951782, now seen corresponding path program 1 times [2018-02-04 01:47:51,533 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:47:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:47:51,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:47:51,601 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 01:47:51,601 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:47:51,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 01:47:51,602 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:47:51,602 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 01:47:51,602 INFO L182 omatonBuilderFactory]: Interpolants [1013#true, 1014#false, 1015#(= 0 |main_#t~malloc10.offset|), 1016#(= 0 main_~nondetString1~0.offset), 1017#(= 0 |cstrcmp_#in~s1.offset|), 1018#(= cstrcmp_~s1.offset 0), 1019#(and (<= (+ cstrcmp_~s1.offset 1) (select |#length| cstrcmp_~s1.base)) (= cstrcmp_~s1.offset 0)), 1020#(and (= |cstrcmp_#t~post3.offset| 0) (<= 1 (select |#length| |cstrcmp_#t~post3.base|)))] [2018-02-04 01:47:51,602 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 01:47:51,602 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 01:47:51,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 01:47:51,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:47:51,602 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 8 states. [2018-02-04 01:47:51,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:47:51,680 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-02-04 01:47:51,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 01:47:51,680 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-02-04 01:47:51,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:47:51,681 INFO L225 Difference]: With dead ends: 57 [2018-02-04 01:47:51,681 INFO L226 Difference]: Without dead ends: 57 [2018-02-04 01:47:51,682 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-02-04 01:47:51,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-04 01:47:51,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2018-02-04 01:47:51,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 01:47:51,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-02-04 01:47:51,685 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 22 [2018-02-04 01:47:51,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:47:51,685 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-02-04 01:47:51,685 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 01:47:51,685 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-02-04 01:47:51,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 01:47:51,685 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:47:51,686 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] [2018-02-04 01:47:51,686 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:47:51,686 INFO L82 PathProgramCache]: Analyzing trace with hash -645685358, now seen corresponding path program 1 times [2018-02-04 01:47:51,686 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:47:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:47:51,694 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:47:51,718 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 01:47:51,719 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:47:51,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:47:51,719 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:47:51,719 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 01:47:51,719 INFO L182 omatonBuilderFactory]: Interpolants [1136#false, 1137#(= 1 (select |#valid| main_~nondetString2~0.base)), 1138#(= 1 (select |#valid| |cstrcmp_#in~s2.base|)), 1139#(= 1 (select |#valid| cstrcmp_~s2.base)), 1140#(= 1 (select |#valid| |cstrcmp_#t~pre5.base|)), 1135#true] [2018-02-04 01:47:51,719 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 01:47:51,720 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:47:51,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:47:51,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:47:51,720 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 6 states. [2018-02-04 01:47:51,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:47:51,775 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-02-04 01:47:51,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:47:51,776 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 01:47:51,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:47:51,777 INFO L225 Difference]: With dead ends: 48 [2018-02-04 01:47:51,777 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 01:47:51,777 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:47:51,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 01:47:51,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-04 01:47:51,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 01:47:51,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-02-04 01:47:51,781 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 24 [2018-02-04 01:47:51,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:47:51,781 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-02-04 01:47:51,781 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:47:51,781 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-02-04 01:47:51,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 01:47:51,782 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:47:51,782 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] [2018-02-04 01:47:51,782 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:47:51,782 INFO L82 PathProgramCache]: Analyzing trace with hash -645685357, now seen corresponding path program 1 times [2018-02-04 01:47:51,783 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:47:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:47:51,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:47:51,855 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 01:47:51,855 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:47:51,855 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 01:47:51,855 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:47:51,856 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 01:47:51,856 INFO L182 omatonBuilderFactory]: Interpolants [1248#(and (<= 1 cstrcmp_~s2.offset) (<= cstrcmp_~s2.offset (select |#length| cstrcmp_~s2.base))), 1249#(and (<= 0 |cstrcmp_#t~pre5.offset|) (<= (+ |cstrcmp_#t~pre5.offset| 1) (select |#length| |cstrcmp_#t~pre5.base|))), 1241#true, 1242#false, 1243#(= 0 |main_#t~malloc11.offset|), 1244#(= 0 main_~nondetString2~0.offset), 1245#(= 0 |cstrcmp_#in~s2.offset|), 1246#(= 0 cstrcmp_~s2.offset), 1247#(and (<= (+ |cstrcmp_#t~post0.offset| 1) cstrcmp_~s2.offset) (= |cstrcmp_#t~post0.offset| 0) (= |cstrcmp_#t~post0.base| cstrcmp_~s2.base) (<= cstrcmp_~s2.offset (+ |cstrcmp_#t~post0.offset| 1)))] [2018-02-04 01:47:51,856 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 01:47:51,856 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 01:47:51,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 01:47:51,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-04 01:47:51,857 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 9 states. [2018-02-04 01:47:51,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:47:51,997 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-02-04 01:47:51,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 01:47:51,998 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-02-04 01:47:51,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:47:51,998 INFO L225 Difference]: With dead ends: 57 [2018-02-04 01:47:51,999 INFO L226 Difference]: Without dead ends: 57 [2018-02-04 01:47:51,999 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-02-04 01:47:51,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-04 01:47:52,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2018-02-04 01:47:52,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 01:47:52,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-02-04 01:47:52,002 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 24 [2018-02-04 01:47:52,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:47:52,002 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-02-04 01:47:52,002 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 01:47:52,002 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-02-04 01:47:52,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 01:47:52,003 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:47:52,003 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:47:52,003 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:47:52,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1460131898, now seen corresponding path program 1 times [2018-02-04 01:47:52,004 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:47:52,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:47:52,014 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:47:52,147 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 01:47:52,147 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:47:52,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 01:47:52,147 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:47:52,152 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 01:47:52,152 INFO L182 omatonBuilderFactory]: Interpolants [1376#(and (= 0 (select (select (store |#memory_int| main_~nondetString2~0.base (store (select |#memory_int| main_~nondetString2~0.base) (+ main_~length2~0 main_~nondetString2~0.offset (- 1)) 0)) main_~nondetString1~0.base) main_~nondetString1~0.offset)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 1377#(= 0 (select (select |#memory_int| |cstrcmp_#in~s1.base|) |cstrcmp_#in~s1.offset|)), 1378#(= 0 (select (select |#memory_int| cstrcmp_~s1.base) cstrcmp_~s1.offset)), 1379#(= 0 (select (select |#memory_int| |cstrcmp_#t~post3.base|) |cstrcmp_#t~post3.offset|)), 1380#(= 0 |cstrcmp_#t~mem4|), 1369#true, 1370#false, 1371#(and (<= 1 main_~length1~0) (<= main_~length1~0 1)), 1372#(and (= 0 |main_#t~malloc10.offset|) (<= 1 main_~length1~0) (<= main_~length1~0 1) (= (select |#valid| |main_#t~malloc10.base|) 1)), 1373#(and (= (select |#valid| main_~nondetString1~0.base) 1) (<= 1 main_~length1~0) (<= main_~length1~0 1) (= main_~nondetString1~0.offset 0)), 1374#(and (not (= main_~nondetString1~0.base |main_#t~malloc11.base|)) (<= 1 main_~length1~0) (<= main_~length1~0 1) (= main_~nondetString1~0.offset 0)), 1375#(and (<= 1 main_~length1~0) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (<= main_~length1~0 1) (= main_~nondetString1~0.offset 0))] [2018-02-04 01:47:52,152 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 01:47:52,153 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 01:47:52,153 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 01:47:52,153 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-04 01:47:52,153 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 12 states. [2018-02-04 01:47:52,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:47:52,298 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-02-04 01:47:52,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 01:47:52,299 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-02-04 01:47:52,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:47:52,299 INFO L225 Difference]: With dead ends: 81 [2018-02-04 01:47:52,299 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 01:47:52,300 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-02-04 01:47:52,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 01:47:52,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2018-02-04 01:47:52,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 01:47:52,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-02-04 01:47:52,302 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 25 [2018-02-04 01:47:52,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:47:52,303 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-02-04 01:47:52,303 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 01:47:52,303 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-02-04 01:47:52,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 01:47:52,304 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:47:52,304 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:47:52,304 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:47:52,304 INFO L82 PathProgramCache]: Analyzing trace with hash -228811844, now seen corresponding path program 1 times [2018-02-04 01:47:52,305 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:47:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:47:52,315 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:47:52,468 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 01:47:52,468 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:47:52,468 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 01:47:52,468 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:47:52,469 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 01:47:52,469 INFO L182 omatonBuilderFactory]: Interpolants [1552#true, 1553#false, 1554#(<= 1 main_~length1~0), 1555#(and (= 0 |main_#t~malloc10.offset|) (<= 1 main_~length1~0) (= (select |#valid| |main_#t~malloc10.base|) 1)), 1556#(and (or (not (= (+ main_~nondetString1~0.offset main_~length1~0) 1)) (= (select |#valid| main_~nondetString1~0.base) 1)) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 1557#(and (or (not (= (+ main_~nondetString1~0.offset main_~length1~0) 1)) (not (= main_~nondetString1~0.base |main_#t~malloc11.base|))) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 1558#(and (or (not (= (+ main_~nondetString1~0.offset main_~length1~0) 1)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 1559#(and (= 0 main_~nondetString1~0.offset) (or (and (= 0 (select (select (store |#memory_int| main_~nondetString2~0.base (store (select |#memory_int| main_~nondetString2~0.base) (+ main_~length2~0 main_~nondetString2~0.offset (- 1)) 0)) main_~nondetString1~0.base) main_~nondetString1~0.offset)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))) (<= 2 (select |#length| main_~nondetString1~0.base)))), 1560#(and (= 0 |cstrcmp_#in~s1.offset|) (or (<= 2 (select |#length| |cstrcmp_#in~s1.base|)) (= 0 (select (select |#memory_int| |cstrcmp_#in~s1.base|) |cstrcmp_#in~s1.offset|)))), 1561#(and (= 0 cstrcmp_~s1.offset) (or (<= 2 (select |#length| cstrcmp_~s1.base)) (= 0 (select (select |#memory_int| cstrcmp_~s1.base) cstrcmp_~s1.offset)))), 1562#(and (= |cstrcmp_#t~post3.offset| 0) (or (= 0 (select (select |#memory_int| |cstrcmp_#t~post3.base|) |cstrcmp_#t~post3.offset|)) (<= (+ cstrcmp_~s1.offset 1) (+ (select |#length| cstrcmp_~s1.base) |cstrcmp_#t~post3.offset|))) (<= (+ |cstrcmp_#t~post3.offset| 1) cstrcmp_~s1.offset)), 1563#(and (or (<= (+ cstrcmp_~s1.offset 1) (select |#length| cstrcmp_~s1.base)) (= 0 |cstrcmp_#t~mem4|)) (<= 1 cstrcmp_~s1.offset)), 1564#(and (<= (+ cstrcmp_~s1.offset 1) (select |#length| cstrcmp_~s1.base)) (<= 1 cstrcmp_~s1.offset))] [2018-02-04 01:47:52,469 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 01:47:52,469 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 01:47:52,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 01:47:52,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-04 01:47:52,470 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 13 states. [2018-02-04 01:47:52,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:47:52,797 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2018-02-04 01:47:52,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 01:47:52,798 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2018-02-04 01:47:52,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:47:52,799 INFO L225 Difference]: With dead ends: 91 [2018-02-04 01:47:52,799 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 01:47:52,799 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2018-02-04 01:47:52,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 01:47:52,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2018-02-04 01:47:52,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-04 01:47:52,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2018-02-04 01:47:52,803 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 25 [2018-02-04 01:47:52,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:47:52,803 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2018-02-04 01:47:52,804 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 01:47:52,804 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2018-02-04 01:47:52,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 01:47:52,804 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:47:52,804 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:47:52,804 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:47:52,805 INFO L82 PathProgramCache]: Analyzing trace with hash -844851555, now seen corresponding path program 1 times [2018-02-04 01:47:52,805 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:47:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:47:52,813 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:47:52,919 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:47:52,919 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:47:52,919 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 01:47:52,919 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:47:52,920 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 01:47:52,920 INFO L182 omatonBuilderFactory]: Interpolants [1760#(and (= main_~nondetString2~0.offset 0) (= 0 (select (select |#memory_int| main_~nondetString2~0.base) main_~nondetString2~0.offset))), 1761#(= 0 (select (select |#memory_int| |cstrcmp_#in~s2.base|) |cstrcmp_#in~s2.offset|)), 1762#(= 0 (select (select |#memory_int| cstrcmp_~s2.base) cstrcmp_~s2.offset)), 1763#(and (= (select (select |#memory_int| cstrcmp_~s1.base) cstrcmp_~s1.offset) |cstrcmp_#t~mem1|) (= 0 (select (select |#memory_int| cstrcmp_~s2.base) cstrcmp_~s2.offset))), 1764#(and (= (select (select |#memory_int| cstrcmp_~s1.base) cstrcmp_~s1.offset) |cstrcmp_#t~mem1|) (= 0 (select (select |#memory_int| |cstrcmp_#t~post0.base|) |cstrcmp_#t~post0.offset|))), 1765#(and (= (select (select |#memory_int| cstrcmp_~s1.base) cstrcmp_~s1.offset) |cstrcmp_#t~mem1|) (= 0 |cstrcmp_#t~mem2|)), 1766#(= 0 (select (select |#memory_int| |cstrcmp_#t~post3.base|) |cstrcmp_#t~post3.offset|)), 1767#(= 0 |cstrcmp_#t~mem4|), 1755#true, 1756#false, 1757#(and (<= main_~length2~0 1) (<= 1 main_~length2~0)), 1758#(and (<= main_~length2~0 1) (<= 1 main_~length2~0) (= 0 |main_#t~malloc11.offset|)), 1759#(and (= main_~nondetString2~0.offset 0) (<= 1 main_~length2~0) (<= (+ main_~nondetString2~0.offset main_~length2~0) 1))] [2018-02-04 01:47:52,920 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:47:52,921 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 01:47:52,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 01:47:52,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-04 01:47:52,921 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand 13 states. [2018-02-04 01:47:53,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:47:53,094 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2018-02-04 01:47:53,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 01:47:53,094 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-02-04 01:47:53,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:47:53,095 INFO L225 Difference]: With dead ends: 128 [2018-02-04 01:47:53,095 INFO L226 Difference]: Without dead ends: 128 [2018-02-04 01:47:53,096 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2018-02-04 01:47:53,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-04 01:47:53,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 79. [2018-02-04 01:47:53,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-04 01:47:53,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2018-02-04 01:47:53,099 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 27 [2018-02-04 01:47:53,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:47:53,099 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2018-02-04 01:47:53,099 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 01:47:53,099 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2018-02-04 01:47:53,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 01:47:53,100 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:47:53,100 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:47:53,100 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:47:53,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1662500005, now seen corresponding path program 1 times [2018-02-04 01:47:53,101 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:47:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:47:53,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:47:53,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:47:53,261 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:47:53,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 01:47:53,261 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:47:53,261 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 01:47:53,262 INFO L182 omatonBuilderFactory]: Interpolants [1993#true, 1994#false, 1995#(<= 1 main_~length2~0), 1996#(and (<= 1 main_~length2~0) (= 0 |main_#t~malloc11.offset|)), 1997#(and (= 0 main_~nondetString2~0.offset) (<= 1 main_~length2~0)), 1998#(and (= 0 main_~nondetString2~0.offset) (or (= 0 (select (select |#memory_int| main_~nondetString2~0.base) main_~nondetString2~0.offset)) (<= 2 (select |#length| main_~nondetString2~0.base)))), 1999#(and (= 0 |cstrcmp_#in~s2.offset|) (or (<= 2 (select |#length| |cstrcmp_#in~s2.base|)) (= 0 (select (select |#memory_int| |cstrcmp_#in~s2.base|) |cstrcmp_#in~s2.offset|)))), 2000#(and (= 0 cstrcmp_~s2.offset) (or (<= 2 (select |#length| cstrcmp_~s2.base)) (= 0 (select (select |#memory_int| cstrcmp_~s2.base) cstrcmp_~s2.offset)))), 2001#(and (= 0 cstrcmp_~s2.offset) (or (and (= (select (select |#memory_int| cstrcmp_~s1.base) cstrcmp_~s1.offset) |cstrcmp_#t~mem1|) (= 0 (select (select |#memory_int| cstrcmp_~s2.base) cstrcmp_~s2.offset))) (<= 2 (select |#length| cstrcmp_~s2.base)))), 2002#(and (= |cstrcmp_#t~post0.offset| 0) (or (and (<= (+ |cstrcmp_#t~post0.offset| 1) cstrcmp_~s2.offset) (= |cstrcmp_#t~post0.base| cstrcmp_~s2.base) (<= (+ cstrcmp_~s2.offset 1) (+ |cstrcmp_#t~post0.offset| (select |#length| |cstrcmp_#t~post0.base|)))) (and (= (select (select |#memory_int| cstrcmp_~s1.base) cstrcmp_~s1.offset) |cstrcmp_#t~mem1|) (= 0 (select (select |#memory_int| |cstrcmp_#t~post0.base|) |cstrcmp_#t~post0.offset|))))), 2003#(or (and (<= (+ cstrcmp_~s2.offset 1) (select |#length| cstrcmp_~s2.base)) (<= 1 cstrcmp_~s2.offset)) (and (= (select (select |#memory_int| cstrcmp_~s1.base) cstrcmp_~s1.offset) |cstrcmp_#t~mem1|) (= 0 |cstrcmp_#t~mem2|))), 2004#(or (= 0 (select (select |#memory_int| |cstrcmp_#t~post3.base|) |cstrcmp_#t~post3.offset|)) (and (<= (+ cstrcmp_~s2.offset 1) (select |#length| cstrcmp_~s2.base)) (<= 1 cstrcmp_~s2.offset))), 2005#(or (= 0 |cstrcmp_#t~mem4|) (and (<= (+ cstrcmp_~s2.offset 1) (select |#length| cstrcmp_~s2.base)) (<= 1 cstrcmp_~s2.offset))), 2006#(and (<= (+ cstrcmp_~s2.offset 1) (select |#length| cstrcmp_~s2.base)) (<= 1 cstrcmp_~s2.offset)), 2007#(and (<= (+ |cstrcmp_#t~post0.offset| 1) (select |#length| |cstrcmp_#t~post0.base|)) (<= 1 |cstrcmp_#t~post0.offset|))] [2018-02-04 01:47:53,262 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:47:53,262 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 01:47:53,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 01:47:53,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-04 01:47:53,262 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand 15 states. [2018-02-04 01:47:53,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:47:53,542 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2018-02-04 01:47:53,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 01:47:53,542 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2018-02-04 01:47:53,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:47:53,543 INFO L225 Difference]: With dead ends: 79 [2018-02-04 01:47:53,543 INFO L226 Difference]: Without dead ends: 79 [2018-02-04 01:47:53,543 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2018-02-04 01:47:53,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-04 01:47:53,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-02-04 01:47:53,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-04 01:47:53,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2018-02-04 01:47:53,545 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 27 [2018-02-04 01:47:53,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:47:53,545 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2018-02-04 01:47:53,545 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 01:47:53,545 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2018-02-04 01:47:53,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 01:47:53,546 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:47:53,546 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:47:53,546 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:47:53,546 INFO L82 PathProgramCache]: Analyzing trace with hash 65327996, now seen corresponding path program 1 times [2018-02-04 01:47:53,546 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:47:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:47:53,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:47:53,595 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:47:53,595 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:47:53,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 01:47:53,596 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:47:53,596 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 01:47:53,596 INFO L182 omatonBuilderFactory]: Interpolants [2192#(= 0 |cstrcmp_#in~s1.offset|), 2193#(= 0 cstrcmp_~s1.offset), 2194#(and (= |cstrcmp_#t~post3.offset| 0) (<= (+ |cstrcmp_#t~post3.offset| 1) cstrcmp_~s1.offset)), 2195#(<= 1 cstrcmp_~s1.offset), 2196#(and (<= (+ cstrcmp_~s1.offset 1) (select |#length| cstrcmp_~s1.base)) (<= 1 cstrcmp_~s1.offset)), 2197#(and (<= (+ |cstrcmp_#t~post3.offset| 1) (select |#length| |cstrcmp_#t~post3.base|)) (<= 1 |cstrcmp_#t~post3.offset|)), 2188#true, 2189#false, 2190#(= 0 |main_#t~malloc10.offset|), 2191#(= 0 main_~nondetString1~0.offset)] [2018-02-04 01:47:53,596 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:47:53,596 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 01:47:53,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 01:47:53,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-04 01:47:53,597 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 10 states. [2018-02-04 01:47:53,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:47:53,734 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2018-02-04 01:47:53,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 01:47:53,735 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-02-04 01:47:53,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:47:53,735 INFO L225 Difference]: With dead ends: 84 [2018-02-04 01:47:53,735 INFO L226 Difference]: Without dead ends: 84 [2018-02-04 01:47:53,736 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-02-04 01:47:53,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-04 01:47:53,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2018-02-04 01:47:53,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 01:47:53,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-02-04 01:47:53,738 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 29 [2018-02-04 01:47:53,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:47:53,739 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-02-04 01:47:53,739 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 01:47:53,739 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-02-04 01:47:53,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 01:47:53,740 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:47:53,740 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:47:53,740 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:47:53,740 INFO L82 PathProgramCache]: Analyzing trace with hash -580377695, now seen corresponding path program 1 times [2018-02-04 01:47:53,740 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:47:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:47:53,748 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:47:53,845 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 01:47:53,846 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:47:53,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 01:47:53,846 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:47:53,846 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 01:47:53,846 INFO L182 omatonBuilderFactory]: Interpolants [2369#true, 2370#false, 2371#(= |#valid| |old(#valid)|), 2372#(and (= |old(#valid)| (store |#valid| |main_#t~malloc10.base| 0)) (= (select |#valid| |main_#t~malloc10.base|) 1)), 2373#(and (= main_~nondetString1~0.base |main_#t~malloc10.base|) (= (select |#valid| main_~nondetString1~0.base) 1) (= |old(#valid)| (store |#valid| |main_#t~malloc10.base| 0))), 2374#(and (not (= |main_#t~malloc10.base| |main_#t~malloc11.base|)) (= |old(#valid)| (store (store |#valid| |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0))), 2375#(= |old(#valid)| (store |#valid| |main_#t~malloc11.base| 0))] [2018-02-04 01:47:53,846 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 01:47:53,847 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 01:47:53,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 01:47:53,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 01:47:53,847 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 7 states. [2018-02-04 01:47:53,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:47:53,929 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2018-02-04 01:47:53,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 01:47:53,929 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-02-04 01:47:53,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:47:53,929 INFO L225 Difference]: With dead ends: 74 [2018-02-04 01:47:53,929 INFO L226 Difference]: Without dead ends: 40 [2018-02-04 01:47:53,930 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-02-04 01:47:53,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-04 01:47:53,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-02-04 01:47:53,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-04 01:47:53,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-02-04 01:47:53,931 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 31 [2018-02-04 01:47:53,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:47:53,931 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-02-04 01:47:53,931 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 01:47:53,931 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-02-04 01:47:53,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 01:47:53,932 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:47:53,932 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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 01:47:53,932 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:47:53,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1644356119, now seen corresponding path program 1 times [2018-02-04 01:47:53,933 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:47:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:47:53,940 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:47:54,016 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:47:54,016 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:47:54,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 01:47:54,016 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:47:54,016 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 01:47:54,017 INFO L182 omatonBuilderFactory]: Interpolants [2496#(= 0 |main_#t~malloc11.offset|), 2497#(= 0 main_~nondetString2~0.offset), 2498#(= 0 |cstrcmp_#in~s2.offset|), 2499#(= 0 cstrcmp_~s2.offset), 2500#(and (<= (+ |cstrcmp_#t~post0.offset| 1) cstrcmp_~s2.offset) (= |cstrcmp_#t~post0.offset| 0) (= |cstrcmp_#t~post0.base| cstrcmp_~s2.base)), 2501#(<= 1 cstrcmp_~s2.offset), 2502#(and (<= (+ cstrcmp_~s2.offset (select |#length| |cstrcmp_#t~post0.base|)) (+ |cstrcmp_#t~post0.offset| (select |#length| cstrcmp_~s2.base) 1)) (<= 2 cstrcmp_~s2.offset)), 2503#(and (<= cstrcmp_~s2.offset (select |#length| cstrcmp_~s2.base)) (<= 2 cstrcmp_~s2.offset)), 2504#(and (<= (+ |cstrcmp_#t~pre5.offset| 1) (select |#length| |cstrcmp_#t~pre5.base|)) (<= 1 |cstrcmp_#t~pre5.offset|)), 2494#true, 2495#false] [2018-02-04 01:47:54,017 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:47:54,017 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 01:47:54,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 01:47:54,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 01:47:54,017 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 11 states. [2018-02-04 01:47:54,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:47:54,132 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-02-04 01:47:54,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 01:47:54,132 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-02-04 01:47:54,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:47:54,133 INFO L225 Difference]: With dead ends: 39 [2018-02-04 01:47:54,133 INFO L226 Difference]: Without dead ends: 36 [2018-02-04 01:47:54,133 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2018-02-04 01:47:54,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-04 01:47:54,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-04 01:47:54,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 01:47:54,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-02-04 01:47:54,134 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 31 [2018-02-04 01:47:54,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:47:54,135 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-02-04 01:47:54,135 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 01:47:54,135 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-02-04 01:47:54,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 01:47:54,135 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:47:54,135 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, 1, 1, 1] [2018-02-04 01:47:54,135 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:47:54,136 INFO L82 PathProgramCache]: Analyzing trace with hash 566109348, now seen corresponding path program 1 times [2018-02-04 01:47:54,136 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:47:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:47:54,146 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:47:54,415 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 01:47:54,415 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:47:54,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 01:47:54,415 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:47:54,416 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 01:47:54,416 INFO L182 omatonBuilderFactory]: Interpolants [2596#true, 2597#false, 2598#(and (= 0 |main_#t~malloc10.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc10.base|)) (= (select |#valid| |main_#t~malloc10.base|) 1)), 2599#(and (= 0 main_~nondetString1~0.offset) (= (select |#valid| main_~nondetString1~0.base) 1) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2))), 2600#(and (= 0 main_~nondetString1~0.offset) (not (= main_~nondetString1~0.base |main_#t~malloc11.base|)) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2))), 2601#(and (= 0 main_~nondetString1~0.offset) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))), 2602#(and (or (<= 3 (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base))) (= 0 (select (select (store |#memory_int| main_~nondetString2~0.base (store (select |#memory_int| main_~nondetString2~0.base) (+ main_~length2~0 main_~nondetString2~0.offset (- 1)) 0)) main_~nondetString1~0.base) 1)) (<= (+ main_~nondetString1~0.offset (select |#length| main_~nondetString1~0.base)) 1)) (= 0 main_~nondetString1~0.offset) (not (= main_~nondetString1~0.base main_~nondetString2~0.base))), 2603#(and (= 0 |cstrcmp_#in~s1.offset|) (or (<= 3 (select |#length| |cstrcmp_#in~s1.base|)) (= 0 (select (select |#memory_int| |cstrcmp_#in~s1.base|) 1)) (<= (select |#length| |cstrcmp_#in~s1.base|) 1))), 2604#(and (= 0 cstrcmp_~s1.offset) (or (= 0 (select (select |#memory_int| cstrcmp_~s1.base) 1)) (<= (select |#length| cstrcmp_~s1.base) 1) (<= 3 (select |#length| cstrcmp_~s1.base)))), 2605#(and (= |cstrcmp_#t~post3.offset| 0) (or (<= (+ (select |#length| cstrcmp_~s1.base) |cstrcmp_#t~post3.offset|) cstrcmp_~s1.offset) (<= (+ cstrcmp_~s1.offset 2) (+ (select |#length| cstrcmp_~s1.base) |cstrcmp_#t~post3.offset|)) (and (= 1 cstrcmp_~s1.offset) (= 0 (select (select |#memory_int| cstrcmp_~s1.base) 1))))), 2606#(or (<= (select |#length| cstrcmp_~s1.base) cstrcmp_~s1.offset) (and (= 1 cstrcmp_~s1.offset) (= 0 (select (select |#memory_int| cstrcmp_~s1.base) 1))) (<= (+ cstrcmp_~s1.offset 2) (select |#length| cstrcmp_~s1.base))), 2607#(or (and (= 1 cstrcmp_~s1.offset) (= 0 (select (select |#memory_int| cstrcmp_~s1.base) 1))) (<= (+ cstrcmp_~s1.offset 2) (select |#length| cstrcmp_~s1.base))), 2608#(or (= 0 (select (select |#memory_int| |cstrcmp_#t~post3.base|) |cstrcmp_#t~post3.offset|)) (and (<= (+ cstrcmp_~s1.offset 1) (select |#length| cstrcmp_~s1.base)) (<= (+ |cstrcmp_#t~post3.offset| 1) cstrcmp_~s1.offset))), 2609#(or (= 0 |cstrcmp_#t~mem4|) (and (<= (+ cstrcmp_~s1.offset 1) (select |#length| cstrcmp_~s1.base)) (<= 1 cstrcmp_~s1.offset))), 2610#(and (<= (+ cstrcmp_~s1.offset 1) (select |#length| cstrcmp_~s1.base)) (<= 1 cstrcmp_~s1.offset))] [2018-02-04 01:47:54,416 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 01:47:54,416 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 01:47:54,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 01:47:54,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-02-04 01:47:54,416 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 15 states. [2018-02-04 01:47:54,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:47:54,750 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-02-04 01:47:54,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 01:47:54,750 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2018-02-04 01:47:54,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:47:54,750 INFO L225 Difference]: With dead ends: 45 [2018-02-04 01:47:54,750 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 01:47:54,751 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2018-02-04 01:47:54,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 01:47:54,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2018-02-04 01:47:54,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 01:47:54,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-02-04 01:47:54,752 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 32 [2018-02-04 01:47:54,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:47:54,753 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-02-04 01:47:54,753 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 01:47:54,753 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-02-04 01:47:54,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 01:47:54,753 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:47:54,753 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:47:54,753 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:47:54,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1429764731, now seen corresponding path program 2 times [2018-02-04 01:47:54,754 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:47:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:47:54,763 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:47:55,017 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:47:55,017 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:47:55,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 01:47:55,018 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:47:55,018 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 01:47:55,018 INFO L182 omatonBuilderFactory]: Interpolants [2720#false, 2721#(and (= main_~length2~0 (select |#length| |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|)), 2722#(and (= 0 main_~nondetString2~0.offset) (or (= (+ main_~nondetString2~0.offset main_~length2~0) 2) (= main_~length2~0 (select |#length| main_~nondetString2~0.base)))), 2723#(and (= 0 main_~nondetString2~0.offset) (or (= 0 (select (select |#memory_int| main_~nondetString2~0.base) 1)) (<= (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base)) 1) (<= 3 (+ main_~nondetString2~0.offset (select |#length| main_~nondetString2~0.base))))), 2724#(and (or (<= (select |#length| |cstrcmp_#in~s2.base|) 1) (<= 3 (select |#length| |cstrcmp_#in~s2.base|)) (= 0 (select (select |#memory_int| |cstrcmp_#in~s2.base|) 1))) (= 0 |cstrcmp_#in~s2.offset|)), 2725#(and (= 0 cstrcmp_~s2.offset) (or (<= (select |#length| cstrcmp_~s2.base) 1) (<= 3 (select |#length| cstrcmp_~s2.base)) (= 0 (select (select |#memory_int| cstrcmp_~s2.base) 1)))), 2726#(and (= |cstrcmp_#t~post0.offset| 0) (or (and (<= (+ |cstrcmp_#t~post0.offset| 1) cstrcmp_~s2.offset) (or (<= (+ |cstrcmp_#t~post0.offset| (select |#length| |cstrcmp_#t~post0.base|)) cstrcmp_~s2.offset) (<= (+ cstrcmp_~s2.offset 2) (+ |cstrcmp_#t~post0.offset| (select |#length| |cstrcmp_#t~post0.base|)))) (= |cstrcmp_#t~post0.base| cstrcmp_~s2.base)) (and (<= (+ |cstrcmp_#t~post0.offset| 1) cstrcmp_~s2.offset) (<= cstrcmp_~s2.offset (+ |cstrcmp_#t~post0.offset| 1)) (= 0 (select (select |#memory_int| cstrcmp_~s2.base) 1))))), 2727#(or (and (<= 1 cstrcmp_~s2.offset) (or (<= (+ cstrcmp_~s2.offset 2) (select |#length| cstrcmp_~s2.base)) (<= (select |#length| cstrcmp_~s2.base) cstrcmp_~s2.offset))) (and (<= cstrcmp_~s2.offset 1) (<= 1 cstrcmp_~s2.offset) (= 0 (select (select |#memory_int| cstrcmp_~s2.base) 1)))), 2728#(or (and (<= 1 cstrcmp_~s2.offset) (or (<= (+ cstrcmp_~s2.offset 2) (select |#length| cstrcmp_~s2.base)) (<= (select |#length| cstrcmp_~s2.base) cstrcmp_~s2.offset))) (and (= (select (select |#memory_int| cstrcmp_~s1.base) cstrcmp_~s1.offset) |cstrcmp_#t~mem1|) (<= cstrcmp_~s2.offset 1) (<= 1 cstrcmp_~s2.offset) (= 0 (select (select |#memory_int| cstrcmp_~s2.base) 1)))), 2729#(or (and (<= 2 cstrcmp_~s2.offset) (or (<= (select |#length| |cstrcmp_#t~post0.base|) |cstrcmp_#t~post0.offset|) (<= (+ cstrcmp_~s2.offset 1) (select |#length| cstrcmp_~s2.base)))) (and (= (select (select |#memory_int| cstrcmp_~s1.base) cstrcmp_~s1.offset) |cstrcmp_#t~mem1|) (= 0 (select (select |#memory_int| |cstrcmp_#t~post0.base|) |cstrcmp_#t~post0.offset|)) (= 1 |cstrcmp_#t~post0.offset|))), 2730#(or (and (<= (+ cstrcmp_~s2.offset 1) (select |#length| cstrcmp_~s2.base)) (<= 2 cstrcmp_~s2.offset)) (and (= (select (select |#memory_int| cstrcmp_~s1.base) cstrcmp_~s1.offset) |cstrcmp_#t~mem1|) (= 0 |cstrcmp_#t~mem2|))), 2731#(or (and (<= (+ cstrcmp_~s2.offset 1) (select |#length| cstrcmp_~s2.base)) (<= 2 cstrcmp_~s2.offset)) (= 0 (select (select |#memory_int| |cstrcmp_#t~post3.base|) |cstrcmp_#t~post3.offset|))), 2732#(or (and (<= (+ cstrcmp_~s2.offset 1) (select |#length| cstrcmp_~s2.base)) (<= 2 cstrcmp_~s2.offset)) (= 0 |cstrcmp_#t~mem4|)), 2733#(and (<= (+ cstrcmp_~s2.offset 1) (select |#length| cstrcmp_~s2.base)) (<= 2 cstrcmp_~s2.offset)), 2734#(and (<= (+ |cstrcmp_#t~post0.offset| 1) (select |#length| |cstrcmp_#t~post0.base|)) (<= 2 |cstrcmp_#t~post0.offset|)), 2719#true] [2018-02-04 01:47:55,018 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:47:55,018 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 01:47:55,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 01:47:55,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-02-04 01:47:55,018 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 16 states. [2018-02-04 01:47:55,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:47:55,348 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-02-04 01:47:55,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 01:47:55,348 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2018-02-04 01:47:55,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:47:55,348 INFO L225 Difference]: With dead ends: 44 [2018-02-04 01:47:55,348 INFO L226 Difference]: Without dead ends: 44 [2018-02-04 01:47:55,349 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2018-02-04 01:47:55,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-04 01:47:55,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-02-04 01:47:55,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-04 01:47:55,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-02-04 01:47:55,350 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 34 [2018-02-04 01:47:55,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:47:55,350 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-02-04 01:47:55,350 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 01:47:55,350 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-02-04 01:47:55,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 01:47:55,351 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:47:55,351 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, 1, 1, 1] [2018-02-04 01:47:55,351 INFO L371 AbstractCegarLoop]: === Iteration 22 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:47:55,351 INFO L82 PathProgramCache]: Analyzing trace with hash -826037062, now seen corresponding path program 2 times [2018-02-04 01:47:55,352 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:47:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:47:55,361 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:47:55,514 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 01:47:55,515 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:47:55,515 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 01:47:55,515 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:47:55,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:47:55,515 INFO L182 omatonBuilderFactory]: Interpolants [2848#(and (= 0 |main_#t~malloc10.offset|) (= main_~length1~0 (select |#length| |main_#t~malloc10.base|)) (= (select |#valid| |main_#t~malloc10.base|) 1)), 2849#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~nondetString1~0.offset 0)), 2850#(and (not (= main_~nondetString1~0.base |main_#t~malloc11.base|)) (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 2851#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 2852#(and (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= 0 (select (select (store |#memory_int| main_~nondetString2~0.base (store (select |#memory_int| main_~nondetString2~0.base) (+ main_~length2~0 main_~nondetString2~0.offset (- 1)) 0)) main_~nondetString1~0.base) (+ (select |#length| main_~nondetString1~0.base) (+ main_~nondetString1~0.offset (- 1))))) (= main_~nondetString1~0.offset 0)), 2853#(= 0 (select (select |#memory_int| |cstrcmp_#in~s1.base|) (+ (select |#length| |cstrcmp_#in~s1.base|) (- 1)))), 2854#(= 0 (select (select |#memory_int| cstrcmp_~s1.base) (+ (select |#length| cstrcmp_~s1.base) (- 1)))), 2855#(or (= 0 (select (select |#memory_int| cstrcmp_~s1.base) cstrcmp_~s1.offset)) (<= (select |#length| cstrcmp_~s1.base) cstrcmp_~s1.offset) (<= (+ cstrcmp_~s1.offset 2) (select |#length| cstrcmp_~s1.base))), 2856#(or (= 0 (select (select |#memory_int| cstrcmp_~s1.base) cstrcmp_~s1.offset)) (<= (+ cstrcmp_~s1.offset 2) (select |#length| cstrcmp_~s1.base))), 2857#(or (= 0 (select (select |#memory_int| |cstrcmp_#t~post3.base|) |cstrcmp_#t~post3.offset|)) (and (<= (+ cstrcmp_~s1.offset 1) (select |#length| cstrcmp_~s1.base)) (<= (+ |cstrcmp_#t~post3.offset| 1) cstrcmp_~s1.offset))), 2858#(or (= 0 |cstrcmp_#t~mem4|) (and (<= (+ cstrcmp_~s1.offset 1) (select |#length| cstrcmp_~s1.base)) (<= 1 cstrcmp_~s1.offset))), 2859#(and (<= (+ cstrcmp_~s1.offset 1) (select |#length| cstrcmp_~s1.base)) (<= 1 cstrcmp_~s1.offset)), 2846#true, 2847#false] [2018-02-04 01:47:55,515 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 01:47:55,515 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 01:47:55,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 01:47:55,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-02-04 01:47:55,516 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 14 states. [2018-02-04 01:47:55,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:47:55,682 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-02-04 01:47:55,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 01:47:55,682 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 39 [2018-02-04 01:47:55,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:47:55,683 INFO L225 Difference]: With dead ends: 42 [2018-02-04 01:47:55,683 INFO L226 Difference]: Without dead ends: 42 [2018-02-04 01:47:55,683 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2018-02-04 01:47:55,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-04 01:47:55,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-02-04 01:47:55,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 01:47:55,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-02-04 01:47:55,685 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2018-02-04 01:47:55,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:47:55,685 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-02-04 01:47:55,685 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 01:47:55,685 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-02-04 01:47:55,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 01:47:55,686 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:47:55,686 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:47:55,686 INFO L371 AbstractCegarLoop]: === Iteration 23 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 01:47:55,686 INFO L82 PathProgramCache]: Analyzing trace with hash 747331611, now seen corresponding path program 3 times [2018-02-04 01:47:55,687 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:47:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:47:55,696 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:47:55,880 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 01:47:55,880 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:47:55,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 01:47:55,881 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:47:55,881 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 01:47:55,881 INFO L182 omatonBuilderFactory]: Interpolants [2976#(and (<= (+ |cstrcmp_#t~post0.offset| 1) (select |#length| |cstrcmp_#t~post0.base|)) (<= 1 |cstrcmp_#t~post0.offset|)), 2962#true, 2963#false, 2964#(and (= main_~length2~0 (select |#length| |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|)), 2965#(and (= main_~nondetString2~0.offset 0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 2966#(and (= main_~nondetString2~0.offset 0) (= 0 (select (select |#memory_int| main_~nondetString2~0.base) (+ (select |#length| main_~nondetString2~0.base) (+ main_~nondetString2~0.offset (- 1)))))), 2967#(= 0 (select (select |#memory_int| |cstrcmp_#in~s2.base|) (+ (select |#length| |cstrcmp_#in~s2.base|) (- 1)))), 2968#(= 0 (select (select |#memory_int| cstrcmp_~s2.base) (+ (select |#length| cstrcmp_~s2.base) (- 1)))), 2969#(and (= 0 (select (select |#memory_int| cstrcmp_~s2.base) (+ (select |#length| |cstrcmp_#t~post0.base|) (- 1)))) (= |cstrcmp_#t~post0.base| cstrcmp_~s2.base)), 2970#(and (= 0 (select (select |#memory_int| cstrcmp_~s2.base) (+ (select |#length| cstrcmp_~s2.base) (- 1)))) (= (select (select |#memory_int| cstrcmp_~s1.base) cstrcmp_~s1.offset) |cstrcmp_#t~mem1|)), 2971#(or (and (<= (+ |cstrcmp_#t~post0.offset| 1) cstrcmp_~s2.offset) (or (<= (select |#length| |cstrcmp_#t~post0.base|) |cstrcmp_#t~post0.offset|) (<= (+ cstrcmp_~s2.offset 1) (select |#length| cstrcmp_~s2.base)))) (and (= (select (select |#memory_int| cstrcmp_~s1.base) cstrcmp_~s1.offset) |cstrcmp_#t~mem1|) (= 0 (select (select |#memory_int| |cstrcmp_#t~post0.base|) |cstrcmp_#t~post0.offset|)))), 2972#(or (and (<= (+ cstrcmp_~s2.offset 1) (select |#length| cstrcmp_~s2.base)) (<= 1 cstrcmp_~s2.offset)) (and (= (select (select |#memory_int| cstrcmp_~s1.base) cstrcmp_~s1.offset) |cstrcmp_#t~mem1|) (= 0 |cstrcmp_#t~mem2|))), 2973#(or (= 0 (select (select |#memory_int| |cstrcmp_#t~post3.base|) |cstrcmp_#t~post3.offset|)) (and (<= (+ cstrcmp_~s2.offset 1) (select |#length| cstrcmp_~s2.base)) (<= 1 cstrcmp_~s2.offset))), 2974#(or (= 0 |cstrcmp_#t~mem4|) (and (<= (+ cstrcmp_~s2.offset 1) (select |#length| cstrcmp_~s2.base)) (<= 1 cstrcmp_~s2.offset))), 2975#(and (<= (+ cstrcmp_~s2.offset 1) (select |#length| cstrcmp_~s2.base)) (<= 1 cstrcmp_~s2.offset))] [2018-02-04 01:47:55,881 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 01:47:55,881 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 01:47:55,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 01:47:55,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-02-04 01:47:55,882 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 15 states. [2018-02-04 01:47:56,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:47:56,180 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-02-04 01:47:56,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 01:47:56,181 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2018-02-04 01:47:56,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:47:56,181 INFO L225 Difference]: With dead ends: 41 [2018-02-04 01:47:56,181 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 01:47:56,181 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2018-02-04 01:47:56,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 01:47:56,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 01:47:56,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 01:47:56,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 01:47:56,182 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2018-02-04 01:47:56,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:47:56,182 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 01:47:56,182 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 01:47:56,182 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 01:47:56,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 01:47:56,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 01:47:56 BoogieIcfgContainer [2018-02-04 01:47:56,185 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 01:47:56,186 INFO L168 Benchmark]: Toolchain (without parser) took 6484.62 ms. Allocated memory was 407.4 MB in the beginning and 750.8 MB in the end (delta: 343.4 MB). Free memory was 365.4 MB in the beginning and 511.4 MB in the end (delta: -146.0 MB). Peak memory consumption was 197.4 MB. Max. memory is 5.3 GB. [2018-02-04 01:47:56,187 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 407.4 MB. Free memory is still 370.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 01:47:56,187 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.63 ms. Allocated memory is still 407.4 MB. Free memory was 364.1 MB in the beginning and 353.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 01:47:56,187 INFO L168 Benchmark]: Boogie Preprocessor took 28.55 ms. Allocated memory is still 407.4 MB. Free memory was 353.5 MB in the beginning and 352.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 01:47:56,187 INFO L168 Benchmark]: RCFGBuilder took 205.63 ms. Allocated memory is still 407.4 MB. Free memory was 352.2 MB in the beginning and 332.2 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 5.3 GB. [2018-02-04 01:47:56,187 INFO L168 Benchmark]: TraceAbstraction took 6094.41 ms. Allocated memory was 407.4 MB in the beginning and 750.8 MB in the end (delta: 343.4 MB). Free memory was 332.2 MB in the beginning and 511.4 MB in the end (delta: -179.2 MB). Peak memory consumption was 164.2 MB. Max. memory is 5.3 GB. [2018-02-04 01:47:56,188 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 407.4 MB. Free memory is still 370.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 153.63 ms. Allocated memory is still 407.4 MB. Free memory was 364.1 MB in the beginning and 353.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.55 ms. Allocated memory is still 407.4 MB. Free memory was 353.5 MB in the beginning and 352.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 205.63 ms. Allocated memory is still 407.4 MB. Free memory was 352.2 MB in the beginning and 332.2 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6094.41 ms. Allocated memory was 407.4 MB in the beginning and 750.8 MB in the end (delta: 343.4 MB). Free memory was 332.2 MB in the beginning and 511.4 MB in the end (delta: -179.2 MB). Peak memory consumption was 164.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 53 locations, 15 error locations. SAFE Result, 6.0s OverallTime, 23 OverallIterations, 4 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 705 SDtfs, 1027 SDslu, 2586 SDs, 0 SdLazy, 2582 SolverSat, 181 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 334 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 298 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 24/109 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, 23 MinimizatonAttempts, 108 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 563 NumberOfCodeBlocks, 563 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 540 ConstructedInterpolants, 0 QuantifiedInterpolants, 114505 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 15 PerfectInterpolantSequences, 24/109 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_cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_01-47-56-193.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_01-47-56-193.csv Received shutdown request...