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_cstrncmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 01:49:29,279 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 01:49:29,280 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 01:49:29,290 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 01:49:29,290 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 01:49:29,291 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 01:49:29,292 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 01:49:29,293 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 01:49:29,295 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 01:49:29,296 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 01:49:29,296 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 01:49:29,297 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 01:49:29,297 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 01:49:29,298 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 01:49:29,299 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 01:49:29,301 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 01:49:29,302 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 01:49:29,304 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 01:49:29,305 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 01:49:29,305 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 01:49:29,307 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 01:49:29,307 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 01:49:29,307 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 01:49:29,308 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 01:49:29,309 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 01:49:29,310 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 01:49:29,310 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 01:49:29,310 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 01:49:29,311 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 01:49:29,311 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 01:49:29,311 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 01:49:29,312 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:49:29,321 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 01:49:29,321 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 01:49:29,322 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 01:49:29,323 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 01:49:29,323 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 01:49:29,323 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 01:49:29,323 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 01:49:29,323 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 01:49:29,323 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 01:49:29,324 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 01:49:29,324 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 01:49:29,324 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 01:49:29,324 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 01:49:29,324 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 01:49:29,324 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 01:49:29,324 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 01:49:29,325 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 01:49:29,325 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 01:49:29,325 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 01:49:29,325 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 01:49:29,325 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 01:49:29,325 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 01:49:29,325 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 01:49:29,352 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 01:49:29,360 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 01:49:29,364 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 01:49:29,365 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 01:49:29,365 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 01:49:29,366 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-02-04 01:49:29,502 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 01:49:29,503 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 01:49:29,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 01:49:29,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 01:49:29,510 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 01:49:29,511 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:49:29" (1/1) ... [2018-02-04 01:49:29,514 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3db90158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:29, skipping insertion in model container [2018-02-04 01:49:29,514 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:49:29" (1/1) ... [2018-02-04 01:49:29,529 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:49:29,559 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:49:29,645 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:49:29,657 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:49:29,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:29 WrapperNode [2018-02-04 01:49:29,661 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 01:49:29,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 01:49:29,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 01:49:29,662 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 01:49:29,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:29" (1/1) ... [2018-02-04 01:49:29,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:29" (1/1) ... [2018-02-04 01:49:29,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:29" (1/1) ... [2018-02-04 01:49:29,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:29" (1/1) ... [2018-02-04 01:49:29,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:29" (1/1) ... [2018-02-04 01:49:29,683 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:29" (1/1) ... [2018-02-04 01:49:29,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:29" (1/1) ... [2018-02-04 01:49:29,685 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 01:49:29,685 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 01:49:29,685 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 01:49:29,685 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 01:49:29,686 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:29" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 01:49:29,720 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 01:49:29,721 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 01:49:29,721 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-02-04 01:49:29,721 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 01:49:29,721 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 01:49:29,721 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 01:49:29,721 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 01:49:29,721 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 01:49:29,721 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 01:49:29,721 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 01:49:29,721 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-02-04 01:49:29,722 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 01:49:29,722 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 01:49:29,722 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 01:49:29,895 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 01:49:29,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:49:29 BoogieIcfgContainer [2018-02-04 01:49:29,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 01:49:29,897 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 01:49:29,897 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 01:49:29,899 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 01:49:29,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:49:29" (1/3) ... [2018-02-04 01:49:29,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2215c27d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:49:29, skipping insertion in model container [2018-02-04 01:49:29,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:49:29" (2/3) ... [2018-02-04 01:49:29,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2215c27d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:49:29, skipping insertion in model container [2018-02-04 01:49:29,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:49:29" (3/3) ... [2018-02-04 01:49:29,902 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-02-04 01:49:29,909 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 01:49:29,915 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-04 01:49:29,946 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 01:49:29,947 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 01:49:29,947 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 01:49:29,947 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 01:49:29,947 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 01:49:29,947 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 01:49:29,947 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 01:49:29,947 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 01:49:29,948 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 01:49:29,956 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-02-04 01:49:29,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 01:49:29,963 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:49:29,964 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:49:29,964 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-04 01:49:29,968 INFO L82 PathProgramCache]: Analyzing trace with hash -417514722, now seen corresponding path program 1 times [2018-02-04 01:49:30,003 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:49:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:49:30,044 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:49:30,119 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:49:30,121 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:49:30,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:49:30,122 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:49:30,122 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:49:30,122 INFO L182 omatonBuilderFactory]: Interpolants [64#(= 1 (select |#valid| main_~nondetString1~0.base)), 61#true, 62#false, 63#(= 1 (select |#valid| |main_#t~malloc11.base|))] [2018-02-04 01:49:30,123 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:49:30,123 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:49:30,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:49:30,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:49:30,133 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 4 states. [2018-02-04 01:49:30,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:49:30,298 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-02-04 01:49:30,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 01:49:30,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 01:49:30,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:49:30,308 INFO L225 Difference]: With dead ends: 57 [2018-02-04 01:49:30,308 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 01:49:30,310 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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:49:30,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 01:49:30,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-04 01:49:30,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 01:49:30,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-02-04 01:49:30,337 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 13 [2018-02-04 01:49:30,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:49:30,337 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-02-04 01:49:30,337 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:49:30,337 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-02-04 01:49:30,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 01:49:30,338 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:49:30,338 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:49:30,338 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-04 01:49:30,338 INFO L82 PathProgramCache]: Analyzing trace with hash -417514721, now seen corresponding path program 1 times [2018-02-04 01:49:30,339 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:49:30,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:49:30,350 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:49:30,445 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:49:30,446 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:49:30,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:49:30,446 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:49:30,446 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:49:30,447 INFO L182 omatonBuilderFactory]: Interpolants [178#true, 179#false, 180#(<= 1 main_~length1~0), 181#(and (= main_~length1~0 (select |#length| |main_#t~malloc11.base|)) (= (select |#valid| |main_#t~malloc11.base|) 1) (= 0 |main_#t~malloc11.offset|) (<= 1 main_~length1~0)), 182#(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)), 183#(and (= (select |#length| main_~nondetString1~0.base) main_~length1~0) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0))] [2018-02-04 01:49:30,447 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:49:30,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:49:30,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:49:30,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:49:30,450 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 6 states. [2018-02-04 01:49:30,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:49:30,508 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-02-04 01:49:30,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:49:30,508 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-04 01:49:30,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:49:30,509 INFO L225 Difference]: With dead ends: 53 [2018-02-04 01:49:30,509 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 01:49:30,510 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:49:30,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 01:49:30,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-04 01:49:30,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 01:49:30,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-02-04 01:49:30,514 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 13 [2018-02-04 01:49:30,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:49:30,514 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-02-04 01:49:30,514 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:49:30,514 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-02-04 01:49:30,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 01:49:30,515 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:49:30,515 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:49:30,515 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-04 01:49:30,515 INFO L82 PathProgramCache]: Analyzing trace with hash -58054499, now seen corresponding path program 1 times [2018-02-04 01:49:30,516 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:49:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:49:30,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:49:30,549 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:49:30,549 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:49:30,549 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:49:30,550 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:49:30,550 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:49:30,550 INFO L182 omatonBuilderFactory]: Interpolants [292#true, 293#false, 294#(= 1 (select |#valid| |main_#t~malloc12.base|)), 295#(= 1 (select |#valid| main_~nondetString2~0.base))] [2018-02-04 01:49:30,550 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:49:30,550 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:49:30,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:49:30,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:49:30,551 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 4 states. [2018-02-04 01:49:30,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:49:30,587 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-02-04 01:49:30,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 01:49:30,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 01:49:30,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:49:30,589 INFO L225 Difference]: With dead ends: 52 [2018-02-04 01:49:30,589 INFO L226 Difference]: Without dead ends: 52 [2018-02-04 01:49:30,589 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:49:30,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-04 01:49:30,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-04 01:49:30,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 01:49:30,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-02-04 01:49:30,593 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 14 [2018-02-04 01:49:30,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:49:30,594 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-02-04 01:49:30,594 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:49:30,594 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-02-04 01:49:30,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 01:49:30,594 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:49:30,594 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:49:30,595 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-04 01:49:30,595 INFO L82 PathProgramCache]: Analyzing trace with hash -58054498, now seen corresponding path program 1 times [2018-02-04 01:49:30,595 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:49:30,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:49:30,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:49:30,650 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:49:30,655 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:49:30,655 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 01:49:30,655 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:49:30,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:30,655 INFO L182 omatonBuilderFactory]: Interpolants [402#true, 403#false, 404#(<= 1 main_~length2~0), 405#(and (= 0 |main_#t~malloc12.offset|) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| |main_#t~malloc12.base|))), 406#(and (= main_~nondetString2~0.offset 0) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base)))] [2018-02-04 01:49:30,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:30,656 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:49:30,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:49:30,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:49:30,656 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-02-04 01:49:30,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:49:30,680 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-02-04 01:49:30,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:49:30,681 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 01:49:30,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:49:30,681 INFO L225 Difference]: With dead ends: 51 [2018-02-04 01:49:30,681 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 01:49:30,682 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:49:30,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 01:49:30,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-04 01:49:30,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 01:49:30,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-02-04 01:49:30,684 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 14 [2018-02-04 01:49:30,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:49:30,684 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-02-04 01:49:30,684 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:49:30,684 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-02-04 01:49:30,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 01:49:30,685 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:49:30,685 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:49:30,685 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-04 01:49:30,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1465356832, now seen corresponding path program 1 times [2018-02-04 01:49:30,685 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:49:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:49:30,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:49:30,782 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:49:30,782 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:49:30,782 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 01:49:30,782 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:49:30,783 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:49:30,783 INFO L182 omatonBuilderFactory]: Interpolants [512#false, 513#(<= 1 main_~length1~0), 514#(and (= 0 |main_#t~malloc11.offset|) (<= 1 main_~length1~0)), 515#(and (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 516#(and (<= (+ main_~nondetString1~0.offset 1) (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 517#(and (<= 1 (select |#length| |cstrncmp_#in~s1.base|)) (= 0 |cstrncmp_#in~s1.offset|)), 518#(and (= cstrncmp_~s1.offset 0) (<= 1 (select |#length| cstrncmp_~s1.base))), 511#true] [2018-02-04 01:49:30,783 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:49:30,783 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 01:49:30,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 01:49:30,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:49:30,783 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 8 states. [2018-02-04 01:49:30,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:49:30,880 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2018-02-04 01:49:30,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 01:49:30,880 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-02-04 01:49:30,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:49:30,883 INFO L225 Difference]: With dead ends: 68 [2018-02-04 01:49:30,884 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 01:49:30,884 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:49:30,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 01:49:30,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2018-02-04 01:49:30,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 01:49:30,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2018-02-04 01:49:30,887 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 20 [2018-02-04 01:49:30,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:49:30,890 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2018-02-04 01:49:30,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 01:49:30,891 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2018-02-04 01:49:30,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 01:49:30,891 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:49:30,891 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:49:30,891 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-04 01:49:30,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1465356831, now seen corresponding path program 1 times [2018-02-04 01:49:30,892 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:49:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:49:30,906 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:49:30,938 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:49:30,938 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:49:30,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 01:49:30,939 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:49:30,939 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:49:30,943 INFO L182 omatonBuilderFactory]: Interpolants [656#(= 1 (select |#valid| cstrncmp_~s1.base)), 652#true, 653#false, 654#(= 1 (select |#valid| main_~nondetString1~0.base)), 655#(= 1 (select |#valid| |cstrncmp_#in~s1.base|))] [2018-02-04 01:49:30,943 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:49:30,943 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:49:30,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:49:30,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:49:30,944 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand 5 states. [2018-02-04 01:49:30,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:49:30,997 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-02-04 01:49:30,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 01:49:30,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-04 01:49:30,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:49:30,998 INFO L225 Difference]: With dead ends: 55 [2018-02-04 01:49:30,999 INFO L226 Difference]: Without dead ends: 55 [2018-02-04 01:49:30,999 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:49:30,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-04 01:49:31,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-02-04 01:49:31,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 01:49:31,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-02-04 01:49:31,002 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 20 [2018-02-04 01:49:31,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:49:31,002 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-02-04 01:49:31,002 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:49:31,002 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-02-04 01:49:31,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 01:49:31,005 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:49:31,006 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:49:31,006 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-04 01:49:31,006 INFO L82 PathProgramCache]: Analyzing trace with hash -541357888, now seen corresponding path program 1 times [2018-02-04 01:49:31,006 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:49:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:49:31,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:49:31,051 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:49:31,052 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:49:31,052 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:49:31,052 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:49:31,052 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:49:31,053 INFO L182 omatonBuilderFactory]: Interpolants [769#true, 770#false, 771#(= 1 (select |#valid| main_~nondetString2~0.base)), 772#(= 1 (select |#valid| |cstrncmp_#in~s2.base|)), 773#(= 1 (select |#valid| cstrncmp_~s2.base)), 774#(= 1 (select |#valid| |cstrncmp_#t~post1.base|))] [2018-02-04 01:49:31,053 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:49:31,053 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:49:31,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:49:31,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:49:31,054 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 6 states. [2018-02-04 01:49:31,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:49:31,113 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-02-04 01:49:31,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:49:31,115 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-04 01:49:31,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:49:31,115 INFO L225 Difference]: With dead ends: 54 [2018-02-04 01:49:31,115 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 01:49:31,116 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:49:31,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 01:49:31,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-04 01:49:31,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 01:49:31,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2018-02-04 01:49:31,118 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 22 [2018-02-04 01:49:31,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:49:31,118 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2018-02-04 01:49:31,118 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:49:31,118 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-02-04 01:49:31,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 01:49:31,118 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:49:31,118 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:49:31,118 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-04 01:49:31,118 INFO L82 PathProgramCache]: Analyzing trace with hash -541357887, now seen corresponding path program 1 times [2018-02-04 01:49:31,119 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:49:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:49:31,128 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:49:31,237 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:49:31,238 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:49:31,238 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 01:49:31,238 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:49:31,238 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:49:31,239 INFO L182 omatonBuilderFactory]: Interpolants [887#true, 888#false, 889#(<= 1 main_~length2~0), 890#(and (= 0 |main_#t~malloc12.offset|) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| |main_#t~malloc12.base|))), 891#(and (= 0 main_~nondetString2~0.offset) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 892#(and (= 0 main_~nondetString2~0.offset) (<= 1 (select |#length| main_~nondetString2~0.base))), 893#(and (<= 1 (select |#length| |cstrncmp_#in~s2.base|)) (= 0 |cstrncmp_#in~s2.offset|)), 894#(and (= 0 cstrncmp_~s2.offset) (<= 1 (select |#length| cstrncmp_~s2.base))), 895#(and (= |cstrncmp_#t~post1.offset| 0) (<= 1 (select |#length| |cstrncmp_#t~post1.base|)))] [2018-02-04 01:49:31,239 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:49:31,239 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 01:49:31,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 01:49:31,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 01:49:31,240 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 9 states. [2018-02-04 01:49:31,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:49:31,356 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-02-04 01:49:31,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 01:49:31,357 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-02-04 01:49:31,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:49:31,357 INFO L225 Difference]: With dead ends: 56 [2018-02-04 01:49:31,357 INFO L226 Difference]: Without dead ends: 56 [2018-02-04 01:49:31,357 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-02-04 01:49:31,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-04 01:49:31,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-02-04 01:49:31,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 01:49:31,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-02-04 01:49:31,360 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 22 [2018-02-04 01:49:31,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:49:31,361 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-02-04 01:49:31,361 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 01:49:31,361 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-02-04 01:49:31,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 01:49:31,361 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:49:31,361 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:49:31,361 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-04 01:49:31,362 INFO L82 PathProgramCache]: Analyzing trace with hash -553886463, now seen corresponding path program 1 times [2018-02-04 01:49:31,362 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:49:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:49:31,371 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:49:31,397 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:49:31,398 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:49:31,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:49:31,398 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:49:31,398 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:49:31,398 INFO L182 omatonBuilderFactory]: Interpolants [1012#true, 1013#false, 1014#(= 1 (select |#valid| main_~nondetString1~0.base)), 1015#(= 1 (select |#valid| |cstrncmp_#in~s1.base|)), 1016#(= 1 (select |#valid| cstrncmp_~s1.base)), 1017#(= 1 (select |#valid| |cstrncmp_#t~post7.base|))] [2018-02-04 01:49:31,398 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:49:31,398 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:49:31,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:49:31,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:49:31,399 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 6 states. [2018-02-04 01:49:31,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:49:31,445 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2018-02-04 01:49:31,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:49:31,446 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 01:49:31,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:49:31,446 INFO L225 Difference]: With dead ends: 53 [2018-02-04 01:49:31,446 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 01:49:31,447 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:49:31,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 01:49:31,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-04 01:49:31,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 01:49:31,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-02-04 01:49:31,449 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 24 [2018-02-04 01:49:31,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:49:31,450 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-02-04 01:49:31,450 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:49:31,450 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-02-04 01:49:31,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 01:49:31,450 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:49:31,450 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:49:31,451 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-04 01:49:31,451 INFO L82 PathProgramCache]: Analyzing trace with hash -553886462, now seen corresponding path program 1 times [2018-02-04 01:49:31,451 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:49:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:49:31,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:49:31,508 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:49:31,508 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:49:31,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 01:49:31,509 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:49:31,509 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:49:31,509 INFO L182 omatonBuilderFactory]: Interpolants [1128#true, 1129#false, 1130#(= 0 |main_#t~malloc11.offset|), 1131#(= 0 main_~nondetString1~0.offset), 1132#(= 0 |cstrncmp_#in~s1.offset|), 1133#(= 0 cstrncmp_~s1.offset), 1134#(and (= 0 cstrncmp_~s1.offset) (<= (+ cstrncmp_~s1.offset 1) (select |#length| cstrncmp_~s1.base))), 1135#(and (<= 1 (select |#length| |cstrncmp_#t~post7.base|)) (= |cstrncmp_#t~post7.offset| 0))] [2018-02-04 01:49:31,509 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:49:31,509 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 01:49:31,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 01:49:31,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:49:31,510 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 8 states. [2018-02-04 01:49:31,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:49:31,597 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-02-04 01:49:31,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 01:49:31,598 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-02-04 01:49:31,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:49:31,598 INFO L225 Difference]: With dead ends: 64 [2018-02-04 01:49:31,598 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 01:49:31,599 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:49:31,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 01:49:31,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2018-02-04 01:49:31,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 01:49:31,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-02-04 01:49:31,602 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 24 [2018-02-04 01:49:31,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:49:31,602 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-02-04 01:49:31,603 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 01:49:31,603 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-02-04 01:49:31,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 01:49:31,604 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:49:31,604 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] [2018-02-04 01:49:31,604 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-04 01:49:31,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1181606150, now seen corresponding path program 1 times [2018-02-04 01:49:31,605 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:49:31,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:49:31,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:49:31,677 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:49:31,677 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:49:31,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:49:31,677 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:49:31,678 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:49:31,678 INFO L182 omatonBuilderFactory]: Interpolants [1264#(= |#valid| |old(#valid)|), 1265#(and (= |old(#valid)| (store |#valid| |main_#t~malloc11.base| 0)) (= (select |#valid| |main_#t~malloc11.base|) 1)), 1266#(and (not (= |main_#t~malloc11.base| |main_#t~malloc12.base|)) (= (store (store |#valid| |main_#t~malloc12.base| 0) |main_#t~malloc11.base| (select (store |#valid| |main_#t~malloc11.base| 0) |main_#t~malloc11.base|)) |old(#valid)|)), 1267#(= (store |#valid| |main_#t~malloc12.base| 0) |old(#valid)|), 1262#true, 1263#false] [2018-02-04 01:49:31,678 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:49:31,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:49:31,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:49:31,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:49:31,679 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 6 states. [2018-02-04 01:49:31,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:49:31,784 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2018-02-04 01:49:31,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 01:49:31,785 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 01:49:31,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:49:31,786 INFO L225 Difference]: With dead ends: 53 [2018-02-04 01:49:31,786 INFO L226 Difference]: Without dead ends: 43 [2018-02-04 01:49:31,786 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:49:31,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-04 01:49:31,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-02-04 01:49:31,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-04 01:49:31,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-02-04 01:49:31,789 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 26 [2018-02-04 01:49:31,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:49:31,789 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-02-04 01:49:31,789 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:49:31,789 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-02-04 01:49:31,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 01:49:31,790 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:49:31,790 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] [2018-02-04 01:49:31,790 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-04 01:49:31,790 INFO L82 PathProgramCache]: Analyzing trace with hash 290777922, now seen corresponding path program 1 times [2018-02-04 01:49:31,791 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:49:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:49:31,799 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:49:31,828 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:49:31,829 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:49:31,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:49:31,829 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:49:31,829 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:49:31,829 INFO L182 omatonBuilderFactory]: Interpolants [1368#true, 1369#false, 1370#(= 1 (select |#valid| main_~nondetString2~0.base)), 1371#(= 1 (select |#valid| |cstrncmp_#in~s2.base|)), 1372#(= 1 (select |#valid| cstrncmp_~s2.base)), 1373#(= 1 (select |#valid| |cstrncmp_#t~pre4.base|))] [2018-02-04 01:49:31,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:49:31,830 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:49:31,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:49:31,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:49:31,830 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 6 states. [2018-02-04 01:49:31,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:49:31,874 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-02-04 01:49:31,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:49:31,874 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 01:49:31,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:49:31,875 INFO L225 Difference]: With dead ends: 42 [2018-02-04 01:49:31,875 INFO L226 Difference]: Without dead ends: 42 [2018-02-04 01:49:31,875 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:49:31,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-04 01:49:31,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-02-04 01:49:31,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 01:49:31,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-02-04 01:49:31,877 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 26 [2018-02-04 01:49:31,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:49:31,877 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-02-04 01:49:31,878 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:49:31,878 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-02-04 01:49:31,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 01:49:31,878 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:49:31,878 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] [2018-02-04 01:49:31,878 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-04 01:49:31,879 INFO L82 PathProgramCache]: Analyzing trace with hash 290777923, now seen corresponding path program 1 times [2018-02-04 01:49:31,879 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:49:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:49:31,888 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:49:31,954 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:49:31,954 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:49:31,954 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 01:49:31,954 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:49:31,955 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:49:31,955 INFO L182 omatonBuilderFactory]: Interpolants [1462#true, 1463#false, 1464#(= 0 |main_#t~malloc12.offset|), 1465#(= 0 main_~nondetString2~0.offset), 1466#(= 0 |cstrncmp_#in~s2.offset|), 1467#(= 0 cstrncmp_~s2.offset), 1468#(and (<= (+ |cstrncmp_#t~post1.offset| 1) cstrncmp_~s2.offset) (= |cstrncmp_#t~post1.offset| 0) (<= cstrncmp_~s2.offset (+ |cstrncmp_#t~post1.offset| 1)) (= |cstrncmp_#t~post1.base| cstrncmp_~s2.base)), 1469#(and (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 1470#(and (<= 0 |cstrncmp_#t~pre4.offset|) (<= (+ |cstrncmp_#t~pre4.offset| 1) (select |#length| |cstrncmp_#t~pre4.base|)))] [2018-02-04 01:49:31,955 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:49:31,955 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 01:49:31,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 01:49:31,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-04 01:49:31,956 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 9 states. [2018-02-04 01:49:32,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:49:32,055 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-02-04 01:49:32,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 01:49:32,055 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-02-04 01:49:32,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:49:32,056 INFO L225 Difference]: With dead ends: 51 [2018-02-04 01:49:32,056 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 01:49:32,056 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-02-04 01:49:32,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 01:49:32,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2018-02-04 01:49:32,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 01:49:32,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-02-04 01:49:32,058 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 26 [2018-02-04 01:49:32,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:49:32,061 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-02-04 01:49:32,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 01:49:32,061 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-02-04 01:49:32,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 01:49:32,062 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:49:32,062 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, 1, 1, 1, 1] [2018-02-04 01:49:32,062 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-04 01:49:32,062 INFO L82 PathProgramCache]: Analyzing trace with hash -716230416, now seen corresponding path program 1 times [2018-02-04 01:49:32,063 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:49:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:49:32,087 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:49:32,301 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:49:32,301 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:49:32,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 01:49:32,302 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:49:32,302 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:49:32,302 INFO L182 omatonBuilderFactory]: Interpolants [1584#(= 0 (select (select |#memory_int| cstrncmp_~s1.base) cstrncmp_~s1.offset)), 1585#(= 0 (select (select |#memory_int| |cstrncmp_#t~post7.base|) |cstrncmp_#t~post7.offset|)), 1586#(= 0 |cstrncmp_#t~mem8|), 1575#true, 1576#false, 1577#(and (<= 1 main_~length1~0) (<= main_~length1~0 1)), 1578#(and (= (select |#valid| |main_#t~malloc11.base|) 1) (= 0 |main_#t~malloc11.offset|) (<= 1 main_~length1~0) (<= main_~length1~0 1)), 1579#(and (= (select |#valid| main_~nondetString1~0.base) 1) (= 1 (+ main_~nondetString1~0.offset main_~length1~0)) (= main_~nondetString1~0.offset 0)), 1580#(and (not (= main_~nondetString1~0.base |main_#t~malloc12.base|)) (= 1 (+ main_~nondetString1~0.offset main_~length1~0)) (= main_~nondetString1~0.offset 0)), 1581#(and (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= 1 (+ main_~nondetString1~0.offset main_~length1~0)) (= main_~nondetString1~0.offset 0)), 1582#(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)), 1583#(= 0 (select (select |#memory_int| |cstrncmp_#in~s1.base|) |cstrncmp_#in~s1.offset|))] [2018-02-04 01:49:32,303 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:49:32,303 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 01:49:32,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 01:49:32,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-04 01:49:32,303 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 12 states. [2018-02-04 01:49:32,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:49:32,472 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-02-04 01:49:32,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 01:49:32,473 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-02-04 01:49:32,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:49:32,473 INFO L225 Difference]: With dead ends: 59 [2018-02-04 01:49:32,473 INFO L226 Difference]: Without dead ends: 41 [2018-02-04 01:49:32,473 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-02-04 01:49:32,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-04 01:49:32,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-02-04 01:49:32,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 01:49:32,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-02-04 01:49:32,475 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 29 [2018-02-04 01:49:32,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:49:32,475 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-02-04 01:49:32,475 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 01:49:32,475 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-02-04 01:49:32,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 01:49:32,476 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:49:32,476 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, 1, 1, 1, 1] [2018-02-04 01:49:32,476 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-04 01:49:32,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1773298546, now seen corresponding path program 1 times [2018-02-04 01:49:32,477 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:49:32,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:49:32,488 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:49:32,672 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:49:32,672 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:49:32,672 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 01:49:32,673 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:49:32,675 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:49:32,675 INFO L182 omatonBuilderFactory]: Interpolants [1701#true, 1702#false, 1703#(<= 1 main_~length1~0), 1704#(and (= (select |#valid| |main_#t~malloc11.base|) 1) (= 0 |main_#t~malloc11.offset|) (<= 1 main_~length1~0)), 1705#(and (= 0 main_~nondetString1~0.offset) (or (not (= (+ main_~nondetString1~0.offset main_~length1~0) 1)) (= (select |#valid| main_~nondetString1~0.base) 1)) (<= 1 main_~length1~0)), 1706#(and (or (not (= main_~nondetString1~0.base |main_#t~malloc12.base|)) (not (= (+ main_~nondetString1~0.offset main_~length1~0) 1))) (<= 1 main_~length1~0) (= main_~nondetString1~0.offset 0)), 1707#(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)), 1708#(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)))), 1709#(and (or (<= 2 (select |#length| |cstrncmp_#in~s1.base|)) (= 0 (select (select |#memory_int| |cstrncmp_#in~s1.base|) |cstrncmp_#in~s1.offset|))) (= 0 |cstrncmp_#in~s1.offset|)), 1710#(and (or (<= 2 (select |#length| cstrncmp_~s1.base)) (= 0 (select (select |#memory_int| cstrncmp_~s1.base) cstrncmp_~s1.offset))) (= 0 cstrncmp_~s1.offset)), 1711#(and (or (<= (+ cstrncmp_~s1.offset 1) (+ |cstrncmp_#t~post7.offset| (select |#length| cstrncmp_~s1.base))) (= 0 (select (select |#memory_int| |cstrncmp_#t~post7.base|) |cstrncmp_#t~post7.offset|))) (<= (+ |cstrncmp_#t~post7.offset| 1) cstrncmp_~s1.offset) (= |cstrncmp_#t~post7.offset| 0)), 1712#(and (<= 1 cstrncmp_~s1.offset) (or (= 0 |cstrncmp_#t~mem8|) (<= (+ cstrncmp_~s1.offset 1) (select |#length| cstrncmp_~s1.base)))), 1713#(and (<= 1 cstrncmp_~s1.offset) (<= (+ cstrncmp_~s1.offset 1) (select |#length| cstrncmp_~s1.base)))] [2018-02-04 01:49:32,675 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:49:32,675 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 01:49:32,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 01:49:32,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-04 01:49:32,676 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 13 states. [2018-02-04 01:49:32,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:49:32,937 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-02-04 01:49:32,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 01:49:32,938 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-02-04 01:49:32,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:49:32,938 INFO L225 Difference]: With dead ends: 54 [2018-02-04 01:49:32,938 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 01:49:32,939 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2018-02-04 01:49:32,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 01:49:32,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2018-02-04 01:49:32,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 01:49:32,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-02-04 01:49:32,941 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 29 [2018-02-04 01:49:32,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:49:32,941 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-02-04 01:49:32,941 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 01:49:32,941 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-02-04 01:49:32,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 01:49:32,942 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:49:32,942 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, 1, 1, 1, 1] [2018-02-04 01:49:32,942 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-04 01:49:32,942 INFO L82 PathProgramCache]: Analyzing trace with hash -962114157, now seen corresponding path program 1 times [2018-02-04 01:49:32,943 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:49:32,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:49:32,955 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:49:33,232 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:49:33,232 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:49:33,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 01:49:33,232 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:49:33,232 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:49:33,232 INFO L182 omatonBuilderFactory]: Interpolants [1834#true, 1835#false, 1836#(<= 1 main_~length2~0), 1837#(and (= 0 |main_#t~malloc12.offset|) (<= 1 main_~length2~0)), 1838#(and (= 0 main_~nondetString2~0.offset) (<= 1 main_~length2~0)), 1839#(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)))), 1840#(and (or (= 0 (select (select |#memory_int| |cstrncmp_#in~s2.base|) |cstrncmp_#in~s2.offset|)) (<= 2 (select |#length| |cstrncmp_#in~s2.base|))) (= 0 |cstrncmp_#in~s2.offset|)), 1841#(and (or (<= 2 (select |#length| cstrncmp_~s2.base)) (= 0 (select (select |#memory_int| cstrncmp_~s2.base) cstrncmp_~s2.offset))) (= 0 cstrncmp_~s2.offset)), 1842#(and (= 0 cstrncmp_~s2.offset) (or (<= 2 (select |#length| cstrncmp_~s2.base)) (and (= (select (select |#memory_int| cstrncmp_~s1.base) cstrncmp_~s1.offset) |cstrncmp_#t~mem2|) (= 0 (select (select |#memory_int| cstrncmp_~s2.base) cstrncmp_~s2.offset))))), 1843#(and (<= (+ |cstrncmp_#t~post1.offset| 1) cstrncmp_~s2.offset) (= |cstrncmp_#t~post1.offset| 0) (= |cstrncmp_#t~post1.base| cstrncmp_~s2.base) (or (and (= 0 (select (select |#memory_int| |cstrncmp_#t~post1.base|) |cstrncmp_#t~post1.offset|)) (= (select (select |#memory_int| cstrncmp_~s1.base) cstrncmp_~s1.offset) |cstrncmp_#t~mem2|)) (<= (+ cstrncmp_~s2.offset 1) (+ (select |#length| |cstrncmp_#t~post1.base|) |cstrncmp_#t~post1.offset|)))), 1844#(and (or (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (and (= 0 |cstrncmp_#t~mem3|) (= (select (select |#memory_int| cstrncmp_~s1.base) cstrncmp_~s1.offset) |cstrncmp_#t~mem2|))) (<= 1 cstrncmp_~s2.offset)), 1845#(and (or (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (= 0 (select (select |#memory_int| |cstrncmp_#t~post7.base|) |cstrncmp_#t~post7.offset|))) (<= 1 cstrncmp_~s2.offset)), 1846#(and (or (= 0 |cstrncmp_#t~mem8|) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))) (<= 1 cstrncmp_~s2.offset)), 1847#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 1848#(and (<= 1 |cstrncmp_#t~post1.offset|) (<= (+ |cstrncmp_#t~post1.offset| 1) (select |#length| |cstrncmp_#t~post1.base|)))] [2018-02-04 01:49:33,232 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:49:33,233 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 01:49:33,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 01:49:33,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-04 01:49:33,233 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 15 states. [2018-02-04 01:49:33,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:49:33,476 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-02-04 01:49:33,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 01:49:33,476 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 31 [2018-02-04 01:49:33,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:49:33,477 INFO L225 Difference]: With dead ends: 50 [2018-02-04 01:49:33,477 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 01:49:33,477 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2018-02-04 01:49:33,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 01:49:33,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 01:49:33,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 01:49:33,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2018-02-04 01:49:33,479 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 31 [2018-02-04 01:49:33,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:49:33,479 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2018-02-04 01:49:33,479 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 01:49:33,479 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2018-02-04 01:49:33,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 01:49:33,480 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:49:33,480 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, 1, 1, 1, 1] [2018-02-04 01:49:33,480 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-04 01:49:33,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1173736108, now seen corresponding path program 1 times [2018-02-04 01:49:33,480 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:49:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:49:33,489 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:49:33,540 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:49:33,540 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:49:33,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 01:49:33,540 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:49:33,540 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:49:33,541 INFO L182 omatonBuilderFactory]: Interpolants [1969#true, 1970#false, 1971#(= 0 |main_#t~malloc11.offset|), 1972#(= 0 main_~nondetString1~0.offset), 1973#(= 0 |cstrncmp_#in~s1.offset|), 1974#(= 0 cstrncmp_~s1.offset), 1975#(and (<= (+ |cstrncmp_#t~post7.offset| 1) cstrncmp_~s1.offset) (= |cstrncmp_#t~post7.offset| 0)), 1976#(<= 1 cstrncmp_~s1.offset), 1977#(and (<= 1 cstrncmp_~s1.offset) (<= (+ cstrncmp_~s1.offset 1) (select |#length| cstrncmp_~s1.base))), 1978#(and (<= (+ |cstrncmp_#t~post7.offset| 1) (select |#length| |cstrncmp_#t~post7.base|)) (<= 1 |cstrncmp_#t~post7.offset|))] [2018-02-04 01:49:33,541 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:49:33,541 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 01:49:33,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 01:49:33,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-04 01:49:33,541 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 10 states. [2018-02-04 01:49:33,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:49:33,639 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-02-04 01:49:33,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 01:49:33,640 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-02-04 01:49:33,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:49:33,640 INFO L225 Difference]: With dead ends: 48 [2018-02-04 01:49:33,641 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 01:49:33,641 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:49:33,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 01:49:33,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-02-04 01:49:33,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 01:49:33,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-02-04 01:49:33,643 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 33 [2018-02-04 01:49:33,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:49:33,643 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-02-04 01:49:33,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 01:49:33,643 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-02-04 01:49:33,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 01:49:33,644 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:49:33,644 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, 1, 1, 1, 1] [2018-02-04 01:49:33,644 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-04 01:49:33,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1615722261, now seen corresponding path program 1 times [2018-02-04 01:49:33,645 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:49:33,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:49:33,653 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:49:33,729 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:49:33,729 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:49:33,729 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 01:49:33,729 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:49:33,729 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:49:33,730 INFO L182 omatonBuilderFactory]: Interpolants [2085#true, 2086#false, 2087#(= 0 |main_#t~malloc12.offset|), 2088#(= 0 main_~nondetString2~0.offset), 2089#(= 0 |cstrncmp_#in~s2.offset|), 2090#(= 0 cstrncmp_~s2.offset), 2091#(and (<= (+ |cstrncmp_#t~post1.offset| 1) cstrncmp_~s2.offset) (= |cstrncmp_#t~post1.offset| 0) (= |cstrncmp_#t~post1.base| cstrncmp_~s2.base)), 2092#(<= 1 cstrncmp_~s2.offset), 2093#(and (<= 2 cstrncmp_~s2.offset) (<= (+ (select |#length| |cstrncmp_#t~post1.base|) cstrncmp_~s2.offset) (+ |cstrncmp_#t~post1.offset| (select |#length| cstrncmp_~s2.base) 1))), 2094#(and (<= 2 cstrncmp_~s2.offset) (<= cstrncmp_~s2.offset (select |#length| cstrncmp_~s2.base))), 2095#(and (<= 1 |cstrncmp_#t~pre4.offset|) (<= (+ |cstrncmp_#t~pre4.offset| 1) (select |#length| |cstrncmp_#t~pre4.base|)))] [2018-02-04 01:49:33,730 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:49:33,730 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 01:49:33,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 01:49:33,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 01:49:33,731 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 11 states. [2018-02-04 01:49:33,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:49:33,862 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-02-04 01:49:33,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 01:49:33,863 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-02-04 01:49:33,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:49:33,863 INFO L225 Difference]: With dead ends: 45 [2018-02-04 01:49:33,863 INFO L226 Difference]: Without dead ends: 42 [2018-02-04 01:49:33,864 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:49:33,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-04 01:49:33,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-02-04 01:49:33,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 01:49:33,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-02-04 01:49:33,865 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 35 [2018-02-04 01:49:33,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:49:33,866 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-02-04 01:49:33,866 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 01:49:33,866 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-02-04 01:49:33,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 01:49:33,867 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:49:33,867 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 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:49:33,867 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-04 01:49:33,867 INFO L82 PathProgramCache]: Analyzing trace with hash -48907298, now seen corresponding path program 2 times [2018-02-04 01:49:33,868 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:49:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:49:33,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:49:34,261 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:34,261 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:49:34,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 01:49:34,261 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:49:34,262 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:49:34,262 INFO L182 omatonBuilderFactory]: Interpolants [2208#(and (or (<= (+ |cstrncmp_#t~post7.offset| (select |#length| cstrncmp_~s1.base)) cstrncmp_~s1.offset) (and (= 0 (select (select |#memory_int| cstrncmp_~s1.base) 1)) (= 1 cstrncmp_~s1.offset)) (<= (+ cstrncmp_~s1.offset 2) (+ |cstrncmp_#t~post7.offset| (select |#length| cstrncmp_~s1.base)))) (= |cstrncmp_#t~post7.offset| 0)), 2209#(or (<= (+ cstrncmp_~s1.offset 2) (select |#length| cstrncmp_~s1.base)) (and (= 0 (select (select |#memory_int| cstrncmp_~s1.base) 1)) (= 1 cstrncmp_~s1.offset)) (<= (select |#length| cstrncmp_~s1.base) cstrncmp_~s1.offset)), 2210#(or (<= (+ cstrncmp_~s1.offset 2) (select |#length| cstrncmp_~s1.base)) (and (= 0 (select (select |#memory_int| cstrncmp_~s1.base) 1)) (= 1 cstrncmp_~s1.offset))), 2211#(or (and (= (select |#length| |cstrncmp_#t~post7.base|) (select |#length| cstrncmp_~s1.base)) (<= (+ cstrncmp_~s1.offset 1) (select |#length| |cstrncmp_#t~post7.base|)) (<= (+ |cstrncmp_#t~post7.offset| 1) cstrncmp_~s1.offset)) (= 0 (select (select |#memory_int| |cstrncmp_#t~post7.base|) |cstrncmp_#t~post7.offset|))), 2212#(or (= 0 |cstrncmp_#t~mem8|) (and (<= 1 cstrncmp_~s1.offset) (<= (+ cstrncmp_~s1.offset 1) (select |#length| cstrncmp_~s1.base)))), 2213#(and (<= 1 cstrncmp_~s1.offset) (<= (+ cstrncmp_~s1.offset 1) (select |#length| cstrncmp_~s1.base))), 2199#true, 2200#false, 2201#(and (= main_~length1~0 (select |#length| |main_#t~malloc11.base|)) (= (select |#valid| |main_#t~malloc11.base|) 1) (= 0 |main_#t~malloc11.offset|)), 2202#(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))), 2203#(and (not (= main_~nondetString1~0.base |main_#t~malloc12.base|)) (= 0 main_~nondetString1~0.offset) (or (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (+ main_~nondetString1~0.offset main_~length1~0) 2))), 2204#(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))), 2205#(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))), 2206#(and (= 0 |cstrncmp_#in~s1.offset|) (or (<= (select |#length| |cstrncmp_#in~s1.base|) 1) (= 0 (select (select |#memory_int| |cstrncmp_#in~s1.base|) 1)) (<= 3 (select |#length| |cstrncmp_#in~s1.base|)))), 2207#(and (or (= 0 (select (select |#memory_int| cstrncmp_~s1.base) 1)) (<= (select |#length| cstrncmp_~s1.base) 1) (<= 3 (select |#length| cstrncmp_~s1.base))) (= 0 cstrncmp_~s1.offset))] [2018-02-04 01:49:34,262 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:34,262 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 01:49:34,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 01:49:34,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-02-04 01:49:34,263 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 15 states. [2018-02-04 01:49:34,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:49:34,609 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-02-04 01:49:34,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 01:49:34,609 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2018-02-04 01:49:34,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:49:34,609 INFO L225 Difference]: With dead ends: 53 [2018-02-04 01:49:34,610 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 01:49:34,610 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2018-02-04 01:49:34,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 01:49:34,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2018-02-04 01:49:34,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 01:49:34,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-02-04 01:49:34,612 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 38 [2018-02-04 01:49:34,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:49:34,612 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-02-04 01:49:34,612 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 01:49:34,612 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-02-04 01:49:34,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 01:49:34,613 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:49:34,613 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 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:49:34,613 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-04 01:49:34,613 INFO L82 PathProgramCache]: Analyzing trace with hash 244726527, now seen corresponding path program 2 times [2018-02-04 01:49:34,614 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:49:34,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:49:34,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:49:34,942 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:34,942 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:49:34,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 01:49:34,943 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:49:34,943 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:49:34,943 INFO L182 omatonBuilderFactory]: Interpolants [2338#true, 2339#false, 2340#(and (= 0 |main_#t~malloc12.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc12.base|))), 2341#(and (= 0 main_~nondetString2~0.offset) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 2342#(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))))), 2343#(and (or (<= 3 (select |#length| |cstrncmp_#in~s2.base|)) (= 0 (select (select |#memory_int| |cstrncmp_#in~s2.base|) 1)) (<= (select |#length| |cstrncmp_#in~s2.base|) 1)) (= 0 |cstrncmp_#in~s2.offset|)), 2344#(and (or (<= 3 (select |#length| cstrncmp_~s2.base)) (= 0 (select (select |#memory_int| cstrncmp_~s2.base) 1)) (<= (select |#length| cstrncmp_~s2.base) 1)) (= 0 cstrncmp_~s2.offset)), 2345#(and (<= (+ |cstrncmp_#t~post1.offset| 1) cstrncmp_~s2.offset) (= |cstrncmp_#t~post1.offset| 0) (or (<= (+ (select |#length| |cstrncmp_#t~post1.base|) |cstrncmp_#t~post1.offset|) cstrncmp_~s2.offset) (and (<= cstrncmp_~s2.offset (+ |cstrncmp_#t~post1.offset| 1)) (= 0 (select (select |#memory_int| cstrncmp_~s2.base) 1))) (<= (+ cstrncmp_~s2.offset 2) (+ (select |#length| |cstrncmp_#t~post1.base|) |cstrncmp_#t~post1.offset|))) (= |cstrncmp_#t~post1.base| cstrncmp_~s2.base)), 2346#(and (or (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (<= (select |#length| cstrncmp_~s2.base) cstrncmp_~s2.offset) (and (<= cstrncmp_~s2.offset 1) (= 0 (select (select |#memory_int| cstrncmp_~s2.base) 1)))) (<= 1 cstrncmp_~s2.offset)), 2347#(and (or (<= (+ cstrncmp_~s2.offset 2) (select |#length| cstrncmp_~s2.base)) (and (<= cstrncmp_~s2.offset 1) (= 0 (select (select |#memory_int| cstrncmp_~s2.base) 1)) (= (select (select |#memory_int| cstrncmp_~s1.base) cstrncmp_~s1.offset) |cstrncmp_#t~mem2|)) (<= (select |#length| cstrncmp_~s2.base) cstrncmp_~s2.offset)) (<= 1 cstrncmp_~s2.offset)), 2348#(and (<= 2 cstrncmp_~s2.offset) (or (<= (select |#length| |cstrncmp_#t~post1.base|) |cstrncmp_#t~post1.offset|) (and (= 1 |cstrncmp_#t~post1.offset|) (= 0 (select (select |#memory_int| |cstrncmp_#t~post1.base|) |cstrncmp_#t~post1.offset|)) (= (select (select |#memory_int| cstrncmp_~s1.base) cstrncmp_~s1.offset) |cstrncmp_#t~mem2|)) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)))), 2349#(and (<= 2 cstrncmp_~s2.offset) (or (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (and (= 0 |cstrncmp_#t~mem3|) (= (select (select |#memory_int| cstrncmp_~s1.base) cstrncmp_~s1.offset) |cstrncmp_#t~mem2|)))), 2350#(and (<= 2 cstrncmp_~s2.offset) (or (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (= 0 (select (select |#memory_int| |cstrncmp_#t~post7.base|) |cstrncmp_#t~post7.offset|)))), 2351#(and (<= 2 cstrncmp_~s2.offset) (or (= 0 |cstrncmp_#t~mem8|) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)))), 2352#(and (<= 2 cstrncmp_~s2.offset) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))), 2353#(and (<= 2 |cstrncmp_#t~post1.offset|) (<= (+ |cstrncmp_#t~post1.offset| 1) (select |#length| |cstrncmp_#t~post1.base|)))] [2018-02-04 01:49:34,943 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:49:34,944 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 01:49:34,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 01:49:34,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-02-04 01:49:34,944 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 16 states. [2018-02-04 01:49:35,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:49:35,369 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-02-04 01:49:35,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 01:49:35,370 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2018-02-04 01:49:35,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:49:35,370 INFO L225 Difference]: With dead ends: 52 [2018-02-04 01:49:35,370 INFO L226 Difference]: Without dead ends: 52 [2018-02-04 01:49:35,371 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2018-02-04 01:49:35,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-04 01:49:35,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-02-04 01:49:35,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 01:49:35,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-02-04 01:49:35,375 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 40 [2018-02-04 01:49:35,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:49:35,375 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-02-04 01:49:35,375 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 01:49:35,375 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-02-04 01:49:35,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 01:49:35,376 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:49:35,376 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:49:35,376 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-04 01:49:35,376 INFO L82 PathProgramCache]: Analyzing trace with hash -688841486, now seen corresponding path program 3 times [2018-02-04 01:49:35,376 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:49:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:49:35,391 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:49:35,577 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-04 01:49:35,577 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:49:35,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 01:49:35,578 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:49:35,578 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:49:35,578 INFO L182 omatonBuilderFactory]: Interpolants [2481#true, 2482#false, 2483#(and (= main_~length1~0 (select |#length| |main_#t~malloc11.base|)) (= (select |#valid| |main_#t~malloc11.base|) 1) (= 0 |main_#t~malloc11.offset|)), 2484#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= (select |#valid| main_~nondetString1~0.base) 1) (= main_~nondetString1~0.offset 0)), 2485#(and (not (= main_~nondetString1~0.base |main_#t~malloc12.base|)) (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (= main_~nondetString1~0.offset 0)), 2486#(and (= main_~length1~0 (select |#length| main_~nondetString1~0.base)) (not (= main_~nondetString1~0.base main_~nondetString2~0.base)) (= main_~nondetString1~0.offset 0)), 2487#(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)), 2488#(= 0 (select (select |#memory_int| |cstrncmp_#in~s1.base|) (+ (select |#length| |cstrncmp_#in~s1.base|) (- 1)))), 2489#(= 0 (select (select |#memory_int| cstrncmp_~s1.base) (+ (select |#length| cstrncmp_~s1.base) (- 1)))), 2490#(or (and (= (select |#length| |cstrncmp_#t~post7.base|) (select |#length| cstrncmp_~s1.base)) (<= (+ |cstrncmp_#t~post7.offset| 1) cstrncmp_~s1.offset) (or (<= (+ cstrncmp_~s1.offset 1) (select |#length| |cstrncmp_#t~post7.base|)) (<= (select |#length| |cstrncmp_#t~post7.base|) |cstrncmp_#t~post7.offset|))) (= 0 (select (select |#memory_int| |cstrncmp_#t~post7.base|) |cstrncmp_#t~post7.offset|))), 2491#(or (= 0 |cstrncmp_#t~mem8|) (and (<= 1 cstrncmp_~s1.offset) (<= (+ cstrncmp_~s1.offset 1) (select |#length| cstrncmp_~s1.base)))), 2492#(and (<= 1 cstrncmp_~s1.offset) (<= (+ cstrncmp_~s1.offset 1) (select |#length| cstrncmp_~s1.base)))] [2018-02-04 01:49:35,578 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-04 01:49:35,578 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 01:49:35,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 01:49:35,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-02-04 01:49:35,579 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 12 states. [2018-02-04 01:49:35,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:49:35,726 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2018-02-04 01:49:35,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 01:49:35,727 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-02-04 01:49:35,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:49:35,727 INFO L225 Difference]: With dead ends: 50 [2018-02-04 01:49:35,727 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 01:49:35,727 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2018-02-04 01:49:35,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 01:49:35,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 01:49:35,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 01:49:35,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-02-04 01:49:35,728 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 47 [2018-02-04 01:49:35,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:49:35,729 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-02-04 01:49:35,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 01:49:35,729 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-02-04 01:49:35,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 01:49:35,729 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:49:35,729 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:49:35,730 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-04 01:49:35,730 INFO L82 PathProgramCache]: Analyzing trace with hash -551704813, now seen corresponding path program 3 times [2018-02-04 01:49:35,730 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:49:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:49:35,745 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:49:35,914 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 01:49:35,915 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:49:35,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 01:49:35,915 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:49:35,915 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:49:35,915 INFO L182 omatonBuilderFactory]: Interpolants [2609#true, 2610#false, 2611#(and (= 0 |main_#t~malloc12.offset|) (= main_~length2~0 (select |#length| |main_#t~malloc12.base|))), 2612#(and (= main_~nondetString2~0.offset 0) (= main_~length2~0 (select |#length| main_~nondetString2~0.base))), 2613#(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)))))), 2614#(= 0 (select (select |#memory_int| |cstrncmp_#in~s2.base|) (+ (select |#length| |cstrncmp_#in~s2.base|) (- 1)))), 2615#(= 0 (select (select |#memory_int| cstrncmp_~s2.base) (+ (select |#length| cstrncmp_~s2.base) (- 1)))), 2616#(and (= |cstrncmp_#t~post1.base| cstrncmp_~s2.base) (= 0 (select (select |#memory_int| cstrncmp_~s2.base) (+ (select |#length| |cstrncmp_#t~post1.base|) (- 1))))), 2617#(and (= 0 (select (select |#memory_int| cstrncmp_~s2.base) (+ (select |#length| cstrncmp_~s2.base) (- 1)))) (= (select (select |#memory_int| cstrncmp_~s1.base) cstrncmp_~s1.offset) |cstrncmp_#t~mem2|)), 2618#(or (and (= 0 (select (select |#memory_int| |cstrncmp_#t~post1.base|) |cstrncmp_#t~post1.offset|)) (= (select (select |#memory_int| cstrncmp_~s1.base) cstrncmp_~s1.offset) |cstrncmp_#t~mem2|)) (and (<= (+ |cstrncmp_#t~post1.offset| 1) cstrncmp_~s2.offset) (or (<= (select |#length| |cstrncmp_#t~post1.base|) |cstrncmp_#t~post1.offset|) (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base))))), 2619#(or (and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)) (and (= 0 |cstrncmp_#t~mem3|) (= (select (select |#memory_int| cstrncmp_~s1.base) cstrncmp_~s1.offset) |cstrncmp_#t~mem2|))), 2620#(or (and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)) (= 0 (select (select |#memory_int| |cstrncmp_#t~post7.base|) |cstrncmp_#t~post7.offset|))), 2621#(or (= 0 |cstrncmp_#t~mem8|) (and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset))), 2622#(and (<= (+ cstrncmp_~s2.offset 1) (select |#length| cstrncmp_~s2.base)) (<= 1 cstrncmp_~s2.offset)), 2623#(and (<= 1 |cstrncmp_#t~post1.offset|) (<= (+ |cstrncmp_#t~post1.offset| 1) (select |#length| |cstrncmp_#t~post1.base|)))] [2018-02-04 01:49:35,915 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 01:49:35,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 01:49:35,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 01:49:35,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-02-04 01:49:35,916 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 15 states. [2018-02-04 01:49:36,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:49:36,208 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-02-04 01:49:36,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 01:49:36,208 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 49 [2018-02-04 01:49:36,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:49:36,208 INFO L225 Difference]: With dead ends: 49 [2018-02-04 01:49:36,208 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 01:49:36,209 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:49:36,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 01:49:36,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 01:49:36,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 01:49:36,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 01:49:36,209 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2018-02-04 01:49:36,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:49:36,210 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 01:49:36,210 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 01:49:36,210 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 01:49:36,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 01:49:36,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 01:49:36 BoogieIcfgContainer [2018-02-04 01:49:36,213 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 01:49:36,214 INFO L168 Benchmark]: Toolchain (without parser) took 6711.53 ms. Allocated memory was 403.7 MB in the beginning and 755.0 MB in the end (delta: 351.3 MB). Free memory was 361.9 MB in the beginning and 456.1 MB in the end (delta: -94.2 MB). Peak memory consumption was 257.0 MB. Max. memory is 5.3 GB. [2018-02-04 01:49:36,215 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 403.7 MB. Free memory is still 367.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 01:49:36,215 INFO L168 Benchmark]: CACSL2BoogieTranslator took 157.47 ms. Allocated memory is still 403.7 MB. Free memory was 360.6 MB in the beginning and 350.0 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:49:36,215 INFO L168 Benchmark]: Boogie Preprocessor took 23.33 ms. Allocated memory is still 403.7 MB. Free memory was 350.0 MB in the beginning and 348.7 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:49:36,215 INFO L168 Benchmark]: RCFGBuilder took 210.94 ms. Allocated memory is still 403.7 MB. Free memory was 348.7 MB in the beginning and 328.0 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. [2018-02-04 01:49:36,215 INFO L168 Benchmark]: TraceAbstraction took 6316.70 ms. Allocated memory was 403.7 MB in the beginning and 755.0 MB in the end (delta: 351.3 MB). Free memory was 328.0 MB in the beginning and 456.1 MB in the end (delta: -128.1 MB). Peak memory consumption was 223.1 MB. Max. memory is 5.3 GB. [2018-02-04 01:49:36,217 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 403.7 MB. Free memory is still 367.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 157.47 ms. Allocated memory is still 403.7 MB. Free memory was 360.6 MB in the beginning and 350.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 23.33 ms. Allocated memory is still 403.7 MB. Free memory was 350.0 MB in the beginning and 348.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 210.94 ms. Allocated memory is still 403.7 MB. Free memory was 348.7 MB in the beginning and 328.0 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6316.70 ms. Allocated memory was 403.7 MB in the beginning and 755.0 MB in the end (delta: 351.3 MB). Free memory was 328.0 MB in the beginning and 456.1 MB in the end (delta: -128.1 MB). Peak memory consumption was 223.1 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: 553]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - 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 - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 58 locations, 15 error locations. SAFE Result, 6.2s OverallTime, 22 OverallIterations, 4 TraceHistogramMax, 3.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 745 SDtfs, 1008 SDslu, 2530 SDs, 0 SdLazy, 2255 SolverSat, 142 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 303 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 36/121 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, 22 MinimizatonAttempts, 41 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 595 NumberOfCodeBlocks, 595 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 573 ConstructedInterpolants, 0 QuantifiedInterpolants, 152682 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 14 PerfectInterpolantSequences, 36/121 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_cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_01-49-36-222.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_01-49-36-222.csv Received shutdown request...